Linear-optical quantum computation with arbitrary error-correcting codes

• URL: http://arxiv.org/abs/2408.04126v2
• Date: Mon, 26 Aug 2024 16:23:27 GMT
• Title: Linear-optical quantum computation with arbitrary error-correcting codes
• Authors: Blayney W. Walshe, Ben Q. Baragiola, Hugo Ferretti, José Gefaell, Michael Vasmer, Ryohei Weil, Takaya Matsuura, Thomas Jaeken, Giacomo Pantaleoni, Zhihua Han, Timo Hillmann, Nicolas C. Menicucci, Ilan Tzitrin, Rafael N. Alexander,
• Abstract summary: High-rate quantum error correcting codes mitigate the imposing scale of fault-tolerant quantum computers. We provide a linear-optical architecture with these properties, compatible with arbitrary codes and Gottesman-Kitaev-Preskill qubits on generic lattices.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: High-rate quantum error correcting codes mitigate the imposing scale of fault-tolerant quantum computers but require the efficient generation of non-local many-body entanglement. We provide a linear-optical architecture with these properties, compatible with arbitrary codes and Gottesman-Kitaev-Preskill qubits on generic lattices, and featuring a natural way to leverage physical noise bias. Simulations involving hyperbolic surface codes, promising quantum low-density parity-check codes, reveal a threshold comparable to the 2D surface code at about a ten-fold improvement in encoding rate.

Related papers

• Variational Graphical Quantum Error Correction Codes: adjustable codes from topological insights [1.3999481573773074]
  We develop a new class of quantum error-correcting codes termed Variational Graphical Quantum Error Correction(VGQEC) codes. The VGQEC codes feature adjustable configuration parameters that play a pivotal role in determining the error-correcting capability of the codes.
  arXiv  Detail & Related papers  (2024-10-03T15:47:48Z)
• Engineering Quantum Error Correction Codes Using Evolutionary Algorithms [0.0]
  Quantum error correction and the use of quantum error correction codes is likely to be essential for the realisation of practical quantum computing. We present a novel evolutionary algorithm which searches for an optimal stabiliser code for a given error model. As part of this work, we also introduce an evolutionary algorithm QDistEvol for finding the distance of quantum error correction codes.
  arXiv  Detail & Related papers  (2024-09-19T18:00:02Z)
• Quantum memory based on concatenating surface codes and quantum Hamming codes [0.0]
  We study the concatenation of surface codes with quantum Hamming codes as a quantum memory. A high error threshold is achieved, which can in principle be pushed up to the threshold of the surface code. The advantage in suppressing errors starts to show for a quantum memory of intermediate scale.
  arXiv  Detail & Related papers  (2024-07-23T04:47:14Z)
• The END: An Equivariant Neural Decoder for Quantum Error Correction [73.4384623973809]
  We introduce a data efficient neural decoder that exploits the symmetries of the problem. We propose a novel equivariant architecture that achieves state of the art accuracy compared to previous neural decoders.
  arXiv  Detail & Related papers  (2023-04-14T19:46:39Z)
• Hardness of braided quantum circuit optimization in the surface code [0.1759008116536278]
  Large-scale quantum information processing requires the use of quantum error codes to mitigate the effects of noise in quantum devices. Topological error-correcting codes, such as surface codes, are promising candidates as they can be implemented using only local interactions in a two-dimensional array of physical qubits. However, error correction also introduces a significant overhead in time, the number of physical qubits, and the number of physical gates.
  arXiv  Detail & Related papers  (2023-02-01T06:35:50Z)
• 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)
• Neural Belief Propagation Decoding of Quantum LDPC Codes Using Overcomplete Check Matrices [60.02503434201552]
  We propose to decode QLDPC codes based on a check matrix with redundant rows, generated from linear combinations of the rows in the original check matrix. This approach yields a significant improvement in decoding performance with the additional advantage of very low decoding latency.
  arXiv  Detail & Related papers  (2022-12-20T13:41:27Z)
• Quantum computation on a 19-qubit wide 2d nearest neighbour qubit array [59.24209911146749]
  This paper explores the relationship between the width of a qubit lattice constrained in one dimension and physical thresholds. We engineer an error bias at the lowest level of encoding using the surface code. We then address this bias at a higher level of encoding using a lattice-surgery surface code bus.
  arXiv  Detail & Related papers  (2022-12-03T06:16:07Z)
• Low-overhead quantum error correction codes with a cyclic topology [0.0]
  We propose a resource-efficient scaling of a five-qubit perfect code with cyclic stabilizers for small distances on the ring architecture. We show an approach to construct the quantum circuit of a correction code with ancillas entangled with non-neighboring data qubits.
  arXiv  Detail & Related papers  (2022-11-06T12:22:23Z)
• Improved decoding of circuit noise and fragile boundaries of tailored surface codes [61.411482146110984]
  We introduce decoders that are both fast and accurate, and can be used with a wide class of quantum error correction codes. Our decoders, named belief-matching and belief-find, exploit all noise information and thereby unlock higher accuracy demonstrations of QEC. We find that the decoders led to a much higher threshold and lower qubit overhead in the tailored surface code with respect to the standard, square surface code.
  arXiv  Detail & Related papers  (2022-03-09T18:48:54Z)
• Deterministic correction of qubit loss [48.43720700248091]
  Loss of qubits poses one of the fundamental obstacles towards large-scale and fault-tolerant quantum information processors. We experimentally demonstrate the implementation of a full cycle of qubit loss detection and correction on a minimal instance of a topological surface code.
  arXiv  Detail & Related papers  (2020-02-21T19:48: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.