2661 search results - page 24 / 533 » Quantum Complexity Classes |
104
Voted
ISAAC
2005
Springer
15 years 6 months ago
2005
Springer
Reducing the error of quantum algorithms is often achieved by applying a primitive called amplitude amplification. Its use leads in many instances to quantum algorithms that are q...
105
Voted
STOC
2007
ACM
16 years 28 days ago
2007
ACM
We introduce a new method to derive lower bounds on randomized and quantum communication complexity. Our method is based on factorization norms, a notion from Banach Space theory....
103
Voted
STOC
1997
ACM
15 years 4 months ago
1997
ACM
Shor has showed how to perform fault tolerant quantum computation when the probability for an error in a qubit or a gate, η, decays with the size of the computation polylogarithmi...
119
click to vote
JCSS
2008
15 years 18 days ago
2008
Given a Boolean function f, we study two natural generalizations of the certificate complexity C (f): the randomized certificate complexity RC (f) and the quantum certificate comp...
102
click to vote
JC
2007
15 years 15 days ago
2007
We study the complexity of approximating the smallest eigenvalue of −∆ + q with Dirichlet boundary conditions on the d-dimensional unit cube. Here ∆ is the Laplacian, and th...