Quantum walk-based portfolio optimisation
Open accessThe DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Quantum Computing in the NISQ era and beyond
Preskill, J. (2018) · Quantum · doi:10.22331/q-2018-08-06-79 · Cited by 8,830
Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
Shor, P. W. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539795293172 · Cited by 8,472
Quantum Computation and Quantum Information: 10th Anniversary Edition
Nielsen, M. A., & Chuang, I. L. (2012) · doi:10.1017/cbo9780511976667 · Cited by 8,436
Quantum computation and decision trees
Farhi, E., & Gutmann, S. (1998) · Physical Review A · doi:10.1103/physreva.58.915 · Cited by 1,215 · cited 1×
“The quantum analogy to the classical random walk, a CTQW is the evolution of a quantum system under a Hamiltonian defined by a graph adjacency matrix [20, 21].”
From the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator Ansatz
Hadfield, S., Wang, Z., O’Gorman, B., Rieffel, E. G., Venturelli, D., & Biswas, R. (2019) · Algorithms · doi:10.3390/a12020034 · Cited by 772
Spatial search by quantum walk
Childs, A. M., & Goldstone, J. (2004) · Physical Review A · doi:10.1103/physreva.70.022314 · Cited by 725
Grover’s quantum searching algorithm is optimal
Zalka, C. (1999) · Physical Review A · doi:10.1103/physreva.60.2746 · Cited by 635
Quantum Supremacy through the Quantum Approximate Optimization Algorithm
Farhi, E., & Harrow, A. W. (2016) · arXiv · doi:10.48550/arxiv.1602.07674 · Cited by 331
Effect of dimensionality on the Nelder–Mead simplex method
Han, L., & Neumann, M. (2006) · Optimization Methods and Software · doi:10.1080/10556780512331318290 · Cited by 127
Efficient quantum walk on a quantum processor
Qiang, X., Loke, T., Montanaro, A., Aungskunsiri, K., Zhou, X., O’Brien, J. L., Wang, J. B., & Matthews, J. C. F. (2016) · Nature Communications · doi:10.1038/ncomms11511 · Cited by 108
Self-citation
Cited by
Benchmarking the performance of portfolio optimization with QAOA
Brandhofer, S., Braun, D., Dehn, V., Hellstern, G., Hüls, M., Ji, Y., Polian, I., Bhatia, A. S., & Wellens, T. (2022) · Quantum Information Processing · doi:10.1007/s11128-022-03766-5 · Cited by 106
Parameter Setting in Quantum Approximate Optimization of Weighted Problems
Sureshbabu, S. H., Herman, D., Shaydulin, R., Basso, J., Chakrabarti, S., Sun, Y., & Pistoia, M. (2024) · Quantum · doi:10.22331/q-2024-01-18-1231 · Cited by 41
“[53] Nicholas Slate, Edric Matwiejew, Samuel Marsh, and JB Wang.”
BackgroundEvolving objective function for improved variational quantum optimization
Kolotouros, I., & Wallden, P. (2022) · Physical Review Research · doi:10.1103/physrevresearch.4.023225 · Cited by 24
“[29] developed a quantum-walk-based optimization algorithm and Ref.”
MethodQuantum Optimization Benchmarking Library - The Intractable Decathlon
Koch, T., Neira, D. E. B., Chen, Y., Cortiana, G., Egger, D. J., Heese, R., Hegade, N. N., Cadavid, A. G., Huang, R., Itoko, T., et al. (2025) · arXiv · doi:10.48550/arxiv.2504.03832 · Cited by 5
Metadata
- Authors
- Slate, N., Matwiejew, E., Marsh, S., & Wang, J. B.
- Venue
- Quantum
- Published
- 2021-07-28
- Volume
- 5
- Pages
- 513
- ISSN
- 2521-327X (ISSN-L)
- OpenAlex
- W3105409691
- Cited by
- 54
- References
- 10
- FWCI
- 2.47
- Type
- journal article
- Language
- en
- Open access
- gold
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Quantum walk-based portfolio optimisation. https://app.cochat.ai/papers/10.22331/q-2021-07-28-513
- The paper
- Slate, N., Matwiejew, E., Marsh, S., & Wang, J. B. (2021). Quantum walk-based portfolio optimisation. Quantum. https://doi.org/10.22331/q-2021-07-28-513
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.