1677 search results - page 16 / 336 » On the Completeness of Quantum Computation Models |
135
click to vote
LOGCOM
2010
14 years 6 months ago
2010
We describe a method to axiomatize computations in deterministic Turing machines (TMs). When applied to computations in non-deterministic TMs, this method may produce contradictor...
ICALP
2004
Springer
15 years 5 months ago
2004
Springer
Quantum algorithms for graph problems are considered, both in the adjacency matrix model and in an adjacency list-like array model. We give almost tight lower and upper bounds for ...
111
click to vote
CORR
2004
Springer
14 years 11 months ago
2004
Springer
The objective of this paper is to develop a functional programming language for quantum computers. We develop a lambda-calculus for the QRAM model, following the work of P. Seling...
TCS
2008
14 years 11 months ago
2008
This paper provides one more step towards bridging the gap between the formal and computational approaches to the verification of cryptographic protocols. We extend the well-known ...
DCC
2008
IEEE
15 years 11 months ago
2008
IEEE
The name `graph state' is used to describe a certain class of pure quantum state which models a physical structure on which one can perform measurement-based quantum computin...