Approaching the theoretical limit in quantum gate decomposition

Abstract

In this work we propose a novel numerical approach to decompose general quantum programs in terms of single- and two-qubit quantum gates with a $CNOT$ gate count very close to the current theoretical lower bounds. In particular, it turns out that $15$ and $63$ $CNOT$ gates are sufficient to decompose a general $3$- and $4$-qubit unitary, respectively, with high numerical accuracy. Our approach is based on a sequential optimization of parameters related to the single-qubit rotation gates involved in a pre-designed quantum circuit used for the decomposition. In addition, the algorithm can be adopted to sparse inter-qubit connectivity architectures provided by current mid-scale quantum computers, needing only a few additional $CNOT$ gates to be implemented in the resulting quantum circuits.

14 pages, 11 figure

References in corpus (10)

• Synthesis of Quantum Logic Circuits
• Experimental Comparison of Two Quantum Computing Architectures
• An Experimental Study of Shor's Factoring Algorithm on IBM Q
• Efficient decomposition of unitary matrices in quantum circuit compilers
• LEAP: Scaling Numerical Optimization Based Synthesis Using an Incremental Approach
• Ab Initio Molecular Dynamics on Quantum Computers
• Optimization of Controlled-Z Gate with Data-Driven Gradient Ascent Pulse Engineering in a Superconducting Qubit System
• Quantum Computing for Atomic and Molecular Resonances
• OpenQL : A Portable Quantum Programming Framework for Quantum Accelerators
• Circuit optimization for IBM processors: A way to get higher fidelity and higher values of nonclassicality witnesses

Cited by in corpus (22)

• Preparation of matrix product states with log-depth quantum circuits
• A scalable and fast artificial neural network syndrome decoder for surface codes
• Comparative study of variations in quantum approximate optimization algorithms for the Traveling Salesman Problem
• Lattice Boltzmann-Carleman quantum algorithm and circuit for fluid flows at moderate Reynolds number
• Efficient variational synthesis of quantum circuits with coherent multi-start optimization
• The Impact of Imperfect Timekeeping on Quantum Control
• Numerical analysis of quantum circuits for state preparation and unitary operator synthesis
• QFactor: A Domain-Specific Optimizer for Quantum Circuit Instantiation
• A Toffoli Gate Decomposition via Echoed Cross-Resonance Gates
• Highly optimized quantum circuits synthesized via data-flow engines
• Quantum circuit synthesis via a random combinatorial search
• One Gate Scheme to Rule Them All: Introducing a Complex Yet Reduced Instruction Set for Quantum Computing
• Energy risk analysis with Dynamic Amplitude Estimation and Piecewise Approximate Quantum Compiling
• Training iterated protocols for distillation of GHZ states with variational quantum algorithms
• Quantum-classical tradeoffs and multi-controlled quantum gate decompositions in variational algorithms
• MIRAGE: Quantum Circuit Decomposition and Routing Collaborative Design using Mirror Gates
• Sketching the Best Approximate Quantum Compiling Problem
• Boosting quantum annealing performance through direct polynomial unconstrained binary optimization
• Block encoding of matrix product operators
• Parallel Driving for Fast Quantum Computing Under Speed Limits
• Modularized and Scalable Compilation for Double Quantum Dot Quatum Computing
• Automated Synthesis of Quantum Algorithms via Classical Numerical Techniques