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

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

2001-08-26

arxiv.org/abs/quant-ph/0108116v2

Physics

Quantum Physics

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

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

A polynomial-time solution to the parity problem on an NMR quantum computer does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A polynomial-time solution to the parity problem on an NMR quantum computer, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A polynomial-time solution to the parity problem on an NMR quantum computer will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-113384