Experimental implementation of quantum Ulam’s problem in a nuclear magnetic resonance quantum information processor

Avik Mitra, Anil Kumar


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.

Full Text:



  • There are currently no refbacks.