arXiv Analytics

Sign in

arXiv:0707.2051 [quant-ph]AbstractReferencesReviewsResources

Quantum Auctions using Adiabatic Evolution: The Corrupt Auctioneer and Circuit Implementations

Saikat Guha, Tad Hogg, David Fattal, Timothy Spiller, Raymond G. Beausoleil

Published 2007-07-13, updated 2008-07-14Version 2

We examine a proposed auction using quantum states to represent bids and distributed adiabatic search to find the winner. When the auctioneer follows the protocol, the final measurement giving the outcome of the auction also destroys the bid states, thereby preserving privacy of losing bidders. We describe how a dishonest auctioneer could alter the protocol to violate this privacy guarantee, and present methods by which bidders can counter such attacks. We also suggest possible quantum circuit implementations of the auctions protocol, and quantum circuits to perpetrate and to counter attacks by a dishonest auctioneer.

Comments: 26 pages, 10 figures, accepted for publication by International Journal of Quantum Information (IJQI)
Journal: Int. J. of Quantum Information, Vol. 6, No. 4, August 2008
Categories: quant-ph
Related articles: Most relevant | Search more
arXiv:quant-ph/0001106 (Published 2000-01-28)
Quantum Computation by Adiabatic Evolution
arXiv:quant-ph/0412117 (Published 2004-12-15)
Quantum search algorithm by adiabatic evolution under a priori probability
arXiv:quant-ph/0509150 (Published 2005-09-21)
Geometric nature in adiabatic evolution of dark eigenstates