English
Related papers

Related papers: All-photonic one-way quantum repeaters

200 papers

We study the decoding problem for quantum Tanner codes and propose to exploit the underlying local code structure by grouping check nodes into more powerful generalized check nodes for enhanced iterative belief propagation (BP) decoding by…

Quantum Physics · Physics 2026-03-06 Olai Å. Mostad , Eirik Rosnes , Hsuan-Yin Lin

Quantum repeaters are a promising platform for realizing long-distance quantum communication and thus could form the backbone of a secure quantum internet, a scalable quantum network, or a distributed quantum computer. Repeater protocols…

Quantum Physics · Physics 2021-08-09 Kosuke Fukui , Rafael N. Alexander , Peter van Loock

A full-fledged quantum network relies on the formation of entangled links between remote location with the help of quantum repeaters. The famous Duan-Lukin-Cirac-Zoller quantum repeater protocol is based on long distance single-photon…

Quantum Physics · Physics 2024-11-27 Chen-Long Li. Hua-Lei Yin , Zeng-Bing Chen

We propose a quantum repeater for continuous variable (CV) quantum optical states. Our repeater relies on an error correction protocol for loss on CV states based on CV teleportation and entanglement distillation via noiseless linear…

Quantum Physics · Physics 2015-05-15 Josephine Dias , Tim Ralph

Quantum key distribution allows for the generation of a secret key between distant parties connected by a quantum channel such as optical fibre or free space. Unfortunately, the rate of generation of a secret key by direct transmission is…

Quantum low-density parity-check (qLDPC) codes can achieve high encoding rates and good code distance scaling, providing a promising route to low-overhead fault-tolerant quantum computing. However, the long-range connectivity required to…

We present an efficient architecture for quantum repeaters based on single-photon sources in combination with quantum memories for photons. Errors inherent to previous repeater protocols using photon-pair sources are eliminated, leading to…

One of the main problems in quantum communications is how to achieve high rates at long distances. Quantum repeaters, i.e., untrusted, intermediate relay stations, are necessary to overcome the repeaterless bound which sets the fundamental…

Quantum Physics · Physics 2021-05-11 Matthew S. Winnel , Joshua J. Guanzon , Nedasadat Hosseinidehaj , Timothy C. Ralph

Belief-propagation (BP) decoding for quantum low-density parity-check (QLDPC) codes is appealing due to its low complexity, yet it often exhibits convergence issues due to quantum degeneracy and short cycles that exist in the Tanner graph.…

Information Theory · Computer Science 2026-03-12 Mohsen Moradi , Vahid Nourozi , Salman Habib , David G. M. Mitchell

Quantum repeaters promise to deliver long-distance entanglement overcoming noise and loss in realistic quantum channels. A promising class of repeaters, based on atomic ensemble quantum memories and linear optics, follow the proposal by…

Quantum Physics · Physics 2010-04-05 Jonatan Bohr Brask , Anders Sondberg Sorensen

The recent success in constructing asymptotically good quantum low-density parity-check (QLDPC) codes makes this family of codes a promising candidate for error-correcting schemes in quantum computing. However, conventional belief…

Information Theory · Computer Science 2023-03-22 Sisi Miao , Alexander Schnerring , Haizheng Li , Laurent Schmalen

In quantum repeater protocols, measurements are performed in multiple relay points. Classical communications are used to convey the measurement results. It is important to improve the way of conveying the measurement results so that EPR…

Quantum Physics · Physics 2015-09-29 Kenichiro Furuta

Quantum repeaters - fundamental building blocks for long-distance quantum communication - are based on the interaction between photons and quantum memories. The photons must fulfil stringent requirements on central frequency, spectral…

Quantum Physics · Physics 2016-05-25 Benjamin Brecht , Kai-Hong Luo , Harald Herrmann , Christine Silberhorn

Quantum repeaters (QRs) provide a way of enabling long distance quantum communication by establishing entangled qubits between remote locations. We investigate a new approach to QRs in which quantum information can be faithfully transmitted…

Quantum low-density parity-check (QLDPC) codes offer a promising route to scalable fault-tolerant quantum computation, but their performance under iterative decoding is strongly influenced by short-cycle structure and other harmful…

Information Theory · Computer Science 2026-05-05 Anthony Gómez-Fonseca , Gretchen L. Matthews , Kirsten D. Morris , Tefjol Pllaha

Quantum error correction is the building block for constructing fault-tolerant quantum processors that can operate reliably even if its constituting elements are corrupted by decoherence. In this context, real-time decoding is a necessity…

Quantum Physics · Physics 2024-02-15 Antonio deMarti iOlius , Josu Etxezarreta Martinez

Quantum low-density parity-check (QLDPC) codes have emerged as a promising technique for quantum error correction. A variety of decoders have been proposed for QLDPC codes and many of them utilize belief propagation (BP) decoding in some…

Information Theory · Computer Science 2024-06-25 Hanwen Yao , Waleed Abu Laban , Christian Häger , Alexandre Graell i Amat , Henry D. Pfister

We study the implementation of quantum key distribution (QKD) systems over quantum repeater infrastructures. We particularly consider quantum repeaters with encoding and compare them with probabilistic quantum repeaters. To that end, we…

Quantum Physics · Physics 2021-04-21 Yumang Jing , Mohsen Razavi

We present a protocol of remote nondestructive parity measurement (RNPM) on a pair of quantum memories. The protocol works as a single module for key operations such as entanglement generation, Bell measurement, parity check measurement,…

Quantum Physics · Physics 2013-05-30 Koji Azuma , Hitoshi Takeda , Masato Koashi , Nobuyuki Imoto

We give a construction of Quantum Low-Density Parity Check (QLDPC) codes with near-optimal rate-distance tradeoff and efficient list decoding up to the Johnson bound in polynomial time. Previous constructions of list decodable good distance…

Information Theory · Computer Science 2024-11-08 Thiago Bergamaschi , Fernando Granha Jeronimo , Tushant Mittal , Shashank Srivastava , Madhur Tulsiani