{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:MG4UO3R756IADO6VQP3PAOYWMU","short_pith_number":"pith:MG4UO3R7","schema_version":"1.0","canonical_sha256":"61b9476e3fef9001bbd583f6f03b166500356fbc85edc949e5b7ab7d8bee7113","source":{"kind":"arxiv","id":"2206.05265","version":2},"attestation_state":"computed","paper":{"title":"When Does Adaptivity Help for Quantum State Learning?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.IT","cs.LG","math.IT"],"primary_cat":"quant-ph","authors_text":"Allen Liu, Brice Huang, Jerry Li, Mark Sellke, Sitan Chen","submitted_at":"2022-06-10T17:59:16Z","abstract_excerpt":"We consider the classic question of state tomography: given copies of an unknown quantum state $\\rho\\in\\mathbb{C}^{d\\times d}$, output $\\widehat{\\rho}$ which is close to $\\rho$ in some sense, e.g. trace distance or fidelity. When one is allowed to make coherent measurements entangled across all copies, $\\Theta(d^2/\\epsilon^2)$ copies are necessary and sufficient to get trace distance $\\epsilon$. Unfortunately, the protocols achieving this rate incur large quantum memory overheads that preclude implementation on near-term devices. On the other hand, the best known protocol using incoherent (sin"},"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":"2206.05265","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2022-06-10T17:59:16Z","cross_cats_sorted":["cs.CC","cs.IT","cs.LG","math.IT"],"title_canon_sha256":"a5ac46a6010de3ae79e8b0bff3899829fd551ec197121d5c54db2af1ac670cd9","abstract_canon_sha256":"c3e1e173396912c2b2bac6ed71ed9b642270a607ef2af90868bb5874346455db"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:15:13.755797Z","signature_b64":"Dmv3pWNPLu4NX+IGXZoOC4z/Zfb+pRKaJCTBjAN9sStjxlS9mN0hcrFJyRLZfn4tzi53VGkGpdAYqMCd7Y02Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"61b9476e3fef9001bbd583f6f03b166500356fbc85edc949e5b7ab7d8bee7113","last_reissued_at":"2026-07-05T06:15:13.755227Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:15:13.755227Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"When Does Adaptivity Help for Quantum State Learning?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.IT","cs.LG","math.IT"],"primary_cat":"quant-ph","authors_text":"Allen Liu, Brice Huang, Jerry Li, Mark Sellke, Sitan Chen","submitted_at":"2022-06-10T17:59:16Z","abstract_excerpt":"We consider the classic question of state tomography: given copies of an unknown quantum state $\\rho\\in\\mathbb{C}^{d\\times d}$, output $\\widehat{\\rho}$ which is close to $\\rho$ in some sense, e.g. trace distance or fidelity. When one is allowed to make coherent measurements entangled across all copies, $\\Theta(d^2/\\epsilon^2)$ copies are necessary and sufficient to get trace distance $\\epsilon$. Unfortunately, the protocols achieving this rate incur large quantum memory overheads that preclude implementation on near-term devices. On the other hand, the best known protocol using incoherent (sin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2206.05265","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/2206.05265/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":"2206.05265","created_at":"2026-07-05T06:15:13.755301+00:00"},{"alias_kind":"arxiv_version","alias_value":"2206.05265v2","created_at":"2026-07-05T06:15:13.755301+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2206.05265","created_at":"2026-07-05T06:15:13.755301+00:00"},{"alias_kind":"pith_short_12","alias_value":"MG4UO3R756IA","created_at":"2026-07-05T06:15:13.755301+00:00"},{"alias_kind":"pith_short_16","alias_value":"MG4UO3R756IADO6V","created_at":"2026-07-05T06:15:13.755301+00:00"},{"alias_kind":"pith_short_8","alias_value":"MG4UO3R7","created_at":"2026-07-05T06:15:13.755301+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.04096","citing_title":"Better Pauli Channel Learning with Maximum Likelihood Estimation","ref_index":41,"is_internal_anchor":false},{"citing_arxiv_id":"2604.26043","citing_title":"An Exponential Advantage for Adaptive Tomography of Structured States under Pauli Basis Measurements","ref_index":5,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MG4UO3R756IADO6VQP3PAOYWMU","json":"https://pith.science/pith/MG4UO3R756IADO6VQP3PAOYWMU.json","graph_json":"https://pith.science/api/pith-number/MG4UO3R756IADO6VQP3PAOYWMU/graph.json","events_json":"https://pith.science/api/pith-number/MG4UO3R756IADO6VQP3PAOYWMU/events.json","paper":"https://pith.science/paper/MG4UO3R7"},"agent_actions":{"view_html":"https://pith.science/pith/MG4UO3R756IADO6VQP3PAOYWMU","download_json":"https://pith.science/pith/MG4UO3R756IADO6VQP3PAOYWMU.json","view_paper":"https://pith.science/paper/MG4UO3R7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2206.05265&json=true","fetch_graph":"https://pith.science/api/pith-number/MG4UO3R756IADO6VQP3PAOYWMU/graph.json","fetch_events":"https://pith.science/api/pith-number/MG4UO3R756IADO6VQP3PAOYWMU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MG4UO3R756IADO6VQP3PAOYWMU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MG4UO3R756IADO6VQP3PAOYWMU/action/storage_attestation","attest_author":"https://pith.science/pith/MG4UO3R756IADO6VQP3PAOYWMU/action/author_attestation","sign_citation":"https://pith.science/pith/MG4UO3R756IADO6VQP3PAOYWMU/action/citation_signature","submit_replication":"https://pith.science/pith/MG4UO3R756IADO6VQP3PAOYWMU/action/replication_record"}},"created_at":"2026-07-05T06:15:13.755301+00:00","updated_at":"2026-07-05T06:15:13.755301+00:00"}