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,695 papers · 148 categories

Trend · papers per month

326395126 · May 202619922001200920172026
48 results for quantum corrections

Quantum codes on hyperbolic lattices outperform Euclidean ones with higher rates and lower overhead.

problem Improving quantum error correction performance with hyperbolic lattices.
method Unified framework using Hyperbolic Cycle Basis algorithm for CSS codes construction and benchmarking.
result Achieved higher encoding rates and lower qubit overhead in hyperbolic quantum error correction codes.

We define the quantum correction of the Teichmüller space T\mathcal{T} of Calabi-Yau manifolds. Under the assumption of no weak quantum correction, we prove that the Teichmüller space T\mathcal{T} is a locally symmetric space with the Weil-Petersson metric. For Calabi-Yau threefolds, we show that no strong quantum co…

2014-11-01abs ↗pdf ↗

We introduce a differential geometric framework for describing families of quantum error-correcting codes and for understanding quantum fault tolerance. This work unifies the notion of topological fault tolerance with fault tolerance in other kinds of quantum error-correcting codes. In particular, we use fibre bundles …

2013-09-26abs ↗pdf ↗

Quantum field theory connects deep neural networks to criticality.

problem Understanding the criticality and training dynamics of deep neural networks.
method Constructing quantum field theory for deep neural networks, computing corrections to correlation functions.
result Found precise analogy with O(N)O(N) vector model, providing corrections to correlation length.

Paper presents a new VMBQC model with fewer parameters for better generative modeling.

problem Limited generative power of VMBQC due to more parameters than unitary models.
method Introduces a restricted VMBQC model with a single additional trainable parameter.
result Minimal extension of VMBQC model generates distributions not learnable by unitary models.

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.

We show that using the family of adapted Kähler polarizations of the phase space of a compact, simply connected, Riemannian symmetric space of rank-1, the obtained field HcorrH^{corr} of quantum Hilbert spaces produced by geometric quantization including the half-form correction is flat if MM is the 3-dimensional sphere …

2012-04-04abs ↗pdf ↗

We use Khovanov homology to define families of LDPC quantum error-correcting codes: unknot codes with asymptotical parameters [[3^(2l+1)/sqrt(8πl);1;2^l]]; unlink codes with asymptotical parameters [[sqrt(2/2πl)6^l;2^l;2^l]] and (2,l)-torus link codes with asymptotical parameters [[n;1;d_n]] where d_n>\sqrt(n)/1.62.

2013-07-17abs ↗pdf ↗

Quantum codes linked to abelian varieties, providing mathematical rigor.

problem Quantum error correction through complex abelian varieties.
method Mathematical formulation of Gottesman-Kitaev-Preskill codes using abelian varieties.
result Asymptotic isometry of encoding, precise gate realizations, and failure probability optimization.

The theory of quantum computation can be constructed from the abstract study of anyonic systems. In mathematical terms, these are unitary topological modular functors. They underlie the Jones polynomial and arise in Witten-Chern-Simons theory. The braiding and fusion of anyonic excitations in quantum Hall electron liqu…

2001-01-04abs ↗pdf ↗

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.

Finding efficient decoders for quantum error correcting codes adapted to realistic experimental noise in fault-tolerant devices represents a significant challenge. In this paper we introduce several decoding algorithms complemented by deep neural decoders and apply them to analyze several fault-tolerant error correctio…

2018-02-18abs ↗pdf ↗

The combination of machine learning and quantum computing has emerged as a promising approach for addressing previously untenable problems. Reservoir computing is an efficient learning paradigm that utilizes nonlinear dynamical systems for temporal information processing, i.e., processing of input sequences to produce …

2020-01-26abs ↗pdf ↗

Variational hybrid quantum-classical optimization represents one of the most promising avenue to show the advantage of nowadays noisy intermediate-scale quantum computers in solving hard problems, such as finding the minimum-energy state of a Hamiltonian or solving some machine-learning tasks. In these devices noise is…

2019-12-13abs ↗pdf ↗

We construct a path integral based on the coupling of the Liouville action and the Mabuchi K-energy on a one-dimensional complex manifold. To the best of our knowledge this is the first rigorous construction of such an object and this is done by means of probabilistic tools. Both functionals play an important role resp…

2018-07-04abs ↗pdf ↗

We propose a formulation of a Lorentzian quantum geometry based on the framework of causal fermion systems. After giving the general definition of causal fermion systems, we deduce space-time as a topological space with an underlying causal structure. Restricting attention to systems of spin dimension two, we derive th…

2011-07-11abs ↗pdf ↗

Quantum machine learning generalizes well from limited data.

problem Generalization in quantum machine learning from few training data.
method Optimizing parameterized quantum circuits on training data sets and analyzing generalization error.
result Generalization error scales at worst as √(T/N) and improves to √(K/N) when only K gates change.

Researchers resolve a SYZ conjecture for A_n singularities using quantum-corrected T-duality.

problem Resolving a mathematically precise SYZ conjecture for A_n singularities.
method Building a quantum-corrected T-duality between two singular torus fibrations.
result Constructing a parameter-dependent SYZ mirror fibration partner with matching singular loci and integral affine structure.

Invited lecture at the XIV-th workshop on geometric methods in physics, Bialowieza, Poland, July 9-15, 1995. In this lecture results are reviewed obtained by the author together with Martin Bordemann and Eckhard Meinrenken on the Berezin-Toeplitz quantization of compact Kaehler manifolds. Using global Toeplitz operator…

1996-01-18abs ↗pdf ↗

We give a differential geometric construction of a connection in the bundle of quantum Hilbert spaces arising from half-form corrected geometric quantization of a prequantizable, symplectic manifold, endowed with a rigid, family of Kähler structures, all of which give vanishing first Dolbeault cohomology groups. In [An…

2007-11-26abs ↗pdf ↗

Study on topological order on fractal geometries, proving no-go theorem and fault-tolerant gates.

problem Investigating topological order on fractal geometries embedded in n dimensions.
method Using quantum error-correcting codes and systolic geometry to diagnose topological order.
result Proves no-go theorem for topological order on 2D fractals, survival on higher dimensions, and construction of fault-tolerant gates.

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.

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.

Quantum kernels show no advantage in stock return prediction, but differ in stability metrics.

problem Determining if quantum kernels improve stock return prediction.
method Controlled horse race on Chinese A-share market with identical training subsamples and tuning budgets.
result Quantum kernels do not outperform classical RBF controls in cross-sectional stock return prediction.

Study 3d N=1 vacua from M-theory compactification on Spin(7) space.

problem Quantum corrections in 3d N=1 vacua from M-theory compactification.
method Use Higgs bundles to analyze 3d N=1 vacua and track corrections.
result Topological anomalies are robust and calculable in 3d effective field theory.

Quantum method improves CVaR evaluation under correlated fields.

problem Accurately evaluating CVaR in high-dimensional, correlated material uncertainty.
method Quantum-enhanced inference framework using stabilized IQAE.
result Quantum method achieves lower oracle complexity than classical methods.

We introduce the hemicubic codes, a family of quantum codes obtained by associating qubits with the pp-faces of the nn-cube (for n>pn>p) and stabilizer constraints with faces of dimension (p±1)(p\pm1). The quantum code obtained by identifying antipodal faces of the resulting complex encodes one logical qubit into $N = 2^…

2019-11-08abs ↗pdf ↗