Loss-tolerant all-photonic quantum repeater with generalized Shor code

• URL: http://arxiv.org/abs/2203.07979v1
• Date: Tue, 15 Mar 2022 15:12:15 GMT
• Title: Loss-tolerant all-photonic quantum repeater with generalized Shor code
• Authors: Rui Zhang, Li-Zheng Liu, Zheng-Da Li, Yue-Yang Fei, Xu-Fei Yin, Li Li, Nai-Le Liu, Yingqiu Mao, Yu-Ao Chen, and Jian-Wei Pan
• Abstract summary: The all-photonic quantum repeater (APQR) is a promising repeater scheme to realize long-distance quantum communication. We propose a new loss-tolerant scheme by applying the generalized Shor code to RGS. Our results make an essential step toward a practical APQR and enrich the research of quantum error correction code.
• Score: 7.509184607349881
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The all-photonic quantum repeater (APQR) is a promising repeater scheme to realize long-distance quantum communication. For a practical APQR, an indispensable requirement is the robustness of the repeater graph state (RGS) against photon loss. We propose a new loss-tolerant scheme by applying the generalized Shor code to RGS, which can be experimentally demonstrated with current technology. Experimentally, we first prepare and verify the nine-qubit Shor code. Then, by applying the generalized Shor code to APQR and preparing a simplified encoded RGS with the structure of $1\times2$ based on the Shor code state, the effectiveness of our loss-tolerant scheme and the loss tolerance of the encoded RGS are respectively verified. Our results make an essential step toward a practical APQR and enrich the research of quantum error correction code.

Related papers

• Fault-tolerant noise guessing decoding of quantum random codes [0.0]
  We present a new decoder for quantum random linear codes (QRLCs) capable of dealing with imperfect decoding operations. We analyze the fault-tolerant characteristics of QRLCs with a new noise-guessing decoding technique.
  arXiv  Detail & Related papers  (2024-07-01T17:54:23Z)
• An Improved Design for All-Photonic Quantum Repeaters [0.8409980020848168]
  All-photonic quantum repeaters use multi-qubit photonic graph states, called repeater graph states (RGS), instead of matter-based quantum memories. We propose a new RGS design, which achieves a higher entanglement rate for all-photonic quantum repeaters using fewer qubits. We also propose a new adaptive scheme to perform logical BSM on the link qubits for loss-only errors.
  arXiv  Detail & Related papers  (2024-05-20T03:57:55Z)
• Bit-flipping Decoder Failure Rate Estimation for (v,w)-regular Codes [84.0257274213152]
  We propose a new technique to provide accurate estimates of the DFR of a two-iterations (parallel) bit flipping decoder. We validate our results, providing comparisons of the modeled and simulated weight of the syndrome, incorrectly-guessed error bit distribution at the end of the first iteration, and two-itcrypteration Decoding Failure Rates (DFR)
  arXiv  Detail & Related papers  (2024-01-30T11:40:24Z)
• 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)
• Architecture and protocols for all-photonic quantum repeaters [0.49157446832511503]
  All-photonic quantum repeater scheme promises resilience to photon losses and operational errors. We propose a new emitter-photonic qubit building block and an RGS protocol that addresses several key considerations. Our proposed building block significantly reduces the total number of emissive quantum memories required for end nodes.
  arXiv  Detail & Related papers  (2023-06-06T15:08:50Z)
• Modular decoding: parallelizable real-time decoding for quantum computers [55.41644538483948]
  Real-time quantum computation will require decoding algorithms capable of extracting logical outcomes from a stream of data generated by noisy quantum hardware. We propose modular decoding, an approach capable of addressing this challenge with minimal additional communication and without sacrificing decoding accuracy. We introduce the edge-vertex decomposition, a concrete instance of modular decoding for lattice-surgery style fault-tolerant blocks.
  arXiv  Detail & Related papers  (2023-03-08T19:26:10Z)
• 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)
• All-photonic one-way quantum repeaters [15.3862808585761]
  We propose a general framework for all-photonic one-way quantum repeaters based on the measurement-based error correction. We present a novel decoding scheme, where the error correction process is carried out at the destination based on the accumulated data from the measurements made across the network.
  arXiv  Detail & Related papers  (2022-10-18T18:07:19Z)
• 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)
• All-Optical Long-Distance Quantum Communication with Gottesman-Kitaev-Preskill qubits [0.0]
  Quantum repeaters are a promising platform for realizing long-distance quantum communication. In this work, we consider implementing a quantum repeater protocol using Gottesman-Kitaev-Preskill qubits.
  arXiv  Detail & Related papers  (2020-11-30T15:14:34Z)

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.