Enregistré dans:
| Auteurs principaux: | , , , , |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | https://arxiv.org/abs/2511.07300 |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866917071326019584 |
|---|---|
| author | Sater, Sami Abdul Garnier, Maxime Martinez, Thierry Ollivier, Harold Chabaud, Ulysse |
| author_facet | Sater, Sami Abdul Garnier, Maxime Martinez, Thierry Ollivier, Harold Chabaud, Ulysse |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2511_07300 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Efficient certification of intractable quantum states with few Pauli measurements Sater, Sami Abdul Garnier, Maxime Martinez, Thierry Ollivier, Harold Chabaud, Ulysse Quantum Physics 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. |
| title | Efficient certification of intractable quantum states with few Pauli measurements |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2511.07300 |