Quantum groundmode computation with static gates
Abstract
We develop a computation model for solving Boolean networks by implementing wires through quantum groundmode computation and gates through identities following from angular momentum algebra and statistics. Gates are represented by threedimensional (triplet) symmetries due to particle indistinguishability and are identically satisfied throughout computation being constants of the motion. The relaxation of the wires yields the network solutions. Such gates cost no computation time, which is comparable with that of an easier Boolean network where all the gate constraints implemented as constants of the motion are removed. This model computation is robust with respect to decoherence and yields a generalized quantum speedup for all NP problems.
 Publication:

arXiv eprints
 Pub Date:
 September 2002
 DOI:
 10.48550/arXiv.quantph/0209169
 arXiv:
 arXiv:quantph/0209169
 Bibcode:
 2002quant.ph..9169C
 Keywords:

 Quantum Physics
 EPrint:
 4 pages, PDF, fifth page is a figure