Programme
Coffee
- Pierre-Jean Ales 11:00
to be announced
- Linda Anticoli 11:30
Polynomial-Time Algorithm for Prime Factorisation and Discrete Logarithms on a Quantum Computer
- Lorenzo Bottarelli 12:00
What is the Computational Value of Finite Range Tunneling?
- Enrico Fraccaroli 12:30
Towards a Quantum Programming Language
Lunch Break
- Nicola Gigante 14:00
Automata and Quantum Computing
- Alberto Molinari 14:30
Classically Controlled Quantum Computation
- Michele Pasqua 15:00
Measurement-Based Quantum Turing Machines and their Universality
- Simone Silvetti 15:30
Topological Quantum Compiling
- Elisa Sovrano 16:00
Complexity of Chaos and Quantum Computation
- Nadia Yakusheva 16:30
Computational Complexity of Uniform Quantum Circuit Families and Quantum Turing Machines