Related papers: All-photonic one-way quantum repeaters
Long-distance quantum communication requires quantum repeaters to overcome photon loss in optical fibers. Here we demonstrate a repeater node with two memory atoms in an optical cavity. Both atoms are individually and repeatedly entangled…
Quantum low-density parity-check (qLDPC) codes are promising candidates for fault-tolerant quantum computation due to their high encoding rates and distances. However, implementing logical operations using qLDPC codes presents significant…
We propose a method for constructing quantum error-correcting codes based on non-binary low-density parity-check codes with Tanner graph girth 16. While conventional constructions using circulant permutation matrices are limited to girth…
Quantum network applications like distributed quantum computing and quantum secret sharing present a promising future network equipped with quantum resources. Entanglement generation and distribution over long distances is critical and…
The ultimate goal of quantum error correction is to create logical qubits with very low error rates (e.g. 1e-12) and assemble them into large-scale quantum computers capable of performing many (e.g. billions) of logical gates on many (e.g.…
Developing and deploying advanced Quantum Repeater (QR) technologies will be necessary to scale quantum networks to longer distances. Depending on the error mitigation mechanisms adopted to suppress loss and errors, QRs are typically…
We propose a post-selection technique, based on quantum error detection, for quantum key distribution (QKD) systems that run over quantum repeaters with encoding. In such repeaters, quantum error correction techniques are used for…
Post-selection strategies that discard low-confidence computational results can significantly improve the effective fidelity of quantum error correction at the cost of reduced acceptance rates, which can be particularly useful for offline…
We propose a scheme for performing quantum key distribution (QKD) which has the potential to beat schemes based on the direct transmission of photons between the communicating parties. In our proposal, the communicating parties exchange…
Fault-tolerant quantum computation critically depends on architectures uniting high encoding rates with physical implementability. Quantum low-density parity-check (qLDPC) codes, including bivariate bicycle (BB) codes, achieve dramatic…
Quantum repeaters promise to enable quantum networks over global distances by circumventing the exponential decrease in success probability inherent in direct photon transmission. We propose a realistic, functionally integrated quantum…
Major obstacles against efficient long distance quantum communication are photon losses during transmission and the probabilistic nature of Bell measurement causing exponential scaling in time and resource with distance. To overcome these…
In this chapter a quantum communication protocol with use of repeaters is presented. The protocol is constructed for qudits i.e. the generalized quantum information units. One-dit teleportation is based on the generalized Pauli-Z…
Quantum repeaters are nodes in a quantum communication network that allow reliable transmission of entanglement over large distances. It was recently shown that highly entangled photons in so-called graph states can be used for all-photonic…
The field of quantum communications promises the faithful distribution of quantum information, quantum entanglement, and absolutely secret keys. However, the highest rates of these tasks are fundamentally limited by the transmission…
Quantum computing requires effective error correction strategies to mitigate noise and decoherence. Quantum Low-Density Parity-Check (QLDPC) codes have emerged as a promising solution for scalable Quantum Error Correction (QEC) applications…
We describe a quantum repeater protocol for long-distance quantum communication. In this scheme, entanglement is created between qubits at intermediate stations of the channel by using a weak dispersive light-matter interaction and…
Quantum low-density parity-check (QLDPC) codes offer a promising path to low-overhead fault-tolerant quantum computation but lack systematic strategies for exploration. In this Letter, we establish a topological framework for studying the…
Quantum repeaters with multiple quantum memories provide high throughput, low latency, and high fidelity quantum state (qubit) transfer over long distances. However, conventional quantum repeater protocols require full connections among the…
Generalized low-density parity-check (GLDPC) codes, where single parity-check constraints on the code bits are replaced with generalized constraints (an arbitrary linear code), are a promising class of codes for low-latency communication.…