{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:BCVMNK7ZSK6B3LTO5Q7WI7HTXE","short_pith_number":"pith:BCVMNK7Z","schema_version":"1.0","canonical_sha256":"08aac6abf992bc1dae6eec3f647cf3b90b2786d58402f5418f1835d5ff748c84","source":{"kind":"arxiv","id":"1905.05118","version":1},"attestation_state":"computed","paper":{"title":"Generalized swap networks for near-term quantum computing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.ET","physics.chem-ph"],"primary_cat":"quant-ph","authors_text":"Bryan O'Gorman, Eleanor G. Rieffel, K. Birgitta Whaley, William J. Huggins","submitted_at":"2019-05-13T16:13:18Z","abstract_excerpt":"The practical use of many types of near-term quantum computers requires accounting for their limited connectivity. One way of overcoming limited connectivity is to insert swaps in the circuit so that logical operations can be performed on physically adjacent qubits, which we refer to as solving the `routing via matchings' problem. We address the routing problem for families of quantum circuits defined by a hypergraph wherein each hyperedge corresponds to a potential gate. Our main result is that any unordered set of $k$-qubit gates on distinct $k$-qubit subsets of $n$ logical qubits can be ord"},"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":"1905.05118","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-05-13T16:13:18Z","cross_cats_sorted":["cs.ET","physics.chem-ph"],"title_canon_sha256":"b2ee6604ff46e3789cac7e33c3764f61e5c91ff7fce76eb9c5e1bf3a9bf5174e","abstract_canon_sha256":"977a1874b3f5a538bd9376e9b4191d1ea3f69eb0bf5b6032c5f3bf00e8cc26d1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:22.495027Z","signature_b64":"BItroOSha73/8Xf8iuWGzo4+WwbPd+Q4GSk6xAVlPU/RXlCFSgNprGmD3HSnkXNP6pIs97lyUDXrdum6eRO6AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"08aac6abf992bc1dae6eec3f647cf3b90b2786d58402f5418f1835d5ff748c84","last_reissued_at":"2026-05-17T23:46:22.494374Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:22.494374Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generalized swap networks for near-term quantum computing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.ET","physics.chem-ph"],"primary_cat":"quant-ph","authors_text":"Bryan O'Gorman, Eleanor G. Rieffel, K. Birgitta Whaley, William J. Huggins","submitted_at":"2019-05-13T16:13:18Z","abstract_excerpt":"The practical use of many types of near-term quantum computers requires accounting for their limited connectivity. One way of overcoming limited connectivity is to insert swaps in the circuit so that logical operations can be performed on physically adjacent qubits, which we refer to as solving the `routing via matchings' problem. We address the routing problem for families of quantum circuits defined by a hypergraph wherein each hyperedge corresponds to a potential gate. Our main result is that any unordered set of $k$-qubit gates on distinct $k$-qubit subsets of $n$ logical qubits can be ord"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.05118","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":""},"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":"1905.05118","created_at":"2026-05-17T23:46:22.494477+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.05118v1","created_at":"2026-05-17T23:46:22.494477+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.05118","created_at":"2026-05-17T23:46:22.494477+00:00"},{"alias_kind":"pith_short_12","alias_value":"BCVMNK7ZSK6B","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_16","alias_value":"BCVMNK7ZSK6B3LTO","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_8","alias_value":"BCVMNK7Z","created_at":"2026-05-18T12:33:12.712433+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2507.23679","citing_title":"Swap Network Augmented Ans\\\"atze on Arbitrary Connectivity","ref_index":17,"is_internal_anchor":true},{"citing_arxiv_id":"2508.08229","citing_title":"Quantum-centric simulation of hydrogen abstraction by sample-based quantum diagonalization and entanglement forging","ref_index":69,"is_internal_anchor":true},{"citing_arxiv_id":"2604.12465","citing_title":"Demonstrating Record Fidelity for the Quantum Fourier Transform","ref_index":19,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BCVMNK7ZSK6B3LTO5Q7WI7HTXE","json":"https://pith.science/pith/BCVMNK7ZSK6B3LTO5Q7WI7HTXE.json","graph_json":"https://pith.science/api/pith-number/BCVMNK7ZSK6B3LTO5Q7WI7HTXE/graph.json","events_json":"https://pith.science/api/pith-number/BCVMNK7ZSK6B3LTO5Q7WI7HTXE/events.json","paper":"https://pith.science/paper/BCVMNK7Z"},"agent_actions":{"view_html":"https://pith.science/pith/BCVMNK7ZSK6B3LTO5Q7WI7HTXE","download_json":"https://pith.science/pith/BCVMNK7ZSK6B3LTO5Q7WI7HTXE.json","view_paper":"https://pith.science/paper/BCVMNK7Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.05118&json=true","fetch_graph":"https://pith.science/api/pith-number/BCVMNK7ZSK6B3LTO5Q7WI7HTXE/graph.json","fetch_events":"https://pith.science/api/pith-number/BCVMNK7ZSK6B3LTO5Q7WI7HTXE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BCVMNK7ZSK6B3LTO5Q7WI7HTXE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BCVMNK7ZSK6B3LTO5Q7WI7HTXE/action/storage_attestation","attest_author":"https://pith.science/pith/BCVMNK7ZSK6B3LTO5Q7WI7HTXE/action/author_attestation","sign_citation":"https://pith.science/pith/BCVMNK7ZSK6B3LTO5Q7WI7HTXE/action/citation_signature","submit_replication":"https://pith.science/pith/BCVMNK7ZSK6B3LTO5Q7WI7HTXE/action/replication_record"}},"created_at":"2026-05-17T23:46:22.494477+00:00","updated_at":"2026-05-17T23:46:22.494477+00:00"}