{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:RTDMPFXZ2ULB62NS2XMSJP3HCT","short_pith_number":"pith:RTDMPFXZ","schema_version":"1.0","canonical_sha256":"8cc6c796f9d5161f69b2d5d924bf6714e874bc47b440c72f70e9a0c8336ea6de","source":{"kind":"arxiv","id":"2606.10730","version":1},"attestation_state":"computed","paper":{"title":"Unitary Channel Testing Under a Depolarizing Noise Assumption","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andrew Jackson, Animesh Datta, Hirak Ghosh","submitted_at":"2026-06-09T11:39:34Z","abstract_excerpt":"We present fast algorithms $\\unicode{x2013}$ under the depolarizing noise assumption, often made in fault-tolerant quantum computations $\\unicode{x2013}$ to test its strength. Our optimal algorithms answer the following question: is the quantum channel implemented by a given black box identical to a target unitary or $\\varepsilon$-far from it in the diamond distance, assuming that the deviation is a depolarizing channel with unknown parameter? Our algorithm has a query complexity of $\\Theta(1/\\varepsilon).$ The query complexity of the relaxed problem of testing whether the black-box channel is"},"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":"2606.10730","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-06-09T11:39:34Z","cross_cats_sorted":[],"title_canon_sha256":"d4683ab80045f8ad52703f2dd89853de0541c90593f10dab5a8b1171146d6cbc","abstract_canon_sha256":"8fb318ab6957c810d66de37d36dd9fa26d4eb58cacfa28a6b72aea43da51186e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-10T01:10:36.967526Z","signature_b64":"MwnRSK3/jd6X2gJVetQwu9L3ZCUP4RLVeL6lh/gg4VLCT3MfwB+Gv76MDok2fxBhkSLBAUUpfp8opgzx5b3kAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8cc6c796f9d5161f69b2d5d924bf6714e874bc47b440c72f70e9a0c8336ea6de","last_reissued_at":"2026-06-10T01:10:36.966870Z","signature_status":"signed_v1","first_computed_at":"2026-06-10T01:10:36.966870Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Unitary Channel Testing Under a Depolarizing Noise Assumption","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andrew Jackson, Animesh Datta, Hirak Ghosh","submitted_at":"2026-06-09T11:39:34Z","abstract_excerpt":"We present fast algorithms $\\unicode{x2013}$ under the depolarizing noise assumption, often made in fault-tolerant quantum computations $\\unicode{x2013}$ to test its strength. Our optimal algorithms answer the following question: is the quantum channel implemented by a given black box identical to a target unitary or $\\varepsilon$-far from it in the diamond distance, assuming that the deviation is a depolarizing channel with unknown parameter? Our algorithm has a query complexity of $\\Theta(1/\\varepsilon).$ The query complexity of the relaxed problem of testing whether the black-box channel is"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.10730","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/2606.10730/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":"2606.10730","created_at":"2026-06-10T01:10:36.966953+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.10730v1","created_at":"2026-06-10T01:10:36.966953+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.10730","created_at":"2026-06-10T01:10:36.966953+00:00"},{"alias_kind":"pith_short_12","alias_value":"RTDMPFXZ2ULB","created_at":"2026-06-10T01:10:36.966953+00:00"},{"alias_kind":"pith_short_16","alias_value":"RTDMPFXZ2ULB62NS","created_at":"2026-06-10T01:10:36.966953+00:00"},{"alias_kind":"pith_short_8","alias_value":"RTDMPFXZ","created_at":"2026-06-10T01:10:36.966953+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/RTDMPFXZ2ULB62NS2XMSJP3HCT","json":"https://pith.science/pith/RTDMPFXZ2ULB62NS2XMSJP3HCT.json","graph_json":"https://pith.science/api/pith-number/RTDMPFXZ2ULB62NS2XMSJP3HCT/graph.json","events_json":"https://pith.science/api/pith-number/RTDMPFXZ2ULB62NS2XMSJP3HCT/events.json","paper":"https://pith.science/paper/RTDMPFXZ"},"agent_actions":{"view_html":"https://pith.science/pith/RTDMPFXZ2ULB62NS2XMSJP3HCT","download_json":"https://pith.science/pith/RTDMPFXZ2ULB62NS2XMSJP3HCT.json","view_paper":"https://pith.science/paper/RTDMPFXZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.10730&json=true","fetch_graph":"https://pith.science/api/pith-number/RTDMPFXZ2ULB62NS2XMSJP3HCT/graph.json","fetch_events":"https://pith.science/api/pith-number/RTDMPFXZ2ULB62NS2XMSJP3HCT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RTDMPFXZ2ULB62NS2XMSJP3HCT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RTDMPFXZ2ULB62NS2XMSJP3HCT/action/storage_attestation","attest_author":"https://pith.science/pith/RTDMPFXZ2ULB62NS2XMSJP3HCT/action/author_attestation","sign_citation":"https://pith.science/pith/RTDMPFXZ2ULB62NS2XMSJP3HCT/action/citation_signature","submit_replication":"https://pith.science/pith/RTDMPFXZ2ULB62NS2XMSJP3HCT/action/replication_record"}},"created_at":"2026-06-10T01:10:36.966953+00:00","updated_at":"2026-06-10T01:10:36.966953+00:00"}