4 citations · 20 across the 25 of their papers we have counts for
6 papers · 2 filters
The Grothendieck Game and Self-Testing Continuous Groups
Alexander Kulpe, Giulio Malavolta, Simon Schmidt +1
Self-testing certifies quantum states and measurements from observed correlations alone, without requiring a description of the devices that produce them. In this work we establish…
Polynomial-Time Algorithms for Nuclear Tensor Norms and Multipartite Separability
Martino Bernasconi, Giulio Malavolta
We study a multilinear optimization problem for tensors with bounded Frobenius norm, where each of the local factors of dimension is chosen from a convex set. We give a det…
Succinct Arguments for QMA from Collapsing Hash Functions
James Bartusek, Giulio Malavolta
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 ``Minicryp…
Robustness of Hidden-Variable Theories and Matrix Scaling
Giulio Malavolta, Harold Nieuwboer, Akshay Ramachandran +1
Motivated by quantum foundations and complexity theory, Aaronson formalized a hidden-variable theory inspired by a proposal by Schrödinger. To any quantum state and unitary, this S…
Quantum Separability in Polynomial Time
Giulio Malavolta
The quantum separability problem asks whether a bipartite density matrix is separable or is -far from every separable state. We give a randomized polynomial-time algorithm for t…
A Modular Approach to Succinct Arguments for QMA
James Bartusek, Jiahui Liu, Giulio Malavolta
Succinct argument systems are of central importance to modern crytpography, enabling the efficient verification of computational claims. In the classical setting, Kilian (STOC 92)…