2012/06/16 by Dorit Aharonov, Umesh Vazirani, Aharonov, Dorit +1
Computer Science · Physics and Astronomy · #Computability, Logic, AI Algorithms #FOS: Physical sciences #Quantum Mechanics and Applications #Quantum Physics (quant-ph)
paper · pdf · doi:10.48550/arxiv.1206.3686
openalex publication_date 2012/06/16 · openalex created_date 2022/10/01 · openalex updated_date 2026/08/01
Quantum computation teaches us that quantum mechanics exhibits exponential complexity. We argue that the standard scientific paradigm of "predict and verify" cannot be applied to testing quantum mechanics in this limit of high complexity. We describe how QM can be tested in this regime by extending the usual scientific paradigm to include \it interactive experiments.