Quantum machine learning offers advantages for broader learning tasks.
problem Demonstrate QML advantage over classical methods for general learning tasks.
method Construct a new family of supervised learning tasks and prove their hardness.
result Prove provable advantage of QML based on general quantum computational advantages.
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 effects are known to provide an advantage in particle transfer across networks. In order to achieve this advantage, requirements on both a graph type and a quantum system coherence must be found. Here we show that the process of finding these requirements can be automated by learning from simulated examples. Th…
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.
Quantum walks are at the heart of modern quantum technologies. They allow to deal with quantum transport phenomena and are an advanced tool for constructing novel quantum algorithms. Quantum walks on graphs are fundamentally different from classical random walks analogs, in particular, they walk faster than classical o…
Quantum algorithms accelerate financial risk computation.
problem Accelerating the computation of financial market risk.
method Quantum gradient estimation algorithms for market sensitivities.
result Significant reduction in resource requirements for financial quantum advantage.
Quantum algorithms improve VaR and CVaR estimation for financial derivatives.
problem Quantum advantage in financial risk analysis of derivatives.
method Two quantum algorithms: QSP and QSP-based approach.
result QSP-based approach requires fewer quantum resources for the same accuracy.
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.
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.
Quantum Boltzmann Machines trained on quantum annealers produce noisy synthetic data.
problem Training quantum Boltzmann machines on quantum annealers for financial data generation.
method Used D-Wave Advantage 4.1 quantum annealer to train QBMs and compare with classical RBMs.
result Quantum Boltzmann Machines trained on quantum annealers are noisier and less effective than classical RBMs.
Hybrid quantum-classical RL model solves standard benchmark tasks and proves quantum advantage.
problem Challenges in reinforcement learning, especially in solving standard benchmarking tasks.
method Parametrized quantum circuits in a hybrid quantum-classical RL model.
result Demonstrates quantum advantage in solving standard benchmarking tasks and intractable classical problems.
Quantum circuits reveal pathways to dequantization in machine learning models.
problem Navigating the complex landscape of quantum machine learning models and algorithms.
method Introducing a framework connecting quantum circuit structure to function representability.
result Fundamental properties of quantum circuits determine classical simulability of models.
Quantum correlations enhance generative models, providing a new resource for machine learning.
problem Capturing complex probability distributions in unsupervised learning.
method Theoretical and numerical analysis of quantum correlations in generative models.
result Quantum nonlocality and contextuality provide an expressivity advantage over classical models.
Quantum computing offers energy savings over classical computing.
problem Energy efficiency in computing services.
method Cournot competition model constrained by energy usage.
result Quantum computing firms can outperform classical counterparts in energy efficiency.
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.
In the past decade, the field of quantum machine learning has drawn significant attention due to the prospect of bringing genuine computational advantages to now widespread algorithmic methods. However, not all domains of machine learning have benefited equally from quantum enhancements. Notably, deep learning and rein…
Quantum networks offer exponential communication savings for large machine learning models.
problem Training and inference of large models require efficient communication.
method Quantum encoding and gradient descent for distributed computation.
result Exponential reduction in communication for gradient descent on quantum networks.
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.
Quantum kernels offer potential speed-ups but require encoding problem-specific knowledge.
problem Generalization difficulty in high-dimensional feature spaces.
method Analysis of spectral properties of quantum kernels and their RKHS.
result Quantum advantage is expected if RKHS is low-dimensional and contains hard-to-compute functions.
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.
Quantum datasets improve QML performance.
problem Benchmarking QML on classical datasets is uncertain.
method Introduced NTangled dataset of quantum states with varying entanglement.
result QML models trained on NTangled dataset outperform classical models.
Single T-gate makes distribution learning hard for deep circuits.
problem Learning probability distributions from quantum circuits.
method Characterization of learnability and simulatability of quantum circuit outputs.
result Injection of a single T-gate into depth n^Ω(1) circuits makes distribution learning hard.
Quantum CNNs improve on multi-channel data processing.
problem Lack of efficient processing for multi-channel data in QCNNs.
method Developed hardware-adaptable quantum circuit ansatzes for convolutional kernels.
result Quantum CNNs outperform existing QCNNs on multi-channel data classification tasks.
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.
Quantum oracles help identify counterfactuals better than classical ones.
problem Identifying unknown causal parameters in causal models.
method Using quantum oracles to query and identify all causal parameters and counterfactuals.
result Quantum oracles enable identification of all two-way joint counterfactuals and tighter bounds on higher-order counterfactuals.
Quantum computing speeds up multi-period asset allocation.
problem High computational complexity in classic computing for multi-period asset allocation.
method Applied quantum computing to simulate multi-asset portfolio using historic data.
result Quantum computing offers significant advantages over classical computing in finance.
Quantum algorithms for financial derivatives and credit risk.
problem Estimating credit risk and option pricing in realistic financial models.
method Developed a regime switching volatility model for financial markets, using a Markov chain to determine volatility parameters.
result Quantum algorithms can be applied to realistic financial models, bringing quantum computing closer to practical applications.
The problem of using observed correlations to infer causal relations is relevant to a wide variety of scientific disciplines. Yet given correlations between just two classical variables, it is impossible to determine whether they arose from a causal influence of one on the other or a common cause influencing both, unle…
SQS uses quantum kernels to improve credit scoring with fewer data points.
problem Credit scoring models struggle with scarce and skewed data.
method Systemic Quantum Score (SQS) leverages quantum kernels for better pattern extraction.
result SQS shows improved performance and pattern extraction with fewer data points.
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.
Study analyzes 3,171 stocks to pick efficient portfolios using quantum and classical solvers.
problem Creating efficient stock portfolios from a large dataset.
method Used classical and quantum solvers to optimize portfolios of 3,171 US stocks.
result Demonstrated the effectiveness of quantum and classical solvers in portfolio optimization.
Quantum computers outperform classical methods in density modeling.
problem Density modeling with quantum computers.
method Quantum-classical separation for density modeling.
result Quantum computers offer a super-polynomial advantage over classical algorithms for density modeling.
InfoQGAN uses mutual information to improve QGANs, overcoming mode collapse and feature disentanglement issues.
problem Mode collapse and lack of feature control in QGANs.
method Integrates InfoGAN principles with variational quantum circuit, classical discriminator, and MINE for mutual information optimization.
result InfoQGAN effectively mitigates mode collapse and achieves robust feature disentanglement.
Quantum model discovery uses DQCs to solve equations from data.
problem Discovering differential equations from data using quantum computing.
method Differentiable quantum circuits (DQCs) to solve parameterized equations, regression on data and equations.
result Successful parameter inference and equation discovery on various systems.
Machine learning has recently emerged as a fruitful area for finding potential quantum computational advantage. Many of the quantum enhanced machine learning algorithms critically hinge upon the ability to efficiently produce states proportional to high-dimensional data points stored in a quantum accessible memory. Eve…
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.
Clustering algorithms are a cornerstone of machine learning applications. Recently, a quantum algorithm for clustering based on the k-means algorithm has been proposed by Kerenidis, Landman, Luongo and Prakash. Based on their work, we propose a quantum expectation-maximization (EM) algorithm for Gaussian mixture models…
Quantum-enhanced barcode decoding and pattern recognition outperforms classical methods.
problem Improving barcode decoding and pattern recognition using quantum entanglement.
method Quantum hypothesis testing applied to barcode decoding and pattern recognition using entangled quantum sources and measurements.
result Quantum-enhanced methods outperform classical coherent-state strategies for barcode data decoding and classification.
Quantum GAN improves volatility modeling in finance.
problem Improving volatility modeling in finance using GANs.
method Developed a quantum GAN for volatility modeling.
result Quantum GAN provides exponential advantage over classical methods.
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.
Under several geometric conditions imposed below, the existence of the discrete spectrum below the essential spectrum is shown for the Dirichlet Laplacian on the quantum layer built over a spherically symmetric hypersurface with a pole embedded in the Euclidean space R4. At the end of this paper, we also show the advan…
This work proposes efficient classical training protocols for IQP circuits to train quantum generative models.
problem Training quantum generative models on industrially relevant probability distributions is challenging due to high computational cost.
method Developed protocols for classical training of IQP circuits, which are hard to sample but have efficient gradient computation.
result Classically trained IQP circuits can efficiently sample from target probability distributions, demonstrating practical quantum advantage.
Fuelled by increasing computer power and algorithmic advances, machine learning techniques have become powerful tools for finding patterns in data. Since quantum systems produce counter-intuitive patterns believed not to be efficiently produced by classical systems, it is reasonable to postulate that quantum computers …
Quantum kernel machines need to use more complex kernels to fully exploit their potential.
problem Current quantum kernels struggle with complex learning tasks due to limited degrees of freedom.
method Propose using operator-valued kernels and C∗-algebraic representations to enhance quantum kernels. result Quantum operator-valued kernels can reveal structural dependencies that scalar-valued kernels miss.
Quantum kernel methods can lead to trivial models due to exponential concentration of kernel values.
problem Exponential concentration of quantum kernel values can lead to trivial models in QML.
method Analyzing the resources needed to accurately estimate quantum kernel values and identifying four sources of concentration.
result Quantum kernel values can be exponentially concentrated, leading to trivial models.
Quantum mechanics is inherently probabilistic in light of Born's rule. Using quantum circuits as probabilistic generative models for classical data exploits their superior expressibility and efficient direct sampling ability. However, training of quantum circuits can be more challenging compared to classical neural net…
Quantum SVM improves financial data classification.
problem Classifying financial data using quantum machine learning.
method Application of quantum kernels to financial data, specifically DSEx Broad Index.
result Empirical quantum advantage demonstrated for financial data classification.
Quantum method calculates risk contributions in credit portfolios efficiently.
problem Quantifying risk concentration in subgroups of a credit portfolio.
method Quantum algorithm for simultaneous estimation of multiple expected values.
result Quantum method scales better than classical methods for finely divided subgroups.