{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:A3MEB5453KQYQO22NQZDDBEOCA","short_pith_number":"pith:A3MEB545","schema_version":"1.0","canonical_sha256":"06d840f79ddaa1883b5a6c3231848e10002bbc77323850393daaac93e31dcbd4","source":{"kind":"arxiv","id":"2309.13461","version":3},"attestation_state":"computed","paper":{"title":"Tight bounds on Pauli channel learning without entanglement","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.LG","math.IT"],"primary_cat":"quant-ph","authors_text":"Changhun Oh, Hsin-Yuan Huang, Liang Jiang, Senrui Chen, Sisi Zhou","submitted_at":"2023-09-23T19:12:29Z","abstract_excerpt":"Quantum entanglement is a crucial resource for learning properties from nature, but a precise characterization of its advantage can be challenging. In this work, we consider learning algorithms without entanglement to be those that only utilize states, measurements, and operations that are separable between the main system of interest and an ancillary system. Interestingly, we show that these algorithms are equivalent to those that apply quantum circuits on the main system interleaved with mid-circuit measurements and classical feedforward. Within this setting, we prove a tight lower bound for"},"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":"2309.13461","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-09-23T19:12:29Z","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"title_canon_sha256":"a4fa5d44ce1444e63d21d136c2db7cb2ec96c6c63291098bacff70c058aee057","abstract_canon_sha256":"ee7fcddc983eabae4f4982b89014955437b538c06eb1e4402690539a57501f49"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:22:14.075325Z","signature_b64":"y7Wgg/ZFmwCJmjp029UpB8UPgRyVFv1cjDBWoT7dTmBV1NCsKqHgnDHc9P5wyESUGEA3QZc4R5JEQTCtG+McBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"06d840f79ddaa1883b5a6c3231848e10002bbc77323850393daaac93e31dcbd4","last_reissued_at":"2026-07-05T09:22:14.074870Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:22:14.074870Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tight bounds on Pauli channel learning without entanglement","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.LG","math.IT"],"primary_cat":"quant-ph","authors_text":"Changhun Oh, Hsin-Yuan Huang, Liang Jiang, Senrui Chen, Sisi Zhou","submitted_at":"2023-09-23T19:12:29Z","abstract_excerpt":"Quantum entanglement is a crucial resource for learning properties from nature, but a precise characterization of its advantage can be challenging. In this work, we consider learning algorithms without entanglement to be those that only utilize states, measurements, and operations that are separable between the main system of interest and an ancillary system. Interestingly, we show that these algorithms are equivalent to those that apply quantum circuits on the main system interleaved with mid-circuit measurements and classical feedforward. Within this setting, we prove a tight lower bound for"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.13461","kind":"arxiv","version":3},"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/2309.13461/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":"2309.13461","created_at":"2026-07-05T09:22:14.074924+00:00"},{"alias_kind":"arxiv_version","alias_value":"2309.13461v3","created_at":"2026-07-05T09:22:14.074924+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.13461","created_at":"2026-07-05T09:22:14.074924+00:00"},{"alias_kind":"pith_short_12","alias_value":"A3MEB5453KQY","created_at":"2026-07-05T09:22:14.074924+00:00"},{"alias_kind":"pith_short_16","alias_value":"A3MEB5453KQYQO22","created_at":"2026-07-05T09:22:14.074924+00:00"},{"alias_kind":"pith_short_8","alias_value":"A3MEB545","created_at":"2026-07-05T09:22:14.074924+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.22743","citing_title":"Information-Computation Gaps in Quantum Learning via Low-Degree Likelihood","ref_index":31,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/A3MEB5453KQYQO22NQZDDBEOCA","json":"https://pith.science/pith/A3MEB5453KQYQO22NQZDDBEOCA.json","graph_json":"https://pith.science/api/pith-number/A3MEB5453KQYQO22NQZDDBEOCA/graph.json","events_json":"https://pith.science/api/pith-number/A3MEB5453KQYQO22NQZDDBEOCA/events.json","paper":"https://pith.science/paper/A3MEB545"},"agent_actions":{"view_html":"https://pith.science/pith/A3MEB5453KQYQO22NQZDDBEOCA","download_json":"https://pith.science/pith/A3MEB5453KQYQO22NQZDDBEOCA.json","view_paper":"https://pith.science/paper/A3MEB545","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2309.13461&json=true","fetch_graph":"https://pith.science/api/pith-number/A3MEB5453KQYQO22NQZDDBEOCA/graph.json","fetch_events":"https://pith.science/api/pith-number/A3MEB5453KQYQO22NQZDDBEOCA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A3MEB5453KQYQO22NQZDDBEOCA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A3MEB5453KQYQO22NQZDDBEOCA/action/storage_attestation","attest_author":"https://pith.science/pith/A3MEB5453KQYQO22NQZDDBEOCA/action/author_attestation","sign_citation":"https://pith.science/pith/A3MEB5453KQYQO22NQZDDBEOCA/action/citation_signature","submit_replication":"https://pith.science/pith/A3MEB5453KQYQO22NQZDDBEOCA/action/replication_record"}},"created_at":"2026-07-05T09:22:14.074924+00:00","updated_at":"2026-07-05T09:22:14.074924+00:00"}