249 search results - page 1 / 50 » One Complexity Theorist's View of Quantum Computing |
CORR
2000
Springer
13 years 4 months ago
2000
Springer
The complexity of quantum computation remains poorly understood. While physicists attempt to find ways to create quantum computers, we still do not have much evidence one way or t...
ITNG
2007
IEEE
13 years 10 months ago
2007
IEEE
Lots of efforts in the last decades have been done to prove or disprove whether the set of polynomially bounded problems is equal to the set of polynomially verifiable problems. T...
EUROCRYPT
2000
Springer
13 years 8 months ago
2000
Springer
We show that although unconditionally secure quantum bit commitment is impossible, it can be based upon any family of quantum one-way permutations. The resulting scheme is uncondit...
STOC
2009
ACM
14 years 5 months ago
2009
ACM
The quantum analog of a constraint satisfaction problem is a sum of local Hamiltonians - each (term of the) Hamiltonian specifies a local constraint whose violation contributes to...
ACMSE
2006
ACM
13 years 8 months ago
2006
ACM
In this paper, we offer an exposition of a theorem originally due to Adleman, Demarrais and Huang that shows that the quantum complexity class BQP (Bounded-error Quantum Polynomia...