Error mitigation with Clifford quantum-circuit data
- URL: http://arxiv.org/abs/2005.10189v3
- Date: Tue, 16 Nov 2021 23:44:44 GMT
- Title: Error mitigation with Clifford quantum-circuit data
- Authors: Piotr Czarnik, Andrew Arrasmith, Patrick J. Coles, Lukasz Cincio
- Abstract summary: We propose a novel, scalable error-mitigation method that applies to gate-based quantum computers.
The method generates training data $X_itextnoisy,X_itextexact$ via quantum circuits composed largely of Clifford gates.
We analyze the performance of our method versus the number of qubits, circuit depth, and number of non-Clifford gates.
- Score: 0.8258451067861933
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Achieving near-term quantum advantage will require accurate estimation of
quantum observables despite significant hardware noise. For this purpose, we
propose a novel, scalable error-mitigation method that applies to gate-based
quantum computers. The method generates training data
$\{X_i^{\text{noisy}},X_i^{\text{exact}}\}$ via quantum circuits composed
largely of Clifford gates, which can be efficiently simulated classically,
where $X_i^{\text{noisy}}$ and $X_i^{\text{exact}}$ are noisy and noiseless
observables respectively. Fitting a linear ansatz to this data then allows for
the prediction of noise-free observables for arbitrary circuits. We analyze the
performance of our method versus the number of qubits, circuit depth, and
number of non-Clifford gates. We obtain an order-of-magnitude error reduction
for a ground-state energy problem on 16 qubits in an IBMQ quantum computer and
on a 64-qubit noisy simulator.
Related papers
- Practical implementation of a single-qubit rotation algorithm [0.0]
The Toffoli is an important universal quantum gate, and will alongside the Clifford gates be available in future Fault-Tolerant Quantum Computing hardware.
We evaluate the performance of a recently proposed single-qubit rotation algorithm using the Clifford+Toffoli gate set.
arXiv Detail & Related papers (2024-10-24T13:53:21Z) - Optimized Noise Suppression for Quantum Circuits [0.40964539027092917]
Crosstalk noise is a severe error source in, e.g., cross-resonance based superconducting quantum processors.
Intrepid programming algorithm extends previous work on optimized qubit routing by swap insertion.
We evaluate the proposed method by characterizing crosstalk noise for two chips with up to 127 qubits.
arXiv Detail & Related papers (2024-01-12T07:34:59Z) - 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) - Scalable noisy quantum circuits for biased-noise qubits [37.69303106863453]
We consider biased-noise qubits affected only by bit-flip errors, which is motivated by existing systems of stabilized cat qubits.
For realistic noise models, phase-flip will not be negligible, but in the Pauli-Twirling approximation, we show that our benchmark could check the correctness of circuits containing up to $106$ gates.
arXiv Detail & Related papers (2023-05-03T11:27:50Z) - Unimon qubit [42.83899285555746]
Superconducting qubits are one of the most promising candidates to implement quantum computers.
Here, we introduce and demonstrate a superconducting-qubit type, the unimon, which combines the desired properties of high non-linearity, full insensitivity to dc charge noise, insensitivity to flux noise, and a simple structure consisting only of a single Josephson junction in a resonator.
arXiv Detail & Related papers (2022-03-11T12:57:43Z) - Quantum State Preparation with Optimal Circuit Depth: Implementations
and Applications [10.436969366019015]
We show that any $Theta(n)$-depth circuit can be prepared with a $Theta(log(nd)) with $O(ndlog d)$ ancillary qubits.
We discuss applications of the results in different quantum computing tasks, such as Hamiltonian simulation, solving linear systems of equations, and realizing quantum random access memories.
arXiv Detail & Related papers (2022-01-27T13:16:30Z) - Quantum error mitigation via matrix product operators [27.426057220671336]
Quantum error mitigation (QEM) can suppress errors in measurement results via repeated experiments and post decomposition of data.
MPO representation increases the accuracy of modeling noise without consuming more experimental resources.
Our method is hopeful of being applied to circuits in higher dimensions with more qubits and deeper depth.
arXiv Detail & Related papers (2022-01-03T16:57:43Z) - Simulating quench dynamics on a digital quantum computer with
data-driven error mitigation [62.997667081978825]
We present one of the first implementations of several Clifford data regression based methods which are used to mitigate the effect of noise in real quantum data.
We find in general Clifford data regression based techniques are advantageous in comparison with zero-noise extrapolation.
This is the largest systems investigated so far in a study of this type.
arXiv Detail & Related papers (2021-03-23T16:56:14Z) - Recycling qubits in near-term quantum computers [1.2891210250935146]
We propose a protocol that can unitarily reset qubits when the circuit has a common convolutional form.
This protocol generates fresh qubits from used ones by partially applying the time-reversed quantum circuit over qubits that are no longer in use.
arXiv Detail & Related papers (2020-12-03T03:24:50Z) - Fault-tolerant Coding for Quantum Communication [71.206200318454]
encode and decode circuits to reliably send messages over many uses of a noisy channel.
For every quantum channel $T$ and every $eps>0$ there exists a threshold $p(epsilon,T)$ for the gate error probability below which rates larger than $C-epsilon$ are fault-tolerantly achievable.
Our results are relevant in communication over large distances, and also on-chip, where distant parts of a quantum computer might need to communicate under higher levels of noise.
arXiv Detail & Related papers (2020-09-15T15:10:50Z) - Quantum Gram-Schmidt Processes and Their Application to Efficient State
Read-out for Quantum Algorithms [87.04438831673063]
We present an efficient read-out protocol that yields the classical vector form of the generated state.
Our protocol suits the case that the output state lies in the row space of the input matrix.
One of our technical tools is an efficient quantum algorithm for performing the Gram-Schmidt orthonormal procedure.
arXiv Detail & Related papers (2020-04-14T11:05:26Z)
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.