Quantum Nondeterministic Computation based on Statistics Superselection Rules
Giuseppe Castagnoli · International Journal of Modern Physics B · 1997
Quantum states which obey certain symmetry superselection rules under identical particles permutation can be interpreted as computational states satisfying corresponding Boolean predicates. Given the NP-complete problem of testing the satisfiability of a generic Boolean predicate P, we investigate the possibility of achieving quantum nondeterministic computation by deriving, from P, a physical situation in which the computational states satisfy Piff they satisfy a special fermion statistics.