More on Static Quantum Computation
Abstract
The construction of a universal static quantum computer actually provides another proof of the NP-hardness of spin-glass problems.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.