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,657 papers · 148 categories

Trend · papers per month

7152229 · Sep 202519922001200920172026
48 results for quantum backreaction

The paper shows instability in Minkowski spacetime for a quantum system.

problem Linear instability of the semiclassical Einstein-Klein-Gordon system in Minkowski spacetime.
method Formulated a forcing problem for metric and state perturbations, used tensor decomposition and quantum Møller operator.
result Metric perturbations grow exponentially, bounded by a universal scale H, indicating quantum backreaction.

Quantum ML promises faster data analysis but faces trainability challenges.

problem Challenges in training quantum machine learning models.
method Review of current methods and applications of quantum neural networks and quantum deep learning.
result Opportunities for quantum advantage in quantum machine learning.

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.

Quantum machine learning uses quantum cross entropy to minimize loss, but measurement loss affects this process.

problem Quantum machine learning's loss minimization through cross entropy is affected by measurement outcomes.
method Defined quantum cross entropy, proved its lower bounds, and investigated its relation to quantum fidelity and likelihood.
result Quantum cross entropy is lower-bounded by negative log-likelihood when derived from quantum data, but measurement outcomes can cause loss.

Quantum Earth Mover's distance improves stability and efficiency in quantum learning.

problem Quantum learning's loss landscapes often lead to poor local minima and gradients.
method Introduced the quantum Earth Mover's (EM) distance and proposed a quantum Wasserstein generative adversarial network (qWGAN).
result The quantum EM distance makes quantum learning more stable and efficient.

Quantum machine learning models can approximate any continuous function.

problem Theoretical understanding of quantum feature maps in machine learning.
method Proving universal approximation property of quantum machine learning models in quantum-enhanced feature spaces.
result Quantum machine learning models are universal approximators of continuous functions.

Quantum autoencoders allow for reducing the amount of resources in a quantum computation by mapping the original Hilbert space onto a reduced space with the relevant information. Recently, it was proposed to employ approximate quantum adders to implement quantum autoencoders in quantum technologies. Here, we carry out …

2018-07-27abs ↗pdf ↗

We define quantum exterior product wedge_h and quantum exterior differential d_h on Poisson manifolds, of which symplectic manifolds are an important class of examples. Quantum de Rham cohomology is defined as the cohomology of d_h. We also define quantum Dolbeault cohomology. Quantum hard Lefschetz theorem is proved. …

1998-06-30abs ↗pdf ↗

VQAs use classical optimization to train quantum circuits, promising quantum advantage.

problem High computational cost of quantum simulations and solving large-scale problems.
method Variational Quantum Algorithms (VQAs) use classical optimizers to train parametrized quantum circuits.
result VQAs are a promising strategy for obtaining quantum advantage.

Quantum machine learning tackles large datasets with randomized measurements.

problem Efficiently process large, high-dimensional datasets on quantum computers.
method Randomized measurements to scale linearly with dataset size and quadratic for post-processing.
result Substantial speed-up for noisy quantum computers, enabling image classification.

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).

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 affine bundles are quantum principal bundles with affine quantum structure groups. A general theory of quantum affine bundles is presented. In particular, a detailed analysis of differential calculi over these bundles is performed, including the description of a natural differential calculus over the structure …

1999-08-10abs ↗pdf ↗

Quantum machine learning uses superposition to create a large ensemble of classifiers.

problem Improving machine learning efficiency on quantum computers.
method Using superposition to create an exponentially large ensemble of classifiers, trained with an optimization-free learning algorithm.
result Adding an optimization step improves the performance of quantum ensembles of classifiers.

Improves VQAs by balancing classical and quantum training resources.

problem Challenges in trainability and resource costs of VQAs on quantum hardware.
method Adopting HELIA Ansatz and combining classical and quantum methods for gradient estimation and training.
result Achieves higher accuracy and success rates in VQE and improved test accuracy in quantum phase classification.

We define quantum exterior product wedge_h and quantum exterior differential d_h on Poisson manifolds (of which symplectic manifolds are an important class of examples). Quantum de Rham cohomology, which is a deformation quantization of de Rham cohomology, is defined as the cohomology of d_h. We also define quantum Dol…

1998-04-30abs ↗pdf ↗

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.

Unified framework combines trace-induced quantum kernels for improved machine learning models.

problem Improving performance of quantum machine learning models using trace-induced kernels.
method Developed a unified framework combining various trace-induced quantum kernels, including global fidelity and local projected kernels, as Lego kernels.
result Local projected kernels can achieve comparable performance to global fidelity kernels with fewer quantum resources.

Survey of QML applications on near-term quantum devices.

problem Achieving quantum advantage on real-world applications.
method Analysis of supervised and unsupervised techniques, including encoding, ansatz structure, error mitigation, and gradient methods.
result Current QML implementations on quantum hardware face limitations but show potential for real-world applications.

This work introduces a new quantum kernel, quantum tangent kernel, for improved performance.

problem Improving quantum machine learning performance beyond conventional methods.
method Developed a deep parameterized quantum circuit and used first-order expansion for training.
result The quantum tangent kernel outperforms conventional quantum kernel methods for ansatz-generated datasets.

Quantum neural tangent kernels help understand variational quantum circuits in machine learning.

problem Designing and predicting performance of variational quantum circuits.
method Using quantum neural tangent kernels and dynamical equations for loss functions.
result Analytical solutions for training dynamics in variational quantum circuits.

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.

Quantum Signal Processing reduces derivative pricing quantum resource requirements.

problem Efficiently pricing financial derivatives on quantum computers.
method Quantum Signal Processing (QSP) to encode payoffs directly into quantum amplitudes.
result Significantly reduces quantum resources (T-gates and qubits) for practical derivative contracts.

VQC-MLPNet combines quantum and classical elements for scalable quantum machine learning.

problem Challenges in expressivity, trainability, and noise resilience of VQCs.
method Hybrid architecture with a VQC generating weights for a classical MLP during training.
result Improved expressivity, trainability, and robustness compared to standalone quantum or hybrid approaches.

Quantum crypto-economics models price risks in blockchain technology.

problem Quantum technology's potential to undermine blockchain security.
method Building financial models to price quantum risk in blockchain scenarios.
result Quantum crypto-economics models can assess and price quantum risks in blockchain.

In quantum computation, series of quantum gates have to be arranged in a predefined sequence that led to a quantum circuit in order to solve a particular problem. What if the sequence of quantum gates is known but both the problem to be solved and the outcome of the so defined quantum circuit remain in the shadow? This…

2015-06-27abs ↗pdf ↗

Quantum computing techniques improve graph analysis and community detection.

problem Analyzing large graphs efficiently and accurately.
method Used quantum annealing and quantum gate computers for community detection and regularity checking.
result Demonstrated the effectiveness of quantum computing in solving complex graph problems.

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 ↗