Sciweavers

5215 search results - page 43 / 1043
» Quantum clustering algorithms
Sort
View
ICALP
2001
Springer
15 years 10 months ago
Quantum Complexities of Ordered Searching, Sorting, and Element Distinctness
We consider the quantum complexities of the following three problems: searching an ordered list, sorting an un-ordered list, and deciding whether the numbers in a list are all dis...
Peter Høyer, Jan Neerbek, Yaoyun Shi
COMPUTER
2002
79views more  COMPUTER 2002»
15 years 5 months ago
A Practical Architecture for Reliable Quantum Computers
wever, by using a simple model of abstract building blocks: quantum bits, gates, and algorithms, and the available implementation technologies--in all their imperfections.7 The bas...
Mark Oskin, Frederic T. Chong, Isaac L. Chuang
STOC
2010
ACM
176views Algorithms» more  STOC 2010»
16 years 3 months ago
QIP = PSPACE
We prove that the complexity class QIP, which consists of all problems having quantum interactive proof systems, is contained in PSPACE. This containment is proved by applying a p...
Rahul Jain, Zhengfeng Ji, Sarvagya Upadhyay and Jo...
CLUSTER
2003
IEEE
15 years 11 months ago
Performance Evaluation of Routing Algorithms in RHiNET-2 Cluster
Michihiro Koibuchi, Konosuke Watanabe, Kenichi Kon...