Efficient variational synthesis of quantum circuits with coherent multi-start optimization

Abstract

We consider the problem of the variational quantum circuit synthesis into a gate set consisting of the CNOT gate and arbitrary single-qubit (1q) gates with the primary target being the minimization of the CNOT count. First we note that along with the discrete architecture search suffering from the combinatorial explosion of complexity, optimization over 1q gates can also be a crucial roadblock due to the omnipresence of local minimums (well known in the context of variational quantum algorithms but apparently underappreciated in the context of the variational compiling). Taking the issue seriously, we make an extensive search over the initial conditions an essential part of our approach. Another key idea we propose is to use parametrized two-qubit (2q) controlled phase gates, which can interpolate between the identity gate and the CNOT gate, and allow a continuous relaxation of the discrete architecture search, which can be executed jointly with the optimization over 1q gates. This coherent optimization of the architecture together with 1q gates appears to work surprisingly well in practice, sometimes even outperforming optimization over 1q gates alone (for fixed optimal architectures). As illustrative examples and applications we derive 8 CNOT and T depth 3 decomposition of the 3q Toffoli gate on the nearest-neighbor topology, rediscover known best decompositions of the 4q Toffoli gate on all 4q topologies including a 1 CNOT gate improvement on the star-shaped topology, and propose decomposition of the 5q Toffoli gate on the nearest-neighbor topology with 48 CNOT gates. We also benchmark the performance of our approach on a number of 5q quantum circuits from the ibm_qx_mapping database showing that it is highly competitive with the existing software. The algorithm developed in this work is available as a Python package CPFlow.

12+4 pages, code available at https://github.com/idnm/cpflow, comments are welcome! v2: added discussion of local minima distributions, improved presentation. Close to published version. v3: +acknowledgments

References in corpus (9)

• Quantum algorithm for solving linear systems of equations
• Synthesis of Quantum Logic Circuits
• t$|$ket$⟩$ : A Retargetable Compiler for NISQ Devices
• Beyond Barren Plateaus: Quantum Variational Algorithms Are Swamped With Traps
• ADAPT-VQE is insensitive to rough parameter landscapes and barren plateaus
• Robust resource-efficient quantum variational ansatz through evolutionary algorithm
• Training Saturation in Layerwise Quantum Approximate Optimisation
• Symmetry enhanced variational quantum spin eigensolver
• Accelerated variational algorithms for digital quantum simulation of many-body ground states

Cited by in corpus (10)

• Non-Abelian braiding of Fibonacci anyons with a superconducting processor
• Simulating unsteady fluid flows on a superconducting quantum processor
• Shallow unitary decompositions of quantum Fredkin and Toffoli gates for connectivity-aware equivalent circuit averaging
• QFactor: A Domain-Specific Optimizer for Quantum Circuit Instantiation
• A Toffoli Gate Decomposition via Echoed Cross-Resonance Gates
• Barren plateaus are swamped with traps
• Variational quantum eigensolver with embedded entanglement using a tensor-network ansatz
• Regularizing quantum loss landscapes by noise injection
• Batched Line Search Strategy for Navigating through Barren Plateaus in Quantum Circuit Training
• All You Need is pi: Quantum Computing with Hermitian Gates