Quantum-inspired method optimizes portfolio selection.
problem Optimizing asset allocation in finance.
method Combining quantum-inspired and conventional optimization methods.
result Faster and more accurate portfolio optimization solutions.
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
45 results for “quantum-inspired”
Canonical correlation analysis (CCA) is a technique to find statistical dependencies between a pair of multivariate data. However, its application to high dimensional data is limited due to the resulting time complexity. While the conventional CCA algorithm requires polynomial time, we have developed an algorithm that …
New algorithms improve MCMC efficiency for complex distributions.
problem High variance and low effective sample size in MCMC samplers.
method Antithetic Riemannian Manifold and Quantum-Inspired Hamiltonian Monte Carlo.
result Improved effective sample size and variance reduction.
Paper presents a faster classical algorithm for principal component regression.
problem Efficiently solving principal component regression problems.
method Uses quantum-inspired linear algebra techniques.
result Achieves polylogarithmic runtime, significantly faster than state-of-the-art.
Quantum hardware and quantum-inspired algorithms are becoming increasingly popular for combinatorial optimization. However, these algorithms may require careful hyperparameter tuning for each problem instance. We use a reinforcement learning agent in conjunction with a quantum-inspired algorithm to solve the Ising ener…
Paper tackles dynamic portfolio optimization using quantum and quantum-inspired methods.
problem Optimizing investment portfolios over time considering transaction costs and constraints.
method Implemented quantum and quantum-inspired algorithms on different hardware platforms for real data.
result D-Wave Hybrid and Tensor Networks handle the largest systems up to 1272 qubits.
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 tensor network models learn continuous data effectively.
problem Tensor network models' limitations in handling continuous data.
method Developed a new family of tensor network generative models for continuous data.
result Models can approximate any reasonably smooth probability density function with arbitrary precision.
Trading system uses NP-hard optimization to select stocks for high Sharpe ratio trading.
problem Finding profitable, uncorrelated stocks for high Sharpe ratio trading.
method NP-hard combinatorial optimization using Ising machine and simulated bifurcation algorithm.
result Trading strategy with FPGA-based system achieves 164 μs response latency.
Proposes a quantum-inspired algorithm for selecting representative data subsets.
problem Selecting the most representative subset of data from a larger dataset.
method Uses a Quadratic Unconstrained Binary Optimization (QUBO) problem approach.
result Demonstrates the effectiveness of the selector algorithm in finance applications.
Quantum-inspired tensor network speeds up financial risk assessment.
problem Efficiently pricing multi-asset derivatives in finance.
method Tensor network algorithms for multi-asset options pricing.
result Tensor network approach yields several orders of magnitude speedup.
Support vector machine (SVM) is a particularly powerful and flexible supervised learning model that analyzes data for both classification and regression, whose usual algorithm complexity scales polynomially with the dimension of data space and the number of data points. To tackle the big data challenge, a quantum SVM a…
Quantum neural network and tensor network models outperform classical models in Japanese stock market predictions.
problem Improving stock return predictions using quantum and quantum-inspired machine learning.
method Evaluation of quantum neural network and tensor network models against classical models like linear and neural networks.
result Tensor network model outperforms classical models in Japanese stock market, including linear and neural network models.
Hamiltonian Monte Carlo (HMC) is an efficient Bayesian sampling method that can make distant proposals in the parameter space by simulating a Hamiltonian dynamical system. Despite its popularity in machine learning and data science, HMC is inefficient to sample from spiky and multimodal distributions. Motivated by the …
Tensor networks improve b-jet classification in high-energy physics.
problem Classifying jets from b-quarks in proton-proton collisions.
method Quantum-inspired machine learning using tensor networks.
result Optimized classification of b-jets with improved precision and speed.
Quantum Sparse Codingquant-ph
Quantum algorithm improves sparse vector recovery from noisy measurements.
problem Accurately recover sparse vectors from noisy linear measurements.
method Formulated as a QUBO task, solved using quantum technology.
result Quantum approach outperforms classical methods in sparse coding.
Tensor networks are efficient representations of high-dimensional tensors which have been very successful for physics and mathematics applications. We demonstrate how algorithms for optimizing such networks can be adapted to supervised learning tasks by using matrix product states (tensor trains) to parameterize models…
Quantum optimization aids in financial crash prediction and portfolio management.
problem Hard financial optimization problems.
method Quantum algorithms for financial crashes and portfolio optimization.
result Quantum strategies improve financial prediction and portfolio management.
New classical algorithm outperforms quantum in neural network subnetwork selection.
problem Selecting sparse subnetworks from large neural networks efficiently.
method Quantum-inspired classical algorithm using ridgelet transform sampling.
result Runs in polynomial time, outperforming naive classical methods.
Portfolio optimization with discrete simulated annealingcond-mat.stat-mech
Optimizes portfolios with discrete units using simulated annealing.
problem Finding optimal asset allocation in finance with discrete units.
method Integer simulated annealing method for combinatorial optimization.
result Classical resources can efficiently solve discretized convex portfolio optimization problems.
New quantum algorithm simplifies complex financial derivatives pricing.
problem Complex financial derivatives pricing with high dimensionality.
method Quantum-inspired variational algorithms combined with neural-network quantum states.
result Simplified pricing of European options with many correlated assets.
QNA uses quantum-inspired density operators to diagnose market dependence and structural risk.
problem Lack of unified operator representation for market dependence and structural risk diagnostics.
method Quantum Network of Assets (QNA) framework using density operators.
result QNA entropy remains strongly related to covariance spectral entropy but becomes distinct with multi-feature rolling trajectories.
A diversified portfolio is created by solving the MIS problem in large market graphs, outperforming conventional methods.
problem Finding the maximum independent set (MIS) in large-scale market graphs is computationally challenging.
method Solved the MIS problem using a quantum-inspired algorithm (Simulated Bifurcation) and a combinatorial optimization solver.
result The SB-based solver optimized MIS portfolios, achieving a Sharpe ratio of 1.16 and outperforming major indices.
AI in finance uses quantum logic for better decision-making.
problem Improving financial decision-making models using AI.
method Application of quantum logic in machine learning techniques.
result Advantages of quantum-inspired neural networks in finance.
A wide range of fundamental machine learning tasks that are addressed by the maximum a posteriori estimation can be reduced to a general minimum conical hull problem. The best-known solution to tackle general minimum conical hull problems is the divide-and-conquer anchoring learning scheme (DCA), whose runtime complexi…
Quantum machine learning boosts financial forecasting accuracy.
problem Churn prediction and credit risk assessment in finance.
method Used quantum and classical Determinantal Point Processes for churn prediction, and quantum neural networks for credit risk assessment.
result Significant improvement in precision for churn prediction (6% increase). Quantum models match classical performance with fewer parameters.
We propose a novel quantum model for the restricted Boltzmann machine (RBM), in which the visible units remain classical whereas the hidden units are quantized as noninteracting fermions. The free motion of the fermions is parametrically coupled to the classical signal of the visible units. This model possesses a quant…
New MBL hidden Born machine learns various tasks.
problem Learning from quantum many-body systems.
method MBL dynamics and hidden units for training.
result Enhanced trainability and stability in learning.
New Ising models improve consensus clustering on specialized hardware.
problem Consensus clustering optimization problems.
method Formulated consensus clustering as Ising models and evaluated on specialized hardware.
result Our Ising models outperform existing techniques on consensus clustering.
Unsupervised Generative Modeling Using Matrix Product Statescond-mat.stat-mech
Generative modeling, which learns joint probability distribution from data and generates samples according to it, is an important task in machine learning and artificial intelligence. Inspired by probabilistic interpretation of quantum physics, we propose a generative model using matrix product states, which is a tenso…
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.
A new GP method enforces physical constraints in probabilistic terms.
problem Unbounded model in GP regression leading to infeasible values.
method Introduces a new GP method using QHMC to enforce soft inequality and monotonicity constraints.
result Improves accuracy and reduces variance in GP model.
To understand the fundamental trade-offs between training stability, temporal dynamics and architectural complexity of recurrent neural networks~(RNNs), we directly analyze RNN architectures using numerical methods of ordinary differential equations~(ODEs). We define a general family of RNNs--the ODERNNs--by relating t…
Paper explores solving HJB equations using neural networks.
problem Solving high-dimensional time-dependent HJB equations.
method Neural Galerkin methods with nonlinearly parametrized trial functions.
result Closed-form solutions for trial functions.
Simulated Bifurcation outperforms quantum machines in community detection.
problem Community detection in complex networks
method Quantum-inspired Simulated Bifurcation algorithm for QUBO formulation
result Simulated Bifurcation achieves highest modularity in community detection
Tensor Neural Networks solve high-dimensional PDEs for financial pricing.
problem High-dimensional PDEs in financial pricing.
method Tensor Neural Networks (TNN) and Tensor Network Initializer (TNN Init).
result TNN provides significant parameter savings and faster training than DNN.
Quantum mechanics models human perception and decision-making, offering a new approach to understanding social dynamics.
problem Understanding the complex interactions between individuals and groups in social networks.
method Developed a simple computational code based on quantum mechanics principles to model human perception and decision-making.
result Quantum-inspired models can help explain differences in individual and group behavior.
Quantum-inspired probability metrics define a complete, universal space for statistical learningstat.ML
Quantum probability metrics improve distribution comparison in high dimensions.
problem Challenges in comparing probability distributions, especially in high-dimensional and non-compact domains.
method Quantum probability metrics (QPMs) derived from quantum state spaces, overcoming limitations of MMD.
result QPMs offer enhanced sensitivity to subtle distributional differences in high dimensions and improve performance in generative modeling.
No free lunch theorem formalized for tensor network models.
problem Understanding limitations of tensor network machine learning models.
method Formalized rigorous no-free-lunch theorem for specific tensor network models.
result Revealed intrinsic limitations of tensor network-based learning models.
A new sampler and temperature estimation method enable efficient learning of Boltzmann Machines.
problem Efficient learning of Boltzmann Machines (BMs) is challenging due to high training costs and difficulty in parallelization.
method Proposed a new Boltzmann sampler (Langevin SB, LSB) and an efficient method (Conditional Expectation Matching, CEM) for estimating inverse temperature.
result Established an efficient learning framework (Sampler-Adaptive Learning, SAL) for BMs with greater expressive power than Restricted Boltzmann Machines (RBMs).
Quantum models generate financial time series with desired properties.
problem Generating synthetic financial data with temporal correlations.
method Quantum generative adversarial networks (QGANs) with quantum and classical components.
result QGANs can generate financial time series with matching distribution and temporal correlations.
Physicists use quantum models to describe the behavior of physical systems. Quantum models owe their success to their interpretability, to their relation to probabilistic models (quantization of classical models) and to their high predictive power. Beyond physics, these properties are valuable in general data science. …
Hybrid LLM and quantum optimization improve CSA collateral management by 9-10%.
problem Finance-native collateral optimization under ISDA CSAs with legal constraints.
method Hybrid pipeline combining LLM, quantum-inspired exploration, and CP-SAT.
result Improves a strong classical baseline by 9.1-10.7% across different scenarios.
New quantum code breaks distance barrier with transversal non-Clifford gates.
problem Breaking the sqrt(N) distance barrier for quantum LDPC codes.
method Combining three qLDPC codes, Freedman-Hastings mapping, and triple cup product.
result Achieves Ω(N^(2/3)) distance and Θ(N^(2/3)) dimension, enabling fault-tolerant magic state preparation.
Quantum models improve data generation from noisy quantum processors.
problem Creating complex probability distributions from limited data.
method Quantum-noise-driven generative diffusion models.
result Quantum noise can be harnessed to generate more complex distributions efficiently.