Aharonov & Vazirani, Is Quantum Mechanics Falsifiable? A Computational Perspective on the Foundations of Quantum…
It describes how quantum mechanics can be tested in the limit of high complexity regime by extending the usual scientific paradigm to include.
- from
- Theoretical Computer Science
- added
- 2026-10-10
- likes
- 0
similar
-
Quantum Mechanics and Quantum Computation edx.org
Conceptual introduction to the fundamental principles of quantum mechanics.
-
Understanding Quantum Computers futurelearn.com
Introduction to the key concepts of quantum computing with minimal mathematics.
-
Constraining the doability of relativistic quantum tasks (2019) arxiv.org
Generalises the port-based attack to more general quantum tasks and spacetime circuits. Finds that the coarse causal structure of the task is the relevant property determining whether the task is doable non-locally.
-
A complexity theory for non-local quantum computation (2025) arxiv.org
Finds relations between a wide range of different NLQC tasks, including showing that $f$-routing and $f$-BB84 are equivalent, with a constant-overhead reduction between them.
-
An Introduction to Quantum Computing amazon.com
Strikes an excellent balance between accessiblity and mathematical rigour. It is suitable for undergraduate students.
-
Quantum Computing: An Applied Approach springer.com
A hands on introduction into quantum computing that explains the foundations of quantum computing to the mathematics behind quantum systems.
Theoretical Computer Science › Papers: “It describes how quantum mechanics can be tested in the limit of high complexity regime by extending the usual scientific paradigm to include.”