Copenhagen Computation: How I Learned to Stop Worrying and Love Bohr
N. David Mermin
Abstract
To celebrate the 60th birthday of Charles H.Bennett I (1) publicly announce my referee reports for the original dense coding and teleportation papers, (2) present a very economical solution to the Bernstein-Vazirani problem that does not even hint at interference between multiple universes, and (3) describe how I inadvertently reinvented the Copenhagen interpretation in the course of constructing a simple, straightforward, and transparent introduction to quantum mechanics for computer scientists.
Create a lesson
Related papers
Discovering state-of-the-art quantum circuits with large language models
Andi Gu, Alek H. Kemeny, Susanne F. Yelin et al.
Stability of Quantum LDPC States under Local Pauli Noise
Tai-Hsuan Yang, Andrew D. Kim, Akash Vijay et al.
Magic in quantum trajectory unravelings of noisy random quantum circuits
Sara Santos, Alessio Paviglianiti, Vincenzo Savona
Magna: simulating magic state factories as cheaply as Clifford circuits
Yifei Wang, Yingfei Gu
Classical Capacity of Single-Mode Bosonic Gaussian Channels
Gerardo Adesso, Ludovico Lami, Vittorio Giovannetti
SynDebug: A Framework to Debug Logic Bugs in Fault-Tolerant Quantum Computing Programs
Nicholas S. DiBrita, Jack Lange, Tirthak Patel