{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:YGSLEWK3BRK4XIUE27TNR4Q3T3","short_pith_number":"pith:YGSLEWK3","schema_version":"1.0","canonical_sha256":"c1a4b2595b0c55cba284d7e6d8f21b9edab75fcd8db09b5d662c87bdbe8d69fb","source":{"kind":"arxiv","id":"2409.08368","version":1},"attestation_state":"computed","paper":{"title":"LightSABRE: A Lightweight and Enhanced SABRE Algorithm","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"quant-ph","authors_text":"Alexander Ivrii, Henry Zou, Jake Lishman, Kevin Hartman, Matthew Treinish","submitted_at":"2024-09-12T19:19:59Z","abstract_excerpt":"We introduce LightSABRE, a significant enhancement of the SABRE algorithm that advances both runtime efficiency and circuit quality. LightSABRE addresses the increasing demands of modern quantum hardware, which can now accommodate complex scenarios, and circuits with millions of gates. Through iterative development within Qiskit, primarily using the Rust programming language, we have achieved a version of the algorithm in Qiskit 1.2.0 that is approximately 200 times faster than the implementation in Qiskit 0.20.1, which already introduced key improvements like the release valve mechanism. Addi"},"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":"2409.08368","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-09-12T19:19:59Z","cross_cats_sorted":["cs.ET"],"title_canon_sha256":"10d5868923740e2b7c46bf4a2cfb7491b6a16df513b8a1709923e366d3ddcb3f","abstract_canon_sha256":"8bc2188f340f2dd13e0310a61a2bf87a6d0b2b7fe971529cb2483f60d50d3a44"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:06:30.111449Z","signature_b64":"O7o7QgQHjPoMZUANDtY2U5nwdwcvI3cMRMBUIKIbikossc/zwmxib2M4j+okXxcVyKUYDXyV0PPr1o2HUukkBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c1a4b2595b0c55cba284d7e6d8f21b9edab75fcd8db09b5d662c87bdbe8d69fb","last_reissued_at":"2026-07-05T09:06:30.111028Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:06:30.111028Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"LightSABRE: A Lightweight and Enhanced SABRE Algorithm","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"quant-ph","authors_text":"Alexander Ivrii, Henry Zou, Jake Lishman, Kevin Hartman, Matthew Treinish","submitted_at":"2024-09-12T19:19:59Z","abstract_excerpt":"We introduce LightSABRE, a significant enhancement of the SABRE algorithm that advances both runtime efficiency and circuit quality. LightSABRE addresses the increasing demands of modern quantum hardware, which can now accommodate complex scenarios, and circuits with millions of gates. Through iterative development within Qiskit, primarily using the Rust programming language, we have achieved a version of the algorithm in Qiskit 1.2.0 that is approximately 200 times faster than the implementation in Qiskit 0.20.1, which already introduced key improvements like the release valve mechanism. Addi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.08368","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/2409.08368/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":"2409.08368","created_at":"2026-07-05T09:06:30.111090+00:00"},{"alias_kind":"arxiv_version","alias_value":"2409.08368v1","created_at":"2026-07-05T09:06:30.111090+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.08368","created_at":"2026-07-05T09:06:30.111090+00:00"},{"alias_kind":"pith_short_12","alias_value":"YGSLEWK3BRK4","created_at":"2026-07-05T09:06:30.111090+00:00"},{"alias_kind":"pith_short_16","alias_value":"YGSLEWK3BRK4XIUE","created_at":"2026-07-05T09:06:30.111090+00:00"},{"alias_kind":"pith_short_8","alias_value":"YGSLEWK3","created_at":"2026-07-05T09:06:30.111090+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":14,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.20968","citing_title":"Profiling the Effective Limits of Error Mitigation via Circuit Replication","ref_index":18,"is_internal_anchor":false},{"citing_arxiv_id":"2605.25552","citing_title":"Beyond Logical Circuits: Hardware-Aware Analysis of Expressibility and Trainability in Variational Quantum Algorithms","ref_index":36,"is_internal_anchor":false},{"citing_arxiv_id":"2605.29964","citing_title":"A Neutral-Atom Quantum Compiler with Application-Specific Layout and Hub-Assisted Shuttling","ref_index":20,"is_internal_anchor":false},{"citing_arxiv_id":"2505.08928","citing_title":"TeleSABRE: Layout Synthesis in Multi-Core Quantum Systems with Teleport Interconnect","ref_index":18,"is_internal_anchor":false},{"citing_arxiv_id":"2605.21662","citing_title":"Fidelity-Aware Frequency Allocation and Transpilation Co-Design for Tunable Coupler Quantum Systems","ref_index":45,"is_internal_anchor":false},{"citing_arxiv_id":"2605.21960","citing_title":"dSABRE: A SABRE-Style Router for Multi-Core Distributed Quantum Computers","ref_index":16,"is_internal_anchor":false},{"citing_arxiv_id":"2511.04608","citing_title":"Unifying Qubit Routing Across Diverse Quantum ISAs via Canonical Representation","ref_index":74,"is_internal_anchor":false},{"citing_arxiv_id":"2605.13638","citing_title":"CO-MAP: A Reinforcement Learning Approach to the Qubit Allocation Problem","ref_index":42,"is_internal_anchor":false},{"citing_arxiv_id":"2605.12365","citing_title":"QAP-Router: Tackling Qubit Routing as Dynamic Quadratic Assignment with Reinforcement Learning","ref_index":76,"is_internal_anchor":false},{"citing_arxiv_id":"2605.11500","citing_title":"Digital Annealer-Assisted Accuracy-First Quantum Circuit Transpilation with Integrated QUBO Mapping and Routing","ref_index":16,"is_internal_anchor":false},{"citing_arxiv_id":"2605.09237","citing_title":"Scaling Qubit Mapping and Routing With Position Graph Abstraction and Memoization","ref_index":17,"is_internal_anchor":false},{"citing_arxiv_id":"2604.24422","citing_title":"Noise-aware selection of circuit cutting strategies under hardware noise non-uniformity","ref_index":14,"is_internal_anchor":false},{"citing_arxiv_id":"2604.19341","citing_title":"Evaluation-driven Scaling for Scientific Discovery","ref_index":177,"is_internal_anchor":false},{"citing_arxiv_id":"2604.13812","citing_title":"AlphaCNOT: Learning CNOT Minimization with Model-Based Planning","ref_index":46,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YGSLEWK3BRK4XIUE27TNR4Q3T3","json":"https://pith.science/pith/YGSLEWK3BRK4XIUE27TNR4Q3T3.json","graph_json":"https://pith.science/api/pith-number/YGSLEWK3BRK4XIUE27TNR4Q3T3/graph.json","events_json":"https://pith.science/api/pith-number/YGSLEWK3BRK4XIUE27TNR4Q3T3/events.json","paper":"https://pith.science/paper/YGSLEWK3"},"agent_actions":{"view_html":"https://pith.science/pith/YGSLEWK3BRK4XIUE27TNR4Q3T3","download_json":"https://pith.science/pith/YGSLEWK3BRK4XIUE27TNR4Q3T3.json","view_paper":"https://pith.science/paper/YGSLEWK3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2409.08368&json=true","fetch_graph":"https://pith.science/api/pith-number/YGSLEWK3BRK4XIUE27TNR4Q3T3/graph.json","fetch_events":"https://pith.science/api/pith-number/YGSLEWK3BRK4XIUE27TNR4Q3T3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YGSLEWK3BRK4XIUE27TNR4Q3T3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YGSLEWK3BRK4XIUE27TNR4Q3T3/action/storage_attestation","attest_author":"https://pith.science/pith/YGSLEWK3BRK4XIUE27TNR4Q3T3/action/author_attestation","sign_citation":"https://pith.science/pith/YGSLEWK3BRK4XIUE27TNR4Q3T3/action/citation_signature","submit_replication":"https://pith.science/pith/YGSLEWK3BRK4XIUE27TNR4Q3T3/action/replication_record"}},"created_at":"2026-07-05T09:06:30.111090+00:00","updated_at":"2026-07-05T09:06:30.111090+00:00"}