{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:7NA777PLL53OSUAE6DYDRUMWV2","short_pith_number":"pith:7NA777PL","schema_version":"1.0","canonical_sha256":"fb41fffdeb5f76e95004f0f038d196ae9208908f6cccf5f9d8bb028610d6b290","source":{"kind":"arxiv","id":"2312.15982","version":1},"attestation_state":"computed","paper":{"title":"Improved Qubit Routing for QAOA Circuits","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Ayse Kotil, Fedor Simkovic, Martin Leib","submitted_at":"2023-12-26T10:26:10Z","abstract_excerpt":"We develop a qubit routing algorithm with polynomial classical run time for the Quantum Approximate Optimization Algorithm (QAOA). The algorithm follows a two step process. First, it obtains a near-optimal solution, based on Vizing's theorem for the edge coloring problem, consisting of subsets of the interaction gates that can be executed in parallel on a fully parallelized all-to-all connected QPU. Second, it proceeds with greedy application of SWAP gates based on their net effect on the distance of remaining interaction gates on a specific hardware connectivity graph. Our algorithm strikes a"},"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":"2312.15982","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-12-26T10:26:10Z","cross_cats_sorted":[],"title_canon_sha256":"491c22e5a8fd8307ffa53464163a3f0d773398fc71e1785e14b691a24fe436c0","abstract_canon_sha256":"0edcc917ed2b0d4f87231cf8a286c95c80acbf1059ed0693caea4eaa3dd729c1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:28:04.407957Z","signature_b64":"v24RCVNLPpDVn9Npz1Xi1J4djZDK3o99hRP9Hz8uE9iQy1Uy1ujPlAx4K0Gq9pUMzroZCleW6D23ADjPhg6ZDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fb41fffdeb5f76e95004f0f038d196ae9208908f6cccf5f9d8bb028610d6b290","last_reissued_at":"2026-07-05T07:28:04.407552Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:28:04.407552Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved Qubit Routing for QAOA Circuits","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Ayse Kotil, Fedor Simkovic, Martin Leib","submitted_at":"2023-12-26T10:26:10Z","abstract_excerpt":"We develop a qubit routing algorithm with polynomial classical run time for the Quantum Approximate Optimization Algorithm (QAOA). The algorithm follows a two step process. First, it obtains a near-optimal solution, based on Vizing's theorem for the edge coloring problem, consisting of subsets of the interaction gates that can be executed in parallel on a fully parallelized all-to-all connected QPU. Second, it proceeds with greedy application of SWAP gates based on their net effect on the distance of remaining interaction gates on a specific hardware connectivity graph. Our algorithm strikes a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.15982","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/2312.15982/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":"2312.15982","created_at":"2026-07-05T07:28:04.407612+00:00"},{"alias_kind":"arxiv_version","alias_value":"2312.15982v1","created_at":"2026-07-05T07:28:04.407612+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.15982","created_at":"2026-07-05T07:28:04.407612+00:00"},{"alias_kind":"pith_short_12","alias_value":"7NA777PLL53O","created_at":"2026-07-05T07:28:04.407612+00:00"},{"alias_kind":"pith_short_16","alias_value":"7NA777PLL53OSUAE","created_at":"2026-07-05T07:28:04.407612+00:00"},{"alias_kind":"pith_short_8","alias_value":"7NA777PL","created_at":"2026-07-05T07:28:04.407612+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/7NA777PLL53OSUAE6DYDRUMWV2","json":"https://pith.science/pith/7NA777PLL53OSUAE6DYDRUMWV2.json","graph_json":"https://pith.science/api/pith-number/7NA777PLL53OSUAE6DYDRUMWV2/graph.json","events_json":"https://pith.science/api/pith-number/7NA777PLL53OSUAE6DYDRUMWV2/events.json","paper":"https://pith.science/paper/7NA777PL"},"agent_actions":{"view_html":"https://pith.science/pith/7NA777PLL53OSUAE6DYDRUMWV2","download_json":"https://pith.science/pith/7NA777PLL53OSUAE6DYDRUMWV2.json","view_paper":"https://pith.science/paper/7NA777PL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2312.15982&json=true","fetch_graph":"https://pith.science/api/pith-number/7NA777PLL53OSUAE6DYDRUMWV2/graph.json","fetch_events":"https://pith.science/api/pith-number/7NA777PLL53OSUAE6DYDRUMWV2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7NA777PLL53OSUAE6DYDRUMWV2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7NA777PLL53OSUAE6DYDRUMWV2/action/storage_attestation","attest_author":"https://pith.science/pith/7NA777PLL53OSUAE6DYDRUMWV2/action/author_attestation","sign_citation":"https://pith.science/pith/7NA777PLL53OSUAE6DYDRUMWV2/action/citation_signature","submit_replication":"https://pith.science/pith/7NA777PLL53OSUAE6DYDRUMWV2/action/replication_record"}},"created_at":"2026-07-05T07:28:04.407612+00:00","updated_at":"2026-07-05T07:28:04.407612+00:00"}