{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:BWJ3LC7I72I5HV4NXACL7PLOPX","short_pith_number":"pith:BWJ3LC7I","schema_version":"1.0","canonical_sha256":"0d93b58be8fe91d3d78db804bfbd6e7dc5beffa3bb73ffba5f3dabef0b1b96eb","source":{"kind":"arxiv","id":"2502.18170","version":1},"attestation_state":"computed","paper":{"title":"Pauli measurements are not optimal for single-copy tomography","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Abhilash Dharmavarapu, Jayadev Acharya, Nengkun Yu, Yuhan Liu","submitted_at":"2025-02-25T13:03:45Z","abstract_excerpt":"Quantum state tomography is a fundamental problem in quantum computing. Given $n$ copies of an unknown $N$-qubit state $\\rho \\in \\mathbb{C}^{d \\times d},d=2^N$, the goal is to learn the state up to an accuracy $\\epsilon$ in trace distance, with at least probability 0.99. We are interested in the copy complexity, the minimum number of copies of $\\rho$ needed to fulfill the task.\n  Pauli measurements have attracted significant attention due to their ease of implementation in limited settings. The best-known upper bound is $O(\\frac{N \\cdot 12^N}{\\epsilon^2})$, and no non-trivial lower bound is kn"},"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":"2502.18170","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-02-25T13:03:45Z","cross_cats_sorted":["cs.CC","cs.IT","math.IT"],"title_canon_sha256":"be4b727b0e13e3ca1dd16ed38a3044b231b261b08a138649601a18f3fc49dbc6","abstract_canon_sha256":"4584acc18aea2b2fe84d62a20adc78ac013560afd028ee522880f27f24c8e195"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:19:49.947137Z","signature_b64":"iVIrHDcAhZhRyWTC18yxqlxvN1oH0gyRqlxs36VMBbLt6Ivd9/ygSyrHgZeC+578rQfcdRPwKQfg3kCm0JnpDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0d93b58be8fe91d3d78db804bfbd6e7dc5beffa3bb73ffba5f3dabef0b1b96eb","last_reissued_at":"2026-07-05T10:19:49.946712Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:19:49.946712Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Pauli measurements are not optimal for single-copy tomography","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Abhilash Dharmavarapu, Jayadev Acharya, Nengkun Yu, Yuhan Liu","submitted_at":"2025-02-25T13:03:45Z","abstract_excerpt":"Quantum state tomography is a fundamental problem in quantum computing. Given $n$ copies of an unknown $N$-qubit state $\\rho \\in \\mathbb{C}^{d \\times d},d=2^N$, the goal is to learn the state up to an accuracy $\\epsilon$ in trace distance, with at least probability 0.99. We are interested in the copy complexity, the minimum number of copies of $\\rho$ needed to fulfill the task.\n  Pauli measurements have attracted significant attention due to their ease of implementation in limited settings. The best-known upper bound is $O(\\frac{N \\cdot 12^N}{\\epsilon^2})$, and no non-trivial lower bound is kn"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.18170","kind":"arxiv","version":1},"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/2502.18170/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":"2502.18170","created_at":"2026-07-05T10:19:49.946769+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.18170v1","created_at":"2026-07-05T10:19:49.946769+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.18170","created_at":"2026-07-05T10:19:49.946769+00:00"},{"alias_kind":"pith_short_12","alias_value":"BWJ3LC7I72I5","created_at":"2026-07-05T10:19:49.946769+00:00"},{"alias_kind":"pith_short_16","alias_value":"BWJ3LC7I72I5HV4N","created_at":"2026-07-05T10:19:49.946769+00:00"},{"alias_kind":"pith_short_8","alias_value":"BWJ3LC7I","created_at":"2026-07-05T10:19:49.946769+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BWJ3LC7I72I5HV4NXACL7PLOPX","json":"https://pith.science/pith/BWJ3LC7I72I5HV4NXACL7PLOPX.json","graph_json":"https://pith.science/api/pith-number/BWJ3LC7I72I5HV4NXACL7PLOPX/graph.json","events_json":"https://pith.science/api/pith-number/BWJ3LC7I72I5HV4NXACL7PLOPX/events.json","paper":"https://pith.science/paper/BWJ3LC7I"},"agent_actions":{"view_html":"https://pith.science/pith/BWJ3LC7I72I5HV4NXACL7PLOPX","download_json":"https://pith.science/pith/BWJ3LC7I72I5HV4NXACL7PLOPX.json","view_paper":"https://pith.science/paper/BWJ3LC7I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.18170&json=true","fetch_graph":"https://pith.science/api/pith-number/BWJ3LC7I72I5HV4NXACL7PLOPX/graph.json","fetch_events":"https://pith.science/api/pith-number/BWJ3LC7I72I5HV4NXACL7PLOPX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BWJ3LC7I72I5HV4NXACL7PLOPX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BWJ3LC7I72I5HV4NXACL7PLOPX/action/storage_attestation","attest_author":"https://pith.science/pith/BWJ3LC7I72I5HV4NXACL7PLOPX/action/author_attestation","sign_citation":"https://pith.science/pith/BWJ3LC7I72I5HV4NXACL7PLOPX/action/citation_signature","submit_replication":"https://pith.science/pith/BWJ3LC7I72I5HV4NXACL7PLOPX/action/replication_record"}},"created_at":"2026-07-05T10:19:49.946769+00:00","updated_at":"2026-07-05T10:19:49.946769+00:00"}