QUEST: systematically approximating Quantum circuits for higher output fidelity
- Northeastern University, USA
- Lawrence Berkeley National Laboratory, USA
We present QUEST, a procedure to systematically generate approximations for quantum circuits to reduce their CNOT gate count. Our approach employs circuit partitioning for scalability with procedures to 1) reduce circuit length using approximate synthesis, 2) improve fidelity by running circuits that represent key samples in the approximation space, and 3) reason about approximation upper bound. Our evaluation results indicate that our approach of "dissimilar"approximations provides close fidelity to the original circuit. Overall, the results indicate that QUEST can reduce CNOT gate count by 30-80% on ideal systems and decrease the impact of noise on existing and near-future quantum systems.
- Research Organization:
- Lawrence Berkeley National Laboratory (LBNL), Berkeley, CA (United States)
- Sponsoring Organization:
- USDOE Office of Science (SC), Advanced Scientific Computing Research (ASCR)
- DOE Contract Number:
- AC02-05CH11231
- OSTI ID:
- 2008319
- Journal Information:
- Proceedings of the 27th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, Conference: ASPLOS '22: Proceedings of the 27. ACM International Conference on Architectural Support for Programming Languages and Operating Systems, Lausanne (Switzerland), 28 Feb - 4 Mar 2022
- Country of Publication:
- United States
- Language:
- English
Quantum circuits for isometries
|
journal | March 2016 |
Quantum-assisted quantum compiling
|
journal | May 2019 |
Noise-Adaptive Compiler Mappings for Noisy Intermediate-Scale Quantum Computers
|
conference | April 2019 |
A quantum computational compiler and design tool for technology-specific targets
|
conference | June 2019 |
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 |
Sketching the Best Approximate Quantum Compiling Problem
|
conference | September 2022 |
The theory of variational hybrid quantum-classical algorithms
|
journal | February 2016 |
Optimized Compilation of Aggregated Instructions for Realistic Quantum Computers
|
conference | April 2019 |
Compiling quantum algorithms for architectures with multi-qubit gates
|
journal | June 2016 |
Time-optimal Qubit mapping
|
conference | April 2021 |
Ensemble of Diverse Mappings: Improving Reliability of Quantum Computers by Orchestrating Dissimilar Mistakes
|
conference | October 2019 |
Compiling SU(4) quantum circuits to IBM QX architectures
|
conference | January 2019 |
Software Mitigation of Crosstalk on Noisy Intermediate-Scale Quantum Computers
|
conference | March 2020 |
Quantum Computing in the NISQ era and beyond
|
journal | August 2018 |
A Trace Inequality for Unitary Matrices
|
journal | May 1994 |
Quantum circuit optimizations for NISQ architectures
|
journal | March 2020 |
IBM's quantum cloud computer goes commercial
|
journal | March 2017 |
The Fractional Order Fourier Transform and its Application to Quantum Mechanics
|
journal | January 1980 |
Tackling the Qubit Mapping Problem for NISQ-Era Quantum Devices
|
conference | April 2019 |
Distance measures to compare real and ideal quantum processes
|
journal | June 2005 |
Not All Qubits Are Created Equal: A Case for Variability-Aware Policies for NISQ-Era Quantum Computers
|
conference | April 2019 |
Mapping Quantum Circuits to IBM QX Architectures Using the Minimal Number of SWAP and H Operations
|
conference | June 2019 |
VERITAS: Accurately Estimating the Correct Output on Noisy Intermediate-Scale Quantum Computers
|
conference | November 2020 |
Similar Records
Quantum Circuit Partitioning for Scalable Noise-Aware Quantum Circuit Re-Synthesis
Noise-Resilient and Reduced Depth Approximate Adders for NISQ Quantum Computing