More on Static Quantum Computation
classification
🪐 quant-ph
keywords
quantumstaticactuallyanothercomputationcomputerconstructionnp-hardness
read the original abstract
The construction of a universal static quantum computer actually provides another proof of the NP-hardness of spin-glass problems.
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.