The lambda-q calculus can efficiently simulate quantum computers
量子物理
2009-09-25 v1
摘要
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.
引用
@article{arxiv.quant-ph/9702057,
title = {The lambda-q calculus can efficiently simulate quantum computers},
author = {Philip Maymin},
journal= {arXiv preprint arXiv:quant-ph/9702057},
year = {2009}
}
备注
4 pages, LaTeX2e