Using Quantum Mechanics to Cope with Liars
| dc.creator | Mancini, Stefano | |
| dc.creator | Maccone, Lorenzo | |
| dc.date | 2005-08-21 | |
| dc.date | 2005-10-06 | |
| dc.date.accessioned | 2026-07-07T06:24:26Z | |
| dc.date.available | 2026-07-07T06:24:26Z | |
| dc.description | 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. | |
| dc.description | 4 pages, RevTeX file, revised version | |
| dc.identifier | https://arxiv.org/abs/quant-ph/0508156 | |
| dc.identifier | http://arxiv.org/abs/quant-ph/0508156 | |
| dc.identifier | Int. J. of Quant. Inf. Vol.3, No.4, pp.729-733 (2005) | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/96544 | |
| dc.subject | Quantum Physics | |
| dc.title | Using Quantum Mechanics to Cope with Liars | |
| dc.type | text |