Sciweavers

2661 search results - page 11 / 533
» Quantum Complexity Classes
Sort
View
95
Voted
CDC
2009
IEEE
127views Control Systems» more  CDC 2009»
15 years 5 months ago
Feedback interconnection of open quantum systems: A small gain theorem
Abstract— This paper examines the stability of quantum feedback networks. We introduce a novel characterization, in terms of equivalence classes of operators, that may be used to...
Ram Abhinav Somaraju, Ian R. Petersen
IPL
2006
104views more  IPL 2006»
15 years 17 days ago
The communication complexity of the Hamming distance problem
We investigate the randomized and quantum communication complexity of the HAMMING DISTANCE problem, which is to determine if the Hamming distance between two n-bit strings is no l...
Wei Huang, Yaoyun Shi, Shengyu Zhang, Yufan Zhu
COCO
2004
Springer
118views Algorithms» more  COCO 2004»
15 years 6 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
121
Voted
SPAA
2003
ACM
15 years 5 months ago
The effect of communication costs in solid-state quantum computing architectures
Quantum computation has become an intriguing technology with which to attack difficult problems and to enhance system security. Quantum algorithms, however, have been analyzed un...
Dean Copsey, Mark Oskin, Tzvetan S. Metodi, Freder...
105
Voted
EUROCRYPT
2000
Springer
15 years 4 months ago
Perfectly Concealing Quantum Bit Commitment from any Quantum One-Way Permutation
We show that although unconditionally secure quantum bit commitment is impossible, it can be based upon any family of quantum one-way permutations. The resulting scheme is uncondit...
Paul Dumais, Dominic Mayers, Louis Salvail