We prove the existence of succinct arguments for QMA, assuming only the existence of collapsing hash functions. This is the first scheme that relies only on unstructured ``Minicrypt''assumptions, which are not known to imply public-key encryption. Our main technical contribution is a quantum-succinct \emph{claw-state g...
Motivated by quantum foundations and complexity theory, Aaronson formalized a hidden-variable theory inspired by a proposal by Schr\"odinger. To any quantum state and unitary, this Schr\"odinger theory assigns a joint probability distribution via the Sinkhorn algorithm: rescale the columns and rows of the entrywise mod...
Giulio Malavolta, Harold Nieuwboer, Akshay Ramachandran et al.· 0 citations
We show that $1.4<K_G^{\mathbb{C}}<1.404898554746$, where $K_G^{\mathbb{C}}$ is the complex Grothendieck constant. The upper bound improves on Haagerup's bound of $1.40490913\ldots$ from 1987, and the lower bound improves on Davie's bound of $1.33807$ from 1984. The upper bound combines ideas from the real and noncommu...
Steven Heilman, Chris Jones, Giulio Malavolta· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.