Show HN: An exact verifier for one brick in a decades-old quantum math problem

Category: library

Tags: quantum-computing, mathematical-proof, mub-problem

Score: 6.3/10 (Innovation: 7, Technical: 8, Documentation: 6, Utility: 4)

This project provides an exact, verifiable proof of a specific feasibility wall in the decades-old MUB(6) problem in quantum math, using deterministic symmetry closure and exact PSD/Veronese certificates. It is interesting because it offers a novel, non-randomized approach to a well-known open problem and invites community verification and further mapping.

Target audience: quantum computing researchers, mathematicians, theoretical physicists

Repository: https://zenodo.org/records/20682233 · Python · GPL-3.0 · 257 stars

View on Hacker News