{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:ULL2RJD6TYZJCAROSEP2FNQ43D","short_pith_number":"pith:ULL2RJD6","schema_version":"1.0","canonical_sha256":"a2d7a8a47e9e3291022e911fa2b61cd8f629061a28097937015d82541388b3c5","source":{"kind":"arxiv","id":"2103.03264","version":2},"attestation_state":"computed","paper":{"title":"Quantum routing with fast reversals","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"quant-ph","authors_text":"Alexey V. Gorshkov, Andrew M. Childs, Aniruddha Bapat, Eddie Schoute, Hrishee Shastri, Samuel King","submitted_at":"2021-03-04T19:00:11Z","abstract_excerpt":"We present methods for implementing arbitrary permutations of qubits under interaction constraints. Our protocols make use of previous methods for rapidly reversing the order of qubits along a path. Given nearest-neighbor interactions on a path of length $n$, we show that there exists a constant $\\epsilon \\approx 0.034$ such that the quantum routing time is at most $(1-\\epsilon)n$, whereas any swap-based protocol needs at least time $n-1$. This represents the first known quantum advantage over swap-based routing methods and also gives improved quantum routing times for realistic architectures "},"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":"2103.03264","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2021-03-04T19:00:11Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"a7cdadf06d337e20b85a1e06c805f6ff676ae37a9874435e0a84e38a8490923e","abstract_canon_sha256":"879766637fe1ebe1a3dafe7b803d5f0826128a151fe0e1e8c01eea94decc915a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:10:28.721062Z","signature_b64":"WToKd7pxt1L61zNJF6V79gbdEB1edzX6Ms26DHcoDuwaxPAZ7gBTrqBqb6bp4pmplSH6Pjyc38427vLdK0L7DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a2d7a8a47e9e3291022e911fa2b61cd8f629061a28097937015d82541388b3c5","last_reissued_at":"2026-07-05T03:10:28.720574Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:10:28.720574Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum routing with fast reversals","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"quant-ph","authors_text":"Alexey V. Gorshkov, Andrew M. Childs, Aniruddha Bapat, Eddie Schoute, Hrishee Shastri, Samuel King","submitted_at":"2021-03-04T19:00:11Z","abstract_excerpt":"We present methods for implementing arbitrary permutations of qubits under interaction constraints. Our protocols make use of previous methods for rapidly reversing the order of qubits along a path. Given nearest-neighbor interactions on a path of length $n$, we show that there exists a constant $\\epsilon \\approx 0.034$ such that the quantum routing time is at most $(1-\\epsilon)n$, whereas any swap-based protocol needs at least time $n-1$. This represents the first known quantum advantage over swap-based routing methods and also gives improved quantum routing times for realistic architectures "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2103.03264","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2103.03264/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":"2103.03264","created_at":"2026-07-05T03:10:28.720634+00:00"},{"alias_kind":"arxiv_version","alias_value":"2103.03264v2","created_at":"2026-07-05T03:10:28.720634+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2103.03264","created_at":"2026-07-05T03:10:28.720634+00:00"},{"alias_kind":"pith_short_12","alias_value":"ULL2RJD6TYZJ","created_at":"2026-07-05T03:10:28.720634+00:00"},{"alias_kind":"pith_short_16","alias_value":"ULL2RJD6TYZJCARO","created_at":"2026-07-05T03:10:28.720634+00:00"},{"alias_kind":"pith_short_8","alias_value":"ULL2RJD6","created_at":"2026-07-05T03:10:28.720634+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/ULL2RJD6TYZJCAROSEP2FNQ43D","json":"https://pith.science/pith/ULL2RJD6TYZJCAROSEP2FNQ43D.json","graph_json":"https://pith.science/api/pith-number/ULL2RJD6TYZJCAROSEP2FNQ43D/graph.json","events_json":"https://pith.science/api/pith-number/ULL2RJD6TYZJCAROSEP2FNQ43D/events.json","paper":"https://pith.science/paper/ULL2RJD6"},"agent_actions":{"view_html":"https://pith.science/pith/ULL2RJD6TYZJCAROSEP2FNQ43D","download_json":"https://pith.science/pith/ULL2RJD6TYZJCAROSEP2FNQ43D.json","view_paper":"https://pith.science/paper/ULL2RJD6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2103.03264&json=true","fetch_graph":"https://pith.science/api/pith-number/ULL2RJD6TYZJCAROSEP2FNQ43D/graph.json","fetch_events":"https://pith.science/api/pith-number/ULL2RJD6TYZJCAROSEP2FNQ43D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ULL2RJD6TYZJCAROSEP2FNQ43D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ULL2RJD6TYZJCAROSEP2FNQ43D/action/storage_attestation","attest_author":"https://pith.science/pith/ULL2RJD6TYZJCAROSEP2FNQ43D/action/author_attestation","sign_citation":"https://pith.science/pith/ULL2RJD6TYZJCAROSEP2FNQ43D/action/citation_signature","submit_replication":"https://pith.science/pith/ULL2RJD6TYZJCAROSEP2FNQ43D/action/replication_record"}},"created_at":"2026-07-05T03:10:28.720634+00:00","updated_at":"2026-07-05T03:10:28.720634+00:00"}