Flexible constraint compilation in the parity architecture

Abstract

We present tools and methods to generalize parity compilation to digital quantum computing devices with arbitrary connectivity graphs and construct circuit implementations for the constraint Hamiltonian of higher-order constrained binary optimization problems. In particular, we show how even non-local constraints can be efficiently implemented without expensive SWAP gates. We show how the presented tools can be used to optimize the total circuit depth and CNOT count of the quantum approximate optimization algorithm in the parity architecture and highlight the advantages of the flexible compilation using various examples. We derive the relation between the developed gate sequences and the traditional approach that uses SWAP gates. The result can be applied to improve the implementation of many other non-local operators.

10 pages, 7 figures

References in corpus (17)

• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Charge insensitive qubit design derived from the Cooper pair box
• Demonstration of Two-Qubit Algorithms with a Superconducting Quantum Processor
• From the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator Ansatz
• Qubit architecture with high coherence and fast tunable coupling
• Controlled exchange interaction between pairs of neutral atoms in an optical lattice
• t$|$ket$⟩$ : A Retargetable Compiler for NISQ Devices
• Coherent quantum annealing in a programmable 2000-qubit Ising chain
• Laser-annealing Josephson junctions for yielding scaled-up superconducting quantum processors
• Detecting crosstalk errors in quantum information processors
• Designing Frustrated Quantum Magnets with Laser-Dressed Rydberg Atoms
• Topological and subsystem codes on low-degree graphs with flag qubits
• In-situ equalization of single-atom loading in large-scale optical tweezers arrays
• Parity Quantum Optimization: Compiler
• Benchmarking variational quantum eigensolvers for the square-octagon-lattice Kitaev model
• Parity Quantum Optimization: Benchmarks
• Parity Quantum Optimization: Encoding Constraints

Cited by in corpus (2)

• SWAP-less Implementation of Quantum Algorithms
• Four-body coupler for superconducting qubits based on Josephson parametric oscillators