508 search results - page 16 / 102 » Quantum Computers |
EUROCRYPT
2005
Springer
14 years 3 months ago
2005
Springer
We introduce a computational problem of distinguishing between two specific quantum states as a new cryptographic problem to design a quantum cryptographic scheme that is “secu...
MSCS
2006
13 years 9 months ago
2006
We develop a notion of predicate transformer and, in particular, the weakest precondition, appropriate for quantum computation. We show that there is a Stone-type duality between ...
FOCS
2004
IEEE
14 years 1 months ago
2004
IEEE
ITNG
2007
IEEE
14 years 4 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...
ASPDAC
2005
ACM
13 years 11 months ago
2005
ACM
— The pressure of fundamental limits on classical computation and the promise of exponential speedups from quantum effects have recently brought quantum circuits to the attention...