Quantum networks use quantum communication protocols to transmit quantum information (or qubits) between distant quantum processors. This is needed to cope with the limitation regarding available and usable qubits characterizing available quantum processors and realize distributed quantum computing. Unlike classical networks, where information is duplicated and directly transmitted, quantum bits cannot be directly transmitted, so these networks leverage quantum mechanical principles, like entanglement, to enable secure and potentially faster communication. Current quantum networks are primarily research prototypes, and significant engineering challenges remain; reliability is among them. This paper is a tutorial on reliability issues and a simulation of the primary faults in quantum networks envisioned in the current network infrastructures.Quantum networks use quantum communication protocols to transmit quantum information (or qubits) between distant quantum processors. This is needed to cope with the limitation regarding available and usable qubits characterizing available quantum processors and realize distributed quantum computing. Unlike classical networks, where information is duplicated and directly transmitted, quantum bits cannot be directly transmitted, so these networks leverage quantum mechanical principles, like entanglement, to enable secure and potentially faster communication. Current quantum networks are primarily research prototypes, and significant engineering challenges remain; reliability is among them. This paper is a tutorial on reliability issues and a simulation of the primary faults in quantum networks envisioned in the current network infrastructures.

International Workshop on Resilient Networks Design and Modeling (RNDM)Nov 25, 20242 citations

Quantum Error-Correcting Codes Need Not Completely Reveal the Error Syndrome

Peter W. Shor, John A. Smolin

Quantum error-correcting codes so far proposed have not worked in the presence of noise which introduces more than one bit of entropy per qubit sent through a quantum channel, nor can any code which identifies the complete error syndrome. We describe a code which does not find the complete error syndrome and can be used for reliable transmission of quantum information through channels which add more than one bit of entropy per transmitted bit. In the case of the depolarizing channel our code can be used in a channel of fidelity .8096. The best existing code worked only down to .8107.Quantum error-correcting codes so far proposed have not worked in the presence of noise which introduces more than one bit of entropy per qubit sent through a quantum channel, nor can any code which identifies the complete error syndrome. We describe a code which does not find the complete error syndrome and can be used for reliable transmission of quantum information through channels which add more than one bit of entropy per transmitted bit. In the case of the depolarizing channel our code can be used in a channel of fidelity .8096. The best existing code worked only down to .8107.

arXiv:quant-ph/9604006Apr 8, 199671 citations

Which verification qubits perform best for secure communication in noisy channel?

Rishi Dutt Sharma, Kishore Thapliyal, Anirban Pathak +2 more

arXiv:1508.05237Quantum Information ProcessingDec 19, 201537 citations

Entanglement-Assisted Covert Communication via Qubit Depolarizing Channels

Elyakim Zlotnick, Boulat A. Bash, Uzi Pereg

We consider entanglement-assisted communication over the qubit depolarizing channel under the security requirement of covert communication, where not only the information is kept secret, but the transmission itself must be concealed from detection by an adversary. Previous work showed that $O(\sqrt n )$ information bits can be reliably and covertly transmitted in n channel uses without entanglement assistance. However, Gagatsos et al. (2020) showed that entanglement assistance can increase this scaling to $O(\sqrt n \log n)$ for continuous-variable bosonic channels. Here, we present a finite-dimensional parallel, and show that $O(\sqrt n \log n)$ covert bits can be transmitted reliably over n uses of a qubit depolarizing channel.We consider entanglement-assisted communication over the qubit depolarizing channel under the security requirement of covert communication, where not only the information is kept secret, but the transmission itself must be concealed from detection by an adversary. Previous work showed that $O(\sqrt n )$ information bits can be reliably and covertly transmitted in n channel uses without entanglement assistance. However, Gagatsos et al. (2020) showed that entanglement assistance can increase this scaling to $O(\sqrt n \log n)$ for continuous-variable bosonic channels. Here, we present a finite-dimensional parallel, and show that $O(\sqrt n \log n)$ covert bits can be transmitted reliably over n uses of a qubit depolarizing channel.

IEEE International Symposium on Information Theory (ISIT)Jun 25, 202311 citations

Computational Complexity of Optimally Encoding a Qubit

Idris Delsol, Omar Fawzi, Akshay Ramachandran

IEEE International Symposium on Information Theory (ISIT)Jun 1, 20260 citations

O(\sqrt n )

information bits can be reliably and covertly transmitted in n channel uses without entanglement assistance. However, Gagatsos et al. (2020) showed that entanglement assistance can increase this scaling to

O(\sqrt n \log n)

for continuous-variable bosonic channels. Here, we present a finite-dimensional parallel, and show that

O(\sqrt n \log n)

covert bits can be transmitted reliably over n uses of a qubit depolarizing channel.