Sciweavers

3328 search results - page 24 / 666
» Topological Quantum Computation
Sort
View
ENGL
2008
79views more  ENGL 2008»
13 years 7 months ago
Cost Reduction in Nearest Neighbour Based Synthesis of Quantum Boolean Circuits
Quantum computer algorithms require an `oracle' as an integral part. An oracle is a reversible quantum Boolean circuit, where the inputs are kept unchanged at the outputs and ...
Mozammel H. A. Khan
ISCI
2008
104views more  ISCI 2008»
13 years 7 months ago
Unconditionally secure cryptosystems based on quantum cryptography
Most modern cryptographic studies design cryptosystems and algorithms using mathematical concepts. In designing and analyzing cryptosystems and protocols, mathematical concepts ar...
Yu-Fang Chung, Zhen Yu Wu, Tzer-Shyong Chen
ICMLA
2010
13 years 5 months ago
A Probabilistic Graphical Model of Quantum Systems
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...
Chen-Hsiang Yeang
CIE
2010
Springer
14 years 11 days ago
On the Completeness of Quantum Computation Models
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...
Pablo Arrighi, Gilles Dowek
FOSSACS
2011
Springer
12 years 11 months ago
Coalgebraic Walks, in Quantum and Turing Computation
The paper investigates non-deterministic, probabilistic and quantum walks, from the perspective of coalgebras and monads. Nondeterministic and probabilistic walks are coalgebras of...
Bart Jacobs