The statistical complexity of quantum circuits is studied using Rademacher complexity.
problem Measuring the richness of quantum hypothesis spaces.
method Applying Rademacher complexity to quantum circuits, investigating dependencies on resources, depth, width, and input/output registers.
result Bounds on the capacity of quantum neural networks constrained by circuit depth, width, and resource measures.
The study examines how quantum resources enhance the complexity of quantum circuits.
problem Quantum resource enhancement on circuit complexity.
method Utilizing quantum resource theories, the study analyzes statistical complexities of quantum circuits with limited quantum resources.
result Bounds for statistical complexities of quantum circuits are derived and applied to specific cases.
Quantum learning complexity reviewed using information theory.
problem Learning properties of quantum systems or processing data via quantum computing.
method Information-theoretic techniques focusing on data, copy, and model complexity.
result Copy complexity due to irreversible quantum measurements limits information extraction.
Quantum algorithms improve perceptron learning efficiency.
problem Improving quantum algorithms for perceptron learning.
method Revisiting and correcting a flawed quantum version space perceptron algorithm, proposing quantum-enhanced cutting-plane algorithms.
result Improved complexity bounds for quantum perceptron learning.
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).
The abstract explores a new wave equation linking quantum mechanics and complex adaptive systems.
problem Understanding the underlying mechanism of distribution formation in complex quantum entanglement.
method Exploring the logical relationship between Schrödinger's wave equation and Shi's trading volume-price wave equation in finance.
result A non-localized wave equation in quantum mechanics reveals the invariance of interaction as a universal law.
A quantum reinforcement learning algorithm reduces sample complexity.
problem Quantum reinforcement learning under model-free settings with quantum oracle access.
method Quantum Natural Policy Gradient (QNPG) algorithm replacing random sampling with deterministic gradient estimation.
result QNPG achieves a sample complexity of ildeO(ε−1.5) for queries to the quantum oracle, significantly improving classical lower bound. New quantum code lacks sparse lift.
problem Existence of sparse lifts for quantum codes.
method Constructed a sparse Z2 chain complex without a sparse lift. result Found a quantum code without a sparse lift.
Quantum reservoirs risk bounds are analyzed using Rademacher complexity.
problem Bounding generalization errors of quantum reservoirs.
method Using Rademacher complexity, specific bounds are derived for quantum reservoir classes.
result Risk bounds converge with increasing training samples and qubits.
Quantum machine learning has received significant attention in recent years, and promising progress has been made in the development of quantum algorithms to speed up traditional machine learning tasks. In this work, however, we focus on investigating the information-theoretic upper bounds of sample complexity - how ma…
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.
We construct a new type of quantum walks on simplicial complexes as a natural extension of the well-known Szegedy walk on graphs. One can numerically observe that our proposing quantum walks possess linear spreading and localization as in the case of the Grover walk on lattices. Moreover, our numerical simulation sugge…
Quantum computing improves Monte Carlo option pricing for complex derivatives.
problem Complex financial derivatives require extensive computations in high-dimensional spaces.
method Developed a quantum algorithm for simulating many potential asset paths in parallel.
result Quantum algorithm provides highly accurate option pricing and risk analysis.
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.
Quantum complexity lowerbound proved using differential geometry.
problem Proving lower bounds on quantum complexity.
method Applied the Bishop-Gromov bound to Nielsen's complexity geometry.
result Lower bounds on quantum complexity are exponentially large.
New complex structures found in quantum SU(3) manifold.
problem Exploring non-commutative complex structures in quantum SU(3) manifold.
method Examined the rank two case of quantum SU(3) manifold, analyzing its differential calculus and non-commutative complex geometry.
result Found that the number of almost-complex structures reduces from 8 to 4, and each is integrable (complex structure).
Extends quantum learning theory to multiclass and online settings.
problem Quantum learning theory for batch and online learning.
method Adapts classical models to quantum settings, introduces new online learning model.
result Quantum and classical sample complexities have the same form for various learning scenarios.
Quantum models generalize well with little data, challenging traditional generalization theories.
problem Quantum machine learning models generalize well with few data, contradicting traditional theories.
method Systematic randomization experiments and theoretical constructions.
result Quantum neural networks can fit random states and labels, defying current generalization measures.
Quantum channels' contraction under privacy constraints studied.
problem Understanding the privacy constraints on quantum channel contractions.
method Established upper bounds on contraction coefficients for specific divergences under QLDP constraints.
result Upper bounds and full characterization of contraction coefficients for specific quantum distances.
Topological quantum computers use hyperbolic knots for computations.
problem The difficulty of calculating quantum invariants of knots.
method Using hyperbolic knots to compute topological quantum computer invariants.
result The hyperbolic geometry of knots is unlikely to be useful for topological quantum computation.
Researchers prove quantum invariants remain hard even when restricted.
problem Computing quantum invariants on 3-manifolds with specific restrictions.
method Using Heegaard splittings and Hempel distance, they construct a hyperbolic 3-manifold with same invariant.
result Proving hardness of computing quantum invariants is preserved under specific restrictions.
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.
Paper proves polynomial equivalence of quantum complexity metrics.
problem Quantum complexity metrics equivalence.
method Study of right-invariant metrics on unitary group.
result All metrics in the equivalence class have polynomial slowdown in approximation.
Explains quantum cohomology of Grassmannians using tt* equations.
problem Relates quantum cohomology of complex Grassmannians to projective space.
method Uses tt* equations and Lie-theoretic connections.
result Illustrates relations between tt* equations and quantum cohomology.
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.
Diffusion maps help learn complex quantum phase transitions from data.
problem Learning quantum phase transitions from experimental data is challenging.
method Diffusion maps for nonlinear dimensionality reduction and spectral clustering.
result Diffusion maps can learn complex phase transitions unsupervised.
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.
The study bounds quantum eigenfunctions on complex manifolds.
problem Restricting quantum eigenfunctions on complex manifolds.
method Analytic continuation and FBI transform for Laplace eigenfunctions.
result Upper and lower L2 bounds for eigenfunctions. 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.
Quantum Reservoir Computing classifies complex probability distributions and identifies volatility regimes.
problem Statistical and financial classification problems with heavy-tailed distributions and correlated time series.
method Implemented QRC in a superconducting quantum circuit with Josephson junctions.
result QRC outperforms classical methods in limited information scenarios.
Physics: Similar long-distance properties can mask vastly different short-distance metrics.
problem Classifying homogeneous metrics on group manifolds by long-distance properties.
method Apply universality concept to geometry, focusing on metrics on Lie groups.
result Many metrics on low-dimensional Lie groups have similar long-distance properties despite differing short-distance properties.
In this paper, we have proposed a deep quantum SVM formulation, and further demonstrated a quantum-clustering framework based on the quantum deep SVM formulation, deep convolutional neural networks, and quantum K-Means clustering. We have investigated the run time computational complexity of the proposed quantum deep c…
Quantum algorithms for multi-armed bandits are explored with limited reward access.
problem Exploring quantum speed-ups in multi-armed bandit problems with limited reward information.
method Introduced new bandit models and showed query complexity equivalence with classical algorithms.
result No quadratic speed-up is possible for multi-armed bandits with limited reward access.
Quantum model generates complex time series data with preserved temporal dynamics.
problem Generating synthetic time series data with temporal correlations.
method Quantum Hamiltonian learning to encode temporal dynamics.
result The proposed quantum model captures unique temporal features of the learned time series.
Study on learning quantum dynamics without direct interaction.
problem Learning quantum dynamics incoherently without direct interaction.
method Analyze sample complexity and prove bounds for incoherent learning.
result Prove that arbitrary measurements allow efficient learning of unitary processes incoherently.
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.
Quantum models improve data generation from noisy quantum processors.
problem Creating complex probability distributions from limited data.
method Quantum-noise-driven generative diffusion models.
result Quantum noise can be harnessed to generate more complex distributions efficiently.
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.
This paper applies quantum probability theory to model asset returns, avoiding assumptions about quantum effects.
problem Modeling asset returns with classical probability theory.
method Derives a Schrödinger-like trading equation using quantum probability, linking it to traders' decisions and market behaviors.
result Quantum probability can describe multimodal distributions of asset returns without assuming quantum effects.
Paper introduces a new deep-learning method for quantum mechanics.
problem Simulating time-evolving Schrödinger equations efficiently.
method Generative diffusion models and stochastic mechanics.
result Significantly lower computational complexity compared to existing methods.
Quantum federated learning improves with non-IID data using one-shot communication.
problem Performance degradation in federated learning with non-IID data.
method Quantum algorithms and local density estimators for non-IID data.
result One-shot communication complexity for non-IID quantum federated learning.
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.
Noncommutative Kähler structures were recently introduced as an algebraic framework for studying noncommutative complex geometry on quantum homogeneous spaces. In this paper, we introduce the notion of a \emph{compact quantum homogeneous Kähler space} which gives a natural set of compatibility conditions between covari…
We analyze the computational complexity of Quantum Sparse Support Vector Machine, a linear classifier that minimizes the hinge loss and the L1 norm of the feature weights vector and relies on a quantum linear programming solver instead of a classical solver. Sparse SVM leads to sparse models that use only a small fr…
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 computing speeds up pricing multi-asset derivatives.
problem Exponential growth in complexity for multi-asset derivatives pricing.
method Quantum algorithm based on quantum linear system algorithms for FDM.
result Exponential speedup in derivative pricing compared to classical methods.
Constructs manifolds from quantum codes with novel geometric properties.
problem Creating manifolds with specific geometric constraints.
method Reverse engineering manifolds from quantum code chain complexes.
result First examples of power law Z2 systolic freedom. Study online learning of quantum processes, showing feasibility for certain types.
problem Learning quantum processes adaptively, especially for bounded gate complexity and Pauli channels.
method Online learning, mistake-bounded model, multiplicative weights update algorithm, Bell sampling.
result Online learning feasible for quantum channels of bounded gate complexity and Pauli channels.