Non-Pauli Errors in the Three-Dimensional Surface Code
- URL: http://arxiv.org/abs/2202.05746v2
- Date: Wed, 8 Jun 2022 05:56:51 GMT
- Title: Non-Pauli Errors in the Three-Dimensional Surface Code
- Authors: Thomas R. Scruby, Michael Vasmer, Dan E. Browne
- Abstract summary: We show that logical non-Clifford operations can map Pauli errors to non-Pauli (Clifford) errors.
In particular, the emergence of linking charge is a local effect rather than a non-local one.
We use the relative simplicity of Clifford errors in this setting to simulate their effect on the performance of a single-shot magic state preparation process.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: A powerful feature of stabiliser error correcting codes is the fact that
stabiliser measurement projects arbitrary errors to Pauli errors, greatly
simplifying the physical error correction process as well as classical
simulations of code performance. However, logical non-Clifford operations can
map Pauli errors to non-Pauli (Clifford) errors, and while subsequent
stabiliser measurements will project the Clifford errors back to Pauli errors
the resulting distributions will possess additional correlations that depend on
both the nature of the logical operation and the structure of the code.
Previous work has studied these effects when applying a transversal $T$ gate to
the three-dimensional colour code and shown the existence of a non-local
"linking charge" phenomenon between membranes of intersecting errors. In this
work we generalise these results to the case of a $CCZ$ gate in the
three-dimensional surface code and find that many aspects of the problem are
much more easily understood in this setting. In particular, the emergence of
linking charge is a local effect rather than a non-local one. We use the
relative simplicity of Clifford errors in this setting to simulate their effect
on the performance of a single-shot magic state preparation process (the first
such simulation to account for the full effect of these errors) and find that
their effect on the threshold is largely determined by probability of $X$
errors occurring immediately prior to the application of the gate, after the
most recent stabiliser measurement.
Related papers
- The surface code under generic $X$-error channels: Statistical mechanics, error thresholds, and errorfield double phenomenology [0.0]
We study the code under the most general single-qubit $X$-error channel, encompassing both coherent and incoherent errors.
We compute maximum-likelihood thresholds and show that error coherence has negligible influence away from the fully coherent limit.
arXiv Detail & Related papers (2024-12-30T16:14:55Z) - Demonstrating dynamic surface codes [138.1740645504286]
We experimentally demonstrate three time-dynamic implementations of the surface code.
First, we embed the surface code on a hexagonal lattice, reducing the necessary couplings per qubit from four to three.
Second, we walk a surface code, swapping the role of data and measure qubits each round, achieving error correction with built-in removal of accumulated non-computational errors.
Third, we realize the surface code using iSWAP gates instead of the traditional CNOT, extending the set of viable gates for error correction without additional overhead.
arXiv Detail & Related papers (2024-12-18T21:56:50Z) - The XYZ ruby code: Making a case for a three-colored graphical calculus for quantum error correction in spacetime [1.453022747359034]
We present a formalism based on tensor networks to capture the logical action and error-correcting capabilities of any Clifford circuit with Pauli measurements.
We apply our method to our new family of dynamical codes which are in the same topological phase as the 2+1d color code.
We benchmark the performance of the XYZ ruby code on a torus by performing both memory and stability experiments.
arXiv Detail & Related papers (2024-07-11T14:56:26Z) - Erasure conversion in Majorana qubits via local quasiparticle detection [0.0]
Quasiparticle poisoning errors in Majorana-based qubits are not suppressed by the underlying topological properties.
This work tackles the errors by developing an erasure conversion scheme based on local quasiparticle detection.
arXiv Detail & Related papers (2023-07-17T23:50:09Z) - Randomized compiling in fault-tolerant quantum computation [0.0]
We present an algorithm projecting the state of the system onto a logical state with a well-defined error.
The algorithm does not significantly increase the depth of the logical circuit.
arXiv Detail & Related papers (2023-06-23T19:17:34Z) - Non-Pauli errors can be efficiently sampled in qudit surface codes [0.8443359047390766]
We quantify remaining correlations after syndrome measurement for a qudit 2D surface code subject to non-Pauli errors.
We relate correlations to loops on the lattice using belief propagation and percolation theory.
arXiv Detail & Related papers (2023-03-29T16:33:06Z) - Transversal Injection: A method for direct encoding of ancilla states
for non-Clifford gates using stabiliser codes [55.90903601048249]
We introduce a protocol to potentially reduce this overhead for non-Clifford gates.
Preliminary results hint at high quality fidelities at larger distances.
arXiv Detail & Related papers (2022-11-18T06:03:10Z) - Fast and Accurate Error Simulation for CNNs against Soft Errors [64.54260986994163]
We present a framework for the reliability analysis of Conal Neural Networks (CNNs) via an error simulation engine.
These error models are defined based on the corruption patterns of the output of the CNN operators induced by faults.
We show that our methodology achieves about 99% accuracy of the fault effects w.r.t. SASSIFI, and a speedup ranging from 44x up to 63x w.r.t.FI, that only implements a limited set of error models.
arXiv Detail & Related papers (2022-06-04T19:45:02Z) - Measuring NISQ Gate-Based Qubit Stability Using a 1+1 Field Theory and
Cycle Benchmarking [50.8020641352841]
We study coherent errors on a quantum hardware platform using a transverse field Ising model Hamiltonian as a sample user application.
We identify inter-day and intra-day qubit calibration drift and the impacts of quantum circuit placement on groups of qubits in different physical locations on the processor.
This paper also discusses how these measurements can provide a better understanding of these types of errors and how they may improve efforts to validate the accuracy of quantum computations.
arXiv Detail & Related papers (2022-01-08T23:12:55Z) - Fault-tolerant parity readout on a shuttling-based trapped-ion quantum
computer [64.47265213752996]
We experimentally demonstrate a fault-tolerant weight-4 parity check measurement scheme.
We achieve a flag-conditioned parity measurement single-shot fidelity of 93.2(2)%.
The scheme is an essential building block in a broad class of stabilizer quantum error correction protocols.
arXiv Detail & Related papers (2021-07-13T20:08:04Z) - Crosstalk Suppression for Fault-tolerant Quantum Error Correction with
Trapped Ions [62.997667081978825]
We present a study of crosstalk errors in a quantum-computing architecture based on a single string of ions confined by a radio-frequency trap, and manipulated by individually-addressed laser beams.
This type of errors affects spectator qubits that, ideally, should remain unaltered during the application of single- and two-qubit quantum gates addressed at a different set of active qubits.
We microscopically model crosstalk errors from first principles and present a detailed study showing the importance of using a coherent vs incoherent error modelling and, moreover, discuss strategies to actively suppress this crosstalk at the gate level.
arXiv Detail & Related papers (2020-12-21T14:20:40Z)
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.