skip to main content
OSTI.GOV title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: Reoptimization of Quantum Circuits via Hierarchical Synthesis

Journal Article · · 2021 International Conference on Rebooting Computing (ICRC)
 [1];  [2];  [3];  [4]
  1. Corp., Santa Clara, CA (United States)
  2. Massachusetts Inst. of Technology (MIT), Cambridge, MA (United States)
  3. Univ. of Chicago, IL (United States)
  4. Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States)

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. Further, 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.

Research Organization:
Univ. of Chicago, IL (United States)
Sponsoring Organization:
USDOE Office of Science (SC), Engineering & Technology
Grant/Contract Number:
SC0020289
OSTI ID:
1865293
Journal Information:
2021 International Conference on Rebooting Computing (ICRC), Vol. 2021; Conference: 2021 International Conference on Rebooting Computing (ICRC), Los Alamitos (held virtually), CA (United States), 30 Nov - 2 Dec 2021
Publisher:
IEEECopyright Statement
Country of Publication:
United States
Language:
English

References (45)

Dynamical Quantum Phase Transitions in the Transverse-Field Ising Model journal March 2013
Determining the minimal number of swap gates for multi-dimensional nearest neighbor quantum circuits
  • Lye, Aaron; Wille, Robert; Drechsler, Rolf
  • 2015 20th Asia and South Pacific Design Automation Conference (ASP-DAC), The 20th Asia and South Pacific Design Automation Conference https://doi.org/10.1109/ASPDAC.2015.7059001
conference January 2015
ScaffCC: Scalable compilation and analysis of quantum programs journal June 2015
Approximate quantum circuit synthesis using block encodings journal November 2020
Optimization of quantum circuit mapping using gate transformation and commutation journal January 2020
t|ket⟩: a retargetable compiler for NISQ devices journal November 2020
Training Schrödinger’s cat: quantum optimal control: Strategic report on current status, visions and goals for research in Europe journal December 2015
Towards Optimal Topology Aware Quantum Circuit Synthesis conference October 2020
Quantum advantage with shallow circuits journal October 2018
Quantum Circuit Placement journal April 2008
Synthesis of Reversible Circuits Using Conventional Hardware Description Languages conference May 2018
A Heuristic for Linear Nearest Neighbor Realization of Quantum Circuits by SWAP Gate Insertion Using -Gate Lookahead journal March 2016
Exact Multiple-Control Toffoli Network Synthesis With SAT Techniques journal May 2009
A Meet-in-the-Middle Algorithm for Fast Synthesis of Depth-Optimal Quantum Circuits journal June 2013
Synthesis of quantum-logic circuits journal June 2006
Parallelizing quantum circuit synthesis journal March 2016
An MINLP Model for Scheduling and Placement of Quantum Circuits with a Heuristic Solution Approach journal September 2015
Compiling quantum algorithms for architectures with multi-qubit gates journal June 2016
Post Synthesis-Optimization of Reversible Circuit using Template Matching conference July 2020
A variational eigenvalue solver on a photonic quantum processor journal July 2014
Quantum optimization using variational algorithms on near-term quantum devices journal June 2018
A Novel Approach for Nearest Neighbor Realization of 2D Quantum Circuits conference July 2018
Quantum sampling problems, BosonSampling and quantum supremacy journal April 2017
Partial Compilation of Variational Algorithms for Noisy Intermediate-Scale Quantum Machines
  • Gokhale, Pranav; Ding, Yongshan; Propson, Thomas
  • MICRO '52: The 52nd Annual IEEE/ACM International Symposium on Microarchitecture, Proceedings of the 52nd Annual IEEE/ACM International Symposium on Microarchitecture https://doi.org/10.1145/3352460.3358313
conference October 2019
Phonon-driven spin-Floquet magneto-valleytronics in MoS2 journal February 2018
Synthesis of quantum circuits for linear nearest neighbor architectures journal October 2010
Exact synthesis of multiqubit Clifford+ T circuits journal March 2013
Look-ahead schemes for nearest neighbor optimization of 1D and 2D quantum circuits conference January 2016
Quantum supremacy using a programmable superconducting processor journal October 2019
Improved synthesis of Clifford+T quantum functionality conference March 2018
On the controlled-NOT complexity of controlled-NOT–phase circuits journal September 2018
Block- Z X Z synthesis of an arbitrary quantum circuit journal November 2016
Quantum Computing in the NISQ era and beyond journal August 2018
Quantum factoring, discrete logarithms, and the hidden subgroup problem journal January 2001
Quantum algorithms revisited
  • Cleve, R.; Ekert, A.; Macchiavello, C.
  • Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences, Vol. 454, Issue 1969 https://doi.org/10.1098/rspa.1998.0164
journal January 1998
AccQOC: Accelerating Quantum Optimal Control Based Pulse Generation conference May 2020
SQUARE: Strategic Quantum Ancilla Reuse for Modular Quantum Programs via Cost-Effective Uncomputation conference May 2020
Efficient Synthesis of Universal Repeat-Until-Success Quantum Circuits journal February 2015
Two-bit gates are universal for quantum computation journal February 1995
Optimal SWAP gate insertion for nearest neighbor quantum circuits conference January 2014
Hardware-efficient variational quantum eigensolver for small molecules and quantum magnets journal September 2017
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer journal January 1999
Efficient mapping of quantum circuits to the IBM QX architectures conference March 2018
Towards HDL-based Synthesis of Reversible Circuits with No Additional Lines conference November 2019
Quantum machine learning journal September 2017

Similar Records

An updated LLVM-based quantum research compiler with further OpenQASM support
Journal Article · Thu May 28 00:00:00 EDT 2020 · Quantum Science and Technology · OSTI ID:1865293

Domain-specific compilers for dynamic simulations of quantum materials on quantum computers
Journal Article · Wed Dec 23 00:00:00 EST 2020 · Quantum Science and Technology · OSTI ID:1865293

SQUARE: Strategic Quantum Ancilla Reuse for Modular Quantum Programs via Cost-Effective Uncomputation
Conference · Mon Jul 13 00:00:00 EDT 2020 · Annual International Symposium on Computer Architecture, ISCA · OSTI ID:1865293