A polynomial-time solution to the parity problem on an NMR quantum computer

Abstract

An efficient quantum algorithm is proposed to solve in polynomial time the parity problem, one of the hardest problems both in conventional quantum computation and in classical computation, on NMR quantum computers. It is based on the quantum parallelism principle in a quantum ensemble, the selective decoherence manipulation, and the NMR phase-sensitive measurement. The quantum circuit for the quantum algorithm is designed explicitly.

18 pages, no figure. Some small errors are corrected, but conclusion is not changed

Cited by in corpus (8)

• Characterization of quantum computable decision problems by state discrimination
• Solving the quantum search problem in polynomial time on an NMR quantum computer
• On the solution of trivalent decision problems by quantum state identification
• The universal quantum driving force to speed up a quantum computation -- The unitary quantum dynamics
• A prime factorization based on quantum dynamics on a spin ensemble (I)
• The basic principles to construct a generalized state-locking pulse field and simulate efficiently the reversible and unitary halting protocol of a universal quantum computer
• Introduction to the multiple-quantum operator spaces
• Physics and metaphysics looks at computation