Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Physics Today

There is still hope for hope

Victor F. Weisskopf

Published Mar 1, 1983• 0 citations
Publisher
DOI
10.1063/1.2915563

Related papers

In Search of Reality

Bernard d’Espagnat

Springer eBooks•Jan 1, 1983•103 citations

Can Quantum Computers Be Useful When There are Not Yet Enough Qubits

Luc Longpré, Владик Крейнович

this paper, we start answering this question by showing the following: for quantum search, even when we do not have enough qubits, we can still get a partial speedup. The fact that we do get a partial speedup for quantum search makes us hope that even when we do not have all the qubits, we can still get a partial speedup for other quantum computing algorithms as well

Bulletin of the European Association for Theoretical Computer Science•Jan 1, 2003•3 citations

Reality Is Not What It Seems

Carlo Rovelli C

•Jan 1, 2014•88 citations

Quantum Theory: Interpretation Cannot be Avoided

Eric Dennis, Travis Norsen

This essay is a response to the (March 2000) Physics Today Opinion article "Quantum Theory Needs No Interpretation" by Fuchs and Peres. It was written several years ago and has been collecting electronic dust ever since Physics Today said they weren't interested. We post it here with the hope that it may still be of some interest.

arXiv:quant-ph/0408178•Aug 30, 2004•7 citations

Uncertain future

M. P. Blencowe

Nature•Jul 1, 2003•5 citations

A Quantum inspired proof of $P^{\#P} \subseteq IP$

Dorit Aharonov, Ayal Green

We provide a new, quantum inspired, proof for the celebrated claim of [LFKN92] that $P^{\#P} \subseteq IP$. The protocol is fundamentally different from the original sum-check protocol of [LFKN92, Sha92], as well as from variants of this proof [GKR08, Mei09], though it still possesses the overall structure of inductively checking consistency between subsequent step. The protocol is inspired by [AAV13]. Hopefully, this protocol will be helpful in making progress towards two major open problems: resolving the quantum PCP question, and verification of quantum computations using a classical BPP verifier. Given the historical importance of the sum-check protocol in classical computational complexity, we hope that the new protocol will also find applications in classical complexity theory.

arXiv:1710.09078•Oct 25, 2017•13 citations
A Quantum inspired proof of P#P⊆IPP^{\#P} \subseteq IPP#P⊆IP
We provide a new, quantum inspired, proof for the celebrated claim of [LFKN92] that P#P⊆IPP^{\#P} \subseteq IPP#P⊆IP. The protocol is fundamentally different from the original sum-check protocol of [LFKN92, Sha92], as well as from variants of this proof [GKR08, Mei09], though it still possesses the overall structure of inductively checking consistency between subsequent step. The protocol is inspired by [AAV13]. Hopefully, this protocol will be helpful in making progress towards two major open problems: resolving the quantum PCP question, and verification of quantum computations using a classical BPP verifier. Given the historical importance of the sum-check protocol in classical computational complexity, we hope that the new protocol will also find applications in classical complexity theory.