Year: 2023
Type: article
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 nonlocal 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 nonlocal operators.
Source: Physical Review A
Institution: Universität Innsbruck
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: hybrid
Estimated APC paid: $2,675
Awards: Novel photo-assisted systems for direct Solar-driven redUctioN of CO2 to energy rich CHEMicals, G1626007387, ParityQC: Parity Constraints as a Quantum Computing Toolbox, G3979371216, G434337789, Shortcuts to Adiabaticity for Quantum Computation and Simula, G575169067, QuantERA II ERA-NET Cofund in Quantum Technologies, G7716710130
OpenAlex ID: W4387570189