We define and study a new type of quantum oracle, the quantum conditional oracle, which provides oracle access to the conditional probabilities associated with an underlying distribution. Amongst other properties, we (a) obtain speed-ups over the best known quantum algorithms for identity testing, equivalence testing and uniformity testing of probability distributions; (b) study the power of these oracles for testing properties of boolean functions, and obtain an algorithm for checking whether an $n$-input $m$-output boolean function is balanced or $\epsilon$-far from balanced; and (c) give a sub-linear algorithm, requiring $\tilde{O}(n^{3/4}/\epsilon)$ queries, for testing whether an $n$-dimensional quantum state is maximally mixed or not.
Quantum conditional query complexity
Imdad S. B. Sardharwalla,Sergii Strelchuk,R. Jozsa
Published 2016 in Quantum information & computation
ABSTRACT
PUBLICATION RECORD
- Publication year
2016
- Venue
Quantum information & computation
- Publication date
2016-09-01
- Fields of study
Mathematics, Physics, Computer Science
- Identifiers
- External record
- Source metadata
Semantic Scholar
CITATION MAP
EXTRACTION MAP
CLAIMS
- No claims are published for this paper.
CONCEPTS
- No concepts are published for this paper.
REFERENCES
Showing 1-30 of 30 references · Page 1 of 1
CITED BY
Showing 1-7 of 7 citing papers · Page 1 of 1