The lambda-q calculus can efficiently simulate quantum computers

Details The lambda-q calculus can efficiently simulate quantum computers The lambda-q calculus can efficiently simulate quantum computers

1997-02-26

arxiv.org/abs/quant-ph/9702057v1

Physics

Quantum Physics

4 pages, LaTeX2e

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

The lambda-q calculus can efficiently simulate quantum computers does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The lambda-q calculus can efficiently simulate quantum computers, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The lambda-q calculus can efficiently simulate quantum computers will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-392366