LEAP: Scaling Numerical Optimization Based Synthesis Using an Incremental Approach

Abstract

While showing great promise, circuit synthesis techniques that combine numerical optimization with search over circuit structures face scalability challenges due to a large number of parameters, exponential search spaces, and complex objective functions. The LEAP algorithm improves scaling across these dimensions using iterative circuit synthesis, incremental re-optimization, dimensionality reduction, and improved numerical optimization. LEAP draws on the design of the optimal synthesis algorithm QSearch by extending it with an incremental approach to determine constant prefix solutions for a circuit. By narrowing the search space, LEAP improves scalability from four to six qubit circuits. LEAP was evaluated with known quantum circuits such as QFT and physical simulation circuits like the VQE, TFIM, and QITE. LEAP can compile four qubit unitaries up to $59\times$ faster than QSearch and five and six qubit unitaries with up to $1.2\times$ fewer CNOTs compared to the QFAST package. LEAP can reduce the CNOT count by up to $36\times$, or $7\times$ on average, compared to the CQC Tket compiler. Despite its heuristics, LEAP has generated optimal circuits for many test cases with a priori known solutions. The techniques introduced by LEAP are applicable to other numerical-optimization-based synthesis approaches.

21 pages

References in corpus (25)

• The theory of variational hybrid quantum-classical algorithms
• Synthesis of Quantum Logic Circuits
• The CMA Evolution Strategy: A Tutorial
• A meet-in-the-middle algorithm for fast synthesis of depth-optimal quantum circuits
• Quantum advantage with shallow circuits
• t$|$ket$⟩$ : A Retargetable Compiler for NISQ Devices
• Quantum Circuits for General Multiqubit Gates
• Quantum-assisted quantum compiling
• Minimal Universal Two-qubit Quantum Circuits
• Quantum Circuits for Isometries
• Exact synthesis of multiqubit Clifford+T circuits
• Phonon-derived ultrafast relaxation of spin-valley polarized states in MoS_{2}
• Asymptotically Optimal Topological Quantum Compiling
• Compiling quantum algorithms for architectures with multi-qubit gates
• A Depth-Optimal Canonical Form for Single-qubit Quantum Circuits
• Practical approximation of single-qubit unitaries by single-qubit quantum Clifford and T circuits
• Optimal two-qubit quantum circuits using exchange interactions
• An Introduction to Cartan's KAK Decomposition for QC Programmers
• Constant-Depth Circuits for Dynamic Simulations of Materials on Quantum Computers
• Towards Dynamic Simulations of Materials on Quantum Computers
• The block-ZXZ synthesis of an arbitrary quantum circuit
• QFAST: Quantum Synthesis Using a Hierarchical Continuous Circuit Space
• Repeat-Until-Success: Non-deterministic decomposition of single-qubit unitaries
• On an implementation of the Solovay-Kitaev algorithm
• Robust and Resource-Efficient Quantum Circuit Approximation

Cited by in corpus (16)

• High-fidelity three-qubit iToffoli gate for fixed-frequency superconducting qubits
• Approaching the theoretical limit in quantum gate decomposition
• Efficient variational synthesis of quantum circuits with coherent multi-start optimization
• Hardware-Conscious Optimization of the Quantum Toffoli Gate
• QFactor: A Domain-Specific Optimizer for Quantum Circuit Instantiation
• Highly optimized quantum circuits synthesized via data-flow engines
• Exploring ab initio machine synthesis of quantum circuits
• Co-Designed Architectures for Modular Superconducting Quantum Computers
• Unitary Synthesis of Clifford+T Circuits with Reinforcement Learning
• QContext: Context-Aware Decomposition for Quantum Gates
• Numerical circuit synthesis and compilation for multi-state preparation
• Variational quantum eigensolver with embedded entanglement using a tensor-network ansatz
• Parallel Driving for Fast Quantum Computing Under Speed Limits
• Peephole Optimization for Quantum Approximate Synthesis
• High-Precision Multi-Qubit Clifford+T Synthesis by Unitary Diagonalization
• Engineering long-range and multi-body interactions via global kinetic constraints