{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:5YQZQ57KEBHVHSLDFTJHMK4H7O","short_pith_number":"pith:5YQZQ57K","schema_version":"1.0","canonical_sha256":"ee219877ea204f53c9632cd2762b87fb9778f395a020645dfc418de00b9d38c5","source":{"kind":"arxiv","id":"1701.01450","version":1},"attestation_state":"computed","paper":{"title":"Practical optimization for hybrid quantum-classical algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Gian Giacomo Guerreschi, Mikhail Smelyanskiy","submitted_at":"2017-01-05T19:04:19Z","abstract_excerpt":"A novel class of hybrid quantum-classical algorithms based on the variational approach have recently emerged from separate proposals addressing, for example, quantum chemistry and combinatorial problems. These algorithms provide an approximate solution to the problem at hand by encoding it in the state of a quantum computer. The operations used to prepare the state are not a priori fixed but, quite the opposite, are subjected to a classical optimization procedure that modifies the quantum gates and improves the quality of the approximate solution. While the quantum hardware determines the size"},"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":"1701.01450","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-01-05T19:04:19Z","cross_cats_sorted":[],"title_canon_sha256":"2f09f54e708fb6d87f7bd2514f2da479d32bfeec496df954458e245a6e7d358b","abstract_canon_sha256":"ab66e992476eaab6558a542cd6475ec09a3d158421faeac126113930f6d6d3bb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:16.788168Z","signature_b64":"vDdcGM8u4rAbvr1g+5rG8pd/gmCOm8vtO0BUNwD6u/Q8PXfbze/fxJ9Topw4FvmWLYPy/MQZK3j+gAhVKaqUBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ee219877ea204f53c9632cd2762b87fb9778f395a020645dfc418de00b9d38c5","last_reissued_at":"2026-05-18T00:53:16.787729Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:16.787729Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Practical optimization for hybrid quantum-classical algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Gian Giacomo Guerreschi, Mikhail Smelyanskiy","submitted_at":"2017-01-05T19:04:19Z","abstract_excerpt":"A novel class of hybrid quantum-classical algorithms based on the variational approach have recently emerged from separate proposals addressing, for example, quantum chemistry and combinatorial problems. These algorithms provide an approximate solution to the problem at hand by encoding it in the state of a quantum computer. The operations used to prepare the state are not a priori fixed but, quite the opposite, are subjected to a classical optimization procedure that modifies the quantum gates and improves the quality of the approximate solution. While the quantum hardware determines the size"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.01450","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":"1701.01450","created_at":"2026-05-18T00:53:16.787794+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.01450v1","created_at":"2026-05-18T00:53:16.787794+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.01450","created_at":"2026-05-18T00:53:16.787794+00:00"},{"alias_kind":"pith_short_12","alias_value":"5YQZQ57KEBHV","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_16","alias_value":"5YQZQ57KEBHVHSLD","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_8","alias_value":"5YQZQ57K","created_at":"2026-05-18T12:31:03.183658+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":3,"sample":[{"citing_arxiv_id":"1907.05415","citing_title":"Learning to learn with quantum neural networks via classical neural networks","ref_index":50,"is_internal_anchor":true},{"citing_arxiv_id":"1907.09631","citing_title":"Analysis of Quantum Approximate Optimization Algorithm under Realistic Noise in Superconducting Qubits","ref_index":9,"is_internal_anchor":true},{"citing_arxiv_id":"2510.14099","citing_title":"A review of quantum machine learning and quantum-inspired applied methods to computational fluid dynamics","ref_index":64,"is_internal_anchor":true},{"citing_arxiv_id":"1811.04968","citing_title":"PennyLane: Automatic differentiation of hybrid quantum-classical computations","ref_index":58,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5YQZQ57KEBHVHSLDFTJHMK4H7O","json":"https://pith.science/pith/5YQZQ57KEBHVHSLDFTJHMK4H7O.json","graph_json":"https://pith.science/api/pith-number/5YQZQ57KEBHVHSLDFTJHMK4H7O/graph.json","events_json":"https://pith.science/api/pith-number/5YQZQ57KEBHVHSLDFTJHMK4H7O/events.json","paper":"https://pith.science/paper/5YQZQ57K"},"agent_actions":{"view_html":"https://pith.science/pith/5YQZQ57KEBHVHSLDFTJHMK4H7O","download_json":"https://pith.science/pith/5YQZQ57KEBHVHSLDFTJHMK4H7O.json","view_paper":"https://pith.science/paper/5YQZQ57K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.01450&json=true","fetch_graph":"https://pith.science/api/pith-number/5YQZQ57KEBHVHSLDFTJHMK4H7O/graph.json","fetch_events":"https://pith.science/api/pith-number/5YQZQ57KEBHVHSLDFTJHMK4H7O/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5YQZQ57KEBHVHSLDFTJHMK4H7O/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5YQZQ57KEBHVHSLDFTJHMK4H7O/action/storage_attestation","attest_author":"https://pith.science/pith/5YQZQ57KEBHVHSLDFTJHMK4H7O/action/author_attestation","sign_citation":"https://pith.science/pith/5YQZQ57KEBHVHSLDFTJHMK4H7O/action/citation_signature","submit_replication":"https://pith.science/pith/5YQZQ57KEBHVHSLDFTJHMK4H7O/action/replication_record"}},"created_at":"2026-05-18T00:53:16.787794+00:00","updated_at":"2026-05-18T00:53:16.787794+00:00"}