In the last decade, the field of unconventional computing has witnessed a huge research effort to resolve the problem of the assumed power of computers operating purely according to the laws of quantum physics. Such computers, if practically realizable, pose a serious challenge to the strong Church-Turing thesis which stipulates a computational polynomial equivalence of any machine with a probabilistic Turing machine. The main new resources are quantum mechanical phenomena such as state superposition, interference and entanglement. Superposition together with interference provide a special kind of parallelism, while entanglement, especially when spatially shared, supports unique means of communication.
Beyond the interest in a computational power of quantum computers, the field of quantum computing offers an innovative view on the problem of understanding to quantum physics which as of now relies a lot in its formalism. A coherent high-level picture is missing.
A short course on quantum computing which is to be given at Chalmers by Miroslav Dobsicek aims to computer scientists and focuses on
- presenting a special notation common in the field,
- aiding with an acquire of necessary intuition,
- giving a big scale overview.
There will be at total six lectures and an optional exam afterwards. The prerequisites are basic facts of linear algebra and of computational complexity classes.
Content of lectures
- Quantum states, evolution and teleportation (materials)
- Deusch-Jozsa algorithm (materials)
- Interpretations of quantum mechanics (materials)
- Fast quantum algorithms (Hidden subgroup problem over Abelian groups) (materials)
- Quantum search algorithm (Grover's amplitude amplification) (materials)
- Quantum cryptography (materials)
Time and Place
Tuesdays from 3:15--5:00 PM Feb 16 to Mar 23 room 5453
Lecture 4: March 9, Tuesday, we will be at the room 6128 !
Lecture 5: March 16, Tuesday, 10:00--12:00 AM, room 5453.
Lecture 6: March 23, Tuesday, 10:00--12:00 AM, room 5453.
Exam: April 20, Tuesday, 10:00--12:00 AM, room 3320.
AboutMiroslav Dobsicek got a PhD degree from the Czech Technical University of Prague in 2008 in Quantum Computing and spent a part of the PhD period at the MC2 department at Chalmers. Until the last year he worked as a Postdoc at MC2 with focus on iterative variants of quantum phase estimation algorithm and algorithms for simulation of fermionic systems on a few qubit system.
Related papers and manuscripts:
- Arbitrary accuracy iterative quantum phase estimation algorithm using a single ancillary qubit
- Quantum Simulations: Report
- Phase measurement strategies in the presence of dephasing
Dobsicek's current interest is the interface between reversible computation and physics, a field between category theory, functional programming and logic. See the following two papers.
- S. Abramsky: A structural approach to reversible computation
- J.C. Baez and M. Stay: Physics, Topology, Logic and Computation: A Rosetta Stone
- dobsicek () chalmers.se, or
- CSE department, room 6462 at the EDIT building.