http://arxiv.org/abs/0709.4502 Reading part of a database without revealing what you're looking at. We describe a method for private database queries using exchange of quantum states with bits encoded in mutually incompatible bases. For technology with limited coherence time, the database vendor can announce the encoding after a suitable delay to allow the user to privately learn one of two items in the database without the ability to also definitely infer the second item. This quantum approach also allows the user to choose to learn other functions of the items, such as the exclusive-or of their bits, but not to gain more information than equivalent to learning one item, on average. This method is especially useful for items consisting of a few bits by avoiding the substantial overhead of conventional cryptographic approaches. Tad Hogg and Li Zhang 2009-04-08 19:45:00 quantum information privacy digital property rights http://arxiv.org/abs/0707.4195 How people perform in an auction using simulated quantum information processing. quantum information incentive design experimental economics We describe human-subject laboratory experiments on probabilistic auctions based on previously proposed auction protocols involving the simulated manipulation and communication of quantum states. These auctions are probabilistic in determining which bidder wins, or having no winner, rather than always having the highest bidder win. Comparing two quantum protocols in the context of first-price sealed bid auctions, we find the one predicted to be superior by game theory also performs better experimentally. We also compare with a conventional first price auction, which gives higher performance. Thus to provide benefits, the quantum protocol requires more complex economic scenarios such as maintaining privacy of bids over a series of related auctions or involving allocative externalities. Kay-Yut Chen and Tad Hogg 2008-08-19 12:00:00 http://arxiv.org/abs/0704.0800 A privacy-preserving auction using quantum information processing. quantum information incentive design game theory economics We present a quantum auction protocol using superpositions to represent bids and distributed search to identify the winner(s). Measuring the final quantum state gives the auction outcome while simultaneously destroying the superposition. Thus non-winning bids are never revealed. Participants can use entanglement to arrange for correlations among their bids, with the assurance that this entanglement is not observable by others. The protocol is useful for information hiding applications, such as partnership bidding with allocative externality or concerns about revealing bidding preferences. The protocol applies to a variety of auction types, e.g., first or second price, and to auctions involving either a single item or arbitrary bundles of items (i.e., combinatorial auctions). We analyze the game-theoretical behavior of the quantum protocol for the simple case of a sealed-bid quantum, and show how a suitably designed adiabatic sear h reduces the possibilities for bidders to game the auction. This design illustrates how incentive rather that computational constraints affect quantum algorithm choices. Tad Hogg, Pavithra Harsha and Kay-Yut Chen 2008-08-19 12:00:00 http://www.hpl.hp.com/research/idl/papers/qpdilemma/index.html People can effectively use quantum entanglement to reduce free riding. quantum information game theory experimental economics (click link to view abstract) Kay-Yut Chen and Tad Hogg 2007-01-01 00:00:00 http://www.hpl.hp.com/research/idl/papers/publicgoods/index.html Quantum information can help address public goods problems. quantum information game theory economics (click link to view abstract) Kay-Yut Chen, Tad Hogg and Raymond Beausoleil 2007-01-01 00:00:00 http://www.hpl.hp.com/research/idl/papers/coordination/index.html Entangled particles provide a coordination mechanism. quantum information game theory (click link to view abstract) Bernardo A. Huberman and Tad Hogg 2007-01-01 00:00:00 http://www.hpl.hp.com/research/idl/papers/adiabatic/index.html An NMR quantum computer for combinatorial search. quantum information (click link to view abstract) M. Steffen, W. van Dam, T. Hogg, G. Breyta and I. Chuang 2007-01-01 00:00:00 http://www.hpl.hp.com/research/idl/papers/quantum/index.html Classical economics can help quantum computation. quantum information (click link to view abstract) Sebastian M. Maurer, Tad Hogg and Bernardo A. Huberma 2007-01-01 00:00:00