Reversible Mapping for Tree Structured Quantum Computation

Wojciech Burkot

Reversible Mapping for Tree Structured Quantum Computation

Quantum Physics 2007-05-23 v1

Authors: Wojciech Burkot

Abstract

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.

Keywords

quantum state space quantum algorithms quantum search algorithms

Cite

@article{arxiv.quant-ph/9712033,
  title  = {Reversible Mapping for Tree Structured Quantum Computation},
  author = {Wojciech Burkot},
  journal= {arXiv preprint arXiv:quant-ph/9712033},
  year   = {2007}
}

Comments

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

Related papers

View all related →