4084 search results - page 4 / 817 » The Method of Quantum Clustering |
TCAD
2008
14 years 9 months ago
2008
Abstract--Quantum circuits are time-dependent diagrams describing the process of quantum computation. Usually, a quantum algorithm must be mapped into a quantum circuit. Optimal sy...
STOC
2006
ACM
15 years 9 months ago
2006
ACM
ISMVL
2007
IEEE
15 years 3 months ago
2007
IEEE
This paper considers variable reordering for quantum multiple-valued decision diagrams (QMDD) used to represent the matrices describing reversible and quantum gates and circuits. ...
ICALP
2005
Springer
15 years 3 months ago
2005
Springer
Abstract: The quantum adversary method is one of the most versatile lower-bound methods for quantum algorithms. We show that all known variants of this method are equivalent: spect...
WSCG
2004
14 years 10 months ago
2004
This paper proposes a novel genetic quantum algorithm (GQA) to solve geometric constraint problems. Instead of binary, numeric or symbolic representation, we introduce qubit chrom...