Improving the Performance of Deep Quantum Optimization Algorithms with Continuous Gate Sets

Abstract

Variational quantum algorithms are believed to be promising for solving computationally hard problems and are often comprised of repeated layers of quantum gates. An example thereof is the quantum approximate optimization algorithm (QAOA), an approach to solve combinatorial optimization problems on noisy intermediate-scale quantum (NISQ) systems. Gaining computational power from QAOA critically relies on the mitigation of errors during the execution of the algorithm, which for coherence-limited operations is achievable by reducing the gate count. Here, we demonstrate an improvement of up to a factor of 3 in algorithmic performance as measured by the success probability, by implementing a continuous hardware-efficient gate set using superconducting quantum circuits. This gate set allows us to perform the phase separation step in QAOA with a single physical gate for each pair of qubits instead of decomposing it into two C$Z$-gates and single-qubit gates. With this reduced number of physical gates, which scales with the number of layers employed in the algorithm, we experimentally investigate the circuit-depth-dependent performance of QAOA applied to exact-cover problem instances mapped onto three and seven qubits, using up to a total of 399 operations and up to 9 layers. Our results demonstrate that the use of continuous gate sets may be a key component in extending the impact of near-term quantum computers.

References in corpus (26)

• Quantum Computing in the NISQ era and beyond
• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
• Probing many-body dynamics on a 51-atom quantum simulator
• Ising formulations of many NP problems
• QuTiP 2: A Python framework for the dynamics of open quantum systems
• Logic gates at the surface code threshold: Superconducting qubits poised for fault-tolerant quantum computing
• Quantum Chemistry in the Age of Quantum Computing
• Demonstration of Two-Qubit Algorithms with a Superconducting Quantum Processor
• Observation of a Many-Body Dynamical Phase Transition with a 53-Qubit Quantum Simulator
• Simple pulses for elimination of leakage in weakly nonlinear qubits
• Scalable Quantum Simulation of Molecular Energies
• From the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator Ansatz
• Quantum Approximate Optimization Algorithm: Performance, Mechanism, and Implementation on Near-Term Devices
• Efficient Z-Gates for Quantum Computing
• Large-scale silicon quantum photonics implementing arbitrary two-qubit processing
• Engineering cryogenic setups for 100-qubit scale superconducting circuit systems
• Repeated Quantum Error Detection in a Surface Code
• Digital quantum simulation of fermionic models with a superconducting circuit
• Deterministic Quantum State Transfer and Generation of Remote Entanglement using Microwave Photons
• Rapid high-fidelity multiplexed readout of superconducting qubits
• Fast and Unconditional All-Microwave Reset of a Superconducting Qubit
• Quantum logic gates for coupled superconducting phase qubits
• Near-optimal quantum circuit for Grover's unstructured search using a transverse field
• Gate-efficient simulation of molecular eigenstates on a quantum computer
• Benchmarking Coherent Errors in Controlled-Phase Gates due to Spectator Qubits

Cited by in corpus (52)

• Noisy intermediate-scale quantum (NISQ) algorithms
• A Review on Quantum Approximate Optimization Algorithm and its Variants
• Warm-starting quantum optimization
• Quantum information processing with bosonic qubits in circuit QED
• Implementation of Conditional-Phase Gates based on tunable ZZ-Interactions
• Avoiding barren plateaus using classical shadows
• High-fidelity controlled-Z gate with maximal intermediate leakage operating at the speed limit in a superconducting quantum processor
• Pulse-efficient circuit transpilation for quantum applications on cross-resonance-based hardware
• Reinforcement Learning for Many-Body Ground-State Preparation Inspired by Counterdiabatic Driving
• Hardware-Efficient Microwave-Activated Tunable Coupling Between Superconducting Qubits
• Constrained Quantum Optimization for Extractive Summarization on a Trapped-ion Quantum Computer
• Quantum Algorithms for Mixed Binary Optimization applied to Transaction Settlement
• Analyzing the Performance of Variational Quantum Factoring on a Superconducting Quantum Processor
• Simulating Open Quantum System Dynamics on NISQ Computers with Generalized Quantum Master Equations
• Variational Hamiltonian simulation for translational invariant systems via classical pre-processing
• Extensive characterization of a family of efficient three-qubit gates at the coherence limit
• Qubit-efficient encoding schemes for binary optimisation problems
• Exploiting Symmetry Reduces the Cost of Training QAOA
• GPU-accelerated simulations of quantum annealing and the quantum approximate optimization algorithm
• Vacuum-gap transmon qubits realized using flip-chip technology
• Single temporal-pulse-modulated parameterized controlled-phase gate for Rydberg atoms
• Optimal control of families of quantum gates
• Variational waveguide QED simulators
• Scalable, high-fidelity all-electronic control of trapped-ion qubits
• Controlled-Controlled-Phase Gates for Superconducting Qubits Mediated by a Shared Tunable Coupler
• Designing calibration and expressivity-efficient instruction sets for quantum computing
• Proposal for entangling gates on fluxonium qubits via a two-photon transition
• Efficient estimation of trainability for variational quantum circuits
• The scattering coefficients of superconducting microwave resonators: I. Transfer-matrix approach
• Multi-round QAOA and advanced mixers on a trapped-ion quantum computer
• Calibration of Drive Non-Linearity for Arbitrary-Angle Single-Qubit Gates Using Error Amplification
• Leveraging Randomized Compiling for the QITE Algorithm
• Taming quantum systems: A tutorial for using shortcuts-to-adiabaticity, quantum optimal control, and reinforcement learning
• A quantum algorithm for the direct estimation of the steady state of open quantum systems
• Co-Design quantum simulation of nanoscale NMR
• Resource analysis of quantum algorithms for coarse-grained protein folding models
• Microwave-activated gates between a fluxonium and a transmon qubit
• Highly Efficient Encoding for Job-Shop Scheduling Problems and its Application on Quantum Computers
• Simulation of a feedback-based algorithm for quantum optimization for a realistic neutral atom system with an optimized small-angle controlled-phase gate
• Realizing a Continuous Set of Two-Qubit Gates Parameterized by an Idle Time
• Efficient control pulses for continuous quantum gate families through coordinated re-optimization
• Numerical analysis of effective models for flux-tunable transmon systems
• Pulse family optimization for parametrized quantum gates using spectral clustering
• Parametrized multiqubit gate design for neutral-atom based quantum platforms
• Variational Quantum Simulation of Valence-Bond Solids
• Verification of a resetting protocol for an uncontrolled superconducting qubit
• On the fragility of gate-error metrics in simulation models of flux-tunable transmon quantum computers
• Scalable quantum simulator with an extended gate set in giant atoms
• Generation of perfectly entangled two and three qubits states by classical random interaction
• Batched Line Search Strategy for Navigating through Barren Plateaus in Quantum Circuit Training
• Concurrent Fermionic Simulation Gate
• Using optimal control to guide neural-network interpolation of continuously-parameterized gates