55 search results - page 10 / 11 » Adiabatic Quantum Computation is Equivalent to Standard Quan... |
COCO
2007
Springer
13 years 12 months ago
2007
Springer
Valiant has proposed a new theory of algorithmic computation based on perfect matchings and Pfaffians. We study the properties of matchgates—the basic building blocks in this n...
ENTCS
2007
13 years 5 months ago
2007
There is a growing interest in models of reversible computation driven by exciting application areas such as bio-systems and quantum computing. Reversible process algebras RCCS [2...
ICPR
2004
IEEE
14 years 6 months ago
2004
IEEE
Parallel processors such as SIMD computers have been successfully used in various areas of high performance image and data processing. Due to their characteristics of highly regula...
NIPS
2000
13 years 7 months ago
2000
Learning of a smooth but nonparametric probability density can be regularized using methods of Quantum Field Theory. We implement a field theoretic prior numerically, test its eff...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
Quantum stabilizer states over Fm can be represented as self-dual additive codes over Fm2 . These codes can be represented as weighted graphs, and orbits of graphs under the genera...