INQNET seminars

From Quantum Cryptography to Quantum Networks passing through Quantum Error Correction

by Nicolò Lo Piparo (National Institite of Informatics, Japan)

Zoom (Only)




Special time 15:30 PT Zoom Only 

Quantum cryptography, quantum error correction, and quantum networks can drastically change the way we communicate in the near future. However, their practical implementation is still far from being reached although several attempts have been made. One of the obstacles comes from the big amount of physical resources required to achieve some tasks, such as distributing high fidelity entangled pairs over long distances, increasing the rate of communication, and maintaining a certain level of security. In this talk I will show how we address this issue by applying the quantum multiplexing technique, a novel method that exploits the degrees of a photon to increase the number of qubits carried. I will explain how quantum multiplexing allows to greatly reduce the number of qubits, photons and number of gates when applied to a quantum error correction code. Moreover, I will describe the advantages of combining quantum multiplexing with the quantum aggregation technique for a quantum error correction code. I will finally discuss how quantum multiplexing could potentially be applied to a quantum network system in which the number of qubits increases exponentially with the distance between the nodes of the network.


Topic: INQNET research seminar 
Time: Aug 8, 2022 03:30 PM Pacific Time (US and Canada)

Join Zoom Meeting

Meeting ID: 853 7188 5249
One tap mobile
+16699006833,,85371885249# US (San Jose)
+12133388477,,85371885249# US (Los Angeles)

Dial by your location
        +1 669 900 6833 US (San Jose)
        +1 213 338 8477 US (Los Angeles)
        +1 346 248 7799 US (Houston)
        +1 301 715 8592 US (Washington DC)
        +1 312 626 6799 US (Chicago)
        +1 646 558 8656 US (New York)
Meeting ID: 853 7188 5249
Find your local number:

Organized by

Raju Valivarthi, Anthony LaTorre, Neil Sinclair