{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:QVOB5QAGUICRDW7SAI22TFIAXS","short_pith_number":"pith:QVOB5QAG","schema_version":"1.0","canonical_sha256":"855c1ec006a20511dbf20235a99500bc86696829d6d1abc89ed7b4c06424e8d9","source":{"kind":"arxiv","id":"2206.06437","version":1},"attestation_state":"computed","paper":{"title":"Distribution of Quantum Circuits Over General Quantum Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cs.ET","authors_text":"C. R. Ramakrishnan, Himanshu Gupta, Ranjani G Sundaram","submitted_at":"2022-06-13T19:30:48Z","abstract_excerpt":"Near-term quantum computers can hold only a small number of qubits. One way to facilitate large-scale quantum computations is through a distributed network of quantum computers. In this work, we consider the problem of distributing quantum programs represented as quantum circuits across a quantum network of heterogeneous quantum computers, in a way that minimizes the overall communication cost required to execute the distributed circuit. We consider two ways of communicating: cat-entanglement that creates linked copies of qubits across pairs of computers, and teleportation. The heterogeneous c"},"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":"2206.06437","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.ET","submitted_at":"2022-06-13T19:30:48Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"f3bbfdd80c0643689913bfbb0760a353cf1ca6d695bb99b0cef6c019231d0efe","abstract_canon_sha256":"290ffb5da842a96322759ca192f8ae5696f039384bf546e559b034daff10b31b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:31:42.246094Z","signature_b64":"mvttJHOGObuSiqVW7Hi53GcB5sMaSkkj27obwqZ5fpoT8MyrQ3p1oH3QR7cgj9ht6OShkuZhkzMIpVN5xM1JBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"855c1ec006a20511dbf20235a99500bc86696829d6d1abc89ed7b4c06424e8d9","last_reissued_at":"2026-07-05T04:31:42.245534Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:31:42.245534Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distribution of Quantum Circuits Over General Quantum Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cs.ET","authors_text":"C. R. Ramakrishnan, Himanshu Gupta, Ranjani G Sundaram","submitted_at":"2022-06-13T19:30:48Z","abstract_excerpt":"Near-term quantum computers can hold only a small number of qubits. One way to facilitate large-scale quantum computations is through a distributed network of quantum computers. In this work, we consider the problem of distributing quantum programs represented as quantum circuits across a quantum network of heterogeneous quantum computers, in a way that minimizes the overall communication cost required to execute the distributed circuit. We consider two ways of communicating: cat-entanglement that creates linked copies of qubits across pairs of computers, and teleportation. The heterogeneous c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2206.06437","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/2206.06437/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":"2206.06437","created_at":"2026-07-05T04:31:42.245621+00:00"},{"alias_kind":"arxiv_version","alias_value":"2206.06437v1","created_at":"2026-07-05T04:31:42.245621+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2206.06437","created_at":"2026-07-05T04:31:42.245621+00:00"},{"alias_kind":"pith_short_12","alias_value":"QVOB5QAGUICR","created_at":"2026-07-05T04:31:42.245621+00:00"},{"alias_kind":"pith_short_16","alias_value":"QVOB5QAGUICRDW7S","created_at":"2026-07-05T04:31:42.245621+00:00"},{"alias_kind":"pith_short_8","alias_value":"QVOB5QAG","created_at":"2026-07-05T04:31:42.245621+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.26297","citing_title":"A Distributed Quantum Approximate Optimization Algorithm Simulator for Engineering Design Optimization","ref_index":38,"is_internal_anchor":false},{"citing_arxiv_id":"2606.26297","citing_title":"A Distributed Quantum Approximate Optimization Algorithm Simulator for Engineering Design Optimization","ref_index":40,"is_internal_anchor":false},{"citing_arxiv_id":"2606.26297","citing_title":"A Distributed Quantum Approximate Optimization Algorithm Simulator for Engineering Design Optimization","ref_index":40,"is_internal_anchor":false},{"citing_arxiv_id":"2606.26297","citing_title":"A Distributed Quantum Approximate Optimization Algorithm Simulator for Engineering Design Optimization","ref_index":39,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QVOB5QAGUICRDW7SAI22TFIAXS","json":"https://pith.science/pith/QVOB5QAGUICRDW7SAI22TFIAXS.json","graph_json":"https://pith.science/api/pith-number/QVOB5QAGUICRDW7SAI22TFIAXS/graph.json","events_json":"https://pith.science/api/pith-number/QVOB5QAGUICRDW7SAI22TFIAXS/events.json","paper":"https://pith.science/paper/QVOB5QAG"},"agent_actions":{"view_html":"https://pith.science/pith/QVOB5QAGUICRDW7SAI22TFIAXS","download_json":"https://pith.science/pith/QVOB5QAGUICRDW7SAI22TFIAXS.json","view_paper":"https://pith.science/paper/QVOB5QAG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2206.06437&json=true","fetch_graph":"https://pith.science/api/pith-number/QVOB5QAGUICRDW7SAI22TFIAXS/graph.json","fetch_events":"https://pith.science/api/pith-number/QVOB5QAGUICRDW7SAI22TFIAXS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QVOB5QAGUICRDW7SAI22TFIAXS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QVOB5QAGUICRDW7SAI22TFIAXS/action/storage_attestation","attest_author":"https://pith.science/pith/QVOB5QAGUICRDW7SAI22TFIAXS/action/author_attestation","sign_citation":"https://pith.science/pith/QVOB5QAGUICRDW7SAI22TFIAXS/action/citation_signature","submit_replication":"https://pith.science/pith/QVOB5QAGUICRDW7SAI22TFIAXS/action/replication_record"}},"created_at":"2026-07-05T04:31:42.245621+00:00","updated_at":"2026-07-05T04:31:42.245621+00:00"}