{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:CAYZBQRSCVZSMI3UHX4MOEFILJ","short_pith_number":"pith:CAYZBQRS","schema_version":"1.0","canonical_sha256":"103190c23215732623743df8c710a85a678fbc2c44ae205d82fa0fd768efc45e","source":{"kind":"arxiv","id":"2511.07300","version":2},"attestation_state":"computed","paper":{"title":"Efficient certification of intractable quantum states with few Pauli measurements","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Harold Ollivier, Maxime Garnier, Sami Abdul Sater, Thierry Martinez, Ulysse Chabaud","submitted_at":"2025-11-10T17:01:51Z","abstract_excerpt":"Efficient verification of quantum computational resources is crucial as experiments advance toward fault-tolerance. Universal quantum computation can be achieved by consuming resource states through simple Pauli measurements, yet a significant gap remains between states that are easy to certify and those required for universality. We focus on \\emph{Clifford-enhanced Product States}, a class of resource states obtained by applying Clifford circuits to a product of single-qubit, potentially magic, states. While essential for universal computation, the certification of such states has previously "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2511.07300","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-11-10T17:01:51Z","cross_cats_sorted":[],"title_canon_sha256":"0bb5537ca0b009f1b2f63b006eeeab7296cef999803bc0249b10f37f5e658a69","abstract_canon_sha256":"5016a8cc401abf7200cc5f44d78768cb461a659f0b1cb06f4f64c488398f886f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-12T01:09:15.997951Z","signature_b64":"kuHIhPYvR+4NuCHOL4vU6yXG9+Ek0nDd2+hQh6h72s0RRAlUhNVI+rQNLmhOedcUMxnnnEEScUCcS2fI8O0vDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"103190c23215732623743df8c710a85a678fbc2c44ae205d82fa0fd768efc45e","last_reissued_at":"2026-06-12T01:09:15.996978Z","signature_status":"signed_v1","first_computed_at":"2026-06-12T01:09:15.996978Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient certification of intractable quantum states with few Pauli measurements","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Harold Ollivier, Maxime Garnier, Sami Abdul Sater, Thierry Martinez, Ulysse Chabaud","submitted_at":"2025-11-10T17:01:51Z","abstract_excerpt":"Efficient verification of quantum computational resources is crucial as experiments advance toward fault-tolerance. Universal quantum computation can be achieved by consuming resource states through simple Pauli measurements, yet a significant gap remains between states that are easy to certify and those required for universality. We focus on \\emph{Clifford-enhanced Product States}, a class of resource states obtained by applying Clifford circuits to a product of single-qubit, potentially magic, states. While essential for universal computation, the certification of such states has previously "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2511.07300","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2511.07300/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2511.07300","created_at":"2026-06-12T01:09:15.997105+00:00"},{"alias_kind":"arxiv_version","alias_value":"2511.07300v2","created_at":"2026-06-12T01:09:15.997105+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2511.07300","created_at":"2026-06-12T01:09:15.997105+00:00"},{"alias_kind":"pith_short_12","alias_value":"CAYZBQRSCVZS","created_at":"2026-06-12T01:09:15.997105+00:00"},{"alias_kind":"pith_short_16","alias_value":"CAYZBQRSCVZSMI3U","created_at":"2026-06-12T01:09:15.997105+00:00"},{"alias_kind":"pith_short_8","alias_value":"CAYZBQRS","created_at":"2026-06-12T01:09:15.997105+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2602.09710","citing_title":"Sample- and Hardware-Efficient Fidelity Estimation by Stripping Phase-Dominated Magic","ref_index":34,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CAYZBQRSCVZSMI3UHX4MOEFILJ","json":"https://pith.science/pith/CAYZBQRSCVZSMI3UHX4MOEFILJ.json","graph_json":"https://pith.science/api/pith-number/CAYZBQRSCVZSMI3UHX4MOEFILJ/graph.json","events_json":"https://pith.science/api/pith-number/CAYZBQRSCVZSMI3UHX4MOEFILJ/events.json","paper":"https://pith.science/paper/CAYZBQRS"},"agent_actions":{"view_html":"https://pith.science/pith/CAYZBQRSCVZSMI3UHX4MOEFILJ","download_json":"https://pith.science/pith/CAYZBQRSCVZSMI3UHX4MOEFILJ.json","view_paper":"https://pith.science/paper/CAYZBQRS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2511.07300&json=true","fetch_graph":"https://pith.science/api/pith-number/CAYZBQRSCVZSMI3UHX4MOEFILJ/graph.json","fetch_events":"https://pith.science/api/pith-number/CAYZBQRSCVZSMI3UHX4MOEFILJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CAYZBQRSCVZSMI3UHX4MOEFILJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CAYZBQRSCVZSMI3UHX4MOEFILJ/action/storage_attestation","attest_author":"https://pith.science/pith/CAYZBQRSCVZSMI3UHX4MOEFILJ/action/author_attestation","sign_citation":"https://pith.science/pith/CAYZBQRSCVZSMI3UHX4MOEFILJ/action/citation_signature","submit_replication":"https://pith.science/pith/CAYZBQRSCVZSMI3UHX4MOEFILJ/action/replication_record"}},"created_at":"2026-06-12T01:09:15.997105+00:00","updated_at":"2026-06-12T01:09:15.997105+00:00"}