Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,657 papers · 148 categories

Trend · papers per month

167334501668 · Jun 202019922001200920172026
48 results for quantum functional

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.

Quantum dilogarithm function proven from a linear difference equation.

problem Proving Faddeev's quantum dilogarithm from a linear difference equation.
method Proved Faddeev's quantum dilogarithm using Borel summation of a formal power series solution of a linear difference equation.
result Borel summation of a formal power series solution produces Faddeev's quantum dilogarithm.

These notes were inspired by the course ''Quantum Field Theory from a Functional Integral Point of View'' given at the University of Zurich in Spring 2017 by Santosh Kandel. We describe Feynman's path integral approach to quantum mechanics and quantum field theory from a functional integral point of view, where the mai…

2019-02-22abs ↗pdf ↗

Quantum invariants from Uhsl(21)U_h\mathfrak{sl}(2|1) are q-holonomic.

problem Understanding quantum invariants from a specific quantum group.
method Demonstrated q-holonomic property through quantum group representations.
result Existence of an underlying field theory for these quantum invariants.

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 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.

Quantum computing offers a quadratic speedup for estimating non-linear functionals.

problem Estimating non-linear functionals of probability distributions.
method Proposes a quantum-inside-quantum Monte Carlo algorithm for a broad class of non-linear estimation problems.
result Achieves a quadratic speedup for non-linear estimation problems, including nested conditional expectations and stochastic optimization.

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.

We discuss an approach to quantum gerbes over quantum groups in terms of q-deformation of transition functions for a loop group bundle. The case of the quantum group SUq(2) is treated in some detail.

2003-08-25abs ↗pdf ↗

New techniques prove quantum modularity for various functions.

problem Proving quantum modularity of false theta functions and related series.
method Developed techniques including Poisson summation formula and modular series framework.
result Unified approach to proving quantum modularity for various functions.

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 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.

We introduce two methods for estimating the density matrix for a quantum system: Quantum Maximum Likelihood and Quantum Variational Inference. In these methods, we construct a variational family to model the density matrix of a mixed quantum state. We also introduce quantum flows, the quantum analog of normalizing flow…

2019-04-11abs ↗pdf ↗

Quantum algorithm samples from SDEs using DQCs and quantile mechanics.

problem Sampling from solutions of stochastic differential equations.
method Differentiable quantum circuits (DQCs) encoding latent variables, quantile mechanics.
result Quantum algorithm generates time-series from SDEs.

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.

In this paper, we study the Yang-Mills functional on quantum Heisenberg manifolds using the appratuses developed by A. Connes and M. Rieffel. It is discovered that a connection on a projective module over a quantum Heisenberg manifold is a minimum of Yang-Mills functional whicih is a critical point that is different wi…

2009-07-02abs ↗pdf ↗

Survey on quantum computing and neural networks.

problem Understanding and comparing quantum computing and neural networks.
method Introduction to quantum computing concepts, explanation of quantum computing paradigms, and analysis of quantum neural networks.
result Current state-of-the-art in quantum neural networks.

Analyzes dynamics of quantum neural networks, predicting exponential decay of training error.

problem Understanding convergence rate of quantum neural networks training.
method Analytic theory for gradient descent dynamics of wide quantum neural networks.
result Simple analytic formula predicts exponential decay of training error.

Quantum circuit optimization speeds up financial derivatives pricing.

problem Efficiently pricing financial derivatives on quantum computers.
method Pretraining conditional parameterized circuits for state-dependent functions.
result Quantum circuit implementation of derivatives' payoff function is more efficient.

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.

Machine learning and quantum computing are two technologies each with the potential for altering how computation is performed to address previously untenable problems. Kernel methods for machine learning are ubiquitous for pattern recognition, with support vector machines (SVMs) being the most well-known method for cla…

2018-04-30abs ↗pdf ↗

Quantum algorithm finds extrema in discrete optimisation problems.

problem Finding extrema in discrete optimisation functions.
method Quantum unstructured search algorithm (QSERA) to map and find extrema.
result Quadratic speed-up over classical algorithms for discrete optimisation.

Beginning with several basic hypotheses of quantum mechanics, we give a new quantum model in econophysics. In this model, we define wave functions and operators of the stock market to establish the Schrödinger equation for the stock price. Based on this theoretical framework, an example of a driven infinite quantum wel…

2010-09-24abs ↗pdf ↗

Quantum machine learning tackles large datasets with randomized measurements.

problem Efficiently process large, high-dimensional datasets on quantum computers.
method Randomized measurements to scale linearly with dataset size and quadratic for post-processing.
result Substantial speed-up for noisy quantum computers, enabling image classification.

Perelman's Ricci flow emerges in quantum gravity, linking math and physics.

problem Understanding Perelman's Ricci flow equations in quantum gravity.
method Mapping Perelman's Ricci flow equations to localization equations in topological quantum gravity.
result Perelman's dilaton and fixed volume condition emerge dynamically.

The probability distribution function (PDF) for prices on financial markets is derived by extremization of Fisher information. It is shown how on that basis the quantum-like description for financial markets arises and different financial market models are mapped by quantum mechanical ones.

2015-04-15abs ↗pdf ↗

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.

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.

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.

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.