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

Trend · papers per month

138277415553 · Jun 202019922001200920172026
48 results for quantum feature map

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 kernels can be efficiently embedded into classical feature spaces.

problem Can all quantum kernels be efficiently embedded into classical feature spaces?
method Invoking computational universality and using techniques like random Fourier features, the authors show that certain classes of quantum kernels can be efficiently embedded.
result For shift-invariant and composition kernels, embedding quantum kernels are universal and efficient.

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.

Restricts quantum representations of mapping class groups to integral coefficients.

problem Integrality of non-semisimple quantum representations of mapping class groups.
method Exhibits explicit bases of states spaces that span Z[ζ]\mathbb{Z}[ζ]-lattices invariant under mapping class groups.
result Restricts quantum representations to integral coefficients from Q(ζ)\mathbb{Q}(ζ) to Z[ζ]\mathbb{Z}[ζ].

Quantum trace maps for surfaces are shown to be compatible under triangulations.

problem Constructing and understanding quantum trace maps for surfaces.
method Developed quantum mutation maps between subalgebras of quantum torus algebras for different triangulations.
result Quantum trace maps are natural and independent of triangulation choices.

Quantum duality map extended to general marked surfaces and its compatibility with skein algebras proven.

problem Generalizing quantum duality map to general marked surfaces and proving its compatibility with skein algebras.
method Generalized quantum duality map, reduced stated skein algebras, quantum trace maps, skein lifting.
result Compatibility of quantum duality map with skein algebras proven.

Quantum Frobenius map for SL3SL_3 skein modules constructed and described.

problem Constructing a quantum Frobenius map for SL3SL_3 skein modules.
method Using threading polynomials and the Frobenius map of Parshall-Wang for quantum group Oq(SL3).\mathcal{O}_q(SL_3).
result Described the quantum Frobenius map for SL3SL_3 skein modules.

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.

We study quantum moment maps of GG-invariant star products, which are a quantum analogue of the moment map for classical Hamiltonian systems. Introducing an integral representation, we show that any quantum moment map for a GG-invariant star product is differentiable. This property gives us a new method for the class…

2002-10-03abs ↗pdf ↗

This study compares feature importance and explainability in quantum vs classical ML models.

problem Lack of transparency in ML models, especially in sensitive fields.
method Comparison of classical ML (SVM, Random Forest) and hybrid quantum ML (VQC, QSVC) models using feature importance and explainability methods.
result Quantum ML models provide insights similar to classical models but with unique quantum features.

Quantum circuits represent binary classification trees with binary features.

problem Classifying data using binary classification trees with binary features.
method Quantum circuits and probabilistic approach for traversing decision trees.
result First realization of a decision tree classifier on a quantum device.

Quantum trace map defines invariants for knots and links, confirming a length conjecture.

problem Defining invariants for knots and links in hyperbolic 3-manifolds.
method Introducing a quantum trace map for ideally triangulated knot complements, combining with state-integral models.
result Perturbative invariants determine an asymptotic expansion of the Jones polynomial, confirming the length conjecture.

Propose a new 3d quantum trace map that agrees with Garoufalidis and Yu's construction and extends to certain manifolds with ideal triangulated boundaries.

problem Relationship between two constructions of 3d quantum trace maps.
method Propose a new 3d quantum trace map.
result Proposed 3d quantum trace map agrees with Garoufalidis and Yu's construction and extends to certain manifolds with ideal triangulated boundaries.

InfoQGAN uses mutual information to improve QGANs, overcoming mode collapse and feature disentanglement issues.

problem Mode collapse and lack of feature control in QGANs.
method Integrates InfoGAN principles with variational quantum circuit, classical discriminator, and MINE for mutual information optimization.
result InfoQGAN effectively mitigates mode collapse and achieves robust feature disentanglement.

Quantum computing improves feature selection in machine learning.

problem Optimizing feature selection in machine learning problems.
method Formulated feature selection as a QUBO problem and compared quantum and classical methods.
result Quantum computing can outperform classical methods in feature selection, depending on data set.

Quantum ELMs use a quantum reservoir to learn from data, with limits on expressivity and scalability.

problem Understanding the limits of quantum ELMs for machine learning tasks.
method Decomposed QELM predictions into Fourier series to analyze expressivity and scalability.
result Expressivity of QELMs is limited by the number of Fourier frequencies and observables, and scalability is hindered by hardware noise and entanglement.

Quantum algorithm speeds up learning from big data exponentially.

problem Scalable learning from big data with optimized random features.
method Quantum algorithm for sampling optimized random features.
result Exponential speedup in runtime compared to classical algorithms.

Proves rigidity of SU(2) and SO(3) quantum representations at prime levels.

problem Quantum representations of mapping class groups at prime levels.
method Ocneanu rigidity of modular categories and harmonic representatives in Hodge theory.
result Rigidity of SU(2) and SO(3) quantum representations at all prime levels for closed surfaces of genus at least 7.

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.

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 machine learning faces challenges similar to variational quantum algorithms in training.

problem Challenges in training quantum machine learning models.
method Bridge between variational quantum algorithms and quantum machine learning, applying gradient scaling results.
result Gradient scaling results for variational quantum algorithms can also be applied to quantum machine learning models, revealing new trainability issues.

Quantum representations of mapping class groups are locally rigid at prime levels.

problem Locally rigid properties of quantum representations of mapping class groups.
method Proving local rigidity for Fibonacci representations of mapping class groups at prime levels.
result Local rigidity of Fibonacci representations of mapping class groups at prime levels.

We show how the quantum trace map of Bonahon and Wong can be constructed in a natural way using the skein algebra of Muller, which is an extension of the Kauffman bracket skein algebra of surfaces. We also show that the quantum Teichmüller space of a marked surface, defined by Chekhov-Fock (and Kashaev) in an abstract …

2015-11-19abs ↗pdf ↗

This paper uses quantum computing to solve sparse linear regression problems efficiently.

problem Sparse linear regression to identify important features from a large set of variables.
method Formulates the 0\ell_0 optimization problem as a QUBO problem and solves it using the D-Wave adiabatic quantum computer.
result The QUBO solution matches the optimal solution for a wide range of sparsity penalty values across datasets.

Authors prove quantum invariant conjecture for figure-eight knot complement.

problem Connecting quantum invariants of surface diffeomorphisms to hyperbolic volumes.
method Analyzes the simplest case of a one-puncture torus and figure-eight knot complement.
result Proves conjecture linking quantum invariant to hyperbolic volume.

A Hermitian TQFT from non-semisimple quantum sl(2) modules.

problem Constructing a Hermitian TQFT from a non-semisimple category.
method Endowed a non-semisimple category of quantum sl(2) modules with a Hermitian structure and proved the resulting TQFT is Hermitian.
result Projective representations of the mapping class group in indefinite unitary matrices.

We define a canonical map from a certain space of laminations on a punctured surface into the quantized algebra of functions on a cluster variety. We show that this map satisfies a number of special properties conjectured by Fock and Goncharov. Our construction is based on the "quantum trace" map introduced by Bonahon …

2015-09-04abs ↗pdf ↗

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 ↗

We analyze the computational complexity of Quantum Sparse Support Vector Machine, a linear classifier that minimizes the hinge loss and the L1L_1 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…

2019-02-05abs ↗pdf ↗