{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:VLGMA3I6BIUZQ4HMWNVUUTMUQX","short_pith_number":"pith:VLGMA3I6","schema_version":"1.0","canonical_sha256":"aaccc06d1e0a299870ecb36b4a4d9485cf9bdcf2a61d727b8c2fb60639006910","source":{"kind":"arxiv","id":"1806.07241","version":3},"attestation_state":"computed","paper":{"title":"NISQ circuit compilation is the travelling salesman problem on a torus","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.ET","cs.SE"],"primary_cat":"quant-ph","authors_text":"Alexandru Paler, Alwin Zulehner, Robert Wille","submitted_at":"2018-06-19T13:58:25Z","abstract_excerpt":"Noisy, intermediate-scale quantum (NISQ) computers are expected to execute quantum circuits of up to a few hundred qubits. The circuits have to conform to NISQ architectural constraints regarding qubit allocation and the execution of multi-qubit gates. Quantum circuit compilation (QCC) takes a nonconforming circuit and outputs a compatible circuit. Can classical optimisation methods be used for QCC? Compilation is a known combinatorial problem shown to be solvable by two types of operations: 1) qubit allocation, and 2) gate scheduling. We show informally that the two operations form a discrete"},"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":"1806.07241","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-06-19T13:58:25Z","cross_cats_sorted":["cs.DS","cs.ET","cs.SE"],"title_canon_sha256":"b785f75a5f4aff4c4949265942de9839e0a023ae369b563b46e56ed739ebcea3","abstract_canon_sha256":"82c31993c8aa6b28e9a4f9a0348d760f806b50bf8d965fc965817c023ff20d7a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:13:41.069486Z","signature_b64":"hk9zt9ZjdaBaUbybxnrwAk3gizpfMCRPjAL3VH0wa/RkbxYCgD0KNeLnp+yDcPROA9Q8zb3aaAqkMgGLYftuAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aaccc06d1e0a299870ecb36b4a4d9485cf9bdcf2a61d727b8c2fb60639006910","last_reissued_at":"2026-07-05T02:13:41.069122Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:13:41.069122Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"NISQ circuit compilation is the travelling salesman problem on a torus","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.ET","cs.SE"],"primary_cat":"quant-ph","authors_text":"Alexandru Paler, Alwin Zulehner, Robert Wille","submitted_at":"2018-06-19T13:58:25Z","abstract_excerpt":"Noisy, intermediate-scale quantum (NISQ) computers are expected to execute quantum circuits of up to a few hundred qubits. The circuits have to conform to NISQ architectural constraints regarding qubit allocation and the execution of multi-qubit gates. Quantum circuit compilation (QCC) takes a nonconforming circuit and outputs a compatible circuit. Can classical optimisation methods be used for QCC? Compilation is a known combinatorial problem shown to be solvable by two types of operations: 1) qubit allocation, and 2) gate scheduling. We show informally that the two operations form a discrete"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.07241","kind":"arxiv","version":3},"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/1806.07241/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":"1806.07241","created_at":"2026-07-05T02:13:41.069183+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.07241v3","created_at":"2026-07-05T02:13:41.069183+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.07241","created_at":"2026-07-05T02:13:41.069183+00:00"},{"alias_kind":"pith_short_12","alias_value":"VLGMA3I6BIUZ","created_at":"2026-07-05T02:13:41.069183+00:00"},{"alias_kind":"pith_short_16","alias_value":"VLGMA3I6BIUZQ4HM","created_at":"2026-07-05T02:13:41.069183+00:00"},{"alias_kind":"pith_short_8","alias_value":"VLGMA3I6","created_at":"2026-07-05T02:13:41.069183+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.15268","citing_title":"Toward Autonomous Digital Populations for Communication-Sensing-Computation Ecosystem","ref_index":17,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VLGMA3I6BIUZQ4HMWNVUUTMUQX","json":"https://pith.science/pith/VLGMA3I6BIUZQ4HMWNVUUTMUQX.json","graph_json":"https://pith.science/api/pith-number/VLGMA3I6BIUZQ4HMWNVUUTMUQX/graph.json","events_json":"https://pith.science/api/pith-number/VLGMA3I6BIUZQ4HMWNVUUTMUQX/events.json","paper":"https://pith.science/paper/VLGMA3I6"},"agent_actions":{"view_html":"https://pith.science/pith/VLGMA3I6BIUZQ4HMWNVUUTMUQX","download_json":"https://pith.science/pith/VLGMA3I6BIUZQ4HMWNVUUTMUQX.json","view_paper":"https://pith.science/paper/VLGMA3I6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.07241&json=true","fetch_graph":"https://pith.science/api/pith-number/VLGMA3I6BIUZQ4HMWNVUUTMUQX/graph.json","fetch_events":"https://pith.science/api/pith-number/VLGMA3I6BIUZQ4HMWNVUUTMUQX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VLGMA3I6BIUZQ4HMWNVUUTMUQX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VLGMA3I6BIUZQ4HMWNVUUTMUQX/action/storage_attestation","attest_author":"https://pith.science/pith/VLGMA3I6BIUZQ4HMWNVUUTMUQX/action/author_attestation","sign_citation":"https://pith.science/pith/VLGMA3I6BIUZQ4HMWNVUUTMUQX/action/citation_signature","submit_replication":"https://pith.science/pith/VLGMA3I6BIUZQ4HMWNVUUTMUQX/action/replication_record"}},"created_at":"2026-07-05T02:13:41.069183+00:00","updated_at":"2026-07-05T02:13:41.069183+00:00"}