Using Quantum Mechanics to Cope with Liars
Quantum Physics
2007-05-23 v3
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.
Cite
@article{arxiv.quant-ph/0508156,
title = {Using Quantum Mechanics to Cope with Liars},
author = {Stefano Mancini and Lorenzo Maccone},
journal= {arXiv preprint arXiv:quant-ph/0508156},
year = {2007}
}
Comments
4 pages, RevTeX file, revised version