You are on page 1of 37

The Rise of the

Quantum Internet
Daryus Chandra, PhD
Postdoctoral Research Fellow

Next-Generation Wireless Research Group


School of Electronics and Computer Science
University of Southampton, UK

Quantum Internet Research Group


Dept. of Electrical Engineering and Information Technology
University of Naples Federico II, Italy
d.chandra@soton.ac.uk
“The Rise of the Quantum Internet”

M. Caleffi, D. Chandra, D. Cuomo, S. Hassanpour, A. S. Cacciapuoti,


“The rise of the Quantum Internet”, IEEE Computer, vol. 53, no. 6, pp.
67-72, 2020.

https://www.quantuminternet.it
“Rebooting Classical Communication”

IEEE Technical Committee on Cognitive Networks (TCCN) Newsletter, vol. 6, no. 1, June 2020.
https://cn.committees.comsoc.org/communications
Jangan lewatkan “Quantumania”!
Let’s start our
quantum quest!
Quantum Race

https://www.qureca.com/overview-on-quantum-initiatives-worldwide (last update: 22/01/2021)


“Quantum” is the new “Buzzword”

• Quantum Blockchain (?)


• Quantum Deep Learning (?)
• Quantum Movie (?)
• Quantum Internet (?)
• Quantum Robotics (?)

• Quantum Superposition or Quantum Superstition


https://www.ibm.com/quantum-computing
https://www.ibm.com/blogs/research/2020/09/ibm-quantum-roadmap
F. Arute, K. Arya, R. Babbush, D. Bacon, J. C. Bardin, R. Barends, R. Biswas et al, “Quantum supremacy using a
programmable superconducting processor,” Nature, vol. 574, no. 7779, pp. 505-510, 2019.
https://ai.googleblog.com/2018/03/a-preview-of-bristlecone-googles-new.html
https://ai.googleblog.com/2019/10/quantum-supremacy-using-programmable.html
Why “Quantum”?
Multiplication is easy, but undoing multiplication is hard

Example: axb=
Perlajuan 57562913650518811
Kuantum 90300360562197368
Quantum 12 x 43 = 20363
Speed-up

3981 x 8347 = Find a and b given


that a and b are
54632747 x prime numbers!
18276354 =
Perlajuan
Kuantum

Quantum
Speed-up

R. V. Meter, K. M. Itoh, T. D. Ladd, “Architecture-dependent execution time of Shor's algorithm,” Controllable Quantum
States: Mesoscopic Superconductivity and Spintronics, pp. 183-188, 2008.
”Caffeine, with 24 atoms, can exist in 1048 distinct
quantum states, i.e., configurations of those atoms.
That means that for a classical computer to perfectly
represent caffeine, it would require 1048 bits — close
to the number of atoms in the entire Earth (1049 -
1050). A 1-gigabyte memory chip has about 109 bits.
… With a quantum system, if it were a very robust,
fault-tolerant quantum system, you could do it with
Perlajuan
only 160 qubits.”
Kuantum
- Robert Sutor, IBM
Quantum
Speed-up
“… Modeling the structure of a molecule of an everyday drug such as penicillin,
which has 41 atoms at ground state, requires a classical computer with some 1086
bits — more transistors than there are atoms in the observable universe. … But for
quantum computers, this type of simulation is well within the realm of possibility,
requiring a processor with 286 qubits.”

- Boston Consulting Group (BCG), “Where Will Quantum Computers Create Value
and When? ”
Hukum
Moore

Moore’s
Law
Fenomena-fenomena Quantum

• Double slit experiment


• →Particle is a wave

• Photoelectric effects
• →Wave is a particle

• Quantum tunnelling ~5nm


• The most advanced transistor → 7nm
Fenomena-fenomena
Quantum

• Quantum tunnelling ~5nm


• The most advanced
transistor → 7nm

• Photoelectric effects
• →Wave is a particle

