Exploiting Particle Statistics in Quantum Computation
classification
🪐 quant-ph
keywords
computationformparticlequantumstatisticsbosoniccounterfactualdescribe
read the original abstract
We describe a plausible-speculative form of quantum computation which exploits particle (fermionic, bosonic) statistics, under a generalized, counterfactual interpretation thereof. In the idealized situation of an isolated system, it seems that this form of computation yields to NP-complete=P.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.