CiteULike Search Register Log in
CiteULike is a free online bibliography manager. Register and you can start organising your references online.

The lambda-q calculus can efficiently simulate quantum computers

by: Philip Maymin
(26 Feb 1997)

X Abstract

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

View the full article here:

arXiv (abstract), arXiv (PDF)

This article has been bookmarked 2 times, initially on 2006-11-08.

2007-03-19 User bendiken
2006-11-08 User tov
Privacy Statement | Terms & Conditions
CiteULike organises scholarly (or academic) papers or literature and provides bibliographic (which means it makes bibliographies) for universities and higher education establishments. It helps undergraduates and postgraduates. People studying for PhDs or in postdoctoral (postdoc) positions. The service is similar in scope to EndNote or RefWorks or any other reference manager like BibTeX, but it is a social bookmarking service for scientists and humanities researchers.