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.
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 …
Quantum computers will work by evolving a high tensor power of a small (e.g. two) dimensional Hilbert space by local gates, which can be implemented by applying a local Hamiltonian H for a time t. In contrast to this quantum engineering, the most abstract reaches of theoretical physics has spawned topological models ha…
An earlier article with Francis Bonahon introduced new invariants for pseudo-Anosov diffeomorphisms of surface, based on the representation theory of the quantum Teichmuller space. We explicity compute these quantum hyperbolic invariants in the case of the 1-puncture torus and the 4-puncture sphere.
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 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.
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.
This study improves quantum classifiers by optimizing data preprocessing.
problem Quantum Machine Learning advantages are not yet clearly demonstrated.
method Used Linear Discriminant Analysis (LDA) for data preprocessing.
result Variational Quantum Algorithm (VQA) outperforms classical classifiers.
New quantum kernels avoid overfitting by combining local and global components.
problem Exponential concentration in quantum kernels leads to overfitting.
method Local-global quantum kernels combining small subsystem and full-system measurements.
result Demonstrated benign overfitting in local-global quantum kernels.
Quantum computing exploits basic quantum phenomena such as state superposition and entanglement to perform computations. The Quantum Approximate Optimization Algorithm (QAOA) is arguably one of the leading quantum algorithms that can outperform classical state-of-the-art methods in the near term. QAOA is a hybrid quant…
Quantum computing offers new solutions for financial optimization, pricing, risk, and security.
problem Core financial bottlenecks in combinatorial search, expectation estimation, and rare-event analysis.
method Identify bottlenecks, specify quantum primitives, compare with classical benchmarks, assess under constraints.
result Strongest near-term case for quantum finance in hybrid workflows, constrained search, and amplitude-estimation.
This paper compares classical shadows and direct quantum measurement for efficient information extraction.
problem Efficiently extracting classical information from quantum states with limited classical post-processing.
method Quantitative resource analysis comparing classical shadows and direct quantum measurement.
result An efficiency frontier between classical shadows and direct quantum measurement is identified.
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 computing speeds up neural network training and retraining.
problem Inefficient classical training and retraining of neural networks.
method Adiabatic quantum computing to optimize Kolmogorov-Arnold Networks using Bezier curves.
result Quantum optimization achieves 100x faster retraining compared to classical methods.
Quantum systems with scrambling improve temporal information processing, but scaling requires exponential overhead.
problem Scalability and memory retention of quantum reservoirs in temporal information processing.
method Examined a quantum reservoir processing framework with scrambling reservoirs modeled by high-order unitary designs, analyzed in noiseless and noisy settings.
result Memory retention improves exponentially with reservoir size but worsens with reservoir iterations, requiring exponential shot overhead for scaling.
We show that unrolled quantum groups at odd roots of unity give rise to relative modular categories. These are the main building blocks for the construction of 1+1+1-TQFTs extending CGP invariants, which are non-semisimple quantum invariants of closed 3-manifolds decorated with ribbon graphs and cohomology classes. Whe…
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[ζ]-lattices invariant under mapping class groups. result Restricts quantum representations to integral coefficients from Q(ζ) to Z[ζ]. Quantum algorithm improves ensemble classification with reduced memory and time requirements.
problem High memory and computational time requirements in ensemble methods.
method Quantum superposition, entanglement, and interference to build an ensemble of classification models.
result Exponential growth of ensemble size with linear increase in depth of circuit.
Quantum algorithm speeds up Lasso regression by quadratically faster per iteration.
problem Efficiently solving high-dimensional linear regression with L1-penalty.
method Pathwise LARS algorithm adapted for quantum computing, using minimum-finding subroutines.
result Quadratic speedup in computation time for both number of features and observations.
Generative AI decodes quantum codes without labeled data.
problem Efficient decoding of quantum error-correcting codes.
method Generative Transformers learn logical operators from unsupervised syndromes.
result Significantly better decoding accuracy than traditional methods.
Quantum theory of curved tetrahedrons yields quantum group intertwiners.
problem Quantum geometry of curved tetrahedrons and their intertwiners.
method Combinatorial quantization of tetrahedron phase space, relating to SU(2) flat connections.
result Physical Hilbert space coincides with Uq(su(2)) intertwiners, consistent with LQG area spectrum.
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.
The authors previously found a model of universal quantum computation by making use of the coset structure of subgroups of a free group G with relations. A valid subgroup H of index d in G leads to a 'magic' state ∣ψ⟩ in d-dimensional Hilbert space that encodes a minimal informationally com…
Quantum algorithms simulate and exponentiate correlated Gaussian vectors for financial modeling.
problem Efficiently simulate and exponentiate correlated Gaussian vectors for financial applications.
method Proposes quantum algorithms for preparing and exponentiating normalised correlated Gaussian random vectors.
result Achieves subcubic complexity in N for quantum state preparation, providing a quantum advantage over classical methods. In this paper we consider a conjecture formulated by the second author in occasion of the 1998 ICM in Berlin (arXiv:math/9807034v2). This conjecture states the equivalence, for a Fano variety X, of the semisimplicity condition for the quantum cohomology QH∙(X) with the existence condition of full exceptional…
Machine learning has recently emerged as a fruitful area for finding potential quantum computational advantage. Many of the quantum enhanced machine learning algorithms critically hinge upon the ability to efficiently produce states proportional to high-dimensional data points stored in a quantum accessible memory. Eve…
New invariants derived from Kauffman bracket for 3-manifolds.
problem Quantum invariants of 3-manifolds, especially non-semisimple ones.
method Combinatorial methods using Temperley-Lieb algebras and Kauffman bracket polynomials.
result Recovery of invariants from small quantum group of sl2. 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.
Quantum computing is a computational paradigm with the potential to outperform classical methods for a variety of problems. Proposed recently, the Quantum Approximate Optimization Algorithm (QAOA) is considered as one of the leading candidates for demonstrating quantum advantage in the near term. QAOA is a variational …
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.
Quantum K-theory of quintic 3-fold conjectured with non-polynomial coefficients.
problem Reconstructing quantum K-theory for quintic 3-fold.
method Formulated explicit conjecture for small J-function and its q-difference equation.
result Coefficients of q-difference equations are non-polynomial functions of Gopakumar-Vafa invariants.
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.
Quantum models avoiding barren plateaus can also be efficiently simulated classically.
problem Understanding the limitations of barren plateaus in quantum computing.
method Analyzing commonly used models and their ability to be simulated classically.
result Many quantum models with barren plateau-free landscapes can also be efficiently simulated classically.
Quantum computing techniques improve graph analysis and community detection.
problem Analyzing large graphs efficiently and accurately.
method Used quantum annealing and quantum gate computers for community detection and regularity checking.
result Demonstrated the effectiveness of quantum computing in solving complex graph problems.
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…
The accurate detection of small deviations in given density matrices is important for quantum information processing. Here we propose a new method based on the concept of data mining. We demonstrate that the proposed method can more accurately detect small erroneous deviations in reconstructed density matrices, which c…
Quantum computing offers new solutions for finance problems.
problem Challenging classical computational problems in finance.
method Quantum algorithms for finance applications.
result Potential benefits for financial services.
Quantum computers can optimize foreign exchange reserves management.
problem Optimizing foreign exchange reserves management using quantum computing.
method Demonstrated through quantum Monte Carlo risk measurement and quantum algorithms for portfolio optimization.
result Quantum computers can theoretically optimize FX reserves management in the future.
Future advancement of engineering applications is dependent on design of novel materials with desired properties. Enormous size of known chemical space necessitates use of automated high throughput screening to search the desired material. The high throughput screening uses quantum chemistry calculations to predict mat…
Quantum reservoir computing improves volatility forecasting.
problem Forecasting realized volatility in finance.
method Quantum reservoir computing with Ising Hamiltonian and feature selection.
result Quantum reservoir computing outperforms benchmarks in volatility forecasting.
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.
The ability to accurately classify disease subtypes is of vital importance, especially in oncology where this capability could have a life saving impact. Here we report a classification between two subtypes of non-small cell lung cancer, namely Adeno- carcinoma vs Squamous cell carcinoma. The data consists of approxima…
We conjecture formulae of the colored superpolynomials for a class of twist knots Kp where p denotes the number of full twists. The validity of the formulae is checked by applying differentials and taking special limits. Using the formulae, we compute both the classical and quantum super-A-polynomial for the twist k…
Quantum computing aids in optimizing currency reserves for central banks.
problem Optimizing currency composition in foreign exchange reserves.
method Comparison of quantum and classical algorithms for portfolio optimization.
result Quantum algorithms outperform classical methods in currency optimization.
VQAs use classical optimization to train quantum circuits, promising quantum advantage.
problem High computational cost of quantum simulations and solving large-scale problems.
method Variational Quantum Algorithms (VQAs) use classical optimizers to train parametrized quantum circuits.
result VQAs are a promising strategy for obtaining quantum advantage.
Quantum machine learning model for binary classification.
problem Efficiency in high-dimensional binary classification tasks.
method Quantum-classical hybrid algorithm and quantum computer for inference.
result Quantum discriminator achieves 99% accuracy on Iris dataset.
Quantum computing promises faster finance algorithms.
problem Solving finance problems faster than classical methods.
method Quantum computing applications to finance, including Monte Carlo, portfolio optimization, and machine learning.
result Quantum speedups for finance problems, especially Monte Carlo and portfolio optimization.
Quantum Proof-of-Work uses boson sampling to secure blockchain consensus.
problem Ensuring secure and efficient blockchain consensus.
method Proposes using quantum boson sampling as a Proof-of-Work scheme for blockchain.
result Demonstrates a robust and energy-efficient PoW scheme.
This review covers quantum computing applications in finance and blockchain.
problem Challenges in finance and blockchain security with quantum computing.
method Systematic review of recent quantum finance and blockchain work.
result Quantum-resistant blockchain systems and security measures.