Orchestrated trios: compiling for efficient communication in Quantum programs with 3-Qubit gates
- Univ. of Chicago, IL (United States); The University of Chicago
- Univ. of Chicago, IL (United States)
Current quantum computers are especially error prone and require high levels of optimization to reduce operation counts and maximize the probability the compiled program will succeed. These computers only support operations decomposed into one- and two-qubit gates and only two-qubit gates between physically connected pairs of qubits. Typical compilers first decompose operations, then route data to connected qubits. We propose a new compiler structure, Orchestrated Trios, that first decomposes to the three-qubit Toffoli, routes the inputs of the higher-level Toffoli operations to groups of nearby qubits, then finishes decomposition to hardware-supported gates. This significantly reduces communication overhead by giving the routing pass access to the higher-level structure of the circuit instead of discarding it. A second benefit is the ability to now select an architecture-tuned Toffoli decomposition such as the 8-CNOT Toffoli for the specific hardware qubits now known after the routing pass. Furthermore, we perform real experiments on IBM Johannesburg showing an average 35% decrease in two-qubit gate count and 23% increase in success rate of a single Toffoli over Qiskit. We additionally compile many near-term benchmark algorithms showing an average 344% increase in (or 4.44x) simulated success rate on the Johannesburg architecture and compare with other architecture types.
- Research Organization:
- Univ. of Chicago, IL (United States)
- Sponsoring Organization:
- USDOE Office of Science (SC), Engineering & Technology
- DOE Contract Number:
- SC0020289
- OSTI ID:
- 1865297
- Country of Publication:
- United States
- Language:
- English
Quantum Computing in the NISQ era and beyond
|
journal | August 2018 |
ScaffCC: Scalable compilation and analysis of quantum programs
|
journal | June 2015 |
On the Qubit Routing Problem
|
text | January 2019 |
Quantum Circuit Simplification and Level Compaction
|
journal | March 2008 |
Look-ahead schemes for nearest neighbor optimization of 1D and 2D quantum circuits
|
conference | January 2016 |
Noise-Adaptive Compiler Mappings for Noisy Intermediate-Scale Quantum Computers
|
conference | April 2019 |
A quantum engineer's guide to superconducting qubits
|
journal | June 2019 |
Quantum complexity theory
|
conference | January 1993 |
Architecting Noisy Intermediate-Scale Trapped Ion Quantum Computers
|
conference | May 2020 |
Software Mitigation of Crosstalk on Noisy Intermediate-Scale Quantum Computers
|
conference | March 2020 |
A fast quantum mechanical algorithm for database search
|
conference | January 1996 |
Ensemble of Diverse Mappings: Improving Reliability of Quantum Computers by Orchestrating Dissimilar Mistakes
|
conference | October 2019 |
Optimal SWAP gate insertion for nearest neighbor quantum circuits
|
conference | January 2014 |
Mapping Quantum Circuits to IBM QX Architectures Using the Minimal Number of SWAP and H Operations
|
conference | June 2019 |
Qubit allocation
|
conference | February 2018 |
Automated optimization of large quantum circuits with continuous parameters
|
journal | May 2018 |
Elementary gates for quantum computation
|
journal | November 1995 |
| Qiskit: An Open-source Framework for Quantum Computing | software | January 2019 |
Quantum arithmetic with the quantum Fourier transform
|
journal | April 2017 |
An efficient conversion of quantum circuits to a linear nearest neighbor architecture
|
journal | January 2011 |
Two-step approach to scheduling quantum circuits
|
journal | July 2018 |
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
|
journal | October 1997 |
Time-sliced quantum circuit partitioning for modular architectures
|
conference | May 2020 |
Similar Records
Hardware-Conscious Optimization of the Quantum Toffoli Gate
Dancing the Quantum Waltz: Compiling Three-Qubit Gates on Four Level Architectures