55 search results - page 3 / 11 » Adiabatic Quantum Computation is Equivalent to Standard Quan... |
ISAAC
2003
Springer
13 years 11 months ago
2003
Springer
This paper introduces quantum “multiple-Merlin”-Arthur proof systems in which Arthur receives multiple quantum proofs that are unentangled with each other. Although classical ...
ENTCS
2006
13 years 6 months ago
2006
It is reasonable to assume that quantum computations take place under the control of the classical world. For modelling this standard situation, we introduce a Classically-control...
STOC
2009
ACM
14 years 6 months ago
2009
ACM
The quantum analog of a constraint satisfaction problem is a sum of local Hamiltonians - each (term of the) Hamiltonian specifies a local constraint whose violation contributes to...
ICALP
2005
Springer
13 years 11 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...
ICCAD
2007
IEEE
14 years 2 months ago
2007
IEEE
Among the post-CMOS technologies currently under investigation, quantum computing (QC) holds a special place. QC offers not only extremely small size and low power, but also expon...