Quantum walk-based portfolio optimisation
arXiv:2011.08057 · doi:10.22331/q-2021-07-28-513
Abstract
This paper proposes a highly efficient quantum algorithm for portfolio optimisation targeted at near-term noisy intermediate-scale quantum computers. Recent work by Hodson et al. (2019) explored potential application of hybrid quantum-classical algorithms to the problem of financial portfolio rebalancing. In particular, they deal with the portfolio optimisation problem using the Quantum Approximate Optimisation Algorithm and the Quantum Alternating Operator Ansatz. In this paper, we demonstrate substantially better performance using a newly developed Quantum Walk Optimisation Algorithm in finding high-quality solutions to the portfolio optimisation problem.
References in corpus (22)
- Quantum Computing in the NISQ era and beyond
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Quantum Computation and Decision Trees
- From the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator Ansatz
- Spatial search by quantum walk
- Quantum computing for finance: overview and prospects
- Grover's quantum searching algorithm is optimal
- Large-scale silicon quantum photonics implementing arbitrary two-qubit processing
- Quantum Risk Analysis
- Quantum computational finance: Monte Carlo pricing of financial derivatives
- Quantum Supremacy through the Quantum Approximate Optimization Algorithm
- Efficient Quantum Walk on a Quantum Processor
- Quantum Fourier Transform in Computational Basis
- Quantum algorithm for visual tracking
- The Quantum Alternating Operator Ansatz on Maximum k-Vertex Cover
- Combinatorial optimisation via highly efficient quantum walks
- Quantum circuit implementation of the Hamiltonian versions of Grover's algorithm
- Efficient quantum circuits for Szegedy quantum walks
- Efficient quantum circuits for continuous-time quantum walks on composite graphs
- Portfolio rebalancing experiments using the Quantum Alternating Operator Ansatz
- Efficient quantum circuits for Toeplitz and Hankel matrices
- QSW_MPI: a framework for parallel simulation of quantum stochastic walks
Cited by in corpus (5)
- Benchmarking the performance of portfolio optimization with QAOA
- Constrained Optimization via Quantum Zeno Dynamics
- An evolving objective function for improved variational quantum optimisation
- Quantum direct communication protocol using recurrence in k-cycle quantum walk
- QuOp_MPI: a framework for parallel simulation of quantum variational algorithms