{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:EQBKLYIVJRJGSJSNFVEEE7Z6YT","short_pith_number":"pith:EQBKLYIV","schema_version":"1.0","canonical_sha256":"2402a5e1154c5269264d2d48427f3ec4d11367f8e319b5c629b7f0ad040fae56","source":{"kind":"arxiv","id":"1902.08091","version":2},"attestation_state":"computed","paper":{"title":"On the qubit routing problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.PL"],"primary_cat":"quant-ph","authors_text":"Alexander Cowtan, Alexandre Krajenbrink, Ross Duncan, Seyon Sivarajah, Silas Dilkes, Will Simmons","submitted_at":"2019-02-21T15:09:20Z","abstract_excerpt":"We introduce a new architecture-agnostic methodology for mapping abstract quantum circuits to realistic quantum computing devices with restricted qubit connectivity, as implemented by Cambridge Quantum Computing's tket compiler. We present empirical results showing the effectiveness of this method in terms of reducing two-qubit gate depth and two-qubit gate count, compared to other implementations."},"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":"1902.08091","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-02-21T15:09:20Z","cross_cats_sorted":["cs.DS","cs.PL"],"title_canon_sha256":"e254b07e94079d24b80c0165f0b748a72119a85af4dd67d4d506db9884684530","abstract_canon_sha256":"04d19011eebbf7f70f6218c15886b1c71f6e1b919c77390b986b973e5a53ea4d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:23.509477Z","signature_b64":"AxhZ7xASbRfBomfoz5V600rmWZOkqi6R8/4atZH/7Dci0wvtyKDW7Tz8dZIn1TOZgA2/aZ7QqJoZGo7hFlexAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2402a5e1154c5269264d2d48427f3ec4d11367f8e319b5c629b7f0ad040fae56","last_reissued_at":"2026-05-17T23:42:23.508798Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:23.508798Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the qubit routing problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.PL"],"primary_cat":"quant-ph","authors_text":"Alexander Cowtan, Alexandre Krajenbrink, Ross Duncan, Seyon Sivarajah, Silas Dilkes, Will Simmons","submitted_at":"2019-02-21T15:09:20Z","abstract_excerpt":"We introduce a new architecture-agnostic methodology for mapping abstract quantum circuits to realistic quantum computing devices with restricted qubit connectivity, as implemented by Cambridge Quantum Computing's tket compiler. We present empirical results showing the effectiveness of this method in terms of reducing two-qubit gate depth and two-qubit gate count, compared to other implementations."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.08091","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":""},"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":"1902.08091","created_at":"2026-05-17T23:42:23.508896+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.08091v2","created_at":"2026-05-17T23:42:23.508896+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.08091","created_at":"2026-05-17T23:42:23.508896+00:00"},{"alias_kind":"pith_short_12","alias_value":"EQBKLYIVJRJG","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_16","alias_value":"EQBKLYIVJRJGSJSN","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_8","alias_value":"EQBKLYIV","created_at":"2026-05-18T12:33:15.570797+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":8,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.21667","citing_title":"Block Encoding of Sparse Matrices via Coherent Permutation","ref_index":19,"is_internal_anchor":true},{"citing_arxiv_id":"2605.12365","citing_title":"QAP-Router: Tackling Qubit Routing as Dynamic Quadratic Assignment with Reinforcement Learning","ref_index":13,"is_internal_anchor":false},{"citing_arxiv_id":"2604.26430","citing_title":"A Multi-Level Integrity Evaluation Framework for Quantum Circuits under Controlled Anomaly Injection","ref_index":18,"is_internal_anchor":false},{"citing_arxiv_id":"2604.27015","citing_title":"Congestion-free routing on quantum chips","ref_index":2,"is_internal_anchor":false},{"citing_arxiv_id":"2605.09237","citing_title":"Scaling Qubit Mapping and Routing With Position Graph Abstraction and Memoization","ref_index":2,"is_internal_anchor":false},{"citing_arxiv_id":"2604.19717","citing_title":"Qubit Routing for (Almost) Free","ref_index":5,"is_internal_anchor":false},{"citing_arxiv_id":"2604.12635","citing_title":"The Impact of Qubit Connectivity on Quantum Advantage in Noisy IQP Circuits","ref_index":11,"is_internal_anchor":false},{"citing_arxiv_id":"2605.07876","citing_title":"Per-Phase Fidelity Attribution for Quantum Compilers using HBR Decomposition","ref_index":10,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EQBKLYIVJRJGSJSNFVEEE7Z6YT","json":"https://pith.science/pith/EQBKLYIVJRJGSJSNFVEEE7Z6YT.json","graph_json":"https://pith.science/api/pith-number/EQBKLYIVJRJGSJSNFVEEE7Z6YT/graph.json","events_json":"https://pith.science/api/pith-number/EQBKLYIVJRJGSJSNFVEEE7Z6YT/events.json","paper":"https://pith.science/paper/EQBKLYIV"},"agent_actions":{"view_html":"https://pith.science/pith/EQBKLYIVJRJGSJSNFVEEE7Z6YT","download_json":"https://pith.science/pith/EQBKLYIVJRJGSJSNFVEEE7Z6YT.json","view_paper":"https://pith.science/paper/EQBKLYIV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.08091&json=true","fetch_graph":"https://pith.science/api/pith-number/EQBKLYIVJRJGSJSNFVEEE7Z6YT/graph.json","fetch_events":"https://pith.science/api/pith-number/EQBKLYIVJRJGSJSNFVEEE7Z6YT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EQBKLYIVJRJGSJSNFVEEE7Z6YT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EQBKLYIVJRJGSJSNFVEEE7Z6YT/action/storage_attestation","attest_author":"https://pith.science/pith/EQBKLYIVJRJGSJSNFVEEE7Z6YT/action/author_attestation","sign_citation":"https://pith.science/pith/EQBKLYIVJRJGSJSNFVEEE7Z6YT/action/citation_signature","submit_replication":"https://pith.science/pith/EQBKLYIVJRJGSJSNFVEEE7Z6YT/action/replication_record"}},"created_at":"2026-05-17T23:42:23.508896+00:00","updated_at":"2026-05-17T23:42:23.508896+00:00"}