{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:2ZKQ2Q5NI3ED35ENN2CIXDPWBN","short_pith_number":"pith:2ZKQ2Q5N","schema_version":"1.0","canonical_sha256":"d6550d43ad46c83df48d6e848b8df60b5e4ab80acb93b72c1742a58676e1450b","source":{"kind":"arxiv","id":"2507.22001","version":1},"attestation_state":"computed","paper":{"title":"Pauli Measurements Are Near-Optimal for Single-Qubit Tomography","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Abhilash Dharmavarapu, Jayadev Acharya, Nengkun Yu, Yuhan Liu","submitted_at":"2025-07-29T16:50:19Z","abstract_excerpt":"We provide the first non-trivial lower bounds for single-qubit tomography algorithms and show that at least ${\\Omega}\\left(\\frac{10^N}{\\sqrt{N} \\varepsilon^2}\\right)$ copies are required to learn an $N$-qubit state $\\rho\\in\\mathbb{C}^{d\\times d},d=2^N$ to within $\\varepsilon$ trace distance. Pauli measurements, the most commonly used single-qubit measurement scheme, have recently been shown to require at most $O\\left(\\frac{10^N}{\\varepsilon^2}\\right)$ copies for this problem. Combining these results, we nearly settle the long-standing question of the complexity of single-qubit tomography."},"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":"2507.22001","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-07-29T16:50:19Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"f583b5db9d236d6d6bab4e21c1f42e6e1bd9ded9e10b078b8c6772c98dc31755","abstract_canon_sha256":"e110e14cabe567e667da483b37d042272188d28202e49f933e6ee724c4479595"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:45:11.272051Z","signature_b64":"u9iGtp/THpcky9sRlXnMzpvlY+EMaf+TUiQbPQx2Vqs/1O0FsdExjRETsOXLW2MV8in4k/r8l7YkAK8LoXvaCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d6550d43ad46c83df48d6e848b8df60b5e4ab80acb93b72c1742a58676e1450b","last_reissued_at":"2026-07-05T11:45:11.271634Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:45:11.271634Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Pauli Measurements Are Near-Optimal for Single-Qubit Tomography","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Abhilash Dharmavarapu, Jayadev Acharya, Nengkun Yu, Yuhan Liu","submitted_at":"2025-07-29T16:50:19Z","abstract_excerpt":"We provide the first non-trivial lower bounds for single-qubit tomography algorithms and show that at least ${\\Omega}\\left(\\frac{10^N}{\\sqrt{N} \\varepsilon^2}\\right)$ copies are required to learn an $N$-qubit state $\\rho\\in\\mathbb{C}^{d\\times d},d=2^N$ to within $\\varepsilon$ trace distance. Pauli measurements, the most commonly used single-qubit measurement scheme, have recently been shown to require at most $O\\left(\\frac{10^N}{\\varepsilon^2}\\right)$ copies for this problem. Combining these results, we nearly settle the long-standing question of the complexity of single-qubit tomography."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.22001","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/2507.22001/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":"2507.22001","created_at":"2026-07-05T11:45:11.271690+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.22001v1","created_at":"2026-07-05T11:45:11.271690+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.22001","created_at":"2026-07-05T11:45:11.271690+00:00"},{"alias_kind":"pith_short_12","alias_value":"2ZKQ2Q5NI3ED","created_at":"2026-07-05T11:45:11.271690+00:00"},{"alias_kind":"pith_short_16","alias_value":"2ZKQ2Q5NI3ED35EN","created_at":"2026-07-05T11:45:11.271690+00:00"},{"alias_kind":"pith_short_8","alias_value":"2ZKQ2Q5N","created_at":"2026-07-05T11:45:11.271690+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.08784","citing_title":"Randomized simulation of quantum channels using small ancilla","ref_index":22,"is_internal_anchor":false},{"citing_arxiv_id":"2604.08871","citing_title":"Beating three-parameter precision trade-offs with entangling collective measurements","ref_index":27,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2ZKQ2Q5NI3ED35ENN2CIXDPWBN","json":"https://pith.science/pith/2ZKQ2Q5NI3ED35ENN2CIXDPWBN.json","graph_json":"https://pith.science/api/pith-number/2ZKQ2Q5NI3ED35ENN2CIXDPWBN/graph.json","events_json":"https://pith.science/api/pith-number/2ZKQ2Q5NI3ED35ENN2CIXDPWBN/events.json","paper":"https://pith.science/paper/2ZKQ2Q5N"},"agent_actions":{"view_html":"https://pith.science/pith/2ZKQ2Q5NI3ED35ENN2CIXDPWBN","download_json":"https://pith.science/pith/2ZKQ2Q5NI3ED35ENN2CIXDPWBN.json","view_paper":"https://pith.science/paper/2ZKQ2Q5N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.22001&json=true","fetch_graph":"https://pith.science/api/pith-number/2ZKQ2Q5NI3ED35ENN2CIXDPWBN/graph.json","fetch_events":"https://pith.science/api/pith-number/2ZKQ2Q5NI3ED35ENN2CIXDPWBN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2ZKQ2Q5NI3ED35ENN2CIXDPWBN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2ZKQ2Q5NI3ED35ENN2CIXDPWBN/action/storage_attestation","attest_author":"https://pith.science/pith/2ZKQ2Q5NI3ED35ENN2CIXDPWBN/action/author_attestation","sign_citation":"https://pith.science/pith/2ZKQ2Q5NI3ED35ENN2CIXDPWBN/action/citation_signature","submit_replication":"https://pith.science/pith/2ZKQ2Q5NI3ED35ENN2CIXDPWBN/action/replication_record"}},"created_at":"2026-07-05T11:45:11.271690+00:00","updated_at":"2026-07-05T11:45:11.271690+00:00"}