{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:K5ETII66VY3HDVOKNBTCUD3UH7","short_pith_number":"pith:K5ETII66","schema_version":"1.0","canonical_sha256":"57493423deae3671d5ca68662a0f743fccbd6e335bb74c97a37588abc78da2dd","source":{"kind":"arxiv","id":"2512.21260","version":2},"attestation_state":"computed","paper":{"title":"Random dilation superchannel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Mio Murao, Ryotaro Niwa, Ryuji Takagi, Satoshi Yoshida, Takeru Utsumi","submitted_at":"2025-12-24T16:09:38Z","abstract_excerpt":"We present a quantum circuit that implements the random dilation superchannel, transforming parallel queries of an unknown quantum channel into the same number of parallel queries of a randomly chosen dilation isometry of the input channel. This is a natural generalization of the random purification channel, that transforms copies of an unknown mixed state to copies of a randomly chosen purification state. The circuit complexity of our construction is $O(\\mathrm{poly}(n, \\log d_I, \\log d_O))$, where $n$ is the number of queries and $d_I$ and $d_O$ are the input and output dimensions of the inp"},"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":"2512.21260","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-12-24T16:09:38Z","cross_cats_sorted":[],"title_canon_sha256":"375b49a0fd1f6822f4bcb6da600ccf8230e8df5ea6842ee27033740b22e3ca6f","abstract_canon_sha256":"2682f4cb8bdc46631334966273bf6551a5a96abc2d2b367b08e8ede8951603da"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:03:00.782569Z","signature_b64":"RgaDPSB9RcpJwR78bBB3/ACPP/H7LheAiow3KVdBnZZEg1liCn40UgjQYlm42QriIHBDWc/gQ6q80pR2oUShDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"57493423deae3671d5ca68662a0f743fccbd6e335bb74c97a37588abc78da2dd","last_reissued_at":"2026-05-20T00:03:00.781801Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:03:00.781801Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Random dilation superchannel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Mio Murao, Ryotaro Niwa, Ryuji Takagi, Satoshi Yoshida, Takeru Utsumi","submitted_at":"2025-12-24T16:09:38Z","abstract_excerpt":"We present a quantum circuit that implements the random dilation superchannel, transforming parallel queries of an unknown quantum channel into the same number of parallel queries of a randomly chosen dilation isometry of the input channel. This is a natural generalization of the random purification channel, that transforms copies of an unknown mixed state to copies of a randomly chosen purification state. The circuit complexity of our construction is $O(\\mathrm{poly}(n, \\log d_I, \\log d_O))$, where $n$ is the number of queries and $d_I$ and $d_O$ are the input and output dimensions of the inp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2512.21260","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/2512.21260/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":"2512.21260","created_at":"2026-05-20T00:03:00.781922+00:00"},{"alias_kind":"arxiv_version","alias_value":"2512.21260v2","created_at":"2026-05-20T00:03:00.781922+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2512.21260","created_at":"2026-05-20T00:03:00.781922+00:00"},{"alias_kind":"pith_short_12","alias_value":"K5ETII66VY3H","created_at":"2026-05-20T00:03:00.781922+00:00"},{"alias_kind":"pith_short_16","alias_value":"K5ETII66VY3HDVOK","created_at":"2026-05-20T00:03:00.781922+00:00"},{"alias_kind":"pith_short_8","alias_value":"K5ETII66","created_at":"2026-05-20T00:03:00.781922+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":5,"internal_anchor_count":5,"sample":[{"citing_arxiv_id":"2605.03975","citing_title":"Quantum metrology of mixed states via purification","ref_index":37,"is_internal_anchor":true},{"citing_arxiv_id":"2604.07460","citing_title":"Optimal Quantum State Testing Even with Limited Entanglement","ref_index":7,"is_internal_anchor":true},{"citing_arxiv_id":"2605.08082","citing_title":"Advances in quantum learning theory with bosonic systems","ref_index":52,"is_internal_anchor":true},{"citing_arxiv_id":"2604.06325","citing_title":"Probabilistic and approximate universal quantum purification machines","ref_index":19,"is_internal_anchor":true},{"citing_arxiv_id":"2604.17369","citing_title":"Quantum channel tomography: optimal bounds and a Heisenberg-to-classical phase transition","ref_index":25,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/K5ETII66VY3HDVOKNBTCUD3UH7","json":"https://pith.science/pith/K5ETII66VY3HDVOKNBTCUD3UH7.json","graph_json":"https://pith.science/api/pith-number/K5ETII66VY3HDVOKNBTCUD3UH7/graph.json","events_json":"https://pith.science/api/pith-number/K5ETII66VY3HDVOKNBTCUD3UH7/events.json","paper":"https://pith.science/paper/K5ETII66"},"agent_actions":{"view_html":"https://pith.science/pith/K5ETII66VY3HDVOKNBTCUD3UH7","download_json":"https://pith.science/pith/K5ETII66VY3HDVOKNBTCUD3UH7.json","view_paper":"https://pith.science/paper/K5ETII66","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2512.21260&json=true","fetch_graph":"https://pith.science/api/pith-number/K5ETII66VY3HDVOKNBTCUD3UH7/graph.json","fetch_events":"https://pith.science/api/pith-number/K5ETII66VY3HDVOKNBTCUD3UH7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K5ETII66VY3HDVOKNBTCUD3UH7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K5ETII66VY3HDVOKNBTCUD3UH7/action/storage_attestation","attest_author":"https://pith.science/pith/K5ETII66VY3HDVOKNBTCUD3UH7/action/author_attestation","sign_citation":"https://pith.science/pith/K5ETII66VY3HDVOKNBTCUD3UH7/action/citation_signature","submit_replication":"https://pith.science/pith/K5ETII66VY3HDVOKNBTCUD3UH7/action/replication_record"}},"created_at":"2026-05-20T00:03:00.781922+00:00","updated_at":"2026-05-20T00:03:00.781922+00:00"}