Sciweavers

5215 search results - page 7 / 1043
» Quantum clustering algorithms
Sort
View
COCO
2005
Springer
141views Algorithms» more  COCO 2005»
14 years 3 months ago
Upper Bounds for Quantum Interactive Proofs with Competing Provers
Refereed games are interactive proof systems with two competing provers: one that tries to convince the verifier to accept and another that tries to convince the verifier to rej...
Gus Gutoski
ENGL
2008
170views more  ENGL 2008»
13 years 9 months ago
Design of Reversible/Quantum Ternary Comparator Circuits
Multiple-valued quantum circuits are promising choices for future quantum computing technology, since the multiple-valued quantum system is more compact than the corresponding bina...
Mozammel H. A. Khan
DAC
2004
ACM
14 years 10 months ago
Quantum logic synthesis by symbolic reachability analysis
Reversible quantum logic plays an important role in quantum computing. In this paper, we propose an approach to optimally synthesize quantum circuits by symbolic reachability anal...
William N. N. Hung, Xiaoyu Song, Guowu Yang, Jin Y...
CAIP
2005
Springer
133views Image Analysis» more  CAIP 2005»
14 years 3 months ago
Finding the Number of Clusters for Nonparametric Segmentation
Non-parametric data representation can be done by means of a potential function. This paper introduces a methodology for finding modes of the potential function. Two different me...
Nikolaos Nasios, Adrian G. Bors
COCO
2007
Springer
142views Algorithms» more  COCO 2007»
14 years 3 months ago
Quantum t-designs: t-wise Independence in the Quantum World
A t-design for quantum states is a finite set of quantum states with the property of simulating the Haar-measure on quantum states w.r.t. any test that uses at most t copies of a...
Andris Ambainis, Joseph Emerson