Sciweavers

7486 search results - page 37 / 1498
» The Limits of Quantum Computers
Sort
View
CORR
1999
Springer
138views Education» more  CORR 1999»
13 years 8 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 8 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
APN
2007
Springer
14 years 2 months ago
Petri Nets, Discrete Physics, and Distributed Quantum Computation
We shall describe connections between Petri nets, quantum physics and category theory. The view of Net theory as a kind of discrete physics has been consistently emphasized by Carl...
Samson Abramsky
PROCEDIA
2010
97views more  PROCEDIA 2010»
13 years 7 months ago
Ontological musings on how nature computes
Modern physical theory and modern computational techniques are used to provide conjecture on how nature computes. I utilize time-domain simulation of physical phenomena and build ...
J. F. Nystrom