{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:3TKN4PYK4WKUCZRS2JC4XJOKV2","short_pith_number":"pith:3TKN4PYK","schema_version":"1.0","canonical_sha256":"dcd4de3f0ae595416632d245cba5caae8134d6b7973438c6a5d814211932ec15","source":{"kind":"arxiv","id":"1805.10224","version":1},"attestation_state":"computed","paper":{"title":"A Case for Variability-Aware Policies for NISQ-Era Quantum Computers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"quant-ph","authors_text":"Moinuddin K.Qureshi, Swamit S. Tannu","submitted_at":"2018-05-25T16:09:16Z","abstract_excerpt":"Recently, IBM, Google, and Intel showcased quantum computers ranging from 49 to 72 qubits. While these systems represent a significant milestone in the advancement of quantum computing, existing and near-term quantum computers are not yet large enough to fully support quantum error-correction. Such systems with few tens to few hundreds of qubits are termed as Noisy Intermediate Scale Quantum computers (NISQ), and these systems can provide benefits for a class of quantum algorithms. In this paper, we study the problems of Qubit-Allocation (mapping of program qubits to machine qubits) and Qubit-"},"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":"1805.10224","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-05-25T16:09:16Z","cross_cats_sorted":["cs.ET"],"title_canon_sha256":"2bdc175d3d8622b88e2f3150bf712b405247dfccea523717ce4834d455a4d794","abstract_canon_sha256":"80fbdf989654fa67157f1c4cf65181f6b0d5ed66328afb7f67c0d212c7e9d6fb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:57.918276Z","signature_b64":"HwrP6E2kUVVPzOTGBkAwr4UPaJE8o2gDz+4bUe5/V8nWhtofZRmHkqfOe4dRtfBMe32pQaZgVRdVInmsNu7MAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dcd4de3f0ae595416632d245cba5caae8134d6b7973438c6a5d814211932ec15","last_reissued_at":"2026-05-18T00:14:57.917518Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:57.917518Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Case for Variability-Aware Policies for NISQ-Era Quantum Computers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"quant-ph","authors_text":"Moinuddin K.Qureshi, Swamit S. Tannu","submitted_at":"2018-05-25T16:09:16Z","abstract_excerpt":"Recently, IBM, Google, and Intel showcased quantum computers ranging from 49 to 72 qubits. While these systems represent a significant milestone in the advancement of quantum computing, existing and near-term quantum computers are not yet large enough to fully support quantum error-correction. Such systems with few tens to few hundreds of qubits are termed as Noisy Intermediate Scale Quantum computers (NISQ), and these systems can provide benefits for a class of quantum algorithms. In this paper, we study the problems of Qubit-Allocation (mapping of program qubits to machine qubits) and Qubit-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.10224","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":"1805.10224","created_at":"2026-05-18T00:14:57.917659+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.10224v1","created_at":"2026-05-18T00:14:57.917659+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.10224","created_at":"2026-05-18T00:14:57.917659+00:00"},{"alias_kind":"pith_short_12","alias_value":"3TKN4PYK4WKU","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_16","alias_value":"3TKN4PYK4WKUCZRS","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_8","alias_value":"3TKN4PYK","created_at":"2026-05-18T12:32:05.422762+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.21475","citing_title":"Photonic Quantum Computing on Spin Memory Architecture with Tree-Encoded Fusion","ref_index":66,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3TKN4PYK4WKUCZRS2JC4XJOKV2","json":"https://pith.science/pith/3TKN4PYK4WKUCZRS2JC4XJOKV2.json","graph_json":"https://pith.science/api/pith-number/3TKN4PYK4WKUCZRS2JC4XJOKV2/graph.json","events_json":"https://pith.science/api/pith-number/3TKN4PYK4WKUCZRS2JC4XJOKV2/events.json","paper":"https://pith.science/paper/3TKN4PYK"},"agent_actions":{"view_html":"https://pith.science/pith/3TKN4PYK4WKUCZRS2JC4XJOKV2","download_json":"https://pith.science/pith/3TKN4PYK4WKUCZRS2JC4XJOKV2.json","view_paper":"https://pith.science/paper/3TKN4PYK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.10224&json=true","fetch_graph":"https://pith.science/api/pith-number/3TKN4PYK4WKUCZRS2JC4XJOKV2/graph.json","fetch_events":"https://pith.science/api/pith-number/3TKN4PYK4WKUCZRS2JC4XJOKV2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3TKN4PYK4WKUCZRS2JC4XJOKV2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3TKN4PYK4WKUCZRS2JC4XJOKV2/action/storage_attestation","attest_author":"https://pith.science/pith/3TKN4PYK4WKUCZRS2JC4XJOKV2/action/author_attestation","sign_citation":"https://pith.science/pith/3TKN4PYK4WKUCZRS2JC4XJOKV2/action/citation_signature","submit_replication":"https://pith.science/pith/3TKN4PYK4WKUCZRS2JC4XJOKV2/action/replication_record"}},"created_at":"2026-05-18T00:14:57.917659+00:00","updated_at":"2026-05-18T00:14:57.917659+00:00"}