Related papers: Loss-tolerant all-photonic quantum repeater with g…
We present a detailed analysis of a new robust quantum repeater architecture building on the original DLCZ protocol [L.M. Duan \textit{et al.}, Nature (London) \textbf{414}, 413 (2001)]. The new architecture is based on two-photon…
Quantum computers have the potential to perform computational tasks beyond the reach of classical machines. A prominent example is Shor's algorithm for integer factorization and discrete logarithms, which is of both fundamental importance…
Cat qubits provide appealing building blocks for quantum computing. They exhibit a tunable noise bias yielding an exponential suppression of bit flips with the average photon number and a protection against the remaining phase errors can be…
Quantum repeaters hold the promise to prevent the photon losses in communication channels. Most recently, the serious efforts have been applied to achieve scalable distribution of entanglement over long distances. However, the probabilistic…
Quantum repeaters enable the generation of reliable entanglement across long distances despite the underlying channel noise. Nevertheless, realizing quantum repeaters poses a difficult engineering challenge due to various device constraints…
General purpose quantum computers can, in principle, entangle a number of noisy physical qubits to realise composite qubits protected against errors. Architectures for measurement-based quantum computing intrinsically support…
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…
The constituent parts of a quantum computer are inherently vulnerable to errors. To this end we have developed quantum error-correcting codes to protect quantum information from noise. However, discovering codes that are capable of a…
The distribution of quantum states over long distances is limited by photon loss. Straightforward amplification as in classical telecommunications is not an option in quantum communication because of the no-cloning theorem. This problem…
Extensive quantum error correction is necessary in order to perform a useful computation on a noisy quantum computer. Moreover, quantum error correction must be implemented based on imperfect parity check measurements that may return…
Rydberg atomic quantum receivers (RAQRs) offer quantum-limited sensitivity and broadband tunability. It is not obvious whether this device-level advantage also improves network reliability, since in dense deployments, aggregate interference…
It has been proven in the literature that the main technological factors limiting the communication rates of quantum cryptography systems by single photon are mainly related to the choice of the encoding method. In fact, the efficiency of…
In this paper, a joint cross-layer design of adaptive modulation and coding (AMC) and cooperative automatic repeat request (C-ARQ) scheme is proposed for a secondary user in a shared-spectrum environment. First, based on the statistical…
When photons are sent through a fiber as part of a quantum communication protocol, the error that is most difficult to correct is photon loss. Here, we propose and analyze a two-to-four qubit encoding scheme, which can recover the loss of…
We introduce a fault-tolerant protocol for code concatenation of a generalized Shor code using a butterfly network architecture with high noise thresholds and low ancilla overhead to allow implementation on current devices. We develop a…
Quantum error correction is indispensable to achieving reliable quantum computation. When quantum information is encoded redundantly, a larger Hilbert space is constructed using multiple physical qubits, and the computation is performed…
Post Quantum and Quantum Cryptography schemes are feasible quantum computer applications for 7G networks. These schemes could possibly replace existing schemes. These algorithms have been compromised by advances in quantum search algorithms…
This paper presents a fault-tolerant algorithm for the QR factorization of general matrices. It relies on the communication-avoiding algorithm, and uses the structure of the reduction of each part of the computation to introduce…
The advent of quantum computing poses a profound threat to traditional cryptographic systems, exposing vulnerabilities that compromise the security of digital communication channels reliant on RSA, ECC, and similar classical encryption…
The Gottesman-Kitaev-Preskill (GKP) code offers the possibility to encode higher-dimensional qudits into individual bosonic modes with, for instance, photonic excitations. Since photons enable the reliable transmission of quantum…