Quantum advantage by relational queries about physically realizable equivalence classes
arXiv:1904.08307 · doi:10.1007/978-3-030-33495-6_39
Abstract
Relational quantum queries are sometimes capable to effectively decide between collections of mutually exclusive elementary cases without completely resolving and determining those individual instances. Thereby the set of mutually exclusive elementary cases is effectively partitioned into equivalence classes pertinent to the respective query. In the second part of the paper, we review recent progress in theoretical certifications (relative to the assumptions made) of quantum value indeterminacy as a means to build quantum oracles for randomness.
8 Pages, one figure, invited contribution to TopHPC2019, Tehran, Iran, April 22-25, 2019
References in corpus (7)
- Strong Kochen-Specker theorem and incomputability of quantum randomness
- Experimental Evidence of Quantum Randomness Incomputability
- Extracontextuality and Extravalence in Quantum Mechanics
- Experimentally Probing the Algorithmic Randomness and Incomputability of Quantum Randomness
- New forms of quantum value indefiniteness suggest that incompatible views on contexts are epistemic
- Characterization of quantum computable decision problems by state discrimination
- On the solution of trivalent decision problems by quantum state identification