{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:576HHFE5YWZIW6PMXPQWDQAGLY","short_pith_number":"pith:576HHFE5","schema_version":"1.0","canonical_sha256":"effc73949dc5b28b79ecbbe161c0065e115fecb4927878d5cfc5d4c39d355b31","source":{"kind":"arxiv","id":"2406.11805","version":2},"attestation_state":"computed","paper":{"title":"Predicting quantum learnability from landscape fluctuation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cond-mat.other","cond-mat.str-el"],"primary_cat":"quant-ph","authors_text":"Chenghong Zhu, Hao-Kai Zhang, Xin Wang","submitted_at":"2024-06-17T17:50:47Z","abstract_excerpt":"The conflict between trainability and expressibility is a key challenge in variational quantum computing and quantum machine learning. Resolving this conflict necessitates designing specific quantum neural networks (QNN) tailored for specific problems, which urgently needs a general and efficient method to predict the learnability of QNNs without costly training. In this work, we demonstrate a simple and efficient metric for learnability by comparing the fluctuations of the given training landscape with standard learnable landscapes. This metric shows surprising effectiveness in predicting lea"},"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":"2406.11805","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-06-17T17:50:47Z","cross_cats_sorted":["cond-mat.other","cond-mat.str-el"],"title_canon_sha256":"344df2559abe9f928c9d7a6d6677566e3d0e97c0e3fcddd901d4c6056f1ee44f","abstract_canon_sha256":"9c688fde49eda325dcdb4834057eca097293356a0d7b1cd69acf99889101a6ed"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:35:10.639381Z","signature_b64":"7UfEsFyJcoqOcBTL1inPEbu9tWgomhtKrfcGj4qmSHrjpGExhwQP2e+RwkR+XiWkckP1ZIdpn+09m1ZncmtEAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"effc73949dc5b28b79ecbbe161c0065e115fecb4927878d5cfc5d4c39d355b31","last_reissued_at":"2026-07-05T09:35:10.638925Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:35:10.638925Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Predicting quantum learnability from landscape fluctuation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cond-mat.other","cond-mat.str-el"],"primary_cat":"quant-ph","authors_text":"Chenghong Zhu, Hao-Kai Zhang, Xin Wang","submitted_at":"2024-06-17T17:50:47Z","abstract_excerpt":"The conflict between trainability and expressibility is a key challenge in variational quantum computing and quantum machine learning. Resolving this conflict necessitates designing specific quantum neural networks (QNN) tailored for specific problems, which urgently needs a general and efficient method to predict the learnability of QNNs without costly training. In this work, we demonstrate a simple and efficient metric for learnability by comparing the fluctuations of the given training landscape with standard learnable landscapes. This metric shows surprising effectiveness in predicting lea"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.11805","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2406.11805/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2406.11805","created_at":"2026-07-05T09:35:10.638976+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.11805v2","created_at":"2026-07-05T09:35:10.638976+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.11805","created_at":"2026-07-05T09:35:10.638976+00:00"},{"alias_kind":"pith_short_12","alias_value":"576HHFE5YWZI","created_at":"2026-07-05T09:35:10.638976+00:00"},{"alias_kind":"pith_short_16","alias_value":"576HHFE5YWZIW6PM","created_at":"2026-07-05T09:35:10.638976+00:00"},{"alias_kind":"pith_short_8","alias_value":"576HHFE5","created_at":"2026-07-05T09:35:10.638976+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.09988","citing_title":"Absence of poor local minima in matrix product states","ref_index":22,"is_internal_anchor":false},{"citing_arxiv_id":"2606.09988","citing_title":"Absence of poor local minima in matrix product states","ref_index":25,"is_internal_anchor":false},{"citing_arxiv_id":"2507.18844","citing_title":"Exploring Entanglement and Parameter Sensitivity in QAOA through Quantum Fisher Information","ref_index":26,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/576HHFE5YWZIW6PMXPQWDQAGLY","json":"https://pith.science/pith/576HHFE5YWZIW6PMXPQWDQAGLY.json","graph_json":"https://pith.science/api/pith-number/576HHFE5YWZIW6PMXPQWDQAGLY/graph.json","events_json":"https://pith.science/api/pith-number/576HHFE5YWZIW6PMXPQWDQAGLY/events.json","paper":"https://pith.science/paper/576HHFE5"},"agent_actions":{"view_html":"https://pith.science/pith/576HHFE5YWZIW6PMXPQWDQAGLY","download_json":"https://pith.science/pith/576HHFE5YWZIW6PMXPQWDQAGLY.json","view_paper":"https://pith.science/paper/576HHFE5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.11805&json=true","fetch_graph":"https://pith.science/api/pith-number/576HHFE5YWZIW6PMXPQWDQAGLY/graph.json","fetch_events":"https://pith.science/api/pith-number/576HHFE5YWZIW6PMXPQWDQAGLY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/576HHFE5YWZIW6PMXPQWDQAGLY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/576HHFE5YWZIW6PMXPQWDQAGLY/action/storage_attestation","attest_author":"https://pith.science/pith/576HHFE5YWZIW6PMXPQWDQAGLY/action/author_attestation","sign_citation":"https://pith.science/pith/576HHFE5YWZIW6PMXPQWDQAGLY/action/citation_signature","submit_replication":"https://pith.science/pith/576HHFE5YWZIW6PMXPQWDQAGLY/action/replication_record"}},"created_at":"2026-07-05T09:35:10.638976+00:00","updated_at":"2026-07-05T09:35:10.638976+00:00"}