quantum algorithms:
constructive mathematics, realizability, computability
propositions as types, proofs as programs, computational trinitarianism
complexity theory for quantum systems and quantum computation
Quantum complexity classes:
Original articles:
Introduction and review:
Umesh Vazirani, A survey of quantum complexity theory, in: Samuel J. Lomonaco (ed.): Quantum Computation: A Grand Mathematical Challenge for the Twenty-First Century and the Millennium, Proceedings of Symposia in Applied Mathematics 58, AMS (2002) [doi:10.1090/psapm/058]
Richard Cleve, An Introduction to Quantum Complexity Theory, p. 103-127 of: Quantum Computation and Quantum Information Theory, World Scientific (2001) [arXiv:quant-ph/9906111, [doi:10.1142/9789810248185_0004]
(https://doi.org/10.1142/9789810248185_0004)]
Lecture notes:
See also
Last revised on February 7, 2025 at 12:42:46. See the history of this page for a list of all contributions to it.