317 search results - page 5 / 64 » Geometry of abstraction in quantum computation |
134
click to vote
QCQC
1998
Springer
15 years 8 months ago
1998
Springer
In order to design a quantum circuit that performs a desired quantum computation, it is necessary to find a decomposition of the unitary matrix that represents that computation in ...
166
click to vote
CORR
2011
Springer
14 years 11 months ago
2011
Springer
Abstract. Notoriously, quantum computation shatters complexity theory, but is innocuous to computability theory [17]. Yet several works have shown how quantum theory as it stands c...
COMPGEOM
1989
ACM
15 years 8 months ago
1989
ACM
d Abstract) Bernard Chazelle Burton Rosenberg Department of Computer Science Princeton University
120
click to vote
ICALP
2005
Springer
15 years 9 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...
129
click to vote
AI
2002
Springer
15 years 4 months ago
2002
Springer
Abstract In this paper, we describe our Question Answering (QA) system called QUANTUM. The goal of QUANTUM is to find the answer to a natural language question in a large document ...