More on Static Quantum Computation

Loading...
Thumbnail Image

Date

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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

Citation

Collections