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...
The paper investigates non-deterministic, probabilistic and quantum walks, from the perspective of coalgebras and monads. Nondeterministic and probabilistic walks are coalgebras of...
Quantum computation deals with projective measurements and unitary transformations in finite dimensional Hilbert spaces. The paper presents a propositional logic designed to descr...
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,...