508 search results - page 23 / 102 » Poly-locality in quantum computing |
150
Voted
ISCI
2008
15 years 2 months ago
2008
Most modern cryptographic studies design cryptosystems and algorithms using mathematical concepts. In designing and analyzing cryptosystems and protocols, mathematical concepts ar...
148
Voted
ICMLA
2010
15 years 23 days ago
2010
Quantum systems are promising candidates of future computing and information processing devices. In a large system, information about the quantum states and processes may be incomp...
103
Voted
CIE
2010
Springer
15 years 7 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...
140
Voted
FOSSACS
2011
Springer
14 years 6 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...
122
Voted
CSL
2003
Springer
15 years 8 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...