Efficient certification of intractable quantum states with few Pauli measurements
Abstract
Verification of quantum computations is crucial as experiments advance toward fault-tolerant quantum computing. Yet, no efficient protocol exists for certifying states generated in the Magic-State Injection model -- the foundation of several fault-tolerant quantum computing architectures. Here, we introduce an efficient protocol for certifying Clifford-enhanced Product States, a large class of quantum states obtained by applying an arbitrary Clifford circuit to a product of single-qubit, possibly magic, states. Our protocol only requires single-qubit Pauli measurements together with efficient classical post-processing, and has efficient sample complexity in both the independent (i.i.d.) and adversarial (non-i.i.d.) settings. This fills a key gap between Pauli-based certification schemes for stabilizer or (hyper)graph states and general protocols demanding non-Pauli measurements or classically intractable information about the target state. Our work provides the first efficient, Pauli-only certification protocol for the Magic-State Injection model, leading to practical verification of universal quantum computation under minimal experimental assumptions.
Keywords
Cite
@article{arxiv.2511.07300,
title = {Efficient certification of intractable quantum states with few Pauli measurements},
author = {Sami Abdul Sater and Maxime Garnier and Thierry Martinez and Harold Ollivier and Ulysse Chabaud},
journal= {arXiv preprint arXiv:2511.07300},
year = {2025}
}
Comments
14 pages, 5 figures