Performance of Quantum Approximate Optimization with Quantum Error Detection

Abstract

Quantum algorithms must be scaled up to tackle real-world applications. Doing so requires overcoming the noise present on today's hardware. The quantum approximate optimization algorithm (QAOA) is a promising candidate for scaling up, due to its modest resource requirements and documented asymptotic speedup over state-of-the-art classical algorithms for some problems. However, achieving better-than-classical performance with QAOA is believed to require fault tolerance. In this paper, we demonstrate a partially fault-tolerant implementation of QAOA using the $[[k+2,k,2]]$ ``Iceberg'' error detection code. We observe that encoding the circuit with the Iceberg code improves the algorithmic performance as compared to the unencoded circuit for problems with up to $20$ logical qubits on a trapped-ion quantum computer. Additionally, we propose and calibrate a model for predicting the code performance. We use this model to characterize the limits of the Iceberg code and extrapolate its performance to future hardware with improved error rates. In particular, we show how our model can be used to determine the necessary conditions for QAOA to outperform the Goemans-Williamson algorithm on future hardware. To the best of our knowledge, our results demonstrate the largest universal quantum computing algorithm protected by partially fault-tolerant quantum error detection on practical applications to date, paving the way towards solving real-world applications with quantum computers.

arXiv comment14 + 6 pages, 13 figures, 9 tables

References in corpus (29)

• A Quantum Approximate Optimization Algorithm
• Suppressing quantum errors by scaling a surface code logical qubit
• Logical quantum processor based on reconfigurable atom arrays
• From the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator Ansatz
• Quantum Approximate Optimization of Non-Planar Graph Problems on a Planar Superconducting Processor
• Real-time quantum error correction beyond break-even
• t$|$ket$⟩$ : A Retargetable Compiler for NISQ Devices
• A Review on Quantum Approximate Optimization Algorithm and its Variants
• Quantum computing for finance
• Combinatorial Optimization with Physics-Inspired Graph Neural Networks
• Noise Resilience of Variational Quantum Compiling
• Fault-tolerant quantum error detection
• Evidence of Scaling Advantage for the Quantum Approximate Optimization Algorithm on a Classically Intractable Problem
• Encoding a magic state with beyond break-even fidelity
• MAXCUT QAOA performance guarantees for p >1
• Constrained Quantum Optimization for Extractive Summarization on a Trapped-ion Quantum Computer
• Demonstration of fault-tolerant Steane quantum error correction
• Characterizing local noise in QAOA circuits
• Re-examining the quantum volume test: Ideal distributions, compiler optimizations, confidence intervals, and scalable resource estimations
• Error propagation in NISQ devices for solving classical optimization problems
• Alignment between Initial State and Mixer Improves QAOA Performance for Constrained Optimization
• Demonstrating Bayesian Quantum Phase Estimation with Quantum Error Detection
• Warm-Started QAOA with Custom Mixers Provably Converges and Computationally Beats Goemans-Williamson's Max-Cut at Low Circuit Depths
• Protecting Expressive Circuits with a Quantum Error Detection Code
• Fault-Tolerant One-Bit Addition with the Smallest Interesting Colour Code
• Characterizing Error Mitigation by Symmetry Verification in QAOA
• QAOA with $N\cdot p\ge 200$
• Parameter Setting Heuristics Make the Quantum Approximate Optimization Algorithm Suitable for the Early Fault-Tolerant Era
• Encoded probabilistic imaginary-time evolution on a trapped-ion quantum computer for ground and excited states of spin qubits

Cited by in corpus (5)

• Universal Resources for QAOA and Quantum Annealing
• Constrained Quantum Optimization via Iterative Warm-Start XY-Mixers
• Quantum approximate optimization of finite-state bosonic systems
• Error detection without post-selection in adaptive quantum circuits
• Near-Term Fermionic Simulation with Subspace Noise Tailored Quantum Error Mitigation