The lambdaq calculus can efficiently simulate quantum computers
Abstract
We show that the lambdaq calculus can efficiently simulate quantum Turing machines by showing how the lambdaq calculus can efficiently simulate a class of quantum cellular automaton that are equivalent to quantum Turing machines. We conclude by noting that the lambdaq calculus may be strictly stronger than quantum computers because NPcomplete problems such as satisfiability are efficiently solvable in the lambdaq calculus but there is a widespread doubt that they are efficiently solvable by quantum computers.
 Publication:

arXiv eprints
 Pub Date:
 February 1997
 arXiv:
 arXiv:quantph/9702057
 Bibcode:
 1997quant.ph..2057M
 Keywords:

 Quantum Physics
 EPrint:
 4 pages, LaTeX2e