paper

More on Static Quantum Computation

arXiv:quant-ph/9702056

Abstract

The construction of a universal static quantum computer actually provides another proof of the NP-hardness of spin-glass problems.

2 pages