Oracles with Costs

@inproceedings{Kimmel2015OraclesWC,
  title={Oracles with Costs},
  author={Shelby Kimmel and Cedric Yen-Yu Lin and Han-Hsuan Lin},
  booktitle={TQC},
  year={2015}
}
While powerful tools have been developed to analyze quantum query complexity, there are still many natural problems that do not fit neatly into the black box model of oracles. We create a new model that allows multiple oracles with differing costs. This model captures more of the difficulty of certain natural problems. We test this model on a simple problem, Search with Two Oracles, for which we create a quantum algorithm that we prove is asymptotically optimal. We further give some evidence… 

Figures from this paper

Hybrid Quantum-Classical Search Algorithms

TLDR
It is shown that classical computation, unless it by itself can solve the Search problem, cannot assist quantum computation and is generalized to algorithms with subconstant success probabilities.

A Quantum Analysis of Nested Search Problems with Applications in Cryptanalysis

TLDR
A framework to transform classical nested searches into a quantum procedure and to analyze its complexity is introduced, which is easier to describe and analyze compared to previous works, both in the asymptotic setting and for concrete instantiations.

Parallelism strategies for the tuneable golden-claw finding problem

TLDR
A quantum resource estimation of the classical and quantum resources required to attack various SIKE instances with Tiny Claw, finding interesting price-points and demonstrating how the cost of the parallel version of this attack scales in a manner superior to that of a naive use of Grover’s algorithm.

References

SHOWING 1-10 OF 21 REFERENCES

Exact quantum lower bound for grover's problem

TLDR
A new lower bound in the query model is given which proves that Grover's algorithm is exactly optimal, and the amount of information the authors can gain from a single oracle query is bound in terms of angles.

The quantum query complexity of the hidden subgroup problem is polynomial

Fixed-point quantum search with an optimal number of queries.

TLDR
This work provides the first version of amplitude amplification that achieves fixed-point behavior without sacrificing the quantum speedup and incorporates an adjustable bound on the failure probability and guarantees that this bound is satisfied over the broadest possible range of λ.

Quantum lower bounds by quantum arguments

TLDR
Two new Ω(√N) lower bounds on computing AND of ORs and inverting a permutation and more uniform proofs for several known lower bounds which have been previously proven via a variety of different techniques are proved.

Quantum lower bounds by polynomials

TLDR
This work examines the number T of queries that a quantum network requires to compute several Boolean functions on {0,1}/sup N/ in the black-box model and gives asymptotically tight characterizations of T for all symmetric f in the exact, zero-error, and bounded-error settings.

Negative weights make adversaries stronger

TLDR
A stronger version of the adversary method which goes beyond this principle to make explicit use of the stronger condition that the algorithm actually computes the function, and which is a lower bound on bounded-error quantum query complexity.

Reflections for quantum query algorithms

We show that any boolean function can be evaluated optimally by a quantum query algorithm that alternates a certain fixed, input-independent reflection with a second reflection that coherently

Quantum Search with Advice

TLDR
A quantum algorithm is presented which solves the problem of search of an unstructured list for a marked element x using an optimal number of queries, up to a constant factor, and can achieve exponential speed-ups over the best possible classical algorithm.

Quantum Search with Variable Times

  • A. Ambainis
  • Computer Science
    Theory of Computing Systems
  • 2009
TLDR
A new variant of the usual search problem, in which evaluating xi for different i may take a different number of time steps, is considered, which is optimal and shows a matching lower bound.

Quantum Attacks on Classical Proof Systems: The Hardness of Quantum Rewinding

TLDR
It is shown that classically secure proofs and proofs of knowledge are insecure in the quantum setting, and the "pick-one trick" is developed, a general technique that allows an adversary to find one value satisfying a given predicate, but not two.