Heuristics for Quantum Compiling with a Continuous Gate Set
arXiv:1912.02727
Abstract
We present an algorithm for compiling arbitrary unitaries into a sequence of gates native to a quantum processor. As accurate CNOT gates are hard for the foreseeable Noisy- Intermediate-Scale Quantum devices era, our A* inspired algorithm attempts to minimize their count, while accounting for connectivity. We discuss the search strategy together with metrics to expand the solution frontier. For a workload of circuits with complexity appropriate for the NISQ era, we produce solutions well within the best upper bounds published in literature and match or exceed hand tuned implementations, as well as other existing synthesis alternatives. In particular, when comparing against state-of-the-art available synthesis packages we show 2.4x average (up to 5.3x) reduction in CNOT count. We also show how to re-target the algorithm for a different chip topology and native gate set, while obtaining similar quality results. We believe that empirical tools like ours can facilitate algorithmic exploration, gate set discovery for quantum processor designers, as well as providing useful optimization blocks within the quantum compilation tool-chain.
Presented at the 3rd International Workshop on Quantum Compilation as part of the International Conference On Computer Aided Design 2019
References in corpus (22)
- Quantum algorithm for solving linear systems of equations
- The theory of variational hybrid quantum-classical algorithms
- Measure for the Degree of Non-Markovian Behavior of Quantum Processes in Open Systems
- Entanglement and quantum computation with ions in thermal motion
- Distance measures to compare real and ideal quantum processes
- A meet-in-the-middle algorithm for fast synthesis of depth-optimal quantum circuits
- Quantum Circuits for General Multiqubit Gates
- Codes for the Quantum Erasure Channel
- Quantum-assisted quantum compiling
- Verified Quantum Information Scrambling
- Quantum Circuits for Isometries
- Exact synthesis of multiqubit Clifford+T circuits
- Asymptotically Optimal Topological Quantum Compiling
- Compiling quantum algorithms for architectures with multi-qubit gates
- A Depth-Optimal Canonical Form for Single-qubit Quantum Circuits
- An Introduction to Cartan's KAK Decomposition for QC Programmers
- How many CNOT gates does it take to generate a three-qubit state ?
- A Rudimentary Quantum Compiler(2cnd Ed.)
- The block-ZXZ synthesis of an arbitrary quantum circuit
- Noise-Adaptive Compiler Mappings for Noisy Intermediate-Scale Quantum Computers
- Introduction to UniversalQCompiler
- On an implementation of the Solovay-Kitaev algorithm
Cited by in corpus (6)
- Quantum simulation of open quantum systems in heavy-ion collisions
- Generative machine learning with tensor networks: benchmarks on near-term quantum computers
- QFAST: Quantum Synthesis Using a Hierarchical Continuous Circuit Space
- Designing calibration and expressivity-efficient instruction sets for quantum computing
- 2QAN: A quantum compiler for 2-local qubit Hamiltonian simulation algorithms
- Software mitigation of coherent two-qubit gate errors