The course introduces the concepts underlying quantum computing through the study of the physical phenomena that characterize this paradigm compared to the classical one.
It is divided into three main parts: the study of the quantum circuit model and its universality, the study of the most important quantum techniques for the design of algorithms and their analysis,
and the introduction of some quantum programming languages and software platforms for the specification of quantum computations.
It is divided into three main parts: the study of the quantum circuit model and its universality, the study of the most important quantum techniques for the design of algorithms and their analysis,
and the introduction of some quantum programming languages and software platforms for the specification of quantum computations.
teacher profile teaching materials
Hilbert Spaces, Products and Tensor Products, Matrices, Complex Spaces and Inner Products, Matrices, Graphs, and Sums Over Paths.
Boolean Functions, Quantum Bits, and Feasibility:
Feasible Boolean Functions, Quantum Representation of Boolean Arguments Quantum Feasibility.
Special Matrices:
Hadamard Matrices, Fourier Matrices, Reversible Computation and Permutation Matrices, Feasible Diagonal Matrices, Reflections. Tricks: Start Vectors, Controlling and Copying Base States, The Copy-Uncompute Trick, Superposition Tricks, Flipping a Switch, Measurement Tricks, Partial Transforms.
Algorithms:
Phil’s Algorithm: Phil Measures Up, Quantum Mazes versus Circuits versus Matrices.
Deutsch’s Algorithm: Superdense Coding and Teleportation.
The Deutsch-Jozsa Algorithm. Simon’s Algorithm. Shor’s Algorithm, Quantum Part of the Algorithm, Analysis of the Quantum Part, Continued Fractions.
FactoringIntegers: Basic Number Theory, Periods Give the Order, Factoring.
Grover’s Algorithm: The binary case, the general case, with k Unknowns, Grover Approximate Counting.
Fruizione: 20411002_2 IN510 – QUANTUM COMPUTING MODULO B in Matematica LM-40 R PEDICINI MARCO
Programme
Basic Linear Algebra:Hilbert Spaces, Products and Tensor Products, Matrices, Complex Spaces and Inner Products, Matrices, Graphs, and Sums Over Paths.
Boolean Functions, Quantum Bits, and Feasibility:
Feasible Boolean Functions, Quantum Representation of Boolean Arguments Quantum Feasibility.
Special Matrices:
Hadamard Matrices, Fourier Matrices, Reversible Computation and Permutation Matrices, Feasible Diagonal Matrices, Reflections. Tricks: Start Vectors, Controlling and Copying Base States, The Copy-Uncompute Trick, Superposition Tricks, Flipping a Switch, Measurement Tricks, Partial Transforms.
Algorithms:
Phil’s Algorithm: Phil Measures Up, Quantum Mazes versus Circuits versus Matrices.
Deutsch’s Algorithm: Superdense Coding and Teleportation.
The Deutsch-Jozsa Algorithm. Simon’s Algorithm. Shor’s Algorithm, Quantum Part of the Algorithm, Analysis of the Quantum Part, Continued Fractions.
FactoringIntegers: Basic Number Theory, Periods Give the Order, Factoring.
Grover’s Algorithm: The binary case, the general case, with k Unknowns, Grover Approximate Counting.
Core Documentation
Richard J. Lipton, Kenneth W. Regan Introduction to Quantum Algorithms via Linear Algebra, Second Edition, ISBN 9780262045254, (2021), MIT PressType of delivery of the course
Lectures.Attendance
optionalType of evaluation
The exam consists of a seminar on an assigned topic.