Efficient quantum gate decomposition via adaptive circuit compression

Abstract

In this work, we report on a novel quantum gate approximation algorithm based on the application of parametric two-qubit gates in the synthesis process. The utilization of these parametric two-qubit gates in the circuit design allows us to transform the discrete combinatorial problem of circuit synthesis into an optimization problem over continuous variables. The circuit is then compressed by a sequential removal of two-qubit gates from the design, while the remaining building blocks are continuously adapted to the reduced gate structure by iterated learning cycles. We implemented the developed algorithm in the SQUANDER software package and benchmarked it against several state-of-the-art quantum gate synthesis tools. Our numerical experiments revealed outstanding circuit compression capabilities of our compilation algorithm providing the most optimal gate count in the majority of the addressed quantum circuits.

11 pages, 5 tables, 4 figures

Cited by in corpus (6)

• QFactor: A Domain-Specific Optimizer for Quantum Circuit Instantiation
• Energy risk analysis with Dynamic Amplitude Estimation and Piecewise Approximate Quantum Compiling
• Numerical circuit synthesis and compilation for multi-state preparation
• Optimisation-free Classification and Density Estimation with Quantum Circuits
• MIRAGE: Quantum Circuit Decomposition and Routing Collaborative Design using Mirror Gates
• Modularized and Scalable Compilation for Double Quantum Dot Quatum Computing