Realizing a class of stabilizer quantum error correction codes using a single ancilla and circular connectivity

• URL: http://arxiv.org/abs/2207.13356v1
• Date: Wed, 27 Jul 2022 08:25:38 GMT
• Title: Realizing a class of stabilizer quantum error correction codes using a single ancilla and circular connectivity
• Authors: A.V. Antipov, E.O. Kiktenko, A.K. Fedorov
• Abstract summary: We show that a class of "neighboring-blocks" stabilizer quantum error correction codes can be implemented in a resource-efficient manner using a single ancilla and circular near-neighbor qubit connectivity. We propose an implementation for syndrome-measurement circuits for codes from the class and illustrate its workings for cases of three-, five-, and nine-qubits stabilizer code schemes.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We describe a class of "neighboring-blocks" stabilizer quantum error correction codes and demonstrate that such class of codes can be implemented in a resource-efficient manner using a single ancilla and circular near-neighbor qubit connectivity. We propose an implementation for syndrome-measurement circuits for codes from the class and illustrate its workings for cases of three-, five-, and nine-qubits stabilizer code schemes. For three- and five-qubit codes suggested scheme has the property that it uses only native two-qubit CNS (CNOT-SWAP) gates, which potentially reduces the amount of non-correctable errors due to the shorter gate time. We developed efficient decoding procedures for repetition codes and the five-qubit code using a minimum weight-perfect matching approach to account for the specific order of measurements in our scheme. The analysis of noise levels for which the scheme could show improvements in the fidelity of a stored logical state in the three- and five-qubit cases is provided. We complement our results by realizing the developed scheme for a three-qubit code using a cloud-based quantum processor and the five-qubit code using the state-vector simulator.

Related papers

• Adaptive Syndrome Extraction [1.9686770963118383]
  We introduce adaptive syndrome extraction as a scheme to improve code performance and reduce the quantum error correction cycle time. Compared to non-concatenated codes and non-adaptive syndrome extraction, we find that the adaptive scheme achieves over an order of magnitude lower logical error rates.
  arXiv  Detail & Related papers  (2025-02-20T18:48:32Z)
• 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)
• An Optimized Nearest Neighbor Compliant Quantum Circuit for 5-qubit Code [9.851172682018731]
  The five-qubit quantum error correcting code encodes one logical qubit to five physical qubits, and protects the code from a single error. We propose a systematic procedure for optimization of encoder circuits for stabilizer codes.
  arXiv  Detail & Related papers  (2024-10-08T21:17:17Z)
• Reducing Quantum Error Correction Overhead with Versatile Flag-Sharing Syndrome Extraction Circuits [5.770351255180495]
  An efficient error syndrome extraction circuit should use fewer ancillary qubits, quantum gates, and measurements. We propose to design parallel flagged syndrome extraction with shared flag qubits for quantum stabilizer codes.
  arXiv  Detail & Related papers  (2024-06-30T06:35:48Z)
• Fault-tolerant quantum architectures based on erasure qubits [49.227671756557946]
  We exploit the idea of erasure qubits, relying on an efficient conversion of the dominant noise into erasures at known locations. We propose and optimize QEC schemes based on erasure qubits and the recently-introduced Floquet codes. Our results demonstrate that, despite being slightly more complex, QEC schemes based on erasure qubits can significantly outperform standard approaches.
  arXiv  Detail & Related papers  (2023-12-21T17:40:18Z)
• Testing the Accuracy of Surface Code Decoders [55.616364225463066]
  Large-scale, fault-tolerant quantum computations will be enabled by quantum error-correcting codes (QECC) This work presents the first systematic technique to test the accuracy and effectiveness of different QECC decoding schemes.
  arXiv  Detail & Related papers  (2023-11-21T10:22:08Z)
• 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)
• Low-overhead quantum error correction codes with a cyclic topology [0.0]
  We show an approach to construct the quantum circuit of a correction code with ancillas entangled with non-neighboring data qubits. We introduce a neural network-based decoding algorithm supported by an improved lookup table decoder.
  arXiv  Detail & Related papers  (2022-11-06T12:22:23Z)
• Performance of teleportation-based error correction circuits for bosonic codes with noisy measurements [58.720142291102135]
  We analyze the error-correction capabilities of rotation-symmetric codes using a teleportation-based error-correction circuit. We find that with the currently achievable measurement efficiencies in microwave optics, bosonic rotation codes undergo a substantial decrease in their break-even potential.
  arXiv  Detail & Related papers  (2021-08-02T16:12:13Z)
• Optimizing Stabilizer Parities for Improved Logical Qubit Memories [0.8431877864777444]
  We study variants of Shor's code that are adept at handling single-axis correlated idling errors. Even-distance versions of our Shor code variants are decoherence-free subspaces and fully robust to identical and independent coherent idling noise.
  arXiv  Detail & Related papers  (2021-05-11T14:20:15Z)
• Cellular automaton decoders for topological quantum codes with noisy measurements and beyond [68.8204255655161]
  We propose an error correction procedure based on a cellular automaton, the sweep rule, which is applicable to a broad range of codes beyond topological quantum codes. For simplicity, we focus on the three-dimensional (3D) toric code on the rhombic dodecahedral lattice with boundaries and prove that the resulting local decoder has a non-zero error threshold. We find that this error correction procedure is remarkably robust against measurement errors and is also essentially insensitive to the details of the lattice and noise model.
  arXiv  Detail & Related papers  (2020-04-15T18:00:01Z)

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.