{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:Y6USF3U566TC3FM25ZSTAHXQ4V","short_pith_number":"pith:Y6USF3U5","schema_version":"1.0","canonical_sha256":"c7a922ee9df7a62d959aee65301ef0e5606fc4181677c229adf7336e1a850125","source":{"kind":"arxiv","id":"1708.00023","version":2},"attestation_state":"computed","paper":{"title":"Two-step approach to scheduling quantum circuits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"quant-ph","authors_text":"Gian Giacomo Guerreschi, Jongsoo Park","submitted_at":"2017-07-31T18:08:26Z","abstract_excerpt":"As the effort to scale up existing quantum hardware proceeds, it becomes necessary to schedule quantum gates in a way that minimizes the number of operations. There are three constraints that have to be satisfied: the order or dependency of the quantum gates in the specific algorithm, the fact that any qubit may be involved in at most one gate at a time, and the restriction that two-qubit gates are implementable only between connected qubits. The last aspect implies that the compilation depends not only on the algorithm, but also on hardware properties like connectivity. Here we suggest a two-"},"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":"1708.00023","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-07-31T18:08:26Z","cross_cats_sorted":["cs.ET"],"title_canon_sha256":"f49d32f7b2a978e67ff548488fbeb775aa390fe4b320aafe967bac28c67bf6e4","abstract_canon_sha256":"dec326e8fdd8e925a3e8b85636c3fe3c058d31e7ea2560424985199f1fd837a7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:18.546398Z","signature_b64":"TOZu1Bb89zJD06CnvuyjGdSF4qEFR5XCYowwTCsVTS27IOcCQgJUPTq1/PluxsvO30IitV149B1ngXt2m2XkCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c7a922ee9df7a62d959aee65301ef0e5606fc4181677c229adf7336e1a850125","last_reissued_at":"2026-05-18T00:07:18.545766Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:18.545766Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Two-step approach to scheduling quantum circuits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"quant-ph","authors_text":"Gian Giacomo Guerreschi, Jongsoo Park","submitted_at":"2017-07-31T18:08:26Z","abstract_excerpt":"As the effort to scale up existing quantum hardware proceeds, it becomes necessary to schedule quantum gates in a way that minimizes the number of operations. There are three constraints that have to be satisfied: the order or dependency of the quantum gates in the specific algorithm, the fact that any qubit may be involved in at most one gate at a time, and the restriction that two-qubit gates are implementable only between connected qubits. The last aspect implies that the compilation depends not only on the algorithm, but also on hardware properties like connectivity. Here we suggest a two-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.00023","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":""},"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":"1708.00023","created_at":"2026-05-18T00:07:18.545879+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.00023v2","created_at":"2026-05-18T00:07:18.545879+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.00023","created_at":"2026-05-18T00:07:18.545879+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y6USF3U566TC","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y6USF3U566TC3FM2","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y6USF3U5","created_at":"2026-05-18T12:31:56.362134+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/Y6USF3U566TC3FM25ZSTAHXQ4V","json":"https://pith.science/pith/Y6USF3U566TC3FM25ZSTAHXQ4V.json","graph_json":"https://pith.science/api/pith-number/Y6USF3U566TC3FM25ZSTAHXQ4V/graph.json","events_json":"https://pith.science/api/pith-number/Y6USF3U566TC3FM25ZSTAHXQ4V/events.json","paper":"https://pith.science/paper/Y6USF3U5"},"agent_actions":{"view_html":"https://pith.science/pith/Y6USF3U566TC3FM25ZSTAHXQ4V","download_json":"https://pith.science/pith/Y6USF3U566TC3FM25ZSTAHXQ4V.json","view_paper":"https://pith.science/paper/Y6USF3U5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.00023&json=true","fetch_graph":"https://pith.science/api/pith-number/Y6USF3U566TC3FM25ZSTAHXQ4V/graph.json","fetch_events":"https://pith.science/api/pith-number/Y6USF3U566TC3FM25ZSTAHXQ4V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y6USF3U566TC3FM25ZSTAHXQ4V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y6USF3U566TC3FM25ZSTAHXQ4V/action/storage_attestation","attest_author":"https://pith.science/pith/Y6USF3U566TC3FM25ZSTAHXQ4V/action/author_attestation","sign_citation":"https://pith.science/pith/Y6USF3U566TC3FM25ZSTAHXQ4V/action/citation_signature","submit_replication":"https://pith.science/pith/Y6USF3U566TC3FM25ZSTAHXQ4V/action/replication_record"}},"created_at":"2026-05-18T00:07:18.545879+00:00","updated_at":"2026-05-18T00:07:18.545879+00:00"}