7 search results - page 2 / 2 » Hidden translation and orbit coset in quantum computing |
EUROCRYPT
2005
Springer
15 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...
FOCS
2002
IEEE
15 years 2 months ago
2002
IEEE
We show that Graph Isomorphism is in the complexity class SPP, and hence it is in ⊕P (in fact, it is in ModkP for each k ≥ 2). We derive this result as a corollary of a more g...