scholarly journals Lower Bounds on Quantum Query Complexity for Read-Once Formulas with XOR and MUX Operators

2010 ◽  
Vol E93-D (2) ◽  
pp. 280-289
Author(s):  
Hideaki FUKUHARA ◽  
Eiji TAKIMOTO
Keyword(s):  
Lower Bounds ◽  
Query Complexity ◽  
Quantum Query Complexity ◽  
Quantum Query

Quantum collision-resistance of non-uniformly distributed functions: upper and lower bounds

2018 ◽  
Vol 18 (15&16) ◽  
pp. 1332-1349
Author(s):  
Ehsan Ebrahimi ◽  
Dominique Unruh
Keyword(s):  
Lower Bound ◽  
Uniform Distribution ◽  
Lower Bounds ◽  
Upper Bounds ◽  
Query Complexity ◽  
Upper And Lower Bounds ◽  
Collision Resistance ◽  
Quantum Query Complexity ◽  
Quantum Query

We study the quantum query complexity of finding a collision for a function f whose outputs are chosen according to a non-uniform distribution D. We derive some upper bounds and lower bounds depending on the min-entropy and the collision-entropy of D. In particular, we improve the previous lower bound by Ebrahimi Targhi et al. from \Omega(2^{k/9}) to \Omega(2^{k/5}) where k is the min-entropy of D.

Lower Bounds for Randomized and Quantum Query Complexity Using Kolmogorov Arguments

2008 ◽  
Vol 38 (1) ◽  
pp. 46-62 ◽  
Author(s):  
Sophie Laplante ◽  
Frédéric Magniez
Keyword(s):  
Lower Bounds ◽  
Query Complexity ◽  
Quantum Query Complexity ◽  
Quantum Query

scholarly journals Adversary lower bounds for the collision and the set equality problems

2018 ◽  
Vol 18 (3&4) ◽  
pp. 198-222
Author(s):  
Aleksandrs Belovs ◽  
Ansis Rosmanis
Keyword(s):  
Lower Bounds ◽  
Query Complexity ◽  
Negative Weight ◽  
Quantum Query Complexity ◽  
Adversary Method ◽  
Quantum Query

We prove tight \Omega(n^{1/3}) lower bounds on the quantum query complexity of the Collision and the Set Equality problems, provided that the size of the alphabet is large enough. We do this using the negative-weight adversary method. Thus, we reprove the result by Aaronson and Shi, as well as a more recent development by Zhandry.

scholarly journals Exact quantum algorithms have advantage for almost all Boolean functions

2015 ◽  
pp. 435-452
Author(s):  
Andris Ambainis ◽  
Jozef Gruska ◽  
Shenggen Zheng
Keyword(s):  
Boolean Function ◽  
Boolean Functions ◽  
Quantum Algorithms ◽  
Quantum Algorithm ◽  
Query Complexity ◽  
Exact Quantum ◽  
Quantum Query Complexity ◽  
Almost All ◽  
Quantum Query

It has been proved that almost all n-bit Boolean functions have exact classical query complexity n. However, the situation seemed to be very different when we deal with exact quantum query complexity. In this paper, we prove that almost all n-bit Boolean functions can be computed by an exact quantum algorithm with less than n queries. More exactly, we prove that ANDn is the only n-bit Boolean function, up to isomorphism, that requires n queries.

scholarly journals The quantum query complexity of elliptic PDE

2006 ◽  
Vol 22 (5) ◽  
pp. 691-725 ◽  
Author(s):  
Stefan Heinrich
Keyword(s):  
Query Complexity ◽  
Elliptic Pde ◽  
Quantum Query Complexity ◽  
Quantum Query

Open Problems Related to Quantum Query Complexity

2021 ◽  
Vol 2 (4) ◽  
pp. 1-9
Author(s):  
Scott Aaronson
Keyword(s):  
Synthesis Problem ◽  
Query Complexity ◽  
Partial Functions ◽  
Open Problems ◽  
Polynomial Degree ◽  
Quantum Query Complexity ◽  
Time Space ◽  
Quantum Query

I offer a case that quantum query complexity still has loads of enticing and fundamental open problems—from relativized QMA versus QCMA and BQP versus IP , to time/space tradeoffs for collision and element distinctness, to polynomial degree versus quantum query complexity for partial functions, to the Unitary Synthesis Problem and more.

Quantum Query Complexity for Some Graph Problems

2004 ◽  
pp. 140-150 ◽  
Author(s):  
Aija Berzina ◽  
Andrej Dubrovsky ◽  
Rusins Freivalds ◽  
Lelde Lace ◽  
Oksana Scegulnaja
Keyword(s):  
Query Complexity ◽  
Graph Problems ◽  
Quantum Query Complexity ◽  
Quantum Query
Sign in / Sign up

Export Citation Format

Share Document