Present advanced Quantum Computing paradigms and algorithms, as well as the main applications to PKI
Curriculum
teacher profile teaching materials
QC-P – Pure and non-pure states: states subject to noise, subject to interactions with the environment, or known only incompletely
QC-C – Quantum computing and cryptography: one-time pad; the EPR paradox; key distribution algorithms: BB84 and E91
QC-I – Towards a quantum internet: entanglement swapping, protocols, and equipment
Q-PE – Phase estimation: from Grover’s and Shor’s algorithms to counting
Q-AA – Advanced algorithmic techniques: quantum dynamic programming; divide and conquer; paths in a hypercube
Q-CC – Quantum complexity classes: randomized complexity; the Bounded-error Quantum Polynomial-time (BQP) class
Recommended texts (for reference only) are:
E. G. Rieffel, W. H. Polak, Quantum Computing: a Gentle Introduction, MIT Press
N. S. Yanofsky, M. A. Mannucci, Quantum Computing for Computer Scientists, Cambridge
S. Aaronson, Quantum Computing since Democritus, Cambridge
Programme
The program is structured as follows:QC-P – Pure and non-pure states: states subject to noise, subject to interactions with the environment, or known only incompletely
QC-C – Quantum computing and cryptography: one-time pad; the EPR paradox; key distribution algorithms: BB84 and E91
QC-I – Towards a quantum internet: entanglement swapping, protocols, and equipment
Q-PE – Phase estimation: from Grover’s and Shor’s algorithms to counting
Q-AA – Advanced algorithmic techniques: quantum dynamic programming; divide and conquer; paths in a hypercube
Q-CC – Quantum complexity classes: randomized complexity; the Bounded-error Quantum Polynomial-time (BQP) class
Prerequisiti
There are no specific prerequisites, other than having completed the first module on Quantum Computing.Core Documentation
Slides provided by the instructor.Recommended texts (for reference only) are:
E. G. Rieffel, W. H. Polak, Quantum Computing: a Gentle Introduction, MIT Press
N. S. Yanofsky, M. A. Mannucci, Quantum Computing for Computer Scientists, Cambridge
S. Aaronson, Quantum Computing since Democritus, Cambridge
Reference Bibliography
The recommended texts (for consultation only) are: E. G. Rieffel, W. H. Polak Quantum Computing: a Gentle Introduction MIT Press N. S. Yanofsky, M. A. Mannucci Quantum Computing for Computer Scientists CambridgeType of delivery of the course
Lecture in class.Attendance
Lecture in class.Type of evaluation
Written exam lasting about one hour. teacher profile teaching materials
Programme
QAOA, Quantum annealing, pure and non-pure states, quantum one-time-pad, BB84, E91, Quantum Internet, phase estimation, dynamic programming, path in the hypercubePrerequisiti
None.Core Documentation
Slides by the teacher.Reference Bibliography
The recommended texts (for consultation only) are: E. G. Rieffel, W. H. Polak Quantum Computing: a Gentle Introduction MIT Press N. S. Yanofsky, M. A. Mannucci Quantum Computing for Computer Scientists CambridgeType of delivery of the course
Lecture in class.Attendance
Lecture in class.Type of evaluation
Written exam lasting about one hour. teacher profile teaching materials
QC-P – Pure and non-pure states: states subject to noise, subject to interactions with the environment, or known only incompletely
QC-C – Quantum computing and cryptography: one-time pad; the EPR paradox; key distribution algorithms: BB84 and E91
QC-I – Towards a quantum internet: entanglement swapping, protocols, and equipment
Q-PE – Phase estimation: from Grover’s and Shor’s algorithms to counting
Q-AA – Advanced algorithmic techniques: quantum dynamic programming; divide and conquer; paths in a hypercube
Q-CC – Quantum complexity classes: randomized complexity; the Bounded-error Quantum Polynomial-time (BQP) class
Recommended texts (for reference only) are:
E. G. Rieffel, W. H. Polak, Quantum Computing: a Gentle Introduction, MIT Press
N. S. Yanofsky, M. A. Mannucci, Quantum Computing for Computer Scientists, Cambridge
S. Aaronson, Quantum Computing since Democritus, Cambridge
Programme
The program is structured as follows:QC-P – Pure and non-pure states: states subject to noise, subject to interactions with the environment, or known only incompletely
QC-C – Quantum computing and cryptography: one-time pad; the EPR paradox; key distribution algorithms: BB84 and E91
QC-I – Towards a quantum internet: entanglement swapping, protocols, and equipment
Q-PE – Phase estimation: from Grover’s and Shor’s algorithms to counting
Q-AA – Advanced algorithmic techniques: quantum dynamic programming; divide and conquer; paths in a hypercube
Q-CC – Quantum complexity classes: randomized complexity; the Bounded-error Quantum Polynomial-time (BQP) class
Prerequisiti
There are no specific prerequisites, other than having completed the first module on Quantum Computing.Core Documentation
Slides provided by the instructor.Recommended texts (for reference only) are:
E. G. Rieffel, W. H. Polak, Quantum Computing: a Gentle Introduction, MIT Press
N. S. Yanofsky, M. A. Mannucci, Quantum Computing for Computer Scientists, Cambridge
S. Aaronson, Quantum Computing since Democritus, Cambridge
Reference Bibliography
The recommended texts (for consultation only) are: E. G. Rieffel, W. H. Polak Quantum Computing: a Gentle Introduction MIT Press N. S. Yanofsky, M. A. Mannucci Quantum Computing for Computer Scientists CambridgeType of delivery of the course
Lecture in class.Attendance
Lecture in class.Type of evaluation
Written exam lasting about one hour. teacher profile teaching materials
Programme
QAOA, Quantum annealing, pure and non-pure states, quantum one-time-pad, BB84, E91, Quantum Internet, phase estimation, dynamic programming, path in the hypercubePrerequisiti
None.Core Documentation
Slides by the teacher.Reference Bibliography
The recommended texts (for consultation only) are: E. G. Rieffel, W. H. Polak Quantum Computing: a Gentle Introduction MIT Press N. S. Yanofsky, M. A. Mannucci Quantum Computing for Computer Scientists CambridgeType of delivery of the course
Lecture in class.Attendance
Lecture in class.Type of evaluation
Written exam lasting about one hour. teacher profile teaching materials
QC-P – Pure and non-pure states: states subject to noise, subject to interactions with the environment, or known only incompletely
QC-C – Quantum computing and cryptography: one-time pad; the EPR paradox; key distribution algorithms: BB84 and E91
QC-I – Towards a quantum internet: entanglement swapping, protocols, and equipment
Q-PE – Phase estimation: from Grover’s and Shor’s algorithms to counting
Q-AA – Advanced algorithmic techniques: quantum dynamic programming; divide and conquer; paths in a hypercube
Q-CC – Quantum complexity classes: randomized complexity; the Bounded-error Quantum Polynomial-time (BQP) class
Recommended texts (for reference only) are:
E. G. Rieffel, W. H. Polak, Quantum Computing: a Gentle Introduction, MIT Press
N. S. Yanofsky, M. A. Mannucci, Quantum Computing for Computer Scientists, Cambridge
S. Aaronson, Quantum Computing since Democritus, Cambridge
Mutuazione: 20830130-2 QUANTUM COMPUTING - II Modulo in Ingegneria informatica e dell'intelligenza artificiale LM-32 DI BATTISTA GIUSEPPE, DA LOZZO GIORDANO
Programme
The program is structured as follows:QC-P – Pure and non-pure states: states subject to noise, subject to interactions with the environment, or known only incompletely
QC-C – Quantum computing and cryptography: one-time pad; the EPR paradox; key distribution algorithms: BB84 and E91
QC-I – Towards a quantum internet: entanglement swapping, protocols, and equipment
Q-PE – Phase estimation: from Grover’s and Shor’s algorithms to counting
Q-AA – Advanced algorithmic techniques: quantum dynamic programming; divide and conquer; paths in a hypercube
Q-CC – Quantum complexity classes: randomized complexity; the Bounded-error Quantum Polynomial-time (BQP) class
Prerequisiti
There are no specific prerequisites, other than having completed the first module on Quantum Computing.Core Documentation
Slides provided by the instructor.Recommended texts (for reference only) are:
E. G. Rieffel, W. H. Polak, Quantum Computing: a Gentle Introduction, MIT Press
N. S. Yanofsky, M. A. Mannucci, Quantum Computing for Computer Scientists, Cambridge
S. Aaronson, Quantum Computing since Democritus, Cambridge
Reference Bibliography
The recommended texts (for consultation only) are: E. G. Rieffel, W. H. Polak Quantum Computing: a Gentle Introduction MIT Press N. S. Yanofsky, M. A. Mannucci Quantum Computing for Computer Scientists CambridgeType of delivery of the course
Lecture in class.Attendance
Lecture in class.Type of evaluation
Written exam lasting about one hour. teacher profile teaching materials
Mutuazione: 20830130-2 QUANTUM COMPUTING - II Modulo in Ingegneria informatica e dell'intelligenza artificiale LM-32 DI BATTISTA GIUSEPPE, DA LOZZO GIORDANO
Programme
QAOA, Quantum annealing, pure and non-pure states, quantum one-time-pad, BB84, E91, Quantum Internet, phase estimation, dynamic programming, path in the hypercubePrerequisiti
None.Core Documentation
Slides by the teacher.Reference Bibliography
The recommended texts (for consultation only) are: E. G. Rieffel, W. H. Polak Quantum Computing: a Gentle Introduction MIT Press N. S. Yanofsky, M. A. Mannucci Quantum Computing for Computer Scientists CambridgeType of delivery of the course
Lecture in class.Attendance
Lecture in class.Type of evaluation
Written exam lasting about one hour. teacher profile teaching materials
QC-P – Pure and non-pure states: states subject to noise, subject to interactions with the environment, or known only incompletely
QC-C – Quantum computing and cryptography: one-time pad; the EPR paradox; key distribution algorithms: BB84 and E91
QC-I – Towards a quantum internet: entanglement swapping, protocols, and equipment
Q-PE – Phase estimation: from Grover’s and Shor’s algorithms to counting
Q-AA – Advanced algorithmic techniques: quantum dynamic programming; divide and conquer; paths in a hypercube
Q-CC – Quantum complexity classes: randomized complexity; the Bounded-error Quantum Polynomial-time (BQP) class
Recommended texts (for reference only) are:
E. G. Rieffel, W. H. Polak, Quantum Computing: a Gentle Introduction, MIT Press
N. S. Yanofsky, M. A. Mannucci, Quantum Computing for Computer Scientists, Cambridge
S. Aaronson, Quantum Computing since Democritus, Cambridge
Programme
The program is structured as follows:QC-P – Pure and non-pure states: states subject to noise, subject to interactions with the environment, or known only incompletely
QC-C – Quantum computing and cryptography: one-time pad; the EPR paradox; key distribution algorithms: BB84 and E91
QC-I – Towards a quantum internet: entanglement swapping, protocols, and equipment
Q-PE – Phase estimation: from Grover’s and Shor’s algorithms to counting
Q-AA – Advanced algorithmic techniques: quantum dynamic programming; divide and conquer; paths in a hypercube
Q-CC – Quantum complexity classes: randomized complexity; the Bounded-error Quantum Polynomial-time (BQP) class
Prerequisiti
There are no specific prerequisites, other than having completed the first module on Quantum Computing.Core Documentation
Slides provided by the instructor.Recommended texts (for reference only) are:
E. G. Rieffel, W. H. Polak, Quantum Computing: a Gentle Introduction, MIT Press
N. S. Yanofsky, M. A. Mannucci, Quantum Computing for Computer Scientists, Cambridge
S. Aaronson, Quantum Computing since Democritus, Cambridge
Reference Bibliography
The recommended texts (for consultation only) are: E. G. Rieffel, W. H. Polak Quantum Computing: a Gentle Introduction MIT Press N. S. Yanofsky, M. A. Mannucci Quantum Computing for Computer Scientists CambridgeType of delivery of the course
Lecture in class.Attendance
Lecture in class.Type of evaluation
Written exam lasting about one hour. teacher profile teaching materials
Programme
QAOA, Quantum annealing, pure and non-pure states, quantum one-time-pad, BB84, E91, Quantum Internet, phase estimation, dynamic programming, path in the hypercubePrerequisiti
None.Core Documentation
Slides by the teacher.Reference Bibliography
The recommended texts (for consultation only) are: E. G. Rieffel, W. H. Polak Quantum Computing: a Gentle Introduction MIT Press N. S. Yanofsky, M. A. Mannucci Quantum Computing for Computer Scientists CambridgeType of delivery of the course
Lecture in class.Attendance
Lecture in class.Type of evaluation
Written exam lasting about one hour. teacher profile teaching materials
QC-P – Pure and non-pure states: states subject to noise, subject to interactions with the environment, or known only incompletely
QC-C – Quantum computing and cryptography: one-time pad; the EPR paradox; key distribution algorithms: BB84 and E91
QC-I – Towards a quantum internet: entanglement swapping, protocols, and equipment
Q-PE – Phase estimation: from Grover’s and Shor’s algorithms to counting
Q-AA – Advanced algorithmic techniques: quantum dynamic programming; divide and conquer; paths in a hypercube
Q-CC – Quantum complexity classes: randomized complexity; the Bounded-error Quantum Polynomial-time (BQP) class
Recommended texts (for reference only) are:
E. G. Rieffel, W. H. Polak, Quantum Computing: a Gentle Introduction, MIT Press
N. S. Yanofsky, M. A. Mannucci, Quantum Computing for Computer Scientists, Cambridge
S. Aaronson, Quantum Computing since Democritus, Cambridge
Mutuazione: 20830130-2 QUANTUM COMPUTING - II Modulo in Ingegneria informatica e dell'intelligenza artificiale LM-32 DI BATTISTA GIUSEPPE, DA LOZZO GIORDANO
Programme
The program is structured as follows:QC-P – Pure and non-pure states: states subject to noise, subject to interactions with the environment, or known only incompletely
QC-C – Quantum computing and cryptography: one-time pad; the EPR paradox; key distribution algorithms: BB84 and E91
QC-I – Towards a quantum internet: entanglement swapping, protocols, and equipment
Q-PE – Phase estimation: from Grover’s and Shor’s algorithms to counting
Q-AA – Advanced algorithmic techniques: quantum dynamic programming; divide and conquer; paths in a hypercube
Q-CC – Quantum complexity classes: randomized complexity; the Bounded-error Quantum Polynomial-time (BQP) class
Prerequisiti
There are no specific prerequisites, other than having completed the first module on Quantum Computing.Core Documentation
Slides provided by the instructor.Recommended texts (for reference only) are:
E. G. Rieffel, W. H. Polak, Quantum Computing: a Gentle Introduction, MIT Press
N. S. Yanofsky, M. A. Mannucci, Quantum Computing for Computer Scientists, Cambridge
S. Aaronson, Quantum Computing since Democritus, Cambridge
Reference Bibliography
The recommended texts (for consultation only) are: E. G. Rieffel, W. H. Polak Quantum Computing: a Gentle Introduction MIT Press N. S. Yanofsky, M. A. Mannucci Quantum Computing for Computer Scientists CambridgeType of delivery of the course
Lecture in class.Attendance
Lecture in class.Type of evaluation
Written exam lasting about one hour. teacher profile teaching materials
Mutuazione: 20830130-2 QUANTUM COMPUTING - II Modulo in Ingegneria informatica e dell'intelligenza artificiale LM-32 DI BATTISTA GIUSEPPE, DA LOZZO GIORDANO
Programme
QAOA, Quantum annealing, pure and non-pure states, quantum one-time-pad, BB84, E91, Quantum Internet, phase estimation, dynamic programming, path in the hypercubePrerequisiti
None.Core Documentation
Slides by the teacher.Reference Bibliography
The recommended texts (for consultation only) are: E. G. Rieffel, W. H. Polak Quantum Computing: a Gentle Introduction MIT Press N. S. Yanofsky, M. A. Mannucci Quantum Computing for Computer Scientists CambridgeType of delivery of the course
Lecture in class.Attendance
Lecture in class.Type of evaluation
Written exam lasting about one hour.