Combinatorial optimization via highly efficient quantum walks

2019/12/31 by S. Marsh, Samuel Marsh, Jingbo Wang +1
Biochemistry, Genetics and Molecular Biology · Computer Science · Physics and Astronomy · #Combinatorial method #Combinatorial optimization #Complexity and Algorithms in Graphs #DNA and Biological Computing #Quantum #Quantum Computing Algorithms and Architecture #Quantum algorithm #Quantum computer #Quantum walk #Subspace topology #quant-ph

paper · pdf · doi:10.1103/physrevresearch.2.023302

published as Physical Review Research, 2 (2) (2020) · 8 pages, 8 figures

arxiv created 2020/04/23 · openalex created_date 2020/05/01 · openalex publication_date 2020/06/08 · arxiv updated 2020/11/17 · openalex updated_date 2026/08/05

Abstract

This paper presents an approach to quantum approximate combinatorial optimization using interleaved continuous-time quantum walks and solution quality-dependent phase shifts. Combinatorial indexing functions are used to implement a quantum walk over the subspace of feasible solutions.

Citations

• Quantum Computation and Decision Trees
• Spatial search by quantum walk
• Evidence for wavelike energy transfer through quantum coherence in photosynthetic systems
• A classical approach to the graph isomorphism problem using quantum walks
• Quantum Fourier transform in computational basis