|
| related topics |
| {algorithm, log, probability} |
| {alice, bob, state} |
| {error, code, errors} |
| {state, states, coherent} |
| {group, space, representation} |
| {theory, mechanics, state} |
|
Using Quantum Mechanics to Cope with Liars
Stefano Mancini, Lorenzo Maccone
abstract: We propose the use of a quantum algorithm to deal with the problem of
searching with errors in the framework of two-person games. Specifically, we
present a solution to the Ulam's problem that polynomially reduces its query
complexity and makes it independent from the dimension of the search space.
- oai_identifier:
- oai:arXiv.org:quant-ph/0508156
- categories:
- quant-ph
- comments:
- 4 pages, RevTeX file, revised version
- arxiv_id:
- quant-ph/0508156
- journal_ref:
- Int. J. of Quant. Inf. Vol.3, No.4, pp.729-733 (2005)
- created:
- 2005-08-21
- updated:
- 2005-10-06
Full article ▸
|
|
| related documents |
| 0303074v1 |
| 0207108v1 |
| 0208112v1 |
| 9702057v1 |
| 9812057v1 |
| 0209148v1 |
| 0206066v1 |
| 0308016v1 |
| 0609160v1 |
| 0608156v1 |
| 0612052v2 |
| 0012088v1 |
| 0403071v1 |
| 0609166v1 |
| 0406104v1 |
| 0612033v1 |
| 0606242v3 |
| 0507024v1 |
| 0502144v1 |
| 0406146v1 |
| 0703193v2 |
| 0507194v1 |
| 0312096v2 |
| 0406121v1 |
| 0701198v1 |
|