2 papers
quant-ph2026
Efficient certification of intractable quantum states with few Pauli measurements
Sami Abdul Sater, Maxime Garnier, Thierry Martinez +2
Efficient verification of quantum computational resources is crucial as experiments advance toward fault-tolerance. Universal quantum computation can be achieved by consuming resou…
quant-ph2026
Composable Verification in the Circuit-Model via Magic-Blindness
Sami Abdul Sater, Harold Ollivier
As quantum computing machines move towards the utility regime, it is essential that users are able to verify their delegated quantum computations with security guarantees that are…