{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:WJVOINZGTMREPFKYXUS5O4ZJMY","short_pith_number":"pith:WJVOINZG","schema_version":"1.0","canonical_sha256":"b26ae437269b22479558bd25d77329661400f89a3b83a30fb73be1ea4e35f3a5","source":{"kind":"arxiv","id":"1805.12570","version":5},"attestation_state":"computed","paper":{"title":"On the depth overhead incurred when running quantum algorithms on near-term quantum computers with limited qubit connectivity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Steven Herbert","submitted_at":"2018-05-31T17:26:29Z","abstract_excerpt":"This paper addresses the problem of finding the depth overhead that will be incurred when running quantum circuits on near-term quantum computers. Specifically, it is envisaged that near-term quantum computers will have low qubit connectivity: each qubit will only be able to interact with a subset of the other qubits, a reality typically represented by a qubit interaction graph in which a vertex represents a qubit and an edge represents a possible direct 2-qubit interaction (gate). Thus the depth overhead is unavoidably incurred by introducing swap gates into the quantum circuit to enable gene"},"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":"1805.12570","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-05-31T17:26:29Z","cross_cats_sorted":[],"title_canon_sha256":"8029d1975c3ae26d722cb762eca86f323e7f0c6e383a5b2f6393083caef5a85f","abstract_canon_sha256":"02cbd9f103a367339003597809183dcdfbf7cfd36b5e315c7808f2acd94ec425"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:22:28.333627Z","signature_b64":"wUwah6TGS3AMOt79a/7yg1YHdEq+ZlT5MmpwZZc2dKn/IahufUmblOwRca8dWkJrmkhGLkNK9J/rwLB+5rcJBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b26ae437269b22479558bd25d77329661400f89a3b83a30fb73be1ea4e35f3a5","last_reissued_at":"2026-07-05T01:22:28.333163Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:22:28.333163Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the depth overhead incurred when running quantum algorithms on near-term quantum computers with limited qubit connectivity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Steven Herbert","submitted_at":"2018-05-31T17:26:29Z","abstract_excerpt":"This paper addresses the problem of finding the depth overhead that will be incurred when running quantum circuits on near-term quantum computers. Specifically, it is envisaged that near-term quantum computers will have low qubit connectivity: each qubit will only be able to interact with a subset of the other qubits, a reality typically represented by a qubit interaction graph in which a vertex represents a qubit and an edge represents a possible direct 2-qubit interaction (gate). Thus the depth overhead is unavoidably incurred by introducing swap gates into the quantum circuit to enable gene"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.12570","kind":"arxiv","version":5},"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/1805.12570/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":"1805.12570","created_at":"2026-07-05T01:22:28.333234+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.12570v5","created_at":"2026-07-05T01:22:28.333234+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.12570","created_at":"2026-07-05T01:22:28.333234+00:00"},{"alias_kind":"pith_short_12","alias_value":"WJVOINZGTMRE","created_at":"2026-07-05T01:22:28.333234+00:00"},{"alias_kind":"pith_short_16","alias_value":"WJVOINZGTMREPFKY","created_at":"2026-07-05T01:22:28.333234+00:00"},{"alias_kind":"pith_short_8","alias_value":"WJVOINZG","created_at":"2026-07-05T01:22:28.333234+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.04110","citing_title":"Circuit Design Informed Adaptive Variational Quantum Algorithms","ref_index":31,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WJVOINZGTMREPFKYXUS5O4ZJMY","json":"https://pith.science/pith/WJVOINZGTMREPFKYXUS5O4ZJMY.json","graph_json":"https://pith.science/api/pith-number/WJVOINZGTMREPFKYXUS5O4ZJMY/graph.json","events_json":"https://pith.science/api/pith-number/WJVOINZGTMREPFKYXUS5O4ZJMY/events.json","paper":"https://pith.science/paper/WJVOINZG"},"agent_actions":{"view_html":"https://pith.science/pith/WJVOINZGTMREPFKYXUS5O4ZJMY","download_json":"https://pith.science/pith/WJVOINZGTMREPFKYXUS5O4ZJMY.json","view_paper":"https://pith.science/paper/WJVOINZG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.12570&json=true","fetch_graph":"https://pith.science/api/pith-number/WJVOINZGTMREPFKYXUS5O4ZJMY/graph.json","fetch_events":"https://pith.science/api/pith-number/WJVOINZGTMREPFKYXUS5O4ZJMY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WJVOINZGTMREPFKYXUS5O4ZJMY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WJVOINZGTMREPFKYXUS5O4ZJMY/action/storage_attestation","attest_author":"https://pith.science/pith/WJVOINZGTMREPFKYXUS5O4ZJMY/action/author_attestation","sign_citation":"https://pith.science/pith/WJVOINZGTMREPFKYXUS5O4ZJMY/action/citation_signature","submit_replication":"https://pith.science/pith/WJVOINZGTMREPFKYXUS5O4ZJMY/action/replication_record"}},"created_at":"2026-07-05T01:22:28.333234+00:00","updated_at":"2026-07-05T01:22:28.333234+00:00"}