Introduction to Quantum Communications, Networks and Sensing

Ömer Rasim Kınacı 21045

07.05.2022
Abstract
The talk in ”Introduction to Quantum Communications, Networking,
and Sensing” presents some communication models derived from quantum
principles and shows how these models bring more excellent facilities to
the classical networks. There is a need for developing new efficient com-
munication ways for the integrated circuits built on the Von Neumann
architecture in the industry. Because, as also stated by Moore’s law, as
components have a half size, the complexity of the chip gets doubled. One
way of this trend, also expected to be integrated into the newer genera-
tions, is quantum designing of communication networks.

1 Introduction
The interest in quantum communica- to that, the no-cloning theorem for
tions arises from the idea that trans- quantum states enables perfect secu-
mitting the information using qubits rity for communication because there
rather than classical bits can provide is no way for an eavesdropper to clone
better computing power for transduc- a quantum state. However, the no-
ers, better data rates, and less com- cloning theorem also poses a problem
plexity for a communication model. in how one can construct a memory
Better computing power stems from for the quantum states. The quantum
the principle of parallelism between teleportation model aims to relieve
quantum states of multiple particles. that issue to some extent. One main
It is a case that the number n of quan- difference between quantum physics
tum particles can handle O(23n ) num- and classical physics is omitting the
ber of computer operations. With this locality principle, which states that
new computing power, NP-hard prob- actions happening in a place can af-
lems can be translated to O(n) or O(1) fect only the states of its neighbors.
complexities. As a more surprising Such excluding originate the notion
case, the RSA algorithm, widely used of entanglement, which is expressed
in the finance world, can be broken as that among a group of particles
by the quantum Shor algorithm. The sharing spatial proximity, each one’s
superposition principle allows a qubit quantum state cannot be described in-
to convey two possible states of a piece dependently of the state of the others,
of data or information compared to even if particles share a long distance.
one state of data for a single classi- Generally, the Bell states are the best-
cal qubit. The dense coding example known entangled quantum states used
shows such better rate of transmit- in many quantum algorithms. These
ted data. The quantum permutation algorithms also include the measure-
algorithm [1] is an example of a less ment operation, which acts as a re-
complex circuit needed for solving the verse entangler. In other words, the
parity of a permutation. In addition entanglement of a single qubit state

1
defined on a basis set creates multi- pair. The process can be visualized as
ple qubit states defined on the same
basis set. Conversely, the measure-
ment operation collapses these mul-
tiple qubit states into a single qubit
state defined on the same basis set.
Embedding information to those en-
tangled states and then using measure-
ment can effectively solve the commu-
nication systems. For example, quan-
Through swapping entangled pairs, we
tum teleportation transfers a quan-
can connect two users separated by a
tum state from one place to another
greater distance without the need for
rather than cloning it. The schematic
an intermediate router. Also seen from
below [2] includes an entangler cir-
the figure, swapping reduces the num-
cuit formed by cascaded CNOT and
ber of communication links to connect
Hadamard gates, the measurement op-
Alice and David. For four users, six
eration, and a single qubit gate at last.
classical links to connect each two of
them can be reduced to 4 quantum
links via Bell states [4]. This pro-
cess would have a wide application in
communication networks. In addition
β00 is a Bell state and may be con- to that, the dense coding in quan-
verted to another Bell state by the tum communication aims to send two
entangler depending on the initial mes- qubits of information by a single pho-
sage |ψ >, which controls the CNOT ton. In that case, the Bell state |β00 >
gate. After the transmitter does the in the quantum teleportation figure
Bell measurement after the entangle- above is used to send two qubits. The
ment phase, the resulting Bell state procedure resembles the inverse oper-
is sent to the receiver via a classi- ation of quantum teleportation: Alice
cal communication channel. Finally, holds the first qubit, and David has
the receiver may apply single-qubit the second qubit. Alice may apply
gates to recover the initial message single-qubit gates to her gates depend-
|ψ > depending on the measured Bell ing on what she wants to send. David
state. This process is an alternative surely receives one state in the Bell
to cloning the quantum state but is state basis. Then he applies the entan-
limited by the classical speed of light. gler to that state. It should be noted
Additionally, there is a demonstration that, since the quantum operations are
of quantum teleportation held between unitary, entangling an entangled state
the Canary Island, La Palma, and gives an unentangled single state, like
Tenefires over both quantum and clas- |00 >, in the case of decoding Bell
sical 143 km free-space channels [3]. states. David recovers Alice’s message
The Bell states are also used in quan- by measuring the unentangled state.
tum entanglement swapping, which The quantum-classic communications
aims to swap a partner in an entan- include sending the classic information
gled pair into one in another entangled by quantum links. The scheme is the

2
same as previous quantum communi- this experiment |α > can be given as
cation models: a classical resource gen-
erates an initial message, encodes it by
a quantum encoder (like the entan-
gler), and transmits it via a quantum The outcome of the measurement of
channel. The receiver side may apply the output state is a Poisson random
a quantum decoder and recovers the variable with the mean |α|2 . Also, the
initial message by measuring it. The inner product of two coherent states is
interesting point here is that quantum another Poisson random variable with
measurement plays the same role as mean |α|2 + |β|2 .
the signal detection on the receiver
side in classical communications, and
they both work in the same manner. 2 Open Challenges
The detection of the receiving signal
is determined by choosing the closest The quantum communication models
basis in a relative constellation model, have been proposed for a few decades,
which partitions the observation space however, they will bring many facili-
among the basis vectors. Similarly, ties to our communication networks, as
after the quantum measurement, the discussed before. Nevertheless, there
decision is made by determining which still are many challenges in the quan-
element in the basis set is most likely tum communication models. The most
to match the measured state. It should famous one is the no-cloning theorem
also be noted that the probability of which brings perfect security, however,
error is much lower in quantum mod- it makes it impossible to construct
ulation schemes than in classical ones. quantum memory. Another difficulty
Another interesting finding is that the arises from the no-broadcasting theo-
distribution of the fock states of a co- rem [5], a corollary of the no-cloning
herent laser sending through a crys- theorem, which prevents quantum in-
tal follows a Poisson distribution. It formation from being transmitted to
counts the number of photons defected more than a single destination. This
from the crystal. The output state of prevention is a fundamental difference
compared with the classical networks.

3 References
[1] Computational speed-up with a single qudit, Z. Gedik, I. A. Silva, B. Çakmak, G. Karpat, E. L.
G. Vidoto, D. O. Soares-Pinto, E. R. de Azevedo, and F. F. Fanchini, Scientific Reports 5, 14671
(2015)
[2] Ivan Djordjevic, Quantum Information Processing and Quantum Error Correction, 2012.
[3] X-S Ma, et al. Quantum Teleportation over 143 kilometers using active feed-forward, Nature,
2012.
[4] Claudio Cicconetti(CNR, Italy), Marco Conti(CNR, Italy), Andrea Passarella(CNR, Italy),
Resource Allocation in Quantum Networks for Distributed Quantum Computing, Mar 11, 2022, 8
pages, e-Print: 2203.05844 [quant-ph]
[5]Cacciapuoti, Angela Sara and Caleffi, Marcello and Tafuri, F. and Cataliotti, Francesco and
Gherardini, Stefano and Bianchi, Giuseppe. (2019). Quantum Internet: Networking Challenges in
Distributed Quantum Computing. IEEE Network. PP. 1-7. 10.1109/MNET.001.1900092.