Quantum variational circuits improve reinforcement learning efficiency.
problem Improving reinforcement learning algorithms using quantum computing.
method Investigation of quantum variational circuits for DQN and Double DQN, encoding classical data for quantum circuits.
result Quantum variational circuits can solve reinforcement learning tasks with a smaller parameter space.
Quantum annealing improves VB inference, avoiding local minima.
problem Variational Bayes inference stuck in local minima.
method Quantum annealing approach to VB inference.
result Quantum annealing variational Bayes (QAVB) outperforms classical VB.
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.
The state-of-the-art machine learning approaches are based on classical von Neumann computing architectures and have been widely used in many industrial and academic domains. With the recent development of quantum computing, researchers and tech-giants have attempted new quantum circuits for machine learning tasks. How…
Flow-VQE uses generative flows to optimize VQE efficiently.
problem Complex objective functions and expensive optimization in VQE.
method Generative normalizing flows with parameterized quantum circuits.
result Flow-VQE accelerates convergence and reduces circuit evaluations.
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.
Warm starts improve variational quantum algorithms by avoiding barren plateaus.
problem Barren plateaus in variational quantum algorithms limit scaling.
method Exploring warm starts in iterative variational methods for quantum circuits.
result Warm starts can lead to substantial gradients in small regions, suggesting trainability.
Develops an analytic theory for quantum imaginary time evolution.
problem Lack of a first-principle understanding of quantum imaginary time evolution.
method Interprets QITE as a form of VQA trained with QNGD and connects it to the geometric geodesic distance in the quantum Fisher information metric.
result QITE converges faster than vanilla gradient descent-based VQAs, though the advantage is suppressed by Hilbert space dimensionality.
Quantum algorithm improves portfolio construction accuracy.
problem Efficiently constructing portfolios with real-world constraints.
method Sampling-based CVaR Variational Quantum Algorithm (VQA) combined with local-search post-processing.
result Achieved a relative solution error of 0.49% on IBM Heron processors.
Spin networks boost quantum algorithms solving SU(2) symmetric problems.
problem Efficiently solving SU(2) symmetric problems on quantum hardware.
method Using SU(2) equivariant variational quantum circuits based on spin networks.
result Spin networks provide a direct implementation for SU(2) equivariant quantum circuits.
Proposes PO-QA framework to optimize portfolios using quantum algorithms.
problem Optimizing investment portfolios with reduced risk and increased gains.
method Develops a scalable quantum framework (PO-QA) to investigate quantum algorithm parameters.
result Identifies efficient quantum circuit configurations for portfolio optimization.
New algorithm improves efficiency of quantum system modeling.
problem Intractable complexities in quantum Hamiltonian learning and Gibbs sampling.
method Generalized quantum natural gradient descent and Quantum-Probabilistic Mirror Descent.
result Data sample efficiency proven using information geometry and quantum metrology.
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.
Variational hybrid quantum-classical optimization represents one of the most promising avenue to show the advantage of nowadays noisy intermediate-scale quantum computers in solving hard problems, such as finding the minimum-energy state of a Hamiltonian or solving some machine-learning tasks. In these devices noise is…
This study improves quantum classifiers by optimizing data preprocessing.
problem Quantum Machine Learning advantages are not yet clearly demonstrated.
method Used Linear Discriminant Analysis (LDA) for data preprocessing.
result Variational Quantum Algorithm (VQA) outperforms classical classifiers.
Paper improves variational inference on Boolean hypercube using quantum methods.
problem Improving variational inference for pairwise Markov random fields on the Boolean hypercube.
method Quantum relaxations of the Kullback-Leibler divergence for upper-bounds, primal-dual optimization, and greedy selection of hierarchies.
result Efficient algorithm and improved bounds for variational inference.
New algorithm Momentum-QNG improves optimization of quantum circuits.
problem Optimizing variational quantum circuits to avoid local minima.
method Applied Langevin dynamics to QNG, introducing momentum term.
result Momentum-QNG outperforms basic QNG and other optimizers.
Quantum method prices options by evolving a state in imaginary time.
problem Pricing options in a quantum setting.
method Prepares an initial state, evolves it using imaginary time algorithms, and maps to quantum state.
result Numerical verification for European options; extension to path-dependent options.
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.
A new approach to quantum machine learning circuits reduces training difficulties.
problem Challenges in training deep quantum circuits due to flat training landscapes.
method Variable structure approach (VAns) to build ansatzes, applying rules for gate growth and removal.
result VAns successfully mitigates trainability and noise-related issues, improving performance in various applications.
New method uses quantum simulation to price multi-asset derivatives efficiently.
problem Efficiently pricing derivatives with many underlying assets.
method Variational quantum simulation to solve Black-Scholes equation.
result Quantum speedup in derivative pricing for small quantum computers.
Variational Bayes (VB) inference is one of the most important algorithms in machine learning and widely used in engineering and industry. However, VB is known to suffer from the problem of local optima. In this Letter, we generalize VB by using quantum mechanics, and propose a new algorithm, which we call quantum annea…
New quantum algorithm simplifies complex financial derivatives pricing.
problem Complex financial derivatives pricing with high dimensionality.
method Quantum-inspired variational algorithms combined with neural-network quantum states.
result Simplified pricing of European options with many correlated assets.
Quantum machine learning faces 'laziness' and 'barren plateaus', but noise can mitigate the latter.
problem Quantum machine learning's loss function landscape issues.
method Theoretical analysis of quantum variational circuits, neural tangent kernels, and noise effects.
result Noise can mitigate barren plateaus in quantum machine learning.
Quantum computing exploits basic quantum phenomena such as state superposition and entanglement to perform computations. The Quantum Approximate Optimization Algorithm (QAOA) is arguably one of the leading quantum algorithms that can outperform classical state-of-the-art methods in the near term. QAOA is a hybrid quant…
Novel quantum algorithm for financial market modeling.
problem Accurate quantum state preparation for financial simulation.
method Multi-Split-Steps Quantum Walk (multi-SSQW) with PQC and variational solver.
result Highly accurate modeling of complex financial distributions.
This paper presents studies on a deterministic annealing algorithm based on quantum annealing for variational Bayes (QAVB) inference, which can be seen as an extension of the simulated annealing for variational Bayes (SAVB) inference. QAVB is as easy as SAVB to implement. Experiments revealed QAVB finds a better local …
Quantum computing improves training of binary neural networks.
problem Training binary neural networks (BiNNs) is challenging.
method Employing a Variational Quantum Algorithm to generate binary weights using quantum circuit measurements.
result The proposed methods improve trainability and generalization of BiNNs.
Quantum-assisted VAE improves similarity search in high-dimensional datasets.
problem Finding fast and memory-efficient similarity search in high-dimensional data.
method Construct a space-efficient search index based on the latent space of a Quantum-assisted Variational Autoencoder (QVAE).
result Real-world speedups and memory-efficient scaling to half a billion data points.
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.
A new optimizer saves significant shots in quantum machine learning.
problem Training variational QML algorithms is challenging due to large datasets and shot-count overhead.
method Proposed Refoqus optimizer that samples over both dataset and measurement operators.
result Refoqus can save several orders of magnitude in shot cost compared to existing methods.
Hybrid quantum-classical method optimizes financial index tracking.
problem Optimizing asset weights for financial index replication.
method Hybrid quantum-classical optimization with pruning algorithm.
result Improved performance through quantum and classical optimization.
Variational quantum computing faces a flat optimization landscape problem.
problem Barren Plateaus (BP) in optimization landscapes.
method Theoretical and heuristic methods to understand and mitigate BPs.
result All algorithm components can lead to BPs if not well-suited.
New MBQC algorithm uses randomness for generative modeling.
problem Designing efficient quantum algorithms for generative modeling.
method Proposes a variational MBQC algorithm that treats randomness as a resource.
result Randomness in MBQC can lead to significant gains in generative modeling performance.
A quantum walk-based method for generating precise probability distributions efficiently.
problem Generating high-precision probability distributions for various applications.
method Integrates variational quantum circuits with split-step quantum walks to dynamically tune coin parameters and evolve quantum states.
result Achieves high simulation fidelity and reduces computational overhead compared to conventional methods.
New bound shows variational algorithms may struggle with barren plateaus.
problem Barren plateaus in quantum loss landscapes.
method General bound on loss variance and gradient decay.
result Exponential decay of gradients in subregions of barren plateaus.
This work presents a novel fundamental algorithm for for defining and training Neural Networks in Quantum Information based on time evolution and the Hamiltonian. Classical Neural Network algorithms (ANN) are computationally expensive. For example, in image classification, representing an image pixel by pixel using cla…
A quantum generalization of Natural Gradient Descent is presented as part of a general-purpose optimization framework for variational quantum circuits. The optimization dynamics is interpreted as moving in the steepest descent direction with respect to the Quantum Information Geometry, corresponding to the real part of…
Quantum circuits optimize financial portfolios faster than classical methods.
problem Dynamic portfolio optimization in financial markets.
method Variational Quantum Circuits for reinforcement learning.
result Quantum agents outperform classical RL models in risk-adjusted performance.
Quantum computer method for pricing lookback options with jumps.
problem Pricing lookback options with discrete monitoring and jump conditions.
method Variational Quantum Imaginary Time Evolution (VarQITE) method to solve non-Hermitian Schrodinger equation.
result Quantum algorithm can handle jump conditions in lookback options pricing.
A new hybrid framework reduces quantum runtime and noise effects.
problem Challenges in deploying deep QFMs on real quantum hardware.
method Iterative Quantum Feature Maps (IQFMs) combining shallow QFMs and classical augmentation weights.
result Numerical experiments show IQFMs outperforming quantum convolutional neural networks.
New approach connects quantum phases to VQA trainability, enabling better scaling.
problem Scalability issues in VQAs, especially barren plateaus.
method Analog VQA ansätze composed of quenches of a disordered Ising chain, tuning disorder strength.
result Thermalized and MBL phases reach maximal expressivity at large M, but barren plateaus emerge at smaller M in the thermalized phase. Quantum model improves safety in machine learning.
problem Improving safety and robustness in machine learning models.
method Variational quantum classifier with amplitude encoding and SAFE-AI metrics.
result Quantum model provides competitive performance and improved robustness.
We introduce DQFIM to quantify and improve generalization of quantum machine learning models.
problem Understanding and improving generalization of quantum machine learning models.
method Data quantum Fisher information metric (DQFIM) to quantify circuit parameters and training data.
result Improves generalization by breaking symmetries of training data and using a low number of training states.
Quantum algorithm estimates mean with sub-Gaussian error.
problem Estimating mean of quantum-computed random variables.
method Quantum mean estimation algorithm with sub-Gaussian error rate.
result Achieves nearly-optimal quadratic speedup over classical methods.
Quantum advantage in derivative pricing requires 8k qubits and 54M T-depth.
problem Quantum advantage in pricing derivatives.
method Re-parameterization method combining pre-trained variational circuits and fault-tolerant quantum computing.
result Benchmark use cases require 8k logical qubits and a T-depth of 54 million.
This work shows how to efficiently simulate parts of quantum landscapes using classical computers.
problem Identifying where quantum computers are advantageous and offloading computations.
method Developed a quantum-enhanced classical algorithm to simulate sub-regions of quantum landscapes.
result It is possible to generate a classical surrogate of a sub-region of a quantum landscape.
Quantum machine learning faces challenges similar to variational quantum algorithms in training.
problem Challenges in training quantum machine learning models.
method Bridge between variational quantum algorithms and quantum machine learning, applying gradient scaling results.
result Gradient scaling results for variational quantum algorithms can also be applied to quantum machine learning models, revealing new trainability issues.