Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,695 papers · 148 categories

Trend · papers per month

151303454605 · Jun 202019922001200920172026
48 results for quantum state

Quantum states can be learned efficiently using gentle measurements.

problem Efficiently learning quantum states with minimal measurements.
method Introducing α-LGM measurements and proving strong quantum DPI.
result The number of states needed for accurate learning is of order 1/(ε^2 α^2).

QGAA learns latent quantum states, reducing errors in quantum data generation.

problem Learning latent representations for quantum data generation.
method Quantum Generative Adversarial Autoencoder (QGAA) combining QAE and QGAN.
result Average errors in energies for H2 and LiH are 0.02 Ha and 0.06 Ha respectively, demonstrating QGAA's potential.

Meta-learning algorithms prepare quantum Gibbs states efficiently for NISQ devices.

problem Efficiently preparing quantum Gibbs states for NISQ devices.
method Meta-Variational Quantum Thermalizer (Meta-VQT) and Neural Network Meta-VQT (NN-Meta VQT) algorithms.
result Meta-learned parameters significantly outperform random initializations in optimization tasks.

Quantum machine learning classification depends on mutual informations between state and parameter spaces.

problem Generalization in quantum machine learning models.
method Link between quantum machine learning and quantum hypothesis testing, using mutual informations.
result Quantum classifier accuracy and generalization depend on mutual informations between state and parameter spaces.

We demonstrate how machine learning is able to model experiments in quantum physics. Quantum entanglement is a cornerstone for upcoming quantum technologies such as quantum computation and quantum cryptography. Of particular interest are complex quantum states with more than two particles and a large number of entangle…

2019-10-30abs ↗pdf ↗

Multi-dimensional state-integrals of products of Faddeev's quantum dilogarithms arise frequently in Quantum Topology, quantum Teichmüller theory and complex Chern--Simons theory. Using the quasi-periodicity property of the quantum dilogarithm, we evaluate 1-dimensional state-integrals at rational points and express the…

2014-11-22abs ↗pdf ↗

MPE framework proves universal approximation for quantum data distribution.

problem Challenges in generating quantum data from underlying distributions.
method Many-body Projected Ensemble (MPE) framework for quantum state design.
result MPE can approximate any quantum distribution within 1-Wasserstein distance error.

Quantum Process Tomography (QPT) methods aim at identifying, i.e. estimating, a given quantum process. QPT is a major quantum information processing tool, since it especially allows one to characterize the actual behavior of quantum gates, which are the building blocks of quantum computers. However, usual QPT procedure…

2019-09-18abs ↗pdf ↗

Center identified in stated skein algebra for quantum traces.

problem Understanding the center of the stated skein algebra.
method Analyzing the algebra as a generalization of Kauffman bracket skein algebra, focusing on the case when the quantum parameter is a root of unity.
result Simple description and dimension calculation of the center over the center module.

Quantum statistical models with singularities are studied for state estimation and model selection.

problem Understanding statistical properties of quantum singular models.
method Classical singular learning theory extended to quantum state estimation and model selection using algebraic geometrical methods.
result Asymptotically unbiased estimator (QWAIC) for quantum generalization loss constructed.

New method uses single quantum state for machine learning tasks, improving accuracy.

problem Challenges in unsupervised learning with quantum data.
method SIngle-Preparation Quantum Information Processing (SIPQIP) concept.
result Significantly more accurate estimation compared to traditional methods.

A quantum state generation method that respects physical constraints.

problem Generating quantum states with complex-valued Hermitian, positive semi-definite, and trace one properties.
method Mirror diffusion model with von Neumann entropy to enforce structural constraints.
result Demonstrated effective generation of quantum states with conditional guidance.

New method uses quantum computing to process classical data efficiently.

problem Inefficient quantum machine learning due to data loading and trainability issues.
method Linear Hamiltonian-based machine learning with ground state problems for k-local Hamiltonians.
result Demonstrated the effectiveness and scalability of the method on up to 50 qubits.

Quantum algorithms speed up reinforcement learning policies in large state-action spaces.

problem Limitations of quantum access in training reinforcement learning policies.
method Designing quantum algorithms to train reinforcement learning policies.
result Quantum algorithms offer full quadratic speed-ups in sample complexity for well-behaved policies.

