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

Nature Physics

Quantum possibilities

Published Apr 1, 2018• 4 citations
Publisher
DOI
10.1038/s41567-018-0125-9

Related papers

CLASSICAL PHYSICS AND THE ACTUALIZATION OF QUANTUM PURE POSSIBILITIES

Amihud Gilead

This paper differs from any previous view in discussing quantum pure possibilities as individuals, existing independently of any observer or mind. These pure possibilities are also absolutely independent of any metaphysical or logical view that endorses the notion of possible worlds. In my view, the relationship between quantum possibilities and classical physical reality is not between reality as such, as it is in itself, and its phenomena. It is rather between fundamental or primary reality, consisting of quantum pure possibilities, on the one hand, and its actualization in what classical physics has discovered so far, on the other. As individual pure possibilities, quantum entities must be, at least ontologically, distinct and different from one another, regardless of the epistemological standing of quantum physics. Hence, quantum metaphysics is committed to the principle of the identity of indiscernibles. Finally, I analyze the two-slit experiment, interference, and entanglement in the light of my approach.

•Jul 24, 2018•0 citations

THINKING QUANTUM

David Finkelstein

Cybernetics & Systems•Jan 1, 1993•0 citations

Quantum Implications

Gordon McCabe, Carfax Publishing

Cogito•Jan 1, 1992•0 citations

How to Use Quantum Computing to Check Which Inputs Are Relevant: A Proof That Deutsch-Jozsa Algorithm Is, In Effect, the Only Possibility

Владик Крейнович, Martine C. Ceberio, Ricardo O. de Alba Alvarez

One of the main reasons why computations - in particular, engineering computations - take long is that, to be on the safe side, models take into account all possible affecting features, most of which turn out to be not really relevant for the corresponding physical problem. From this viewpoint, it is desirable to find out which inputs are relevant. In general, the problem of checking the input's relevancy is itself NP-hard, which means, crudely speaking, that no feasible algorithm can always solve it. Thus, it is desirable to speed up this checking as much as possible. One possible way to speed up such a checking is to use quantum computing, namely, to use the Deutsch-Josza algorithm. However, it is not clear whether a more efficient quantum algorithm is possible for solving this problem. In this paper, we show that the Deutsch-Josza algorithm is, in effect, the only possible way to use quantum computing for checking which inputs are relevant - so no alternative quantum algorithms are possible.

IEEE Symposium Series on Computational Intelligence (SSCI)•Dec 1, 2019•3 citations

Quantum Possibilities and Waves

Michael G. Raymer

How does the concept of waves enter quantum theory? In quantum theory, probabilities are determined by considering all the possibilities that may be involved in a certain process. If there are intermediate possibilities involved in a process, quantum theory tells us how to combine...

•Sep 14, 2017•0 citations

Quantum Connections

Christopher R. Monroe, Robert J. Schoelkopf, Mikhail D. Lukin

Scientific American•Apr 19, 2016•38 citations
This paper differs from any previous view in discussing quantum pure possibilities as individuals, existing independently of any observer or mind. These pure possibilities are also absolutely independent of any metaphysical or logical view that endorses the notion of possible worlds. In my view, the relationship between quantum possibilities and classical physical reality is not between reality as such, as it is in itself, and its phenomena. It is rather between fundamental or primary reality, consisting of quantum pure possibilities, on the one hand, and its actualization in what classical physics has discovered so far, on the other. As individual pure possibilities, quantum entities must be, at least ontologically, distinct and different from one another, regardless of the epistemological standing of quantum physics. Hence, quantum metaphysics is committed to the principle of the identity of indiscernibles. Finally, I analyze the two-slit experiment, interference, and entanglement in the light of my approach.
One of the main reasons why computations - in particular, engineering computations - take long is that, to be on the safe side, models take into account all possible affecting features, most of which turn out to be not really relevant for the corresponding physical problem. From this viewpoint, it is desirable to find out which inputs are relevant. In general, the problem of checking the input's relevancy is itself NP-hard, which means, crudely speaking, that no feasible algorithm can always solve it. Thus, it is desirable to speed up this checking as much as possible. One possible way to speed up such a checking is to use quantum computing, namely, to use the Deutsch-Josza algorithm. However, it is not clear whether a more efficient quantum algorithm is possible for solving this problem. In this paper, we show that the Deutsch-Josza algorithm is, in effect, the only possible way to use quantum computing for checking which inputs are relevant - so no alternative quantum algorithms are possible.