• Double slit experiment


• →Particle is a wave
Fenomena-fenomena
Quantum

• Double slit experiment


• →Particle is a wave

• Photoelectric effects
• →Wave is a particle

• Quantum tunnelling
~5nm
• The most advanced
transistor → 7nm
Quantum Communication Quantum Computing

Quantum
… and potentially many more
Technologies

Quantum Metrology Quantum Control


Internet Kuantum:
Hasil persilangan antara Komputasi
Kuantum dan Komunikasi Kuantum.
Komputasi Kuantum:
Pengantar (sangat) singkat
Informasi Klasikal Informasi Kuantum

c = {0, 1}
Informasi
Klasikal
vs. • Bit klasikal hanya dapat memiliki • Bit kuantum (Quantum Bit, Qubit)
Informasi nilai “0” dan “1” pada satu waktu. dapat memiliki nilai “0” dan “1” di
Kuantum saat yang bersamaan.

• Keadaan “nyala” atau “mati” pada


transistor. • Sifat: Superposisi.

• Polarisasi photon, bilangan spin


electron.
Informasi Klasikal Informasi Kuantum

Informasi
Klasikal
vs. “0”
Informasi
Kuantum

“1”

Youtube: Kurzgesagt – In a Nutshell


Komputasi
Klasikal
vs.
Komputasi
Kuantum
Komunikasi Kuantum:
Pengantar singkat (lagi)
Secure Classical Communication: One Time Pad

Secret key sharing 1/Secure channel

Encrypted message/Public channel

Secret key sharing 1/Secure channel

Encrypted message/Public channel

.
.
• Absolute secure
. • Highly impractical for implementation
Secure Classical Communication:
Symmetric and Asymmetric Key

Secret key sharing/Secure channel

Encrypted message/Public channel

Encrypted message/Public channel

Encrypted message/Public channel

.
.
. • Secure under assumption
• More practical for implementation
Quantum Key Distribution
(Tackling the unpracticality of one-time pad)

Classical Communication Channel

Quantum Channel

Classical Channel
.
.
.
Example
Komunikasi Quantum
■ No-Cloning Theorem. (?)

■ Observasi meruntuhkan
superposisi.

■ Sistem komunikasi kuantum


yang memiliki keamanan
yang absolut.

■ Quantum Key
Distribution, Quantum
Superdense Coding

Classical
Komunikasi Quantum
■ No-Cloning Theorem. (?)

■ Observasi meruntuhkan
superposisi.

■ Sistem komunikasi kuantum


yang memiliki keamanan
yang absolut.

■ Quantum Key
Distribution, Quantum
Superdense Coding
Quantum
Quantum Internet
Bahan Bacaan Lanjutan
■ Introduction to Quantum Computing and Quantum Hardware by IBM.
https://qiskit.org/learn/intro-qc-qh

■ Z. Babar, D. Chandra, H. V. Nguyen, P. Botsinis, D. Alanis, S. X. Ng, and L. Hanzo,


“Duality of Quantum and Classical Error Correction Codes: Design Principles and
Examples,” IEEE Communications Surveys & Tutorials, vol. 21, no. 1, pp. 970–1010,
2019. DOI: 10.1109/COMST.2018.2861361.

■ P. Botsinis, D. Alanis, Z. Babar, H. V. Nguyen, D. Chandra, S. X. Ng, and L. Hanzo,,


“Quantum Algorithms for Wireless Communications,” IEEE Communications Surveys
& Tutorials, vol. 21, no. 2, pp. 1209–1242, 2019. DOI:
10.1109/COMST.2018.2882385.
Terima kasih!
Ada pertanyaan?
d.chandra@soton.ac.uk
Twitter: @DaryusChandra, @ChandraDaryus

Are you ready to go quantum?


The answer is both yes and no.
“The most ambitious crossover event in history”
Marvel fan:
“The most ambitious crossover event in history”
Me:

You might also like