{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:VFSAMPRGOPGC5653LDH2VE2EZY","short_pith_number":"pith:VFSAMPRG","schema_version":"1.0","canonical_sha256":"a964063e2673cc2efbbb58cfaa9344ce154f8a3544673cfbead4cc8691b846f0","source":{"kind":"arxiv","id":"1605.05370","version":1},"attestation_state":"computed","paper":{"title":"Training A Quantum Optimizer","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"D. Wecker, M. B. Hastings, M. Troyer","submitted_at":"2016-05-17T21:26:37Z","abstract_excerpt":"We study a variant of the quantum approximate optimization algorithm [ E. Farhi, J. Goldstone, and S. Gutmann, arXiv:1411.4028] with slightly different parametrization and different objective: rather than looking for a state which approximately solves an optimization problem, our goal is to find a quantum algorithm that, given an instance of MAX-2-SAT, will produce a state with high overlap with the optimal state. Using a machine learning approach, we chose a \"training set\" of instances and optimized the parameters to produce large overlap for the training set. We then tested these optimized p"},"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":"1605.05370","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-05-17T21:26:37Z","cross_cats_sorted":[],"title_canon_sha256":"beffed5c633281a2b4db338c8989b92575e32e15bb1c9f0877fe309f12f82f8d","abstract_canon_sha256":"3fa65b5eb79ae3cb23a3b0f53e81318dacbda1bf16319053c6b6ad52a036a107"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:08:41.255893Z","signature_b64":"9yZvmHr/sSVb2U38L4gSwwqCnaHt7l6FhvIMu75+5XueK93pYhOEyAZba5WuLI9yZw/U1H/VpmjIPb6pfSn7AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a964063e2673cc2efbbb58cfaa9344ce154f8a3544673cfbead4cc8691b846f0","last_reissued_at":"2026-05-18T01:08:41.255143Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:08:41.255143Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Training A Quantum Optimizer","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"D. Wecker, M. B. Hastings, M. Troyer","submitted_at":"2016-05-17T21:26:37Z","abstract_excerpt":"We study a variant of the quantum approximate optimization algorithm [ E. Farhi, J. Goldstone, and S. Gutmann, arXiv:1411.4028] with slightly different parametrization and different objective: rather than looking for a state which approximately solves an optimization problem, our goal is to find a quantum algorithm that, given an instance of MAX-2-SAT, will produce a state with high overlap with the optimal state. Using a machine learning approach, we chose a \"training set\" of instances and optimized the parameters to produce large overlap for the training set. We then tested these optimized p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.05370","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":"1605.05370","created_at":"2026-05-18T01:08:41.255251+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.05370v1","created_at":"2026-05-18T01:08:41.255251+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.05370","created_at":"2026-05-18T01:08:41.255251+00:00"},{"alias_kind":"pith_short_12","alias_value":"VFSAMPRGOPGC","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_16","alias_value":"VFSAMPRGOPGC5653","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_8","alias_value":"VFSAMPRG","created_at":"2026-05-18T12:30:48.956258+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.27482","citing_title":"Finite Imaginary-Time Evolution for Polynomial Unconstrained Binary Optimization","ref_index":23,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VFSAMPRGOPGC5653LDH2VE2EZY","json":"https://pith.science/pith/VFSAMPRGOPGC5653LDH2VE2EZY.json","graph_json":"https://pith.science/api/pith-number/VFSAMPRGOPGC5653LDH2VE2EZY/graph.json","events_json":"https://pith.science/api/pith-number/VFSAMPRGOPGC5653LDH2VE2EZY/events.json","paper":"https://pith.science/paper/VFSAMPRG"},"agent_actions":{"view_html":"https://pith.science/pith/VFSAMPRGOPGC5653LDH2VE2EZY","download_json":"https://pith.science/pith/VFSAMPRGOPGC5653LDH2VE2EZY.json","view_paper":"https://pith.science/paper/VFSAMPRG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.05370&json=true","fetch_graph":"https://pith.science/api/pith-number/VFSAMPRGOPGC5653LDH2VE2EZY/graph.json","fetch_events":"https://pith.science/api/pith-number/VFSAMPRGOPGC5653LDH2VE2EZY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VFSAMPRGOPGC5653LDH2VE2EZY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VFSAMPRGOPGC5653LDH2VE2EZY/action/storage_attestation","attest_author":"https://pith.science/pith/VFSAMPRGOPGC5653LDH2VE2EZY/action/author_attestation","sign_citation":"https://pith.science/pith/VFSAMPRGOPGC5653LDH2VE2EZY/action/citation_signature","submit_replication":"https://pith.science/pith/VFSAMPRGOPGC5653LDH2VE2EZY/action/replication_record"}},"created_at":"2026-05-18T01:08:41.255251+00:00","updated_at":"2026-05-18T01:08:41.255251+00:00"}