{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:RLA7G7QBMF4Z3TCW7M2EMAZ4HB","short_pith_number":"pith:RLA7G7QB","schema_version":"1.0","canonical_sha256":"8ac1f37e0161799dcc56fb3446033c38543cb22b873ed920379e782280665e00","source":{"kind":"arxiv","id":"2006.14904","version":1},"attestation_state":"computed","paper":{"title":"Layerwise learning for quantum neural networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"quant-ph","authors_text":"Andrea Skolik, Jarrod R. McClean, Martin Leib, Masoud Mohseni, Patrick van der Smagt","submitted_at":"2020-06-26T10:44:46Z","abstract_excerpt":"With the increased focus on quantum circuit learning for near-term applications on quantum devices, in conjunction with unique challenges presented by cost function landscapes of parametrized quantum circuits, strategies for effective training are becoming increasingly important. In order to ameliorate some of these challenges, we investigate a layerwise learning strategy for parametrized quantum circuits. The circuit depth is incrementally grown during optimization, and only subsets of parameters are updated in each training step. We show that when considering sampling noise, this strategy ca"},"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":"2006.14904","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2020-06-26T10:44:46Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"c3af40126bc07a69f836b53f9ba2bede48c04b5cc48b22c6e1beae024038c946","abstract_canon_sha256":"7d163a475c4bef464d3dc51c1d07ba90faea5e48d831a28eb5103daa219c146d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:12:44.980868Z","signature_b64":"DwnrjbpuwYKgTH9S406bYzmdAtRcM5q5h6LPbi8mJsq9L3roD49U+oW8Z0pajjt3oP/bXx4SPHExKa1o9gYlBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8ac1f37e0161799dcc56fb3446033c38543cb22b873ed920379e782280665e00","last_reissued_at":"2026-07-05T03:12:44.980312Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:12:44.980312Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Layerwise learning for quantum neural networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"quant-ph","authors_text":"Andrea Skolik, Jarrod R. McClean, Martin Leib, Masoud Mohseni, Patrick van der Smagt","submitted_at":"2020-06-26T10:44:46Z","abstract_excerpt":"With the increased focus on quantum circuit learning for near-term applications on quantum devices, in conjunction with unique challenges presented by cost function landscapes of parametrized quantum circuits, strategies for effective training are becoming increasingly important. In order to ameliorate some of these challenges, we investigate a layerwise learning strategy for parametrized quantum circuits. The circuit depth is incrementally grown during optimization, and only subsets of parameters are updated in each training step. We show that when considering sampling noise, this strategy ca"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.14904","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2006.14904/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":"2006.14904","created_at":"2026-07-05T03:12:44.980378+00:00"},{"alias_kind":"arxiv_version","alias_value":"2006.14904v1","created_at":"2026-07-05T03:12:44.980378+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.14904","created_at":"2026-07-05T03:12:44.980378+00:00"},{"alias_kind":"pith_short_12","alias_value":"RLA7G7QBMF4Z","created_at":"2026-07-05T03:12:44.980378+00:00"},{"alias_kind":"pith_short_16","alias_value":"RLA7G7QBMF4Z3TCW","created_at":"2026-07-05T03:12:44.980378+00:00"},{"alias_kind":"pith_short_8","alias_value":"RLA7G7QB","created_at":"2026-07-05T03:12:44.980378+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.26312","citing_title":"Tailor Made Embeddings for Quantum Machine Learning","ref_index":46,"is_internal_anchor":false},{"citing_arxiv_id":"2507.01246","citing_title":"Quantum Machine Learning for State Tomography Using Classical Data","ref_index":111,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RLA7G7QBMF4Z3TCW7M2EMAZ4HB","json":"https://pith.science/pith/RLA7G7QBMF4Z3TCW7M2EMAZ4HB.json","graph_json":"https://pith.science/api/pith-number/RLA7G7QBMF4Z3TCW7M2EMAZ4HB/graph.json","events_json":"https://pith.science/api/pith-number/RLA7G7QBMF4Z3TCW7M2EMAZ4HB/events.json","paper":"https://pith.science/paper/RLA7G7QB"},"agent_actions":{"view_html":"https://pith.science/pith/RLA7G7QBMF4Z3TCW7M2EMAZ4HB","download_json":"https://pith.science/pith/RLA7G7QBMF4Z3TCW7M2EMAZ4HB.json","view_paper":"https://pith.science/paper/RLA7G7QB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2006.14904&json=true","fetch_graph":"https://pith.science/api/pith-number/RLA7G7QBMF4Z3TCW7M2EMAZ4HB/graph.json","fetch_events":"https://pith.science/api/pith-number/RLA7G7QBMF4Z3TCW7M2EMAZ4HB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RLA7G7QBMF4Z3TCW7M2EMAZ4HB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RLA7G7QBMF4Z3TCW7M2EMAZ4HB/action/storage_attestation","attest_author":"https://pith.science/pith/RLA7G7QBMF4Z3TCW7M2EMAZ4HB/action/author_attestation","sign_citation":"https://pith.science/pith/RLA7G7QBMF4Z3TCW7M2EMAZ4HB/action/citation_signature","submit_replication":"https://pith.science/pith/RLA7G7QBMF4Z3TCW7M2EMAZ4HB/action/replication_record"}},"created_at":"2026-07-05T03:12:44.980378+00:00","updated_at":"2026-07-05T03:12:44.980378+00:00"}