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

scholarly journals Quantum Query Complexity of Some Graph Problems

2004 ◽  
pp. 481-493 ◽  
Author(s):  
Christoph Dürr ◽  
Mark Heiligman ◽  
Peter Høyer ◽  
Mehdi Mhalla
Keyword(s):  
Query Complexity ◽  
Graph Problems ◽  
Quantum Query Complexity ◽  
Quantum Query

scholarly journals Quantum Query Complexity of Some Graph Problems

2006 ◽  
Vol 35 (6) ◽  
pp. 1310-1328 ◽  
Author(s):  
Christoph Dürr ◽  
Mark Heiligman ◽  
Peter HOyer ◽  
Mehdi Mhalla
Keyword(s):  
Query Complexity ◽  
Graph Problems ◽  
Quantum Query Complexity ◽  
Quantum Query

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.

scholarly journals Improving Quantum Query Complexity of Boolean Matrix Multiplication Using Graph Collision

Algorithmica ◽  
2015 ◽  
Vol 76 (1) ◽  
pp. 1-16 ◽  
Author(s):  
Stacey Jeffery ◽  
Robin Kothari ◽  
François Le Gall ◽  
Frédéric Magniez
Keyword(s):  
Matrix Multiplication ◽  
Boolean Matrix ◽  
Query Complexity ◽  
Quantum Query Complexity ◽  
Boolean Matrix Multiplication ◽  
Quantum Query
Sign in / Sign up

Export Citation Format

Share Document