{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:Q4X4KJOF73AE5VNIKYVX5SXVMO","short_pith_number":"pith:Q4X4KJOF","schema_version":"1.0","canonical_sha256":"872fc525c5fec04ed5a8562b7ecaf563973477ed6bccd6918d89628b567c6fe5","source":{"kind":"arxiv","id":"2108.08488","version":2},"attestation_state":"computed","paper":{"title":"Quantum advantages for Pauli channel estimation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Alireza Seif, Liang Jiang, Senrui Chen, Sisi Zhou","submitted_at":"2021-08-19T04:10:28Z","abstract_excerpt":"We show that entangled measurements provide an exponential advantage in sample complexity for Pauli channel estimation, which is both a fundamental problem and a practically important subroutine for benchmarking near-term quantum devices. The specific task we consider is to simultaneously learn all the eigenvalues of an $n$-qubit Pauli channel to $\\pm\\varepsilon$ precision. We give an estimation protocol with an $n$-qubit ancilla that succeeds with high probability using only $O(n/\\varepsilon^{2})$ copies of the Pauli channel, while prove that any ancilla-free protocol (possibly with adaptive "},"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":"2108.08488","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2021-08-19T04:10:28Z","cross_cats_sorted":[],"title_canon_sha256":"b9a06c79033b39f5654604748abf105b2094900d66563822a6dc8646119e5183","abstract_canon_sha256":"72cc6959e8bb4a4e46936a7454bcbefb42d4b73a1b2b448d16373656fd32d05f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:07:24.263170Z","signature_b64":"44S8PM1zvDtSZuFQYVixcSl8C+j6z5R2facqi64nk7S5U4x5Padul5xly+dpJQ/0xMwP95ehTJMu5bdZSmWiDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"872fc525c5fec04ed5a8562b7ecaf563973477ed6bccd6918d89628b567c6fe5","last_reissued_at":"2026-07-05T04:07:24.262650Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:07:24.262650Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum advantages for Pauli channel estimation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Alireza Seif, Liang Jiang, Senrui Chen, Sisi Zhou","submitted_at":"2021-08-19T04:10:28Z","abstract_excerpt":"We show that entangled measurements provide an exponential advantage in sample complexity for Pauli channel estimation, which is both a fundamental problem and a practically important subroutine for benchmarking near-term quantum devices. The specific task we consider is to simultaneously learn all the eigenvalues of an $n$-qubit Pauli channel to $\\pm\\varepsilon$ precision. We give an estimation protocol with an $n$-qubit ancilla that succeeds with high probability using only $O(n/\\varepsilon^{2})$ copies of the Pauli channel, while prove that any ancilla-free protocol (possibly with adaptive "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2108.08488","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/2108.08488/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":"2108.08488","created_at":"2026-07-05T04:07:24.262713+00:00"},{"alias_kind":"arxiv_version","alias_value":"2108.08488v2","created_at":"2026-07-05T04:07:24.262713+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2108.08488","created_at":"2026-07-05T04:07:24.262713+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q4X4KJOF73AE","created_at":"2026-07-05T04:07:24.262713+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q4X4KJOF73AE5VNI","created_at":"2026-07-05T04:07:24.262713+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q4X4KJOF","created_at":"2026-07-05T04:07:24.262713+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2509.07702","citing_title":"Weakly-Driven Quantum Walks for Memory-Constrained Pauli Channel Learning","ref_index":43,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Q4X4KJOF73AE5VNIKYVX5SXVMO","json":"https://pith.science/pith/Q4X4KJOF73AE5VNIKYVX5SXVMO.json","graph_json":"https://pith.science/api/pith-number/Q4X4KJOF73AE5VNIKYVX5SXVMO/graph.json","events_json":"https://pith.science/api/pith-number/Q4X4KJOF73AE5VNIKYVX5SXVMO/events.json","paper":"https://pith.science/paper/Q4X4KJOF"},"agent_actions":{"view_html":"https://pith.science/pith/Q4X4KJOF73AE5VNIKYVX5SXVMO","download_json":"https://pith.science/pith/Q4X4KJOF73AE5VNIKYVX5SXVMO.json","view_paper":"https://pith.science/paper/Q4X4KJOF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2108.08488&json=true","fetch_graph":"https://pith.science/api/pith-number/Q4X4KJOF73AE5VNIKYVX5SXVMO/graph.json","fetch_events":"https://pith.science/api/pith-number/Q4X4KJOF73AE5VNIKYVX5SXVMO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q4X4KJOF73AE5VNIKYVX5SXVMO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q4X4KJOF73AE5VNIKYVX5SXVMO/action/storage_attestation","attest_author":"https://pith.science/pith/Q4X4KJOF73AE5VNIKYVX5SXVMO/action/author_attestation","sign_citation":"https://pith.science/pith/Q4X4KJOF73AE5VNIKYVX5SXVMO/action/citation_signature","submit_replication":"https://pith.science/pith/Q4X4KJOF73AE5VNIKYVX5SXVMO/action/replication_record"}},"created_at":"2026-07-05T04:07:24.262713+00:00","updated_at":"2026-07-05T04:07:24.262713+00:00"}