508 search results - page 24 / 102 » Poly-locality in quantum computing |
128
click to vote
ISTCS
1997
Springer
15 years 1 months ago
1997
Springer
We investigate the power of quantum computers when they are required to return an answer that is guaranteed to be correct after a time that is upper-bounded by a polynomial in the...
CCR
2004
14 years 9 months ago
2004
A team of researchers from the Massachusetts Institute of Technology (MIT) and Northwestern University (NU) is developing a system for long-distance, high-fidelity qubit teleporta...
100
click to vote
CORR
2011
Springer
14 years 4 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...
COGSCI
2007
14 years 9 months ago
2007
In their article, Is the Brain a Quantum Computer,? Litt, Eliasmith, Kroon, Weinstein, and Thagard (2006) criticize the Penrose–Hameroff “Orch OR” quantum computational mode...
DATE
2004
IEEE
15 years 1 months ago
2004
IEEE
We show how to implement an arbitrary two-qubit unitary operation using any of several quantum gate libraries with small a priori upper bounds on gate counts. In analogy to librar...