SQUARE: Strategic Quantum Ancilla Reuse for Modular Quantum Programs via Cost-Effective Uncomputation

  title={SQUARE: Strategic Quantum Ancilla Reuse for Modular Quantum Programs via Cost-Effective Uncomputation},
  author={Yongshan Ding and X. Wu and Adam Holmes and Ash Wiseth and D. Franklin and M. Martonosi and F. Chong},
  journal={2020 ACM/IEEE 47th Annual International Symposium on Computer Architecture (ISCA)},
  • Yongshan Ding, X. Wu, +4 authors F. Chong
  • Published 2020
  • Computer Science, Physics
  • 2020 ACM/IEEE 47th Annual International Symposium on Computer Architecture (ISCA)
Compiling high-level quantum programs to machines that are size constrained (i.e. limited number of quantum bits) and time constrained (i.e. limited number of quantum operations) is challenging. In this paper, we present SQUARE (Strategic QUantum Ancilla REuse), a compilation infrastructure that tackles allocation and reclamation of scratch qubits (called ancilla) in modular quantum programs. At its core, SQUARE strategically performs uncomputation to create opportunities for qubit reuse… Expand
Optimizing Noisy-Intermediate Scale Quantum Circuits: A Block-Based Synthesis
A hierarchical, block-by-block optimization framework, QGo, for quantum circuit optimization that can reduce the number of CNOT gates by 29.9% on average and up to 50% when compared with industrial compilers such as t|ket>. Expand
2QAN: A quantum compiler for 2-local qubit Hamiltonian simulation algorithms
This work develops a compiler, named 2QAN, to optimize quantum circuits for 2-local qubit Hamiltonian simulation problems, a framework which includes the important quantum approximate optimization algorithm (QAOA). Expand
Fast Swapping in a Quantum Multiplier Modelled as a Queuing Network
This paper proposes that quantum circuits can be modeled as queuing networks, enabling efficient extraction of the parallelism and duration of SWAP circuits, and compilation of large scale quantum circuit compilation is proposed. Expand
Quantum PUF for Security and Trust in Quantum Computing
This work proposes two flavors of a Quantum Physically Unclonable Function (QuPUF) - one based on superposition and another based on decoherence to address the issue of temporal variations in qubit quality, and adds a parametric rotation to the QuPUF for stability. Expand
Unqomp: synthesizing uncomputation in Quantum circuits
Unqomp is presented, the first procedure to automatically synthesize uncomputation in a given quantum circuit, allowing the programmer to allocate and use temporary values analogously to classical computation, knowing they will be uncomputed by Unqomp. Expand
QGo: Scalable Quantum Circuit Optimization Using Automated Synthesis
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 isExpand


Compiler Management of Communication and Parallelism for Quantum Computation
This work is the most comprehensive software-to-quantum toolflow published to date, with efficient and practical scheduling techniques that reduce communication and increase parallelism for full-scale quantum code executing up to a trillion quantum gate operations. Expand
Noise-Adaptive Compiler Mappings for Noisy Intermediate-Scale Quantum Computers
It is shown that fine grained spatial and temporal variations in hardware parameters can be exploited to obtain an average 2.9x (and up to 18x) improvement in program success rate over the industry standard IBM Qiskit compiler. Expand
Magic-State Functional Units: Mapping and Scheduling Multi-Level Distillation Circuits for Fault-Tolerant Quantum Architectures
This paper presents the first detailed designs of hardware functional units that implement space-time optimized magic-state factories for surface code error-corrected machines, and proposes two novel mapping techniques: braid repulsion and dipole moment braid rotation. Expand
Resource optimized quantum architectures for surface code implementations of magic-state distillation
This work design and analyze a set of optimized factory architectural layouts that divide a single factory into spatially distributed factories located throughout the processor, and develops an optimization procedure that discovers the optimal number of factory distillation rounds and number of output magic states per factory. Expand
Faster manipulation of large quantum circuits using wire label reference diagrams
This work introduces a dedicated representation for large quantum circuits, namely wire label reference diagrams, which is applied to a set of very common circuit transformations, and develops corresponding solutions which achieve orders of magnitude performance improvements for circuits which include up to 80 000 qubits and 200 000 gates. Expand
Unified framework for magic state distillation and multiqubit gate synthesis with reduced resource cost
The standard approach to fault-tolerant quantum computation is to store information in a quantum error correction code, such as the surface code, and process information using a strategy that can beExpand
An Efficient Quantum Compiler that reduces $T$ count.
This work implemented several efficient quantum compilers for multi-qubit Clifford + $T$ circuits in C++ and benchmarked them on random circuits, from which it is determined that the TODD compiler yields the lowest number of gates in a circuit on average. Expand
Fault-tolerant, high-level quantum circuits: form, compilation and description
This work introduces a package that converts high level quantum circuits consisting of commonly used gates into a form employing all decompositions and ancillary protocols needed for fault-tolerant error correction and outputs a standard circuit or a canonical geometric description. Expand
eQASM: An Executable Quantum Instruction Set Architecture
  • Xiang Fu, L. Riesebos, +13 authors K. Bertels
  • Computer Science, Physics
  • 2019 IEEE International Symposium on High Performance Computer Architecture (HPCA)
  • 2019
This paper proposes an executable QISA that can be translated from quantum assembly language (QASM), supports comprehensive quantum program flow control, and is executed on a quantum control microarchitecture, and presents better scalability than QuMIS. Expand
Optimized Surface Code Communication in Superconducting Quantum Computers
This paper evaluates two established quantum error correction codes-planar and double-defect surface codes-using a set of compilation, scheduling and network simulation tools, and finds that the simpler planar codes are sometimes more favorable for implementation on superconducting quantum computers, especially under conditions of high communication congestion. Expand