Quantum statistical models with singularities are studied for state estimation and model selection.
problem Understanding statistical properties of quantum singular models.
method Classical singular learning theory extended to quantum state estimation and model selection using algebraic geometrical methods.
result Asymptotically unbiased estimator (QWAIC) for quantum generalization loss constructed.
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.
A quantum circuit designed for efficient statistical model preparation and training.
problem Challenges in preparing and learning statistical models on quantum processors.
method Utilizes the maximum entropy principle to design a statistics-informed parameterized quantum circuit (SI-PQC).
result Improves trainability and interpretability for learning quantum states and classical model parameters.
Quantum machine learning can't achieve polylogarithmic runtimes, even with quantum data access.
problem Bounding the minimum number of samples required for supervised quantum learning.
method Statistical learning theory and quantum machine learning algorithms.
result Quantum machine learning algorithms for supervised learning have at most polynomial speedups over classical algorithms.
Unified approach for quantum and classical learning from evaluation oracles.
problem Learning from evaluation oracles in quantum and classical settings.
method Inspired by Kearns' SQ and Valiant's weak evaluation oracle, a unified framework is established.
result Characterizes query complexity for learning linear function classes and extends learnability results for quantum circuits.
This paper reviews quantum machine learning from NISQ to fault tolerance.
problem The challenges and opportunities in quantum machine learning.
method Comprehensive review of quantum machine learning concepts.
result Coverage of NISQ and fault-tolerant quantum computing approaches.
The paper explores quantum statistical manifolds and their autoparallelity, providing estimation-theoretical characterizations.
problem Quantum statistical manifolds and their geometric properties.
method Study of autoparallelity w.r.t. the e-connection, using quantum estimation theory.
result Characterizations of e-autoparallel submanifolds as statistical models with efficient estimators.
Quantum algorithms improve high-frequency trading efficiency.
problem Reducing calculation time in high-frequency statistical arbitrage trading.
method Variable time condition number estimation and quantum linear regression.
result Quantum advantage in trading algorithm complexity reduction.
To formulate the universal constraints of quantum statistics data of generic long-range entangled quantum systems, we introduce the geometric-topology surgery theory on spacetime manifolds where quantum systems reside, cutting and gluing the associated quantum amplitudes, specifically in 2+1 and 3+1 spacetime dimension…
We analyze the relationships between game theory and quantum mechanics and the extensions to statistical physics and information theory. We use certain quantization relationships to assign quantum states to the strategies of a player. These quantum states are contained in a density operator which describes the new quan…
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 theory improves counting overlapping clusters.
problem Counting overlapping clusters in machine learning.
method Applied quantum theory using path integral technique.
result Quantum theory provides a robust statistical method for counting clusters.
Lossy compression of statistical data using quantum annealing.
problem Efficiently compressing statistical floating-point data.
method Representation learning with binary variables, classical optimization of basis vectors, quantum annealing for coefficients, bias correction.
result Quantum annealing shows promising results with 3.5x better compression than neural-network autoencoders.
Study shows limitations and possibilities of learning quantum circuit output distributions.
problem Learnability of output distributions of local quantum circuits.
method Investigated within two oracle models: statistical query model and direct sample access model.
result Output distributions of super-logarithmic depth Clifford circuits are not efficiently learnable in the statistical query model.
New quantum states capture more information, enabling advanced processing tasks.
problem Quantum information processing challenges with limited statistical information.
method Introducing Random-Coefficient Pure States (RCPS) and exploiting their higher-order statistics.
result RCPS provide richer information than density operators, enabling new quantum tasks.
We analyze complexity of financial (and general economic) processes by comparing classical and quantum-like models for randomness. Our analysis implies that it might be that a quantum-like probabilistic description is more natural for financial market than the classical one. A part of our analysis is devoted to study t…
Quantum tech speeds up financial risk assessment.
problem Improving credit valuation adjustments using quantum mechanics.
method Developed a quantum algorithm using Bayesian quantum amplitude estimation and engineered likelihood functions.
result Significant speedup in quantum computations for CVA over classical methods.
New method uses quantum annealing and VAN for better statistical mechanics calculations.
problem Difficulty in computing partition function in statistical mechanics.
method Combines quantum annealing samples with variational autoregressive networks.
result Enhanced accuracy in finite-size Sherrington-Kirkpatrick model.
We apply the geometric-topology surgery theory on spacetime manifolds to study the constraints of quantum statistics data in 2+1 and 3+1 spacetime dimensions. First, we introduce the fusion data for worldline and worldsheet operators capable creating anyon excitations of particles and strings, well-defined in gapped st…
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.
Quantum GBS boosts asset clustering for robust statistical arbitrage portfolios.
problem Identifying co-moving assets from correlation matrices for statistical arbitrage.
method Mapping S&P 500 correlation data to GBS-compatible adjacency matrices, benchmarking classical and quantum clustering algorithms.
result Quantum GBS generates superior alpha during high volatility periods, persisting under low-loss conditions.
Global EQG sums boundary states over manifold diffeomorphism classes.
problem Summing boundary states over manifold diffeomorphism classes.
method Formulated as classical statistical physics, weights determined by general principles.
result Hartle-Hawking state as a probability measure.
Quantum models show improved performance in overparameterized regimes.
problem Overfitting in quantum machine learning models.
method Analytical demonstration and numerical experiments on quantum kernel methods.
result Quantum models can operate in the modern, overparameterized regime without overfitting.
Predicts coherence from quantum heat engine noise using machine learning.
problem Predicting coherence in quantum heat engines from nonequilibrium fluctuations.
method Developed a machine learning protocol using K-Nearest Neighbor (KNN) model.
result Machine learning successfully predicts coherence from quantum heat engine noise.
Renormalization in neural networks linked to quantum field theory.
problem Implementing renormalization in neural networks.
method Mapping neural networks to quantum field theory, applying renormalization techniques.
result Changing weight standard deviation corresponds to a renormalization flow.
A quantum system can be entirely described by the Kähler structure of the projective space P(H) associated to the Hilbert space H of possible states; this is the so-called geometrical formulation of quantum mechanics. In this paper, we give an explicit link between the geometrical formulation (of finite dimensional qua…
Quantum method speeds up VB estimation in machine learning.
problem Prohibitively expensive natural gradient in high dimensions.
method Regression-based natural gradient estimation with quantum matrix inversion.
result Quantum method enables efficient VB estimation.
This paper bridges Kahler geometry and quantum mechanics in lognormal statistical models.
problem Evolution of spectral curves in Siegel Jacobi space through Schrodinger equation.
method Kahler geometry induced on lognormal statistical manifold, Dombrowski's construction.
result Time-dependent Schrodinger equation with varying energy.
Simple construction for universal quantum gates.
problem Designing efficient quantum gates for topological computers.
method Demonstrated a simple construction for unitary solutions of the braided Yang-Baxter equation in any dimension.
result Proved the existence of universal quantum gates in any dimension.
Unified geometric approach to quantum indeterminacy.
problem Quantum indeterminacy and uncertainty principles.
method Geometric formulation using convex geometry and symplectic topology.
result Robertson-Schrodinger inequalities emerge as geometric principles.
Exponential families are a particular class of statistical manifolds which are particularly important in statistical inference, and which appear very frequently in statistics. For example, the set of normal distributions, with mean μ and deviation σ, form a 2-dimensional exponential family. In this paper, we show that …
The Riemannian Bures metric on the space of (normalized) complex positive matrices is used for parameter estimation of mixed quantum states based on repeated measurements just as the Fisher information in classical statistics. It appears also in the concept of purifications of mixed states in quantum physics. Here we d…
We demonstrate how quantum computation can provide non-trivial improvements in the computational and statistical complexity of the perceptron model. We develop two quantum algorithms for perceptron learning. The first algorithm exploits quantum information processing to determine a separating hyperplane using a number …
This paper provides a construction of a quantum statistical mechanical system associated to knots in the 3-sphere and cyclic branched coverings of the 3-sphere, which is an analog, in the sense of arithmetic topology, of the Bost-Connes system, with knots replacing primes, and cyclic branched coverings of the 3-sphere …
We present two paradigms relating algebraic, topological and quantum computational statistics for the topological model for quantum computation. In particular we suggest correspondences between the computational power of topological quantum computers, computational complexity of link invariants and images of braid grou…
Quantum model for knotted graphs from knot theory.
problem Constructing an isotopy invariant polynomial for knotted bipartite ribbon graphs.
method Applying quantum topology to construct an isotopy invariant polynomial.
result Computed the expected number of loops in the double dimer model.
New quantum state reconstruction method accelerates convergence.
problem Quantum state reconstruction for larger systems.
method Momentum-Inspired Factored Gradient Descent (MiFGD) combining compressed sensing, non-convex optimization, and acceleration.
result Converges to true density matrix at an accelerated linear rate, provably close to the true matrix.
We use standard perturbation techniques originally formulated in quantum (statistical) mechanics in the analysis of a toy model of a stock market which is given in terms of bosonic operators. In particular we discuss the probability of transition from a given value of the {\em portfolio} of a certain trader to a differ…
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.
Econophysics has developed as a research field that applies the formalism of Statistical Mechanics and Quantum Mechanics to address Economics and Finance problems. The branch of Econophysics that applies of Quantum Theory to Economics and Finance is called Quantum Econophysics. In Finance, Quantum Econophysics' contrib…
QBC uses quantum computers to speed up Bayesian computation.
problem Exponential speed-up in Bayesian computation.
method Quantum von Neumann measurement for simulating ML algorithms.
result Quantum versions of regression, Gaussian processes, and SGD.
Study finds no significant difference in neural network weights with quantum random numbers.
problem Effects of biased quantum random numbers on neural network initialization.
method Empirical study using quantum hardware and classical pseudo-random numbers.
result No statistically significant difference found between quantum random numbers and other types.
Quantum algorithm estimates multivariate mean with near-optimal efficiency.
problem Estimating the mean of multivariate random variables efficiently in quantum computing.
method Combines amplitude amplification, quantum singular value transformation, and Bernstein-Vazirani algorithm.
result Quantum estimator outperforms classical estimators outside low-precision regime.
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.
Geometrically decomposes Kähler functions on toric manifolds.
problem Decomposing Kähler functions on Kähler toric manifolds.
method Defining spectrum of Kähler functions and proving spectral decomposition theorem.
result Geometric spectral theory for Kähler functions established.
New metrics improve quantum ensemble learning efficiency and power.
problem Quantum ensembles' distances poorly understood due to measurement constraints.
method Introduce MMD-k hierarchy of integral probability metrics for quantum ensembles. result MMD-k requires fewer samples for full discriminative power at higher k. By analyzing the relationships between a socioeconomical system modeled through evolutionary game theory and a physical system modeled through quantum mechanics we show how although both systems are described through two theories apparently different both are analogous and thus exactly equivalents. The extensions of qu…