{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:UOKBERH7CDHVXUPM2WREC7PWH6","short_pith_number":"pith:UOKBERH7","schema_version":"1.0","canonical_sha256":"a3941244ff10cf5bd1ecd5a2417df63fb0cded8a5027ec30860e42136c46308c","source":{"kind":"arxiv","id":"2305.11642","version":2},"attestation_state":"computed","paper":{"title":"Quantum channel decomposition with pre- and post-selection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Naoki Yamamoto, Ryo Nagai, Shu Kanno, Yuki Sato","submitted_at":"2023-05-19T12:48:21Z","abstract_excerpt":"The quantum channel decomposition techniques, which contain the so-called probabilistic error cancellation and gate/wire cutting, are powerful approach for simulating a hard-to-implement (or an ideal) unitary operation by concurrently executing relatively easy-to-implement (or noisy) quantum channels. However, such virtual simulation necessitates an exponentially large number of decompositions, thereby significantly limiting their practical applicability. This paper proposes a channel decomposition method for target unitaries that have their input and output conditioned on specific quantum sta"},"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":"2305.11642","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-05-19T12:48:21Z","cross_cats_sorted":[],"title_canon_sha256":"682236c9e95b0b8d6508880632cbf44c62ce7a3aa68e4adbd0c7c10cc8bf576c","abstract_canon_sha256":"14bae4f0c62ee515bf4189d35d1fc3e4bbfd35749a1d7716f93140e2cd8d3dfb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:45:35.875494Z","signature_b64":"RLDqtE0bwFbvWVPoRxmgNqFacjKFQrmyfKpdoFGGAJw38mPTc0IIp/0nv3y56rFQWcjrJLpYBHSbmnBSq06cDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a3941244ff10cf5bd1ecd5a2417df63fb0cded8a5027ec30860e42136c46308c","last_reissued_at":"2026-07-05T06:45:35.874956Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:45:35.874956Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum channel decomposition with pre- and post-selection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Naoki Yamamoto, Ryo Nagai, Shu Kanno, Yuki Sato","submitted_at":"2023-05-19T12:48:21Z","abstract_excerpt":"The quantum channel decomposition techniques, which contain the so-called probabilistic error cancellation and gate/wire cutting, are powerful approach for simulating a hard-to-implement (or an ideal) unitary operation by concurrently executing relatively easy-to-implement (or noisy) quantum channels. However, such virtual simulation necessitates an exponentially large number of decompositions, thereby significantly limiting their practical applicability. This paper proposes a channel decomposition method for target unitaries that have their input and output conditioned on specific quantum sta"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.11642","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/2305.11642/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":"2305.11642","created_at":"2026-07-05T06:45:35.875031+00:00"},{"alias_kind":"arxiv_version","alias_value":"2305.11642v2","created_at":"2026-07-05T06:45:35.875031+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.11642","created_at":"2026-07-05T06:45:35.875031+00:00"},{"alias_kind":"pith_short_12","alias_value":"UOKBERH7CDHV","created_at":"2026-07-05T06:45:35.875031+00:00"},{"alias_kind":"pith_short_16","alias_value":"UOKBERH7CDHVXUPM","created_at":"2026-07-05T06:45:35.875031+00:00"},{"alias_kind":"pith_short_8","alias_value":"UOKBERH7","created_at":"2026-07-05T06:45:35.875031+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/UOKBERH7CDHVXUPM2WREC7PWH6","json":"https://pith.science/pith/UOKBERH7CDHVXUPM2WREC7PWH6.json","graph_json":"https://pith.science/api/pith-number/UOKBERH7CDHVXUPM2WREC7PWH6/graph.json","events_json":"https://pith.science/api/pith-number/UOKBERH7CDHVXUPM2WREC7PWH6/events.json","paper":"https://pith.science/paper/UOKBERH7"},"agent_actions":{"view_html":"https://pith.science/pith/UOKBERH7CDHVXUPM2WREC7PWH6","download_json":"https://pith.science/pith/UOKBERH7CDHVXUPM2WREC7PWH6.json","view_paper":"https://pith.science/paper/UOKBERH7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2305.11642&json=true","fetch_graph":"https://pith.science/api/pith-number/UOKBERH7CDHVXUPM2WREC7PWH6/graph.json","fetch_events":"https://pith.science/api/pith-number/UOKBERH7CDHVXUPM2WREC7PWH6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UOKBERH7CDHVXUPM2WREC7PWH6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UOKBERH7CDHVXUPM2WREC7PWH6/action/storage_attestation","attest_author":"https://pith.science/pith/UOKBERH7CDHVXUPM2WREC7PWH6/action/author_attestation","sign_citation":"https://pith.science/pith/UOKBERH7CDHVXUPM2WREC7PWH6/action/citation_signature","submit_replication":"https://pith.science/pith/UOKBERH7CDHVXUPM2WREC7PWH6/action/replication_record"}},"created_at":"2026-07-05T06:45:35.875031+00:00","updated_at":"2026-07-05T06:45:35.875031+00:00"}