Sciweavers

7486 search results - page 28 / 1498
» The Limits of Quantum Computers
Sort
View
CF
2007
ACM
14 years 21 days ago
Converting massive TLP to DLP: a special-purpose processor for molecular orbital computations
We propose an application specific processor for computational quantum chemistry. The kernel of interest is the computation of electron repulsion integrals (ERIs), which vary in c...
Tirath Ramdas, Gregory K. Egan, David Abramson, Ki...
COCO
2007
Springer
75views Algorithms» more  COCO 2007»
14 years 2 months ago
On the Theory of Matchgate Computations
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...
Jin-yi Cai, Vinay Choudhary, Pinyan Lu
IAT
2008
IEEE
14 years 3 months ago
Quantum Service Selection
Quantum service selection facilitates matchmaking of Web services and greatly benefits from quantum memory exponential in the number of its qubits as well as from computational s...
Matthias Klusch, René Schubotz
GECCO
2004
Springer
120views Optimization» more  GECCO 2004»
14 years 2 months ago
Comparison of Selection Strategies for Evolutionary Quantum Circuit Design
Evolution of quantum circuits faces two major challenges: complex and huge search spaces and the high costs of simulating quantum circuits on conventional computers. In this paper ...
André Leier, Wolfgang Banzhaf
ASIAN
2009
Springer
363views Algorithms» more  ASIAN 2009»
13 years 9 months ago
A Logic for Formal Verification of Quantum Programs
Abstract. This paper provides a Hoare-style logic for quantum computation. While the usual Hoare logic helps us to verify classical deterministic programs, our logic supports quant...
Yoshihiko Kakutani