Optimized fermionic SWAP networks with equivalent circuit averaging for QAOA

Abstract

The fermionic SWAP network is a qubit routing sequence that can be used to efficiently execute the Quantum Approximate Optimization Algorithm (QAOA). Even with a minimally-connected topology on an n-qubit processor, this routing sequence enables O(n^2) operations to execute in O(n) steps. In this work, we optimize the execution of fermionic SWAP networks for QAOA through two techniques. First, we take advantage of an overcomplete set of native hardware operations [including 150 ns controlled-pi/2 phase gates with up to 99.67(1)% fidelity] in order to decompose the relevant quantum gates and SWAP networks in a manner which minimizes circuit depth and maximizes gate cancellation. Second, we introduce Equivalent Circuit Averaging, which randomizes over degrees of freedom in the quantum circuit compilation to reduce the impact of systematic coherent errors. Our techniques are experimentally validated on the Advanced Quantum Testbed through the execution of QAOA circuits for finding the ground state of two- and four-node Sherrington-Kirkpatrick spin-glass models with various randomly sampled parameters. We observe a ~60% average reduction in error (total variation distance) for QAOA of depth p = 1 on four transmon qubits on a superconducting quantum processor.

References in corpus (27)

• Quantum Computing in the NISQ era and beyond
• Charge insensitive qubit design derived from the Cooper pair box
• A Quantum Approximate Optimization Algorithm
• Randomized Benchmarking of Quantum Gates
• Noise-Induced Barren Plateaus in Variational Quantum Algorithms
• Robust randomized benchmarking of quantum processes
• Exact and Approximate Unitary 2-Designs: Constructions and Applications
• Efficient Z-Gates for Quantum Computing
• Noise tailoring for scalable quantum computation via randomized compiling
• Scalable Noise Estimation with Random Unitary Operators
• Quantum Simulation of Electronic Structure with Linear Depth and Connectivity
• Obstacles to State Preparation and Variational Optimization from Symmetry Protection
• The Quantum Approximate Optimization Algorithm and the Sherrington-Kirkpatrick Model at Infinite Size
• Scalable error mitigation for noisy quantum circuits produces competitive expectation values
• Quantum Supremacy through the Quantum Approximate Optimization Algorithm
• Suppression of crosstalk in superconducting qubits using dynamical decoupling
• Quantum computation with universal error mitigation on superconducting quantum processor
• Efficient error models for fault-tolerant architectures and the Pauli twirling approximation
• Counterdiabaticity and the quantum approximate optimization algorithm
• Generalized swap networks for near-term quantum computing
• Mitigating Coherent Noise Using Pauli Conjugation
• Shorter gate sequences for quantum computing by mixing unitaries
• Fault-Tolerant Postselected Quantum Computation: Threshold Analysis
• Bounding the average gate fidelity of composite channels using the unitarity
• Limitations of optimization algorithms on noisy quantum devices
• Microwave-based Arbitrary CPHASE Gates for Transmon Qubits
• Optimal fermionic swap networks for Hubbard models