|
| related topics |
| {algorithm, log, probability} |
| {let, theorem, proof} |
| {time, systems, information} |
| {theory, mechanics, state} |
| {qubit, qubits, gate} |
|
The lambda-q calculus can efficiently simulate quantum computers
Philip Maymin
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.
- oai_identifier:
- oai:arXiv.org:quant-ph/9702057
- categories:
- quant-ph
- comments:
- 4 pages, LaTeX2e
- arxiv_id:
- quant-ph/9702057
- created:
- 1997-02-26
Full article ▸
|
|
| related documents |
| 0208112v1 |
| 0209148v1 |
| 0206066v1 |
| 0608156v1 |
| 0508156v3 |
| 0308016v1 |
| 0303074v1 |
| 0207108v1 |
| 0012088v1 |
| 0612052v2 |
| 0005087v2 |
| 0507024v1 |
| 9908090v3 |
| 0612033v1 |
| 0606242v3 |
| 0105014v2 |
| 0502144v1 |
| 0209139v1 |
| 0104007v2 |
| 0002009v1 |
| 0406146v1 |
| 0001034v1 |
| 9811027v1 |
| 0703193v2 |
| 0507194v1 |
|