Empirical Evaluation of Circuit Approximations on Noisy Quantum Devices
- URL: http://arxiv.org/abs/2107.06701v1
- Date: Wed, 14 Jul 2021 13:44:54 GMT
- Title: Empirical Evaluation of Circuit Approximations on Noisy Quantum Devices
- Authors: Ellis Wilson, Frank Mueller, Lindsay Bassman, Constin Iancu
- Abstract summary: Noisy Intermediate-Scale Quantum (NISQ) devices fail to produce outputs with sufficient fidelity for deep circuits with many gates today.
This work develops a methodology to generate shorter circuits with fewer multi-qubit gates whose unitary transformations approximate the original reference one.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Noisy Intermediate-Scale Quantum (NISQ) devices fail to produce outputs with
sufficient fidelity for deep circuits with many gates today. Such devices
suffer from read-out, multi-qubit gate and crosstalk noise combined with short
decoherence times limiting circuit depth. This work develops a methodology to
generate shorter circuits with fewer multi-qubit gates whose unitary
transformations approximate the original reference one. It explores the benefit
of such generated approximations under NISQ devices. Experimental results with
Grover's algorithm, multiple-control Toffoli gates, and the Transverse Field
Ising Model show that such approximate circuits produce higher fidelity results
than longer, theoretically precise circuits on NISQ devices, especially when
the reference circuits have many CNOT gates to begin with. With this ability to
fine-tune circuits, it is demonstrated that quantum computations can be
performed for more complex problems on today's devices than was feasible
before, sometimes even with a gain in overall precision by up to 60%.
Related papers
- Quantum Compiling with Reinforcement Learning on a Superconducting Processor [55.135709564322624]
We develop a reinforcement learning-based quantum compiler for a superconducting processor.
We demonstrate its capability of discovering novel and hardware-amenable circuits with short lengths.
Our study exemplifies the codesign of the software with hardware for efficient quantum compilation.
arXiv Detail & Related papers (2024-06-18T01:49:48Z) - Multi-qubit Lattice Surgery Scheduling [3.7126786554865774]
A quantum circuit can be transpiled into a sequence of solely non-Clifford multi-qubit gates.
We show that the transpilation significantly reduces the circuit length on the set of circuits tested.
The resulting circuit of multi-qubit gates has a further reduction in the expected circuit execution time compared to serial execution.
arXiv Detail & Related papers (2024-05-27T22:41:41Z) - QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum
Circuits [82.50620782471485]
QuantumSEA is an in-time sparse exploration for noise-adaptive quantum circuits.
It aims to achieve two key objectives: (1) implicit circuits capacity during training and (2) noise robustness.
Our method establishes state-of-the-art results with only half the number of quantum gates and 2x time saving of circuit executions.
arXiv Detail & Related papers (2024-01-10T22:33:00Z) - Quantum circuit debugging and sensitivity analysis via local inversions [62.997667081978825]
We present a technique that pinpoints the sections of a quantum circuit that affect the circuit output the most.
We demonstrate the practicality and efficacy of the proposed technique by applying it to example algorithmic circuits implemented on IBM quantum machines.
arXiv Detail & Related papers (2022-04-12T19:39:31Z) - Circuit connectivity boosts by quantum-classical-quantum interfaces [0.4194295877935867]
High-connectivity circuits are a major roadblock for current quantum hardware.
We propose a hybrid classical-quantum algorithm to simulate such circuits without swap-gate ladders.
We numerically show the efficacy of our method for a Bell-state circuit for two increasingly distant qubits.
arXiv Detail & Related papers (2022-03-09T19:00:02Z) - Quantum Circuit Engineering for Correcting Coherent Noise [1.0965065178451106]
Crosstalk and several sources of operational interference are invisible when qubit or a gate is calibrated or benchmarked in isolation.
Unwanted Z-Z coupling on superconducting cross-resonance CNOT gates, is a commonly occurring unitary crosstalk noise.
Experiments aggressively deploy forced commutation of CNOT gates to obtain low noise state-preparation circuits.
arXiv Detail & Related papers (2021-09-08T10:33:18Z) - Accurate methods for the analysis of strong-drive effects in parametric
gates [94.70553167084388]
We show how to efficiently extract gate parameters using exact numerics and a perturbative analytical approach.
We identify optimal regimes of operation for different types of gates including $i$SWAP, controlled-Z, and CNOT.
arXiv Detail & Related papers (2021-07-06T02:02:54Z) - Error Mitigation in Quantum Computers through Instruction Scheduling [7.0230815242347475]
Current quantum devices suffer from the rapid accumulation of error that prevents the storage of quantum information over extended periods.
This paper presents TimeStitch, a framework that pinpoints the optimum execution schedules for single-qubit gates within quantum circuits.
arXiv Detail & Related papers (2021-05-04T20:58:58Z) - High-fidelity geometric quantum gates with short paths on
superconducting circuits [5.666193021459319]
We propose a scheme to realize nonadiabatic geometric quantum gates with short paths based on simple pulse control techniques.
Specifically, we illustrate the idea on a superconducting quantum circuit, which is one of the most promising platforms for realizing practical quantum computer.
arXiv Detail & Related papers (2021-02-06T10:13:05Z) - On the realistic worst case analysis of quantum arithmetic circuits [69.43216268165402]
We show that commonly held intuitions when designing quantum circuits can be misleading.
We show that reducing the T-count can increase the total depth.
We illustrate our method on addition and multiplication circuits using ripple-carry.
arXiv Detail & Related papers (2021-01-12T21:36:16Z) - Boundaries of quantum supremacy via random circuit sampling [69.16452769334367]
Google's recent quantum supremacy experiment heralded a transition point where quantum computing performed a computational task, random circuit sampling.
We examine the constraints of the observed quantum runtime advantage in a larger number of qubits and gates.
arXiv Detail & Related papers (2020-05-05T20:11:53Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.