2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/150921The construction of a universal static quantum computer actually provides another proof of the NP-hardness of spin-glass problems.2 pagesQuantum PhysicsMore on Static Quantum Computationtext