Reversible Mapping for Tree Structured Quantum Computation

Simple item page
dc.creatorBurkot, Wojciech
dc.date1997-12-17
dc.date.accessioned2026-07-07T06:14:39Z
dc.date.available2026-07-07T06:14:39Z
dc.descriptionA hierarchical, reversible mapping between levels of tree structured computation, applicable for structuring the Quantum Computation algorithm for NP-complete problem is presented. It is proven that confining the state of a quantum computer to a subspace of the available Hilbert space, where states are consistent with the problem constraints, can be done in polynomial time. The proposed mapping, together with the method of state reduction can be potentially used for solving NP-complete problems in polynomial time.
dc.descriptionTypeset using Revtex, 8 pages including 2 fullpage PostScript figures, submitted to Phys.Rev.Lett
dc.identifierhttps://arxiv.org/abs/quant-ph/9712033
dc.identifierhttp://arxiv.org/abs/quant-ph/9712033
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/93542
dc.subjectQuantum Physics
dc.titleReversible Mapping for Tree Structured Quantum Computation
dc.typetext

Files

Collections

arXiv