Rapid solution of problems by nuclear-magnetic-resonance quantum computation

John M. Myers, A. F. Fahmy, S. J. Glaser, R. Marx

Research output: Contribution to journalArticlepeer-review

2 Scopus citations

Abstract

We offer an improved method for using a nuclear-magnetic-resonance quantum computer (NMRQC) to solve the Deutsch-Jozsa problem. Two known obstacles to the application of the NMRQC are an exponential diminishment of density-matrix elements with the number of bits, threatening weak signal levels; and the high cost of preparing a suitable starting state. A third obstacle is a heretofore unnoticed restriction on measurement operators available for use by a NMRQC. Variations on the function classes of the Deutsch-Jozsa problem are introduced, both to extend the range of problems advantageous for quantum computation and to escape all three obstacles to the use of a NMRQC. At the cost of an extra work bit and a polynomial increase in the number of gate operations required, the method solves the Deutsch-Jozsa problem while avoiding an exponential loss of the signal, preparation of a pseudopure state, and temporal averaging.

Original languageEnglish
Article number032302
Pages (from-to)1-8
Number of pages8
JournalPhysical Review A
Volume63
Issue number3
DOIs
StatePublished - 2001

Fingerprint

Dive into the research topics of 'Rapid solution of problems by nuclear-magnetic-resonance quantum computation'. Together they form a unique fingerprint.

Cite this