Reoptimization of Quantum Circuits via Hierarchical Synthesis
- 1 November 2021
- conference paper
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
The current phase of quantum computing is in the Noisy Intermediate-Scale Quantum (NISQ) era. On NISQ devices, two-qubit gates such as CNOTs are much noisier than single-qubit gates, so it is essential to minimize their count. Quantum circuit synthesis is a process of decomposing an arbitrary unitary into a sequence of quantum gates, and can be used as an optimization tool to produce shorter circuits to improve overall circuit fidelity. However, the time-to-solution of synthesis grows exponentially with the number of qubits. As a result, synthesis is intractable for circuits on a large qubit scale. In this paper, we propose a hierarchical, block-by-block opti-mization framework, QGo, for quantum circuit optimization. Our approach allows an exponential cost optimization to scale to large circuits. QGo uses a combination of partitioning and synthesis: 1) partition the circuit into a sequence of independent circuit blocks; 2) re-generate and optimize each block using quantum synthesis; and 3) re-compose the final circuit by stitching all the blocks together. We perform our analysis and show the fidelity improvements in three different regimes: small-size circuits on real devices, medium-size circuits on noisy simulations, and large-size circuits on analytical models. Our technique can be applied after existing optimizations to achieve higher circuit fidelity. Using a set of NISQ benchmarks, we show that QGo can reduce the number of CNOT gates by 29.9% on average and up to 50% when compared with industrial compiler optimizations such as t|ket). When executed on the IBM Athens system, shorter depth leads to higher circuit fidelity. We also demonstrate the scalability of our QGo technique to optimize circuits of 60+ qubits, Our technique is the first demonstration of successfully employing and scaling synthesis in the compilation tool chain for large circuits. Overall, our approach is robust for direct incorporation in production compiler toolchains to further improve the circuit fidelity.Keywords
Funding Information
- NSF (CCF-1730449)
- DOE (DE-SC0020289,DE-SC0020331)
This publication has 45 references indexed in Scilit:
- ScaffCC: Scalable compilation and analysis of quantum programsParallel Computing, 2015
- Efficient Synthesis of Universal Repeat-Until-Success Quantum CircuitsPhysical Review Letters, 2015
- A variational eigenvalue solver on a photonic quantum processorNature Communications, 2014
- Dynamical Quantum Phase Transitions in the Transverse-Field Ising ModelPhysical Review Letters, 2013
- Exact synthesis of multiqubit Clifford+circuitsPhysical Review A, 2013
- Synthesis of quantum circuits for linear nearest neighbor architecturesQuantum Information Processing, 2010
- Quantum factoring, discrete logarithms, and the hidden subgroup problemComputing in Science & Engineering, 2001
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum ComputerSIAM Review, 1999
- Quantum algorithms revisitedProceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, 1998
- Two-bit gates are universal for quantum computationPhysical Review A, 1995