7486 search results - page 30 / 1498 » The Limits of Quantum Computers |
133
Voted
CIE
2010
Springer
15 years 10 months ago
2010
Springer
The notion of computability is stable (i.e. independent of the choice of an indexing) over infinite-dimensional vector spaces provided they have a finite “tensorial dimension...
175
Voted
FOSSACS
2011
Springer
14 years 9 months ago
2011
Springer
The paper investigates non-deterministic, probabilistic and quantum walks, from the perspective of coalgebras and monads. Nondeterministic and probabilistic walks are coalgebras of...
148
Voted
CSL
2003
Springer
15 years 11 months ago
2003
Springer
Quantum computation deals with projective measurements and unitary transformations in finite dimensional Hilbert spaces. The paper presents a propositional logic designed to descr...
228
click to vote
ISTCS
1997
Springer
15 years 9 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...
136
Voted
CCR
2004
15 years 5 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...