Yale & U-Michigan researchers prove minimum-weight decoding is NP-hard for color code, surface code, and transversal CNOT variants via 3D matching reduction, establishing a fundamental scalability barrier for fault-tolerant QEC.
#QuantumErrorCorrection #NPHard #News
Local Crossing Minimization NP-Hard; Median Heuristic 3‑Approx
Researchers proved the unweighted one‑sided local crossing minimization problem is NP‑hard and that the median heuristic still gives a 3‑approximation, per a paper submitted Sep 30 2025. getnews.me/local-crossing-minimizat... #graphdrawing #nphard
New Study Shows Secret Protection Problem Is NP‑Hard
New research proves the uniform secret‑protection problem is NP‑hard and a variant is Σ₂^P‑complete; the authors also present an ILP model that scales to realistic system sizes. Read more: getnews.me/new-study-shows-secret-p... #secretprotection #nphard #complexity
Freeze-Tag Problem Proven NP-Hard for 2D Manhattan Distance
Researchers have proved the Freeze-Tag Problem is strongly NP-hard when movement costs use Manhattan (L1) distance on a 2-D grid, settling a long-standing open question. getnews.me/freeze-tag-problem-prove... #freezetag #nphard #robotics
Study Finds NP‑Hardness of ROABP Order Finding and Equivalence
Researchers proved that finding ROABP ordering and testing GL_n equivalence are NP‑hard even for quadratic forms, and that approximating minimal width is also NP‑hard. Submitted September 2025. getnews.me/study-finds-np-hardness-... #roabp #nphard
Clever people: Quantum Scientists Build New Math of Cryptography
www.quantamagazine.org/quantum-scie...
en.wikipedia.org/wiki/One-way...
en.wikipedia.org/wiki/Quantum...
en.wikipedia.org/wiki/Permane...
en.wikipedia.org/wiki/%E2%99%...
#cryptography #OneWayFunctions #QuantumCryptography #NPhard
