Mitra, Avik and Kumar, Anil (2009) Experimental implementation of quantumUlam’s problem in a nuclear magnetic resonance quantum information processor. In: Journal of the Indian Institute of Science, 89 (3).
Anil.pdf - Published Version
The Ulam’s problem is a two person game in which one of the player tries to search, in minimum queries, a number thought by the other player. Classically the problem scales polynomially with the size of the number. The quantum version of the Ulam’s problem has a query complexity that is independent of the dimension of the search space. The experimental implementation of the quantum Ulam’s problem in a Nuclear Magnetic Resonance Information Processor with 3 quantum bits is reported here.
|Item Type:||Journal Article|
|Additional Information:||Copyright of this article belongs to The Indian Institute of Science (IISc).|
|Department/Centre:||Division of Chemical Sciences > NMR Research Centre (Formerly SIF)
Division of Physical & Mathematical Sciences > Physics
|Date Deposited:||03 Feb 2012 06:15|
|Last Modified:||03 Feb 2012 06:15|
Actions (login required)