Manvir Jaswal

An independent certified computation excluding four mutually unbiased bases in dimension six

1 / –
PDF

Abstract

We show that there are no four mutually unbiased bases in ℂ⁶, so that the maximum number of such bases is three, as Zauner conjectured. The proof is computer-assisted and assumes that the processor, compiler and C library of the computer that ran our computation carried out its binary64 (double-precision) arithmetic correctly. The computation carries out the discretization proof of a recent preprint by OpenAI, which has not appeared in a refereed journal; our programs are written from its text, and we prove every statement of the preprint that our proof uses. Four mutually unbiased bases could be taken to consist of the standard basis, the columns of a complex Hadamard matrix divided by √6, and two further bases. Finitely many balls in phase coordinates cover all complex Hadamard matrices of order six up to equivalence, and on each small ball a finite search excludes these two further bases. Every inequality that the programs decide in order to reject a case or to cover a set of matrices is decided in integer arithmetic or in interval arithmetic with outward rounding. The programs, logs and data of the computation are deposited.

Manvir Jaswal 13 October 2026 doi:10.5281/zenodo.23255857

Cite

M. Jaswal, An independent certified computation excluding four mutually unbiased bases in dimension six, preprint, 2026, doi:10.5281/zenodo.23255857.

@misc{jaswal2026mub,
  author    = {Jaswal, Manvir},
  title     = {An independent certified computation excluding four mutually unbiased bases in dimension six},
  year      = {2026},
  publisher = {Zenodo},
  doi       = {10.5281/zenodo.23255857},
  url       = {https://doi.org/10.5281/zenodo.23255857},
  note      = {Preprint}
}

Preprint 13 October 2026