Characterizes optimal-speed quantum state evolution Hamiltonians.

problem Optimal-speed unitary time evolution of pure and quasi-pure quantum states.
method Construction of the manifold of pure states and isometry with flag manifold, characterization of equigeodesic vectors.
result Hamiltonians generating optimal-speed time evolution are fully characterized by equigeodesic vectors of the flag manifold.

Survey on quantum computing and neural networks.

problem Understanding and comparing quantum computing and neural networks.
method Introduction to quantum computing concepts, explanation of quantum computing paradigms, and analysis of quantum neural networks.
result Current state-of-the-art in quantum neural networks.

Quantum models are rephrased as kernel methods, improving performance.

problem Improving quantum machine learning models by encoding data into quantum states.
method Rephrasing quantum models as kernel methods and using support vector machines.
result Kernel-based training finds better quantum models than variational circuit training.

Quantum walk algorithm optimizes quantum state preparation for financial simulations.

problem Efficiently loading classical data into quantum states for quantum computers.
method Split-step quantum walks (SSQW) to design parameterized quantum circuits (PQC).
result SSQW facilitates generating desired probability amplitude distributions for quantum simulations.

Studying general quantum many-body systems is one of the major challenges in modern physics because it requires an amount of computational resources that scales exponentially with the size of the system.Simulating the evolution of a state, or even storing its description, rapidly becomes intractable for exact classical…

2017-10-02abs ↗pdf ↗

Adversarial learning is one of the most successful approaches to modelling high-dimensional probability distributions from data. The quantum computing community has recently begun to generalize this idea and to look for potential applications. In this work, we derive an adversarial algorithm for the problem of approxim…

2018-06-01abs ↗pdf ↗

New method uses kernel methods to approximate ground states of quantum Hamiltonians efficiently.

problem Approximating ground states of quantum Hamiltonians using neural networks is computationally expensive.
method Introduces a statistical learning approach using kernel methods to make optimization trivial.
result Ground state properties of arbitrary gapped quantum Hamiltonians can be reached with polynomial resources.

Quantum mechanics fundamentally forbids deterministic discrimination of quantum states and processes. However, the ability to optimally distinguish various classes of quantum data is an important primitive in quantum information science. In this work, we train near-term quantum circuits to classify data represented by …

2018-05-22abs ↗pdf ↗

Unified geometric framework for quantum states using dual number algebras.

problem Representing quantum states in a geometrically unified way.
method Smooth embeddings into higher-order dual number algebras and algebraic flows.
result Established nilpotent dual algebras as a geometric landscape for quantum kinematics.

New methods optimize training VQAs without barren plateaus, improving efficiency and applicability.

problem Barren plateaus in training variational quantum algorithms.
method Derive adaptive learning rates and use Gaussian kernels to optimize movement in parameter space.
result Optimized training methods outperform other routines and can train VQAs free of barren plateaus.

Geometric approach to quantum thermodynamics models state spaces and processes.

problem Quantum thermodynamics in the regime of non-equilibrium states.
method Contact geometry and principal fiber bundles to model quantum state spaces and processes.
result Geometric formulation reveals the fundamental thermodynamic relations and unattainability of the third law.

Estimates quantum cohomology complexity for Fano varieties and homogeneous spaces.

problem Quantum cohomology complexity estimation for compact symplectic manifolds.
method Estimates the number of states with finite approximate complexity for Fano complete intersections and (co)minuscule homogeneous varieties.
result Sharp upper bound for the dimension of the space spanned by states with finite complexity for Gr(2, n).

Method learns topological states from randomized measurements.

problem Detecting topologically ordered two-dimensional states on quantum processors.
method Variational tensor network tomography with randomized measurements.
result Demonstrated ability to learn ground states of surface code and quantum spin liquid states.

Quantum computing for option pricing using MPS states.

problem Efficiently generating time series for path-dependent options on quantum computers.
method Proposes a Matrix Product State (MPS) model for time series generation and trains it for the Heston model.
result Demonstrates the MPS model's capability to generate paths in the Heston model for path-dependent option pricing.