  We develop a computation model for solving Boolean networks by implementing
wires through quantum ground-mode computation and gates through identities
following from angular momentum algebra and statistics. Gates are represented
by three-dimensional (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 speed-up for all NP problems.
