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

Trend · papers per month

136272408544 · Jun 202019922001200920172026
48 results for Quantum Computing

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 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 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.

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 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 walk algorithm optimizes quantum state preparation for financial simulations.

problem Efficiently loading classical data into quantum states for quantum computers.
method Split-step quantum walks (SSQW) to design parameterized quantum circuits (PQC).
result SSQW facilitates generating desired probability amplitude distributions for quantum simulations.

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 ↗

Quantum computing speeds up asset pricing models exponentially.

problem Solving dynamic nonlinear asset pricing models efficiently.
method Utilizes quantum superposition and entanglement to solve models exponentially faster than classical methods.
result Exponential computational speed-up for solving asset pricing models.

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.

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 computing techniques applied to Monte Carlo simulations in finance.

problem Efficiently simulating quantum algorithms for financial modeling.
method Introduces quantum computing basics, amplitude estimation, and Grover's algorithm for unstructured search.
result Demonstrates quantum approaches to Monte Carlo integration and counting in finance.

Topological quantum computers use hyperbolic knots for computations.

problem The difficulty of calculating quantum invariants of knots.
method Using hyperbolic knots to compute topological quantum computer invariants.
result The hyperbolic geometry of knots is unlikely to be useful for topological quantum computation.

Enhances quantum computing for symmetrical systems, proving a new class of problems.

problem Proving the efficiency of a new quantum computing model for symmetrical systems.
method Introducing equivariant convolutional quantum algorithms tailored for SU(d) symmetries.
result Demonstrates a problem that can be solved efficiently on a new quantum model, suggesting it's not classically simulatable.

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.

Quantum variational circuits improve reinforcement learning efficiency.

problem Improving reinforcement learning algorithms using quantum computing.
method Investigation of quantum variational circuits for DQN and Double DQN, encoding classical data for quantum circuits.
result Quantum variational circuits can solve reinforcement learning tasks with a smaller parameter space.

New method uses quantum computing to process classical data efficiently.

problem Inefficient quantum machine learning due to data loading and trainability issues.
method Linear Hamiltonian-based machine learning with ground state problems for k-local Hamiltonians.
result Demonstrated the effectiveness and scalability of the method on up to 50 qubits.

In this paper we review our earlier work on quantum computing and the Nash Equilibrium, in particular, tracing the history of the discovery of new Nash Equilibria and then reviewing the ways in which quantum computing may be expected to generate new classes of Nash equilibria. We then extend this work through a substan…

2007-07-03abs ↗pdf ↗

Study finds no significant difference in neural network weights with quantum random numbers.

problem Effects of biased quantum random numbers on neural network initialization.
method Empirical study using quantum hardware and classical pseudo-random numbers.
result No statistically significant difference found between quantum random numbers and other types.

Quantum autoencoders allow for reducing the amount of resources in a quantum computation by mapping the original Hilbert space onto a reduced space with the relevant information. Recently, it was proposed to employ approximate quantum adders to implement quantum autoencoders in quantum technologies. Here, we carry out …

2018-07-27abs ↗pdf ↗

This paper explores the interactions between knot theory and quantum computing. On one side, knot theory has been used to create models of quantum computing, and on the other, it is a source of computational problems. Knot theory is often used to introduce topological idea to people without a formal mathematical backgr…

2019-01-09abs ↗pdf ↗

Quantum computing promises to revolutionize finance, especially in optimization and modeling.

problem Financial inefficiencies and inaccuracies in current computing methods.
method Survey of quantum computing applications in finance, focusing on stochastic modeling, optimization, and machine learning.
result Quantum computing can solve financial problems more efficiently and accurately.

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…

2000-01-20abs ↗pdf ↗

Quantum kernels offer potential speed-ups but require encoding problem-specific knowledge.

problem Generalization difficulty in high-dimensional feature spaces.
method Analysis of spectral properties of quantum kernels and their RKHS.
result Quantum advantage is expected if RKHS is low-dimensional and contains hard-to-compute functions.

A central task in the field of quantum computing is to find applications where quantum computer could provide exponential speedup over any classical computer. Machine learning represents an important field with broad applications where quantum computer may offer significant speedup. Several quantum algorithms for discr…

2017-11-06abs ↗pdf ↗

Quantum algorithms for financial derivatives and credit risk.

problem Estimating credit risk and option pricing in realistic financial models.
method Developed a regime switching volatility model for financial markets, using a Markov chain to determine volatility parameters.
result Quantum algorithms can be applied to realistic financial models, bringing quantum computing closer to practical applications.