Optimal Qubit Reuse for Near-Term Quantum Computers
- URL: http://arxiv.org/abs/2308.00194v1
- Date: Mon, 31 Jul 2023 23:15:45 GMT
- Title: Optimal Qubit Reuse for Near-Term Quantum Computers
- Authors: Sebastian Brandhofer, Ilia Polian, Kevin Krsulich
- Abstract summary: Increasing support for mid-circuit measurements and qubit reset in near-term quantum computers enables qubit reuse.
We introduce a formal model for qubit reuse optimization that delivers provably optimal solutions.
We show improvements in the number of qubits and swap gate insertions, estimated success probability, and Hellinger fidelity of the investigated quantum circuits.
- Score: 0.18188255328029254
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Near-term quantum computations are limited by high error rates, the scarcity
of qubits and low qubit connectivity. Increasing support for mid-circuit
measurements and qubit reset in near-term quantum computers enables qubit reuse
that may yield quantum computations with fewer qubits and lower errors. In this
work, we introduce a formal model for qubit reuse optimization that delivers
provably optimal solutions with respect to quantum circuit depth, number of
qubits, or number of swap gates for the first time. This is in contrast to
related work where qubit reuse is used heuristically or optimally but without
consideration of the mapping effort. We further investigate reset errors on
near-term quantum computers by performing reset error characterization
experiments. Using the hereby obtained reset error characterization and
calibration data of a near-term quantum computer, we then determine a qubit
assignment that is optimal with respect to a given cost function. We define
this cost function to include gate errors and decoherence as well as the
individual reset error of each qubit. We found the reset fidelity to be
state-dependent and to range, depending on the reset qubit, from 67.5% to 100%
in a near-term quantum computer. We demonstrate the applicability of the
developed method to a number of quantum circuits and show improvements in the
number of qubits and swap gate insertions, estimated success probability, and
Hellinger fidelity of the investigated quantum circuits.
Related papers
- A Quantum-Classical Collaborative Training Architecture Based on Quantum
State Fidelity [50.387179833629254]
We introduce a collaborative classical-quantum architecture called co-TenQu.
Co-TenQu enhances a classical deep neural network by up to 41.72% in a fair setting.
It outperforms other quantum-based methods by up to 1.9 times and achieves similar accuracy while utilizing 70.59% fewer qubits.
arXiv Detail & Related papers (2024-02-23T14:09: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) - Fast Flux-Activated Leakage Reduction for Superconducting Quantum
Circuits [84.60542868688235]
leakage out of the computational subspace arising from the multi-level structure of qubit implementations.
We present a resource-efficient universal leakage reduction unit for superconducting qubits using parametric flux modulation.
We demonstrate that using the leakage reduction unit in repeated weight-two stabilizer measurements reduces the total number of detected errors in a scalable fashion.
arXiv Detail & Related papers (2023-09-13T16:21:32Z) - Near-Term Distributed Quantum Computation using Mean-Field Corrections
and Auxiliary Qubits [77.04894470683776]
We propose near-term distributed quantum computing that involve limited information transfer and conservative entanglement production.
We build upon these concepts to produce an approximate circuit-cutting technique for the fragmented pre-training of variational quantum algorithms.
arXiv Detail & Related papers (2023-09-11T18:00:00Z) - Optimal Partitioning of Quantum Circuits using Gate Cuts and Wire Cuts [1.0507729375838437]
A limited number of qubits, high error rates, and limited qubit connectivity are major challenges for effective near-term quantum computations.
Quantum circuit partitioning divides a quantum computation into a set of computations that include smaller-scale quantum (sub)circuits and classical postprocessing steps.
We develop an optimal partitioning method based on recent advances in quantum circuit knitting.
arXiv Detail & Related papers (2023-08-18T13:59:55Z) - State preparation by shallow circuits using feed forward [0.0]
We make use of this four-step scheme not to carry out fault-tolerant computations, but to enhance short, constant-depth, quantum circuits.
We show that LAQCC circuits can create long-ranged interactions, which constant-depth quantum circuits cannot achieve.
We create three new state preparation protocols for a uniform superposition over an arbitrary number of states.
arXiv Detail & Related papers (2023-07-27T13:20:21Z) - Deep Quantum Error Correction [73.54643419792453]
Quantum error correction codes (QECC) are a key component for realizing the potential of quantum computing.
In this work, we efficiently train novel emphend-to-end deep quantum error decoders.
The proposed method demonstrates the power of neural decoders for QECC by achieving state-of-the-art accuracy.
arXiv Detail & Related papers (2023-01-27T08:16:26Z) - Suppressing quantum circuit errors due to system variability [0.0]
We present a quantum circuit optimization technique that takes into account the variability in error rates that is inherent across present day noisy quantum computing platforms.
We show that it is possible to recover on average nearly of missing fidelity using better qubit selection via efficient to compute cost functions.
arXiv Detail & Related papers (2022-09-30T15:00:38Z) - Optimization of Quantum Read-Only Memory Circuits [5.486046841722322]
In quantum machine learning applications, a quantum memory can simplify the data loading process and potentially accelerate the learning task.
Quantum Read Only Memory (QROM) scale exponentially with the number of address lines making them impractical in state-of-the-art Noisy Intermediate-Scale Quantum (NISQ) computers beyond 4-bit addresses.
We propose techniques such as, predecoding logic and qubit reset to reduce the depth and gate count of QROM circuits to target wider address ranges such as, 8-bits.
arXiv Detail & Related papers (2022-04-06T21:23:31Z) - 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.