Towards Prediction of Financial Crashes with a D-Wave Quantum Computer
arXiv:1904.05808 · doi:10.3390/e25020323
Abstract
Prediction of financial crashes in a complex financial network is known to be an NP-hard problem, which means that no known algorithm can guarantee to find optimal solutions efficiently. We experimentally explore a novel approach to this problem by using a D-Wave quantum computer, benchmarking its performance for attaining financial equilibrium. To be specific, the equilibrium condition of a nonlinear financial model is embedded into a higher-order unconstrained binary optimization (HUBO) problem, which is then transformed to a spin- Hamiltonian with at most two-qubit interactions. The problem is thus equivalent to finding the ground state of an interacting spin Hamiltonian, which can be approximated with a quantum annealer. The size of the simulation is mainly constrained by the necessity of a large quantity of physical qubits representing a logical qubit with the correct connectivity. Our experiment paves the way to codify this quantitative macroeconomics problem in quantum computers.
References in corpus (18)
- Quantum annealing with more than one hundred qubits
- Quantum Annealing and Analog Quantum Computation
- Quantum computing for finance: overview and prospects
- Quantum Annealing: A New Method for Minimizing Multidimensional Functions
- Defining and detecting quantum speedup
- Perspectives of quantum annealing: Methods and implementations
- Reverse Quantum Annealing Approach to Portfolio Optimization Problems
- Solving the Optimal Trading Trajectory Problem Using a Quantum Annealer
- Dynamic Portfolio Optimization with Real Datasets Using Quantum Processors and Quantum-Inspired Tensor Networks
- Circuit design for multi-body interactions in superconducting quantum annealing system with applications to a scalable architecture
- Forecasting financial crashes with quantum computing
- Demonstration of nonstoquastic Hamiltonian in coupled superconducting flux qubits
- A Direct Mapping of Max k-SAT and High Order Parity Checks to a Chimera Graph
- Stabilisers as a design tool for new forms of Lechner-Hauke-Zoller Annealer
- Quantum computing cryptography: Finding cryptographic Boolean functions with quantum annealing by a 2000 qubit D-wave quantum computer
- Adiabatic Quantum Optimization Fails to Solve the Knapsack Problem
- Optimizing glassy p-spin models
- Random Matrices and complexity of Spin Glasses