Improved success probability with greater circuit depth for the quantum approximate optimization algorithm

Abstract

Present-day, noisy, small or intermediate-scale quantum processors---although far from fault-tolerant---support the execution of heuristic quantum algorithms, which might enable a quantum advantage, for example, when applied to combinatorial optimization problems. On small-scale quantum processors, validations of such algorithms serve as important technology demonstrators. We implement the quantum approximate optimization algorithm (QAOA) on our hardware platform, consisting of two superconducting transmon qubits and one parametrically modulated coupler. We solve small instances of the NP-complete exact-cover problem, with 96.6% success probability, by iterating the algorithm up to level two.

arXiv comment9 pages, 7 figures

References in corpus (24)

• Quantum Computing in the NISQ era and beyond
• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• A variational eigenvalue solver on a quantum processor
• Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
• Ising formulations of many NP problems
• A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
• A Quantum Approximate Optimization Algorithm
• Superconducting Qubits: Current State of Play
• Microwave photonics with superconducting quantum circuits
• Characterizing Quantum Supremacy in Near-Term Devices
• Quantum algorithms: an overview
• Quantum information processing with superconducting circuits: a review
• Scalable Quantum Simulation of Molecular Energies
• Efficient Z-Gates for Quantum Computing
• Decoherence benchmarking of superconducting qubits
• A universal gate for fixed-frequency qubits via a tunable bus
• Process verification of two-qubit quantum gates by randomized benchmarking
• Parametrically Activated Entangling Gates Using Transmon Qubits
• Quantum Supremacy through the Quantum Approximate Optimization Algorithm
• Near-optimal quantum circuit for Grover's unstructured search using a transverse field
• Entanglement Metrology Using a Joint Readout of Superconducting Qubits
• Benchmarking gate-based quantum computers
• Quantum annealing with longitudinal bias fields
• Optimizing QAOA: Success Probability and Runtime Dependence on Circuit Depth

Cited by in corpus (52)

• Noisy intermediate-scale quantum (NISQ) algorithms
• Quantum Approximate Optimization of Non-Planar Graph Problems on a Planar Superconducting Processor
• A Review on Quantum Approximate Optimization Algorithm and its Variants
• High-fidelity, high-scalability two-qubit gate scheme for superconducting qubits
• Benchmarking Advantage and D-Wave 2000Q quantum annealers with exact cover problems
• Building Blocks of a Flip-Chip Integrated Superconducting Quantum Processor
• Pulse-efficient circuit transpilation for quantum applications on cross-resonance-based hardware
• Classical variational simulation of the Quantum Approximate Optimization Algorithm
• Benchmarking the noise sensitivity of different parametric two-qubit gates in a single superconducting quantum computing platform
• Universal fidelity reduction of quantum operations from weak dissipation
• Constrained Quantum Optimization for Extractive Summarization on a Trapped-ion Quantum Computer
• Analyzing the Performance of Variational Quantum Factoring on a Superconducting Quantum Processor
• Fast multi-qubit gates through simultaneous two-qubit gates
• Quantum variational optimization: The role of entanglement and problem hardness
• Progress toward favorable landscapes in quantum combinatorial optimization
• Qubit-efficient encoding schemes for binary optimisation problems
• Extensive characterization of a family of efficient three-qubit gates at the coherence limit
• Application-Motivated, Holistic Benchmarking of a Full Quantum Computing Stack
• GPU-accelerated simulations of quantum annealing and the quantum approximate optimization algorithm
• An entanglement perspective on the quantum approximate optimization algorithm
• Lyapunov control-inspired strategies for quantum combinatorial optimization
• Quantum Approximate Optimization Algorithm with Adaptive Bias Fields
• An Expressive Ansatz for Low-Depth Quantum Approximate Optimisation
• Single temporal-pulse-modulated parameterized controlled-phase gate for Rydberg atoms
• Primary thermometry of propagating microwaves in the quantum regime
• Quantum Computational Phase Transition in Combinatorial Problems
• Applying quantum approximate optimization to the heterogeneous vehicle routing problem
• Reachability Deficits in Quantum Approximate Optimization of Graph Problems
• Multi-round QAOA and advanced mixers on a trapped-ion quantum computer
• Impacts of Noise and Structure on Quantum Information Encoded in a Quantum Memory
• High-speed calibration and characterization of superconducting quantum processors without qubit reset
• Impact of decoherence on the fidelity of quantum gates leaving the computational subspace
• Calibrating the Classical Hardness of the Quantum Approximate Optimization Algorithm
• Continuous-variable quantum approximate optimization on a programmable photonic quantum processor
• Automatic Depth Optimization for Quantum Approximate Optimization Algorithm
• Deterministic generation of shaped single microwave photons using a parametrically driven coupler
• Simulating open quantum systems with giant atoms
• Quantum SWAP gate realized with CZ and iSWAP gates in a superconducting architecture
• Computing Graph Edit Distance with Algorithms on Quantum Devices
• Characterization and tomography of a hidden qubit
• Simulation of a feedback-based algorithm for quantum optimization for a realistic neutral atom system with an optimized small-angle controlled-phase gate
• An engineering guide to superconducting quantum circuit shielding
• Numerical analysis of effective models for flux-tunable transmon systems
• Single entanglement connection architecture between multi-layer bipartite Hardware Efficient Ansatz
• Out of the Loop: Structural Approximation of Optimisation Landscapes and non-Iterative Quantum Optimisation
• On the fragility of gate-error metrics in simulation models of flux-tunable transmon quantum computers
• Tuning and Amplifying the Interactions in Superconducting Quantum Circuits with Subradiant Qubits
• Dispersive Qubit Readout with Intrinsic Resonator Reset
• Validity condition for high-fidelity Digitized Quantum Annealing
• Measurement and control of a superconducting quantum processor with a fully-integrated radio-frequency system on a chip
• Quantum circuit evolutionary framework applied on set partitioning problem
• On Assessing the Quantum Advantage for MaxCut Provided by Quantum Neural Network Ansätze