Parity-encoding-based quantum computing with Bayesian error tracking

• URL: http://arxiv.org/abs/2207.06805v4
• Date: Thu, 1 Dec 2022 04:32:03 GMT
• Title: Parity-encoding-based quantum computing with Bayesian error tracking
• Authors: Seok-Hyung Lee, Srikrishna Omkar, Yong Siah Teo, Hyunseok Jeong
• Abstract summary: Measurement-based quantum computing (MBQC) in linear optical systems is promising for near-future quantum computing architecture. We propose a linear optical topological MBQC protocol employing multiphoton qubits based on the parity encoding. We show that our protocol is advantageous over several other existing approaches in terms of fault-tolerance, resource overhead, or feasibility of basic elements.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Measurement-based quantum computing (MBQC) in linear optical systems is promising for near-future quantum computing architecture. However, the nondeterministic nature of entangling operations and photon losses hinder the large-scale generation of graph states and introduce logical errors. In this work, we propose a linear optical topological MBQC protocol employing multiphoton qubits based on the parity encoding, which turns out to be highly photon-loss tolerant and resource-efficient even under the effects of nonideal entangling operations that unavoidably corrupt nearby qubits. For the realistic error analysis, we introduce a Bayesian methodology, in conjunction with the stabilizer formalism, to track errors caused by such detrimental effects. We additionally suggest a graph-theoretical optimization scheme for the process of constructing an arbitrary graph state, which greatly reduces its resource overhead. Notably, we show that our protocol is advantageous over several other existing approaches in terms of fault-tolerance, resource overhead, or feasibility of basic elements.

Related papers

• Single-shot and measurement-based quantum error correction via fault complexes [0.0]
  Photonics provides a viable path to a scalable fault-tolerant quantum computer. Foliation is the construction of fault-tolerant graph states. We introduce the fault complex, a representation of dynamic quantum error correction protocols.
  arXiv  Detail & Related papers  (2024-10-16T18:52:24Z)
• 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)
• 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)
• 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)
• Optimising graph codes for measurement-based loss tolerance [0.0]
  Graph codes play an important role in photonic quantum technologies as they provide protection against qubit loss. We develop methods to analyse and optimise measurement-based tolerance to qubit loss and computational errors for arbitrary graph codes.
  arXiv  Detail & Related papers  (2022-12-09T13:06:40Z)
• 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)
• Hardware-Efficient, Fault-Tolerant Quantum Computation with Rydberg Atoms [55.41644538483948]
  We provide the first complete characterization of sources of error in a neutral-atom quantum computer. We develop a novel and distinctly efficient method to address the most important errors associated with the decay of atomic qubits to states outside of the computational subspace. Our protocols can be implemented in the near-term using state-of-the-art neutral atom platforms with qubits encoded in both alkali and alkaline-earth atoms.
  arXiv  Detail & Related papers  (2021-05-27T23:29:53Z)
• Fault-tolerant quantum computation with static linear optics [0.0]
  In this work we propose a topologically error-corrected architecture that does away with these elements at no cost. Our computer consists of three modules: a 2D array of probabilistic sources of GKP states; a depth-four circuit of static beamsplitters, phase shifters, and single-time-step delay lines. The symmetry of our proposed circuit allows us to combine the effects of finite squeezing and uniform photon loss within the noise model, resulting in more comprehensive threshold estimates.
  arXiv  Detail & Related papers  (2021-04-07T16:43:34Z)
• Fusion-based quantum computation [43.642915252379815]
  Fusion-based quantum computing (FBQC) is a model of universal quantum computation in which entangling measurements, called fusions, are performed on qubits of small constant-sized entangled resource states. We introduce a stabilizer formalism for analyzing fault tolerance and computation in these schemes. This framework naturally captures the error structure that arises in certain physical systems for quantum computing, such as photonics.
  arXiv  Detail & Related papers  (2021-01-22T20:00:22Z)
• Boosting photonic quantum computation with moderate nonlinearity [0.0]
  Photonic measurement-based quantum computation (MBQC) is a promising route towards fault-tolerant universal quantum computing. A central challenge in this effort is the huge overhead in the resources required for the construction of large photonic clusters. Here we explore the prospects of using moderate nonlinearity to boost photonic quantum computing and significantly reduce its resources overhead.
  arXiv  Detail & Related papers  (2020-11-12T15:53:34Z)
• Rapid characterisation of linear-optical networks via PhaseLift [51.03305009278831]
  Integrated photonics offers great phase-stability and can rely on the large scale manufacturability provided by the semiconductor industry. New devices, based on such optical circuits, hold the promise of faster and energy-efficient computations in machine learning applications. We present a novel technique to reconstruct the transfer matrix of linear optical networks.
  arXiv  Detail & Related papers  (2020-10-01T16:04:22Z)

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.