{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:74W7H2KT7JD24ICQCQZNJBN7KS","short_pith_number":"pith:74W7H2KT","schema_version":"1.0","canonical_sha256":"ff2df3e953fa47ae20501432d485bf549b80bddf69b1ab076d7bc5d1d5d3e128","source":{"kind":"arxiv","id":"1907.05415","version":1},"attestation_state":"computed","paper":{"title":"Learning to learn with quantum neural networks via classical neural networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"quant-ph","authors_text":"Guillaume Verdon, Hartmut Neven, Jarrod R. McClean, Kevin J. Sung, Masoud Mohseni, Michael Broughton, Ryan Babbush, Zhang Jiang","submitted_at":"2019-07-11T17:57:56Z","abstract_excerpt":"Quantum Neural Networks (QNNs) are a promising variational learning paradigm with applications to near-term quantum processors, however they still face some significant challenges. One such challenge is finding good parameter initialization heuristics that ensure rapid and consistent convergence to local minima of the parameterized quantum circuit landscape. In this work, we train classical neural networks to assist in the quantum learning process, also know as meta-learning, to rapidly find approximate optima in the parameter landscape for several classes of quantum variational algorithms. Sp"},"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":"1907.05415","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-07-11T17:57:56Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"5d238276608531b2edb4aae293b6b7806647789045e29ddc43191011d47a8016","abstract_canon_sha256":"2328d1fa6bcad6b9cb1be205bc7ab622f6936cd7df7754854912d9d1dc271f15"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:50.293328Z","signature_b64":"K6RBziDUg0zDQ9Ww85xlrDiR1NKF6sZORN9VtuvFABVA7DOQzDNZ13gciLIbVws4Njuotemaoq+LqMuenS9UDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ff2df3e953fa47ae20501432d485bf549b80bddf69b1ab076d7bc5d1d5d3e128","last_reissued_at":"2026-05-17T23:40:50.292701Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:50.292701Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning to learn with quantum neural networks via classical neural networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"quant-ph","authors_text":"Guillaume Verdon, Hartmut Neven, Jarrod R. McClean, Kevin J. Sung, Masoud Mohseni, Michael Broughton, Ryan Babbush, Zhang Jiang","submitted_at":"2019-07-11T17:57:56Z","abstract_excerpt":"Quantum Neural Networks (QNNs) are a promising variational learning paradigm with applications to near-term quantum processors, however they still face some significant challenges. One such challenge is finding good parameter initialization heuristics that ensure rapid and consistent convergence to local minima of the parameterized quantum circuit landscape. In this work, we train classical neural networks to assist in the quantum learning process, also know as meta-learning, to rapidly find approximate optima in the parameter landscape for several classes of quantum variational algorithms. Sp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.05415","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":"1907.05415","created_at":"2026-05-17T23:40:50.292786+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.05415v1","created_at":"2026-05-17T23:40:50.292786+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.05415","created_at":"2026-05-17T23:40:50.292786+00:00"},{"alias_kind":"pith_short_12","alias_value":"74W7H2KT7JD2","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_16","alias_value":"74W7H2KT7JD24ICQ","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_8","alias_value":"74W7H2KT","created_at":"2026-05-18T12:33:12.712433+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.25275","citing_title":"Graph-Conditioned Meta-Optimizer for QAOA Parameter Generation on Multiple Problem Classes","ref_index":20,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/74W7H2KT7JD24ICQCQZNJBN7KS","json":"https://pith.science/pith/74W7H2KT7JD24ICQCQZNJBN7KS.json","graph_json":"https://pith.science/api/pith-number/74W7H2KT7JD24ICQCQZNJBN7KS/graph.json","events_json":"https://pith.science/api/pith-number/74W7H2KT7JD24ICQCQZNJBN7KS/events.json","paper":"https://pith.science/paper/74W7H2KT"},"agent_actions":{"view_html":"https://pith.science/pith/74W7H2KT7JD24ICQCQZNJBN7KS","download_json":"https://pith.science/pith/74W7H2KT7JD24ICQCQZNJBN7KS.json","view_paper":"https://pith.science/paper/74W7H2KT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.05415&json=true","fetch_graph":"https://pith.science/api/pith-number/74W7H2KT7JD24ICQCQZNJBN7KS/graph.json","fetch_events":"https://pith.science/api/pith-number/74W7H2KT7JD24ICQCQZNJBN7KS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/74W7H2KT7JD24ICQCQZNJBN7KS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/74W7H2KT7JD24ICQCQZNJBN7KS/action/storage_attestation","attest_author":"https://pith.science/pith/74W7H2KT7JD24ICQCQZNJBN7KS/action/author_attestation","sign_citation":"https://pith.science/pith/74W7H2KT7JD24ICQCQZNJBN7KS/action/citation_signature","submit_replication":"https://pith.science/pith/74W7H2KT7JD24ICQCQZNJBN7KS/action/replication_record"}},"created_at":"2026-05-17T23:40:50.292786+00:00","updated_at":"2026-05-17T23:40:50.292786+00:00"}