Sciweavers

587 search results - page 36 / 118
» Quantum computation and quantum information
Sort
View
ICCAD
2007
IEEE
153views Hardware» more  ICCAD 2007»
14 years 7 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 3 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 9 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
COCO
2009
Springer
126views Algorithms» more  COCO 2009»
14 years 4 months ago
New Results in the Simultaneous Message Passing Model via Information Theoretic Techniques
—Consider the following Simultaneous Message Passing (SMP) model for computing a relation f ⊆ X ×Y ×Z. In this model Alice, on input x ∈ X and Bob, on input y ∈ Y, send o...
Rahul Jain, Hartmut Klauck
CIE
2010
Springer
14 years 2 months ago
On the Completeness of Quantum Computation Models
The notion of computability is stable (i.e. independent of the choice of an indexing) over infinite-dimensional vector spaces provided they have a finite “tensorial dimension...
Pablo Arrighi, Gilles Dowek