Present advanced Quantum Computing paradigms and algorithms, as well as the main applications to PKI
Curriculum
teacher profile teaching materials
QC-EB – Basic Elements: fundamental concepts of quantum computing, including an introduction to qubits, qubit registers, and operators acting on qubits; simple algorithmic applications; and information transmission techniques.
QC-SH – Shor: Shor’s algorithm for integer factorization.
QC-GR – Grover: Grover’s algorithm for searching for an item within a set.
QC-AP – Applications: perspectives on experimenting with quantum computing; the Bloch sphere; measurements and observables; simulating the behavior of quantum circuits; the Quantum Approximate Optimization Algorithm (QAOA); and quantum annealing—a quantum paradigm alternative to the circuit-based model.
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-EB – Basic Elements: fundamental concepts of quantum computing, including an introduction to qubits, qubit registers, and operators acting on qubits; simple algorithmic applications; and information transmission techniques.
QC-SH – Shor: Shor’s algorithm for integer factorization.
QC-GR – Grover: Grover’s algorithm for searching for an item within a set.
QC-AP – Applications: perspectives on experimenting with quantum computing; the Bloch sphere; measurements and observables; simulating the behavior of quantum circuits; the Quantum Approximate Optimization Algorithm (QAOA); and quantum annealing—a quantum paradigm alternative to the circuit-based model.
Prerequisiti
None.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
Type of delivery of the course
Lecture in class.Attendance
Lecture in class.Type of evaluation
The exam consists of a written test lasting approximately one hour. Students may also carry out a small project, using a quantum computer made available free of charge by the company D-Wave. teacher profile teaching materials
QC-EB – Basic Elements: fundamental concepts of quantum computing, including an introduction to qubits, qubit registers, and operators acting on qubits; simple algorithmic applications; and information transmission techniques.
QC-SH – Shor: Shor’s algorithm for integer factorization.
QC-GR – Grover: Grover’s algorithm for searching for an item within a set.
QC-AP – Applications: perspectives on experimenting with quantum computing; the Bloch sphere; measurements and observables; simulating the behavior of quantum circuits; the Quantum Approximate Optimization Algorithm (QAOA); and quantum annealing—a quantum paradigm alternative to the circuit-based model.
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-EB – Basic Elements: fundamental concepts of quantum computing, including an introduction to qubits, qubit registers, and operators acting on qubits; simple algorithmic applications; and information transmission techniques.
QC-SH – Shor: Shor’s algorithm for integer factorization.
QC-GR – Grover: Grover’s algorithm for searching for an item within a set.
QC-AP – Applications: perspectives on experimenting with quantum computing; the Bloch sphere; measurements and observables; simulating the behavior of quantum circuits; the Quantum Approximate Optimization Algorithm (QAOA); and quantum annealing—a quantum paradigm alternative to the circuit-based model.
Prerequisiti
None.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
Type of delivery of the course
Lecture in class.Attendance
Lecture in class.Type of evaluation
The exam consists of a written test lasting approximately one hour. Students may also carry out a small project, using a quantum computer made available free of charge by the company D-Wave. teacher profile teaching materials
QC-EB – Basic Elements: fundamental concepts of quantum computing, including an introduction to qubits, qubit registers, and operators acting on qubits; simple algorithmic applications; and information transmission techniques.
QC-SH – Shor: Shor’s algorithm for integer factorization.
QC-GR – Grover: Grover’s algorithm for searching for an item within a set.
QC-AP – Applications: perspectives on experimenting with quantum computing; the Bloch sphere; measurements and observables; simulating the behavior of quantum circuits; the Quantum Approximate Optimization Algorithm (QAOA); and quantum annealing—a quantum paradigm alternative to the circuit-based model.
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-1 QUANTUM COMPUTING - I Modulo in Ingegneria informatica e dell'intelligenza artificiale LM-32 DI BATTISTA GIUSEPPE
Programme
The program is structured as follows:QC-EB – Basic Elements: fundamental concepts of quantum computing, including an introduction to qubits, qubit registers, and operators acting on qubits; simple algorithmic applications; and information transmission techniques.
QC-SH – Shor: Shor’s algorithm for integer factorization.
QC-GR – Grover: Grover’s algorithm for searching for an item within a set.
QC-AP – Applications: perspectives on experimenting with quantum computing; the Bloch sphere; measurements and observables; simulating the behavior of quantum circuits; the Quantum Approximate Optimization Algorithm (QAOA); and quantum annealing—a quantum paradigm alternative to the circuit-based model.
Prerequisiti
None.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
Type of delivery of the course
Lecture in class.Attendance
Lecture in class.Type of evaluation
The exam consists of a written test lasting approximately one hour. Students may also carry out a small project, using a quantum computer made available free of charge by the company D-Wave. teacher profile teaching materials
QC-EB – Basic Elements: fundamental concepts of quantum computing, including an introduction to qubits, qubit registers, and operators acting on qubits; simple algorithmic applications; and information transmission techniques.
QC-SH – Shor: Shor’s algorithm for integer factorization.
QC-GR – Grover: Grover’s algorithm for searching for an item within a set.
QC-AP – Applications: perspectives on experimenting with quantum computing; the Bloch sphere; measurements and observables; simulating the behavior of quantum circuits; the Quantum Approximate Optimization Algorithm (QAOA); and quantum annealing—a quantum paradigm alternative to the circuit-based model.
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-EB – Basic Elements: fundamental concepts of quantum computing, including an introduction to qubits, qubit registers, and operators acting on qubits; simple algorithmic applications; and information transmission techniques.
QC-SH – Shor: Shor’s algorithm for integer factorization.
QC-GR – Grover: Grover’s algorithm for searching for an item within a set.
QC-AP – Applications: perspectives on experimenting with quantum computing; the Bloch sphere; measurements and observables; simulating the behavior of quantum circuits; the Quantum Approximate Optimization Algorithm (QAOA); and quantum annealing—a quantum paradigm alternative to the circuit-based model.
Prerequisiti
None.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
Type of delivery of the course
Lecture in class.Attendance
Lecture in class.Type of evaluation
The exam consists of a written test lasting approximately one hour. Students may also carry out a small project, using a quantum computer made available free of charge by the company D-Wave. teacher profile teaching materials
QC-EB – Basic Elements: fundamental concepts of quantum computing, including an introduction to qubits, qubit registers, and operators acting on qubits; simple algorithmic applications; and information transmission techniques.
QC-SH – Shor: Shor’s algorithm for integer factorization.
QC-GR – Grover: Grover’s algorithm for searching for an item within a set.
QC-AP – Applications: perspectives on experimenting with quantum computing; the Bloch sphere; measurements and observables; simulating the behavior of quantum circuits; the Quantum Approximate Optimization Algorithm (QAOA); and quantum annealing—a quantum paradigm alternative to the circuit-based model.
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-1 QUANTUM COMPUTING - I Modulo in Ingegneria informatica e dell'intelligenza artificiale LM-32 DI BATTISTA GIUSEPPE
Programme
The program is structured as follows:QC-EB – Basic Elements: fundamental concepts of quantum computing, including an introduction to qubits, qubit registers, and operators acting on qubits; simple algorithmic applications; and information transmission techniques.
QC-SH – Shor: Shor’s algorithm for integer factorization.
QC-GR – Grover: Grover’s algorithm for searching for an item within a set.
QC-AP – Applications: perspectives on experimenting with quantum computing; the Bloch sphere; measurements and observables; simulating the behavior of quantum circuits; the Quantum Approximate Optimization Algorithm (QAOA); and quantum annealing—a quantum paradigm alternative to the circuit-based model.
Prerequisiti
None.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
Type of delivery of the course
Lecture in class.Attendance
Lecture in class.Type of evaluation
The exam consists of a written test lasting approximately one hour. Students may also carry out a small project, using a quantum computer made available free of charge by the company D-Wave.