55 search results - page 7 / 11 » Adiabatic Quantum Computation is Equivalent to Standard Quan... |
69
Voted
CORR
2008
Springer
14 years 9 months ago
2008
Springer
It has recently been discovered that both quantum and classical propositional logics can be modelled by classes of nonorthomodular and thus non-distributive lattices that properly...
STOC
2007
ACM
15 years 9 months ago
2007
ACM
The quantum adversary method is one of the most successful techniques for proving lower bounds on quantum query complexity. It gives optimal lower bounds for many problems, has ap...
SIAMSC
2010
14 years 7 months ago
2010
Abstract. We present a new algorithm that computes eigenvalues and eigenvectors of a Hermitian positive definite matrix while solving a linear system of equations with Conjugate G...
DATE
2010
IEEE
15 years 2 months ago
2010
IEEE
—With the prospect of atomic-scale computing, we study cumulative energy profiles of spin-spin interactions in nonferromagnetic lattices (Ising spin-glasses)—an established to...
ECCC
2002
14 years 9 months ago
2002
Would physical laws permit the construction of computing machines that are capable of solving some problems much faster than the standard computational model? Recent evidence sugge...