1677 search results - page 14 / 336 » On the Completeness of Quantum Computation Models |
STOC
1998
ACM
15 years 3 months ago
1998
ACM
Current formal models for quantum computation deal only with unitary gates operating on “pure quantum states”. In these models it is difficult or impossible to deal formally w...
122
click to vote
ICQNM
2008
IEEE
15 years 6 months ago
2008
IEEE
Coin flipping is a cryptographic primitive in which two spatially separated players, who in principle do not trust each other, wish to establish a common random bit. If we limit ...
101
click to vote
FOCS
2008
IEEE
15 years 23 days ago
2008
IEEE
We introduce another variant of Quantum MIP, where the provers do not share entanglement, the communication between the verifier and the provers is quantum, but the provers are u...
TLCA
2005
Springer
15 years 5 months ago
2005
Springer
The objective of this paper is to develop a functional programming language for quantum computers. We develop a lambda calculus for the classical control model, following the firs...
103
click to vote
AISC
2008
Springer
15 years 1 months ago
2008
Springer
Graph-based formalisms of quantum computation provide an abstract and symbolic way to represent and simulate computations. However, manual manipulation of such graphs is slow and e...