Adversarial learning approximates unknown quantum states on near-term quantum computers.
problem Approximating unknown quantum pure states on near-term quantum computers.
method Two parametrized circuits optimized adversarially, with resilient backpropagation and bipartite entanglement entropy.
result Resilient backpropagation algorithms perform well in optimizing the two circuits.
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.
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.
Sketch Tomography improves quantum state estimation accuracy.
problem Efficiently estimating quantum states, especially MPS states.
method Hybridizes classical shadow protocol with tensor train ansatz.
result Proven convergence with quadratic sample complexity.
RL optimizes quantum circuit parameters for combinatorial problems.
problem Optimizing quantum circuit parameters for combinatorial problems.
method Reinforcement Learning (RL) to train a policy network.
result RL policy reduces optimality gap by up to 8.61.
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).
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.
New machine learning method detects quantum separability in large-scale systems.
problem Deciding quantum separability of large-scale bipartite density matrices.
method Frank-Wolfe-based algorithm for finding nearest separable density matrices and classification of density matrices as separable or entangled.
result The method scales up to thousands of density matrices and achieves high quantum entanglement detection accuracy.
Noise-resilient optimization on noisy quantum computers.
problem Noise's impact on hybrid quantum-classical optimization.
method Iterative quantum circuit with noise consideration, using Quantum Fisher Information bound.
result Algorithm robustness against different noise strengths.
Neural-Network Quantum States have been recently introduced as an Ansatz for describing the wave function of quantum many-body systems. We show that there are strong connections between Neural-Network Quantum States in the form of Restricted Boltzmann Machines and some classes of Tensor-Network states in arbitrary dime…
Researchers successfully implemented quantum autoencoders using quantum adders in a cloud quantum computer.
problem Reducing resource usage in quantum computations.
method Experimental implementation of quantum autoencoders using approximate quantum adders in a cloud quantum computer.
result Experimental fidelities are in good agreement with theoretical predictions, proving the feasibility of quantum autoencoders via quantum adders.
Quantum method generates unbiased samples from discrete graphical models.
problem Sampling from discrete graphical models is challenging and intractable in high dimensions.
method Embedding graphical models into unitary operators and using quantum circuits.
result Provably generates unbiased and independent samples from general discrete factor models.
Quantum-assisted Gaussian process speeds up data regression.
problem High computational complexity of Gaussian process regression for large datasets.
method Quantum-assisted sparse Gaussian process regression using random Fourier features.
result Achieves polynomial-order computational speedup compared to classical methods.
We show that the topological modular functor from Witten-Chern-Simons theory is universal for quantum computation in the sense a quantum circuit computation can be efficiently approximated by an intertwining action of a braid on the functor's state space. A computational model based on Chern-Simons theory at a fifth ro…
Quantum computers can optimize foreign exchange reserves management.
problem Optimizing foreign exchange reserves management using quantum computing.
method Demonstrated through quantum Monte Carlo risk measurement and quantum algorithms for portfolio optimization.
result Quantum computers can theoretically optimize FX reserves management in the future.
Quantum neural networks can approximate noisy functions accurately.
problem Approximating noisy functions with quantum neural networks.
method Universal approximation theorem with error bounds for noisy quantum neural networks.
result Quantum neural networks can approximate noisy functions with precise error bounds.
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).
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.
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.
Quantum RL algorithm achieves logarithmic regret for exploration.
problem Designing efficient quantum RL algorithms for exploration.
method UCRL-style quantum algorithm with lazy updating and quantum estimation.
result Proves O(poly(S,A,H,logT)) worst-case regret. It is known that evaluating a certain approximation to the Jones polynomial for the plat closure of a braid is a BQP-complete problem. That is, this problem exactly captures the power of the quantum circuit model. The one clean qubit model is a model of quantum computation in which all but one qubit starts in the maxim…
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.
A new MPS model for both classification and generation.
problem Efficiently representing and manipulating complex, high-dimensional data.
method Inspired by Matrix Product States (MPS) used in quantum computing, applies them in a classical machine learning setting.
result Dual functionality in a supervised learning framework enhances traditional training and generates more realistic samples.
We prove an abstract criterion stating resolvent convergence in the case of operators acting in different Hilbert spaces. This result is then applied to the case of Laplacians on a family $X_\eps$ of branched quantum waveguides. Combining it with an exterior complex scaling we show, in particular, that the resonances o…
Develops quantum circuits for faster learning with symmetry considerations.
problem Speeding up learning quantum states with symmetry considerations.
method Utilizes Okounkov-Vershik approach and Young-Jucys-Murphy elements to develop Sn-equivariant convolutional quantum circuits. result Proves Sn-CQA generates any unitary in any given Sn irrep sector, universal for SU(d) symmetry. Study topological quantum mechanics on orbifolds with geometric interpretation.
problem Quantum mechanical models on symplectic orbifolds.
method Explicit orbifold version of quantum HKR map and exact semi-classical approximation.
result Geometric and quantum field theoretic interpretation of orbifold algebraic index.
Quantum algorithm speeds up Gibbs partition function estimation.
problem Estimating partition functions in sublinear time.
method Sublinear-time quantum algorithm using quantum phase and amplitude estimation.
result First sublinear-time speed-up for partition function estimation.
This work uses variational quantum circuits for deep reinforcement learning.
problem Intractability of deep quantum circuits on existing quantum computing platforms.
method Reshaping classical deep reinforcement learning algorithms into variational quantum circuits and using quantum information encoding.
result First proof-of-principle demonstration of variational quantum circuits for deep reinforcement learning.
Quantum algorithm speeds up pricing of financial derivatives.
problem Pricing autocallable options efficiently.
method Integration-based exponential amplitude loading technique.
result 50x reduction in circuit depth for payoff component.
Quantum algorithms reduce clustering input size, achieving near-linear approximation.
problem Efficiently clustering large datasets in quantum computing.
method Quantum coresets for k-clustering with sublinear query complexity. result Achieves near-linear approximation for k-clustering with coresets. Quantum dynamics reveals hidden geometric structure in data.
problem Understanding complex, high-dimensional datasets through geometric structure.
method Introducing semiclassical and microlocal analysis to data analysis.
result First tractable algorithm for approximating wave dynamics and geodesics on data manifolds.
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.
Machine learning, specifically LSTM, models quantum experiments efficiently.
problem Modeling complex quantum states with high-dimensional entanglement.
method Used a long short-term memory (LSTM) neural network to predict quantum experiment outcomes.
result LSTM neural networks can accurately predict quantum experiment outcomes without computing the states themselves.
High-fidelity quantum simulations demonstrated on short-coherence hardware.
problem Short coherence times limit the depth of quantum algorithms.
method Fixed State Variational Fast Forwarding (fsVFF) algorithm.
result Simulations of 600 time steps possible, 150x longer than previous methods.
Quantum neural networks approximate periodic functions more efficiently.
problem Approximating periodic functions with quantum neural networks.
method Using Jackson's inequality to construct a QNN that approximates a trigonometric polynomial of the function.
result Quantum neural networks can achieve better approximation results with fewer parameters for smoother functions.
Quantum circuits learn to classify non-orthogonal quantum states.
problem Classifying non-orthogonal quantum states is crucial in quantum information.
method Trained quantum circuits using Adam optimization to discover parameters of unknown POVMs.
result Shallow quantum circuits can learn to discriminate among various quantum states with comparable performance to optimal POVMs.
In 1974, Berezin proposed a quantum theory for dynamical systems having a Kähler manifold as their phase space. The system states were represented by holomorphic functions on the manifold. For any homogeneous Kähler manifold, the Lie algebra of its group of motions may be represented either by holomorphic differential …
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.
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.
Quantum models can approximate any function if data encoding allows for a rich enough frequency spectrum.
problem Theoretical properties of quantum machine learning models, particularly their expressive power.
method Investigated how data encoding affects the expressive power of parametrized quantum circuits.
result Quantum models can access increasingly rich frequency spectra by repeating data encoding gates, potentially making them universal function approximators.
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 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.
New method for QPT without needing to know or prepare specific input states.
problem Quantum process characterization with unknown input states.
method Blind Quantum Process Tomography (BQPT) with single-preparation methods.
result Ability to characterize quantum processes using arbitrary unknown input states.
Quantum states associated with subsets of product manifolds are separable.
problem Characterizing quantum states associated with subsets of product manifolds.
method Using holomorphic sections of quantum line bundles and restriction maps.
result Quantum states associated with finite unions of products are separable.
Quantum models learn unitary actions on entangled states from product states.
problem Generalization to out-of-distribution data in quantum machine learning.
method Proved out-of-distribution generalization for learning unitary actions.
result Learned unitary actions on entangled states from product states.
Variational autoencoders (VAEs) are powerful generative models with the salient ability to perform inference. Here, we introduce a quantum variational autoencoder (QVAE): a VAE whose latent generative process is implemented as a quantum Boltzmann machine (QBM). We show that our model can be trained end-to-end by maximi…
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…
Researchers measure distances between quantum states to speed up machine learning.
problem Calculating distances between quantum states for machine learning is complex.
method Three-step method using many-particle interference to measure Hilbert-Schmidt distance.
result The method reduces complexity in calculating Euclidean distances between quantum states.