Sciweavers

4084 search results - page 4 / 817
» The Method of Quantum Clustering
Sort
View
116
Voted
TCAD
2008
102views more  TCAD 2008»
15 years 3 months ago
Quantum Circuit Simplification and Level Compaction
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...
Dmitri Maslov, Gerhard W. Dueck, D. Michael Miller...
96
Voted
STOC
2006
ACM
78views Algorithms» more  STOC 2006»
16 years 4 months ago
A new quantum lower bound method, : with applications to direct product theorems and time-space tradeoffs
Andris Ambainis, Robert Spalek, Ronald de Wolf
128
Voted
ISMVL
2007
IEEE
76views Hardware» more  ISMVL 2007»
15 years 10 months ago
Variable Reordering and Sifting for QMDD
This paper considers variable reordering for quantum multiple-valued decision diagrams (QMDD) used to represent the matrices describing reversible and quantum gates and circuits. ...
D. Michael Miller, David Y. Feinstein, Mitchell A....
116
Voted
ICALP
2005
Springer
15 years 9 months ago
All Quantum Adversary Methods Are Equivalent
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...
Robert Spalek, Mario Szegedy
122
Voted
WSCG
2004
118views more  WSCG 2004»
15 years 5 months ago
New Method for Geometric Constraint Solving Based on the Genetic Quantum Algorithm
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...
Chunhong Cao, Wenhui Li