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

203407610813 · Jun 202019922001200920172026
48 results for quantum optimization

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.

Quantum machine learning uses superposition to create a large ensemble of classifiers.

problem Improving machine learning efficiency on quantum computers.
method Using superposition to create an exponentially large ensemble of classifiers, trained with an optimization-free learning algorithm.
result Adding an optimization step improves the performance of quantum ensembles of classifiers.

This tutorial introduces quantum computing for financial portfolio optimization.

problem Combinatorial portfolio optimization in financial markets.
method Application of Quantum Approximate Optimization Algorithm (QAOA) to portfolio optimization.
result Quality of combinatorial portfolio optimization solutions using QAOA on quantum simulator.

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.

Quantum mechanics fundamentally forbids deterministic discrimination of quantum states and processes. However, the ability to optimally distinguish various classes of quantum data is an important primitive in quantum information science. In this work, we train near-term quantum circuits to classify data represented by …

2018-05-22abs ↗pdf ↗

New methods optimize training VQAs without barren plateaus, improving efficiency and applicability.

problem Barren plateaus in training variational quantum algorithms.
method Derive adaptive learning rates and use Gaussian kernels to optimize movement in parameter space.
result Optimized training methods outperform other routines and can train VQAs free of barren plateaus.

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.

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.

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.

Proposes PO-QA framework to optimize portfolios using quantum algorithms.

problem Optimizing investment portfolios with reduced risk and increased gains.
method Develops a scalable quantum framework (PO-QA) to investigate quantum algorithm parameters.
result Identifies efficient quantum circuit configurations for portfolio optimization.

Study analyzes 3,171 stocks to pick efficient portfolios using quantum and classical solvers.

problem Creating efficient stock portfolios from a large dataset.
method Used classical and quantum solvers to optimize portfolios of 3,171 US stocks.
result Demonstrated the effectiveness of quantum and classical solvers in portfolio optimization.

Hybrid quantum algorithm tackles binary optimization problems with multiple constraints.

problem Efficiently solving binary optimization problems with multiple constraints using quantum algorithms.
method Combines QAOA with penalty dephasing and Zeno effect for non-Ising constraints.
result Significant improvement in solving practical aircraft loading problems.

Hybrid QNN-LSTM predicts financial stock market trends using quantum computing.

problem Complex temporal dependencies and market fluctuations in financial time-series forecasting.
method Custom QNN regressor with hybrid optimization strategies.
result Hybrid models integrate quantum computing into financial forecasting workflows.

A quantum generalization of Natural Gradient Descent is presented as part of a general-purpose optimization framework for variational quantum circuits. The optimization dynamics is interpreted as moving in the steepest descent direction with respect to the Quantum Information Geometry, corresponding to the real part of…

2019-09-04abs ↗pdf ↗

SGLBO optimizes quantum circuits with fewer measurements, improving accuracy and noise resilience.

problem Efficiently optimizing parameterized quantum circuits with reduced measurement shots and noise.
method Developed SGLBO combining SGD and BO, with adaptive measurement-shot strategy and suffix averaging.
result Significantly reduces measurement-shot cost while improving accuracy and noise resilience.

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.

This work reveals symmetries in quantum circuits and develops a noise-aware optimization method.

problem Understanding and optimizing the cost landscape of parametrized quantum circuits.
method Analytical proof of symmetries and their resilience to noise, followed by the development of SYMH optimization method.
result Symmetries in PQCs lead to degeneracy in the cost landscape and can be exploited to improve optimization under noise.

Quantum computing offers financial industry new optimization and risk management tools.

problem Traditional computing limits financial industry's problem-solving capabilities.
method Structured review of quantum computing platforms, algorithms, and use cases.
result Quantum computing can enhance financial industry applications like optimization and risk management.

We investigate a hybrid quantum-classical solution method to the mean-variance portfolio optimization problems. Starting from real financial data statistics and following the principles of the Modern Portfolio Theory, we generate parametrized samples of portfolio optimization problems that can be related to quadratic b…

2018-10-19abs ↗pdf ↗

Quantum computing tackles non-convex portfolio optimization with cardinality constraints.

problem Non-convex portfolio optimization problems in asset management.
method Application of quantum annealing with non-linear cardinality constraints.
result Quantum portfolio optimization yields smaller, more profitable portfolios.

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 states can be learned efficiently using gentle measurements.

problem Efficiently learning quantum states with minimal measurements.
method Introducing α-LGM measurements and proving strong quantum DPI.
result The number of states needed for accurate learning is of order 1/(ε^2 α^2).

Classical optimization algorithms in machine learning often take a long time to compute when applied to a multi-dimensional problem and require a huge amount of CPU and GPU resource. Quantum parallelism has a potential to speed up machine learning algorithms. We describe a generic mathematical model to leverage quantum…

2019-11-17abs ↗pdf ↗

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.

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 ↗