{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:FF2QM7C2TUMPQV3TFMLLEYB3ZA","short_pith_number":"pith:FF2QM7C2","schema_version":"1.0","canonical_sha256":"2975067c5a9d18f857732b16b2603bc80b415d0b8bad00b2796bfecaf668aec5","source":{"kind":"arxiv","id":"2203.06174","version":1},"attestation_state":"computed","paper":{"title":"Quantifying the barren plateau phenomenon for a model of unstructured variational ans\\\"{a}tze","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"John Napp","submitted_at":"2022-03-11T18:58:12Z","abstract_excerpt":"Quantifying the flatness of the objective-function landscape associated with unstructured parameterized quantum circuits is important for understanding the performance of variational algorithms utilizing a \"hardware-efficient ansatz\", particularly for ensuring that a prohibitively flat landscape -- a so-called \"barren plateau\" -- is avoided. For a model of such ans\\\"{a}tze, we relate the typical landscape flatness to a certain family of random walks, enabling us to derive a Monte Carlo algorithm for efficiently, classically estimating the landscape flatness for any architecture. The statistica"},"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":"2203.06174","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2022-03-11T18:58:12Z","cross_cats_sorted":[],"title_canon_sha256":"336b3330b371c19ece9003099d80bb9db84d25719b80cb05a093b1be7755b98b","abstract_canon_sha256":"4e7676e27c0fd2b8203b1ddaf10a254166334b44f6276cd10f454aaa1f2c88e7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:04:13.395576Z","signature_b64":"DlU7u/xqXTMb0sAtyw5K5pdGLDxsuRsa2v6RqKvmU6lOouxbYXSFc4IjlTzPnG77fyQO2qEdZgUiig7SiaSyAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2975067c5a9d18f857732b16b2603bc80b415d0b8bad00b2796bfecaf668aec5","last_reissued_at":"2026-07-05T04:04:13.395151Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:04:13.395151Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantifying the barren plateau phenomenon for a model of unstructured variational ans\\\"{a}tze","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"John Napp","submitted_at":"2022-03-11T18:58:12Z","abstract_excerpt":"Quantifying the flatness of the objective-function landscape associated with unstructured parameterized quantum circuits is important for understanding the performance of variational algorithms utilizing a \"hardware-efficient ansatz\", particularly for ensuring that a prohibitively flat landscape -- a so-called \"barren plateau\" -- is avoided. For a model of such ans\\\"{a}tze, we relate the typical landscape flatness to a certain family of random walks, enabling us to derive a Monte Carlo algorithm for efficiently, classically estimating the landscape flatness for any architecture. The statistica"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.06174","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/2203.06174/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":"2203.06174","created_at":"2026-07-05T04:04:13.395207+00:00"},{"alias_kind":"arxiv_version","alias_value":"2203.06174v1","created_at":"2026-07-05T04:04:13.395207+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.06174","created_at":"2026-07-05T04:04:13.395207+00:00"},{"alias_kind":"pith_short_12","alias_value":"FF2QM7C2TUMP","created_at":"2026-07-05T04:04:13.395207+00:00"},{"alias_kind":"pith_short_16","alias_value":"FF2QM7C2TUMPQV3T","created_at":"2026-07-05T04:04:13.395207+00:00"},{"alias_kind":"pith_short_8","alias_value":"FF2QM7C2","created_at":"2026-07-05T04:04:13.395207+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2408.12739","citing_title":"Quantum Convolutional Neural Networks are Effectively Classically Simulable","ref_index":125,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FF2QM7C2TUMPQV3TFMLLEYB3ZA","json":"https://pith.science/pith/FF2QM7C2TUMPQV3TFMLLEYB3ZA.json","graph_json":"https://pith.science/api/pith-number/FF2QM7C2TUMPQV3TFMLLEYB3ZA/graph.json","events_json":"https://pith.science/api/pith-number/FF2QM7C2TUMPQV3TFMLLEYB3ZA/events.json","paper":"https://pith.science/paper/FF2QM7C2"},"agent_actions":{"view_html":"https://pith.science/pith/FF2QM7C2TUMPQV3TFMLLEYB3ZA","download_json":"https://pith.science/pith/FF2QM7C2TUMPQV3TFMLLEYB3ZA.json","view_paper":"https://pith.science/paper/FF2QM7C2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2203.06174&json=true","fetch_graph":"https://pith.science/api/pith-number/FF2QM7C2TUMPQV3TFMLLEYB3ZA/graph.json","fetch_events":"https://pith.science/api/pith-number/FF2QM7C2TUMPQV3TFMLLEYB3ZA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FF2QM7C2TUMPQV3TFMLLEYB3ZA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FF2QM7C2TUMPQV3TFMLLEYB3ZA/action/storage_attestation","attest_author":"https://pith.science/pith/FF2QM7C2TUMPQV3TFMLLEYB3ZA/action/author_attestation","sign_citation":"https://pith.science/pith/FF2QM7C2TUMPQV3TFMLLEYB3ZA/action/citation_signature","submit_replication":"https://pith.science/pith/FF2QM7C2TUMPQV3TFMLLEYB3ZA/action/replication_record"}},"created_at":"2026-07-05T04:04:13.395207+00:00","updated_at":"2026-07-05T04:04:13.395207+00:00"}