Sciweavers

1352 search results - page 147 / 271
» Fault-Tolerant Quantum Computation
Sort
View
ICCAD
2007
IEEE
153views Hardware» more  ICCAD 2007»
14 years 5 months ago
Checking equivalence of quantum circuits and states
Among the post-CMOS technologies currently under investigation, quantum computing (QC) holds a special place. QC offers not only extremely small size and low power, but also expon...
George F. Viamontes, Igor L. Markov, John P. Hayes
COCO
2004
Springer
118views Algorithms» more  COCO 2004»
14 years 1 months ago
Graph Properties and Circular Functions: How Low Can Quantum Query Complexity Go?
In decision tree models, considerable attention has been paid on the effect of symmetry on computational complexity. That is, for a permutation group Γ, how low can the complexit...
Xiaoming Sun, Andrew Chi-Chih Yao, Shengyu Zhang
CORR
1999
Springer
138views Education» more  CORR 1999»
13 years 7 months ago
A simple proof of the unconditional security of quantum key distribution
Quantum key distribution is the best known application of quantum cryptography. Previously proposed proofs of security of quantum key distribution contain various technical subtle...
Hoi-Kwong Lo
FOCS
2002
IEEE
14 years 1 months ago
Quantum Computation and Lattice Problems
We present the first explicit connection between quantum computation and lattice problems. Namely, our main result is a solution to the Unique Shortest Vector Problem (SVP) under ...
Oded Regev
CORR
2000
Springer
81views Education» more  CORR 2000»
13 years 7 months ago
Poly-locality in quantum computing
A polynomial depth quantum circuit affects, by definition, a poly-local unitary transformation of a tensor product state space. It is a reasonable belief [Fe], [L], [FKW] that, at ...
Michael H. Freedman