Reversible Mapping for Tree Structured Quantum Computation

Details Reversible Mapping for Tree Structured Quantum Computation Reversible Mapping for Tree Structured Quantum Computation

1997-12-17

arxiv.org/abs/quant-ph/9712033v1

Physics

Quantum Physics

Typeset using Revtex, 8 pages including 2 fullpage PostScript figures, submitted to Phys.Rev.Lett

Scientific paper

A 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.

Affiliated with

Also associated with

No associations

Rating

Reversible Mapping for Tree Structured Quantum Computation 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 Reversible Mapping for Tree Structured Quantum Computation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Reversible Mapping for Tree Structured Quantum Computation will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-677740