Quantum auctions using adiabatic evolution: The corrupt auctioneer and circuit implementations

We examine a proposed auction algorithm using quantum states to represent bids and distributed adiabatic search to find the winner. 1 When the auctioneer follows the protocol, the final measurement giving the outcome of the auction also destroys the bid states, thereby preserving the 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 auction protocol, and quantum circuits to perpetrate and to counter attacks by a dishonest auctioneer.