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.
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(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(nlogn) for continuous-variable bosonic channels. Here, we present a finite-dimensional parallel, and show that O(nlogn) 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 the transmission itself must be concealed from detection by an adversary. Previous work showed thatO(n)information bits can be reliably and covertly transmitted innchannel uses without entanglement assistance. However, Gagatsos et al. (2020) showed that entanglement assistance can increase this scaling toO(nlogn)for continuous-variable bosonic channels. Here, we present a finite-dimensional parallel, and show thatO(nlogn)covert bits can be transmitted reliably overnuses of a qubit depolarizing channel. The coding scheme employs “weakly” entangled states such that their squared amplitude scales asO(1/n).