{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:XGH2USJVDHG3HU6NDAHMQWE7EN","short_pith_number":"pith:XGH2USJV","schema_version":"1.0","canonical_sha256":"b98faa493519cdb3d3cd180ec8589f234934f79c733c5dee9d5f065a72569063","source":{"kind":"arxiv","id":"2103.15695","version":2},"attestation_state":"computed","paper":{"title":"Topological-Graph Dependencies and Scaling Properties of a Heuristic Qubit-Assignment Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Carmen G. Almudever, Jan-Michael Reiner, Matthew Steinberg, Michael Marthaler, Sebastian Feld","submitted_at":"2021-03-29T15:29:10Z","abstract_excerpt":"The qubit-mapping problem aims to assign and route qubits of a quantum circuit onto a NISQ device in an optimized fashion, with respect to some cost function. Finding an optimal solution to this problem is known to scale exponentially in computational complexity; as such, it is imperative to investigate scalable qubit-mapping solutions for NISQ computation. In this work, a noise-aware heuristic qubit-assignment algorithm (which assigns initial placements for qubits in a quantum algorithm to qubits on a NISQ device, but does not route qubits during the quantum algorithm's execution) is presente"},"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.15695","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2021-03-29T15:29:10Z","cross_cats_sorted":[],"title_canon_sha256":"512fe3e10191dc3aab91a8a0aa28e71494867cdb0683b94d0d011cc1c6d09884","abstract_canon_sha256":"dadff9e3c798a7c635047437db756bc2f4e9ae13fef9ca3babceb93c064d6157"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:11:49.752628Z","signature_b64":"KiJb1KNg5AUIlSBeFXHscppzVvJh/4zJkiOwfpklCbJeAJSFFJiPuoTVojm9MF8LqvmRKQ1fbRQzBWdUx5ddCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b98faa493519cdb3d3cd180ec8589f234934f79c733c5dee9d5f065a72569063","last_reissued_at":"2026-07-05T07:11:49.752204Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:11:49.752204Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Topological-Graph Dependencies and Scaling Properties of a Heuristic Qubit-Assignment Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Carmen G. Almudever, Jan-Michael Reiner, Matthew Steinberg, Michael Marthaler, Sebastian Feld","submitted_at":"2021-03-29T15:29:10Z","abstract_excerpt":"The qubit-mapping problem aims to assign and route qubits of a quantum circuit onto a NISQ device in an optimized fashion, with respect to some cost function. Finding an optimal solution to this problem is known to scale exponentially in computational complexity; as such, it is imperative to investigate scalable qubit-mapping solutions for NISQ computation. In this work, a noise-aware heuristic qubit-assignment algorithm (which assigns initial placements for qubits in a quantum algorithm to qubits on a NISQ device, but does not route qubits during the quantum algorithm's execution) is presente"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2103.15695","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.15695/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.15695","created_at":"2026-07-05T07:11:49.752263+00:00"},{"alias_kind":"arxiv_version","alias_value":"2103.15695v2","created_at":"2026-07-05T07:11:49.752263+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2103.15695","created_at":"2026-07-05T07:11:49.752263+00:00"},{"alias_kind":"pith_short_12","alias_value":"XGH2USJVDHG3","created_at":"2026-07-05T07:11:49.752263+00:00"},{"alias_kind":"pith_short_16","alias_value":"XGH2USJVDHG3HU6N","created_at":"2026-07-05T07:11:49.752263+00:00"},{"alias_kind":"pith_short_8","alias_value":"XGH2USJV","created_at":"2026-07-05T07:11:49.752263+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/XGH2USJVDHG3HU6NDAHMQWE7EN","json":"https://pith.science/pith/XGH2USJVDHG3HU6NDAHMQWE7EN.json","graph_json":"https://pith.science/api/pith-number/XGH2USJVDHG3HU6NDAHMQWE7EN/graph.json","events_json":"https://pith.science/api/pith-number/XGH2USJVDHG3HU6NDAHMQWE7EN/events.json","paper":"https://pith.science/paper/XGH2USJV"},"agent_actions":{"view_html":"https://pith.science/pith/XGH2USJVDHG3HU6NDAHMQWE7EN","download_json":"https://pith.science/pith/XGH2USJVDHG3HU6NDAHMQWE7EN.json","view_paper":"https://pith.science/paper/XGH2USJV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2103.15695&json=true","fetch_graph":"https://pith.science/api/pith-number/XGH2USJVDHG3HU6NDAHMQWE7EN/graph.json","fetch_events":"https://pith.science/api/pith-number/XGH2USJVDHG3HU6NDAHMQWE7EN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XGH2USJVDHG3HU6NDAHMQWE7EN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XGH2USJVDHG3HU6NDAHMQWE7EN/action/storage_attestation","attest_author":"https://pith.science/pith/XGH2USJVDHG3HU6NDAHMQWE7EN/action/author_attestation","sign_citation":"https://pith.science/pith/XGH2USJVDHG3HU6NDAHMQWE7EN/action/citation_signature","submit_replication":"https://pith.science/pith/XGH2USJVDHG3HU6NDAHMQWE7EN/action/replication_record"}},"created_at":"2026-07-05T07:11:49.752263+00:00","updated_at":"2026-07-05T07:11:49.752263+00:00"}