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...
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...
Seth Lloyd, Jeffrey H. Shapiro, Franco N. C. Wong,...
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...
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...
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...
Vivek V. Shende, Igor L. Markov, Stephen S. Bulloc...