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

Simple item page
dc.creatorMiao, Xijia
dc.date2001-08-26
dc.date2001-09-06
dc.date.accessioned2026-07-07T06:02:36Z
dc.date.available2026-07-07T06:02:36Z
dc.descriptionAn 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.
dc.description18 pages, no figure. Some small errors are corrected, but conclusion is not changed
dc.identifierhttps://arxiv.org/abs/quant-ph/0108116
dc.identifierhttp://arxiv.org/abs/quant-ph/0108116
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/89668
dc.subjectQuantum Physics
dc.titleA polynomial-time solution to the parity problem on an NMR quantum computer
dc.typetext

Files

Collections

arXiv