Sciweavers

5215 search results - page 20 / 1043
» Quantum clustering algorithms
Sort
View
COCOON
2005
Springer
14 years 3 months ago
Promised and Distributed Quantum Search
This paper gives a quantum algorithm to search in an set S for a k-tuple satisfying some predefined relation, with the promise that some components of a desired k-tuple are in som...
Shengyu Zhang
QCQC
1998
Springer
154views Communications» more  QCQC 1998»
14 years 2 months ago
Automated Design of Quantum Circuits
In order to design a quantum circuit that performs a desired quantum computation, it is necessary to find a decomposition of the unitary matrix that represents that computation in ...
Colin P. Williams, Alexander G. Gray
ENGL
2008
79views more  ENGL 2008»
13 years 9 months ago
Cost Reduction in Nearest Neighbour Based Synthesis of Quantum Boolean Circuits
Quantum computer algorithms require an `oracle' as an integral part. An oracle is a reversible quantum Boolean circuit, where the inputs are kept unchanged at the outputs and ...
Mozammel H. A. Khan
ISCA
2005
IEEE
128views Hardware» more  ISCA 2005»
14 years 3 months ago
An Evaluation Framework and Instruction Set Architecture for Ion-Trap Based Quantum Micro-Architectures
: The theoretical study of quantum computation has yielded efficient algorithms for some traditionally hard problems. Correspondingly, experimental work on the underlying physical...
Steven Balensiefer, Lucas Kreger-Stickles, Mark Os...
ISAAC
2003
Springer
91views Algorithms» more  ISAAC 2003»
14 years 3 months ago
Quantum Merlin-Arthur Proof Systems: Are Multiple Merlins More Helpful to Arthur?
This paper introduces quantum “multiple-Merlin”-Arthur proof systems in which Arthur receives multiple quantum proofs that are unentangled with each other. Although classical ...
Hirotada Kobayashi, Keiji Matsumoto, Tomoyuki Yama...