Implementation for Solving Random Satisfiability Problems through CNOT-based circuits in a NMR Quantum Processor

Simple item page
dc.creatorPeng, Xinhua
dc.creatorZhu, Xiwen
dc.creatorGao, Kelin
dc.date2003-08-25
dc.date.accessioned2026-07-07T06:07:39Z
dc.date.available2026-07-07T06:07:39Z
dc.descriptionWe give a general method of construting quantum circuit for random \QTR{it}{satisfiability} (SAT) problems with the basic logic gates such as multi-qubit controlled-NOT and NOT gates. The sizes of these circuits are almost the same as the sizes of the SAT formulas. Further, a parallelization scheme is described to solve random SAT problems efficiently through these quantum circuits in \QTR{it}{nuclear magnetic resonance} (NMR) ensemble quantum computing. This scheme exploits truly mixed states as input states rather than pseudo-pure states, and combines with the topological nanture of the NMR spectrum to identify the solutions to SAT problems in a parallel way. Several typical SAT problems have been experimentally demonstrated by this scheme with good performances.
dc.description17 pages, 7 figures
dc.identifierhttps://arxiv.org/abs/quant-ph/0308130
dc.identifierhttp://arxiv.org/abs/quant-ph/0308130
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/91367
dc.subjectQuantum Physics
dc.titleImplementation for Solving Random Satisfiability Problems through CNOT-based circuits in a NMR Quantum Processor
dc.typetext

Files

Collections

arXiv