The lambda-q calculus can efficiently simulate quantum computers Export

@misc{citeulike:936706, 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.}, archivePrefix = {arXiv}, author = {Maymin, Philip}, citeulike-article-id = {936706}, citeulike-linkout-0 = {http://arxiv.org/abs/quant-ph/9702057}, citeulike-linkout-1 = {http://arxiv.org/pdf/quant-ph/9702057}, day = {26}, eprint = {quant-ph/9702057}, keywords = {lambda-calculus, quantum}, month = {Feb}, posted-at = {2007-03-19 15:43:39}, priority = {3}, title = {The lambda-q calculus can efficiently simulate quantum computers}, url = {http://arxiv.org/abs/quant-ph/9702057}, year = {1997} }

TY - ELEC ID - citeulike:936706 L3 - citeulike-article-id:936706 N2 - 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. TI - The lambda-q calculus can efficiently simulate quantum computers KW - lambda-calculus KW - quantum AU - Maymin, Philip PY - 1997/Feb/26/ UR - http://arxiv.org/abs/quant-ph/9702057 ER -