{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:W7XRNZCHR2F77WVPL6ANRQCKPW","short_pith_number":"pith:W7XRNZCH","schema_version":"1.0","canonical_sha256":"b7ef16e4478e8bffdaaf5f80d8c04a7dab5ab28c9aecf678a68435806737bb60","source":{"kind":"arxiv","id":"1703.06199","version":1},"attestation_state":"computed","paper":{"title":"Quantum Algorithms for Fixed Qubit Architectures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"E. Farhi, H. Neven, J. Goldstone, S. Gutmann","submitted_at":"2017-03-17T21:17:04Z","abstract_excerpt":"Gate model quantum computers with too many qubits to be simulated by available classical computers are about to arrive. We present a strategy for programming these devices without error correction or compilation. This means that the number of logical qubits is the same as the number of qubits on the device. The hardware determines which pairs of qubits can be addressed by unitary operators. The goal is to build quantum states that solve computational problems such as maximizing a combinatorial objective function or minimizing a Hamiltonian. These problems may not fit naturally on the physical "},"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":"1703.06199","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-03-17T21:17:04Z","cross_cats_sorted":[],"title_canon_sha256":"ca3ba23ce8aff062d7a498a1260d47aba89cd989b3d3a5c923ac0461756bb4eb","abstract_canon_sha256":"55a9b516b48ebb0e83f0f5436941b5abe1a2e91a70ad39019bb841627265bfd6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:25.475642Z","signature_b64":"EZy4xtm4ZA39O2zn6aP69YR/kougmdivtHyrCZhhPgP+g89etxVQpZ0JpoHb2t2jkH4WC0jTCIi+Z0m+jZcPDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b7ef16e4478e8bffdaaf5f80d8c04a7dab5ab28c9aecf678a68435806737bb60","last_reissued_at":"2026-05-18T00:48:25.474950Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:25.474950Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Algorithms for Fixed Qubit Architectures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"E. Farhi, H. Neven, J. Goldstone, S. Gutmann","submitted_at":"2017-03-17T21:17:04Z","abstract_excerpt":"Gate model quantum computers with too many qubits to be simulated by available classical computers are about to arrive. We present a strategy for programming these devices without error correction or compilation. This means that the number of logical qubits is the same as the number of qubits on the device. The hardware determines which pairs of qubits can be addressed by unitary operators. The goal is to build quantum states that solve computational problems such as maximizing a combinatorial objective function or minimizing a Hamiltonian. These problems may not fit naturally on the physical "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.06199","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":"1703.06199","created_at":"2026-05-18T00:48:25.475061+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.06199v1","created_at":"2026-05-18T00:48:25.475061+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.06199","created_at":"2026-05-18T00:48:25.475061+00:00"},{"alias_kind":"pith_short_12","alias_value":"W7XRNZCHR2F7","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_16","alias_value":"W7XRNZCHR2F77WVP","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_8","alias_value":"W7XRNZCH","created_at":"2026-05-18T12:31:53.515858+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.09631","citing_title":"Analysis of Quantum Approximate Optimization Algorithm under Realistic Noise in Superconducting Qubits","ref_index":13,"is_internal_anchor":true},{"citing_arxiv_id":"2605.04253","citing_title":"Second-Order FALQON Parameter Transfer for the Max-Cut Problem on 3-Regular Graphs","ref_index":6,"is_internal_anchor":false},{"citing_arxiv_id":"2604.12549","citing_title":"Utility of NISQ devices: optimizing experimental parameters for the fabrication of Au atomic junction using gate-based quantum computers","ref_index":30,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/W7XRNZCHR2F77WVPL6ANRQCKPW","json":"https://pith.science/pith/W7XRNZCHR2F77WVPL6ANRQCKPW.json","graph_json":"https://pith.science/api/pith-number/W7XRNZCHR2F77WVPL6ANRQCKPW/graph.json","events_json":"https://pith.science/api/pith-number/W7XRNZCHR2F77WVPL6ANRQCKPW/events.json","paper":"https://pith.science/paper/W7XRNZCH"},"agent_actions":{"view_html":"https://pith.science/pith/W7XRNZCHR2F77WVPL6ANRQCKPW","download_json":"https://pith.science/pith/W7XRNZCHR2F77WVPL6ANRQCKPW.json","view_paper":"https://pith.science/paper/W7XRNZCH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.06199&json=true","fetch_graph":"https://pith.science/api/pith-number/W7XRNZCHR2F77WVPL6ANRQCKPW/graph.json","fetch_events":"https://pith.science/api/pith-number/W7XRNZCHR2F77WVPL6ANRQCKPW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/W7XRNZCHR2F77WVPL6ANRQCKPW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/W7XRNZCHR2F77WVPL6ANRQCKPW/action/storage_attestation","attest_author":"https://pith.science/pith/W7XRNZCHR2F77WVPL6ANRQCKPW/action/author_attestation","sign_citation":"https://pith.science/pith/W7XRNZCHR2F77WVPL6ANRQCKPW/action/citation_signature","submit_replication":"https://pith.science/pith/W7XRNZCHR2F77WVPL6ANRQCKPW/action/replication_record"}},"created_at":"2026-05-18T00:48:25.475061+00:00","updated_at":"2026-05-18T00:48:25.475061+00:00"}