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

arXiv:1004.1434 · Theoretical Computer Science

On the uselessness of quantum queries

David Meyer, James Pommersheim

Published Jul 21, 2011• 12 citations
arXivHTMLPDF
DOI
10.1016/j.tcs.2011.06.037

Related papers

Uselessness for an Oracle model with internal randomness

Aram W. Harrow, David J. Rosenbaum

We consider a generalization of the standard oracle model in which the oracle acts on the target with a permutation selected according to internal random coins. We describe several problems that are impossible to solve classically but can be solved by a quantum algorithm using a single query; we show that such infinity-vs-one separations between classical and quantum query complexities can be constructed from much weaker separations. We also give conditions to determine when oracle problems -- either in the standard model, or in any of the generalizations we consider -- cannot be solved with success probability better than random guessing would achieve. In the oracle model with internal randomness where the goal is to gain any nonzero advantage over guessing, we prove (roughly speaking) that k quantum queries are equivalent in power to 2k classical queries, thus extending results of Meyer and Pommersheim.

arXiv:1111.1462•Quantum Information and Computation•May 1, 2014•9 citations

The power of various real-valued quantum queries

Arvid J. Bessen

arXiv:quant-ph/0308140•Journal of Complexity•Oct 15, 2003•7 citations

Resource Optimisation of Coherently Controlled Quantum Computations with the PBS-Calculus

Alexandre Clément, Simon Perdrix

Coherent control of quantum computations can be used to improve some quantum protocols and algorithms. For instance, the complexity of implementing the permutation of some given unitary transformations can be strictly decreased by allowing coherent control, rather than using the standard quantum circuit model. In this paper, we address the problem of optimising the resources of coherently controlled quantum computations. We refine the PBS-calculus, a graphical language for coherent control which is inspired by quantum optics. In order to obtain a more resource-sensitive language, it manipulates abstract gates - that can be interpreted as queries to an oracle - and more importantly, it avoids the representation of useless wires by allowing unsaturated polarising beam splitters. Technically the language forms a coloured PROP. The language is equipped with an equational theory that we show to be sound, complete, and minimal. Regarding resource optimisation, we introduce an efficient procedure to minimise the number of oracle queries of a given diagram. We also consider the problem of minimising both the number of oracle queries and the number of polarising beam splitters. We show that this optimisation problem is NP-hard in general, but introduce an efficient heuristic that produces optimal diagrams when at most one query to each oracle is required.

arXiv:2202.05260•Leibniz international proceedings in informatics•Jan 1, 2022•4 citations

Quantum query algorithms and lower bounds

Andris Ambainis

Springer eBooks•Nov 2, 2007•36 citations

On quantum database search algorithms

김정산

•Jan 1, 2002•0 citations

Existence of universal resource and uselessness of too entangled states for quantum metrology

Rina Miyajima, Yuki Takeuchi, Seiseki Akibue

We show (i) the existence of universal resource states for a certain class of linear Hamiltonians and (ii) the uselessness of highly entangled states for quantum metrology of linear Hamiltonians. We also show that random pure states are basically not useful even if we consider more general Hamiltonians. Since random pure states have high entanglement, this result strengthens the uselessness of highly entangled states for quantum metrology.

arXiv:2510.08133•Oct 9, 2025•0 citations
We consider a generalization of the standard oracle model in which the oracle acts on the target with a permutation selected according to internal random coins. We describe several problems that are impossible to solve classically but can be solved by a quantum algorithm using a single query; we show that such infinity-vs-one separations between classical and quantum query complexities can be constructed from much weaker separations. We also give conditions to determine when oracle problems -- either in the standard model, or in any of the generalizations we consider -- cannot be solved with success probability better than random guessing would achieve. In the oracle model with internal randomness where the goal is to gain any nonzero advantage over guessing, we prove (roughly speaking) that k quantum queries are equivalent in power to 2k classical queries, thus extending results of Meyer and Pommersheim.
Coherent control of quantum computations can be used to improve some quantum protocols and algorithms. For instance, the complexity of implementing the permutation of some given unitary transformations can be strictly decreased by allowing coherent control, rather than using the standard quantum circuit model. In this paper, we address the problem of optimising the resources of coherently controlled quantum computations. We refine the PBS-calculus, a graphical language for coherent control which is inspired by quantum optics. In order to obtain a more resource-sensitive language, it manipulates abstract gates - that can be interpreted as queries to an oracle - and more importantly, it avoids the representation of useless wires by allowing unsaturated polarising beam splitters. Technically the language forms a coloured PROP. The language is equipped with an equational theory that we show to be sound, complete, and minimal. Regarding resource optimisation, we introduce an efficient procedure to minimise the number of oracle queries of a given diagram. We also consider the problem of minimising both the number of oracle queries and the number of polarising beam splitters. We show that this optimisation problem is NP-hard in general, but introduce an efficient heuristic that produces optimal diagrams when at most one query to each oracle is required.