Improving success probability in the LHZ parity embedding by computing with quantum walks

Abstract

The LHZ parity embedding is one of the front-running methods for implementing difficult-to-engineer long-range interactions in quantum optimisation problems. Continuous-time quantum walks are a leading approach for solving quantum optimisation problems. Due to them populating excited states, quantum walks can avoid the exponential gap closing problems seen in other continuous-time techniques such as quantum annealing and adiabatic quantum computation (AQC). An important question therefore, is how continuous-time quantum walks perform in combination with the LHZ parity embedding. By numerically simulating continuous-time quantum walks on 4, 5 and 6 logical qubit Sherrington-Kirkpatrick (SK) Ising spin glass instances embedded onto the LHZ parity architecture, we are able to verify the continued efficacy of heuristics used to estimate the optimal hopping rate and the numerical agreement with the theory behind the location of the lower bound of the LHZ parity constraint strength. In addition, by comparing several different LHZ-based decoding methods, we were able to identify post-readout error correction techniques which were able to improve the success probability of the quantum walk.

16 pages, 12 figures

References in corpus (16)

• Spatial search by quantum walk
• Minor-embedding in adiabatic quantum computation: II. Minor-universal graph design
• Topological and subsystem codes on low-degree graphs with flag qubits
• Quantum optimization with arbitrary connectivity using Rydberg atom arrays
• Stabilisers as a design tool for new forms of Lechner-Hauke-Zoller Annealer
• Programmable Quantum Annealing Architectures with Ising Quantum Wires
• Quantum search with hybrid adiabatic-quantum walk algorithms and realistic noise
• Finding spin-glass ground states using quantum walks
• An energetic perspective on rapid quenches in quantum annealing
• Error correction for encoded quantum annealing
• Simulated Quantum Annealing with Two All-to-All Connectivity Schemes
• Guided quantum walk
• Minimal Constraints in the Parity Formulation of Optimization Problems
• Continuous-time quantum walks for MAX-CUT are hot
• Parity Quantum Computing as YZ-Plane Measurement-Based Quantum Computing
• Fault-tolerant quantum computing with the parity code and noise-biased qubits