{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:IDJHNKMU7AJOB6SOZ246CEWSTX","short_pith_number":"pith:IDJHNKMU","schema_version":"1.0","canonical_sha256":"40d276a994f812e0fa4eceb9e112d29dca77538820a0e5192cda4ee8ad0785f5","source":{"kind":"arxiv","id":"2405.00781","version":2},"attestation_state":"computed","paper":{"title":"Barren Plateaus in Variational Quantum Computing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"quant-ph","authors_text":"Jacob Biamonte, Jarrod R. McClean, Kunal Sharma, Lukasz Cincio, Martin Larocca, M. Cerezo, Patrick J. Coles, Samson Wang, Supanut Thanasilp, Zo\\\"e Holmes","submitted_at":"2024-05-01T18:00:10Z","abstract_excerpt":"Variational quantum computing offers a flexible computational paradigm with applications in diverse areas. However, a key obstacle to realizing their potential is the Barren Plateau (BP) phenomenon. When a model exhibits a BP, its parameter optimization landscape becomes exponentially flat and featureless as the problem size increases. Importantly, all the moving pieces of an algorithm -- choices of ansatz, initial state, observable, loss function and hardware noise -- can lead to BPs when ill-suited. Due to the significant impact of BPs on trainability, researchers have dedicated considerable"},"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":"2405.00781","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-05-01T18:00:10Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"a47fd6b21b8025d5bf8b635f278e288b2fbeab244eb17f22ed33f45f86fb0765","abstract_canon_sha256":"58a6b8087b97d18f5e2f6df0aeea49b5b6fedf814b23326e612d72b995faec82"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:59:58.079051Z","signature_b64":"LjzFpTJveC0qn1CapWz8OsIBX9UtNQzjsjtpFIfZuey6RW/qcwbb/LAp5gSxk7ZAeIxBBASo81u42Cn9K3XnAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"40d276a994f812e0fa4eceb9e112d29dca77538820a0e5192cda4ee8ad0785f5","last_reissued_at":"2026-07-05T10:59:58.078548Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:59:58.078548Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Barren Plateaus in Variational Quantum Computing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"quant-ph","authors_text":"Jacob Biamonte, Jarrod R. McClean, Kunal Sharma, Lukasz Cincio, Martin Larocca, M. Cerezo, Patrick J. Coles, Samson Wang, Supanut Thanasilp, Zo\\\"e Holmes","submitted_at":"2024-05-01T18:00:10Z","abstract_excerpt":"Variational quantum computing offers a flexible computational paradigm with applications in diverse areas. However, a key obstacle to realizing their potential is the Barren Plateau (BP) phenomenon. When a model exhibits a BP, its parameter optimization landscape becomes exponentially flat and featureless as the problem size increases. Importantly, all the moving pieces of an algorithm -- choices of ansatz, initial state, observable, loss function and hardware noise -- can lead to BPs when ill-suited. Due to the significant impact of BPs on trainability, researchers have dedicated considerable"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.00781","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/2405.00781/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":"2405.00781","created_at":"2026-07-05T10:59:58.078608+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.00781v2","created_at":"2026-07-05T10:59:58.078608+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.00781","created_at":"2026-07-05T10:59:58.078608+00:00"},{"alias_kind":"pith_short_12","alias_value":"IDJHNKMU7AJO","created_at":"2026-07-05T10:59:58.078608+00:00"},{"alias_kind":"pith_short_16","alias_value":"IDJHNKMU7AJOB6SO","created_at":"2026-07-05T10:59:58.078608+00:00"},{"alias_kind":"pith_short_8","alias_value":"IDJHNKMU","created_at":"2026-07-05T10:59:58.078608+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":24,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.21721","citing_title":"On a Central Limit Theorem and Sanov's principle for quantum neural networks","ref_index":15,"is_internal_anchor":false},{"citing_arxiv_id":"2606.18422","citing_title":"Gatekeepers and Hallucinations: A Layered Evaluation Framework for LLM-Driven Quantum Circuit Generation","ref_index":7,"is_internal_anchor":false},{"citing_arxiv_id":"2606.18339","citing_title":"Ground state preparation of random all-to-all Hamiltonians using ADAPT-VQE","ref_index":65,"is_internal_anchor":false},{"citing_arxiv_id":"2607.01329","citing_title":"Ravines in quantum cost landscapes: opportunities for improved VQA predictions","ref_index":77,"is_internal_anchor":false},{"citing_arxiv_id":"2606.05297","citing_title":"Continuous-variable ADAPT-VQE for bosonic lattice models","ref_index":64,"is_internal_anchor":false},{"citing_arxiv_id":"2606.01426","citing_title":"Efficient and Expressive Boundary Conditions in Quantum Lattice Boltzmann Methods","ref_index":100,"is_internal_anchor":false},{"citing_arxiv_id":"2605.28599","citing_title":"Thermodynamic-limit dispersion relations on trapped-ion quantum hardware","ref_index":35,"is_internal_anchor":false},{"citing_arxiv_id":"2605.28927","citing_title":"Quantum encodings that preserve persistent homology","ref_index":67,"is_internal_anchor":false},{"citing_arxiv_id":"2306.02620","citing_title":"Feasibility of performing quantum chemistry calculations on quantum computers","ref_index":30,"is_internal_anchor":false},{"citing_arxiv_id":"2408.12739","citing_title":"Quantum Convolutional Neural Networks are Effectively Classically Simulable","ref_index":18,"is_internal_anchor":false},{"citing_arxiv_id":"2409.15645","citing_title":"Quantum Machine Learning in Drug Discovery: Applications in Academia and Pharmaceutical Industries","ref_index":20,"is_internal_anchor":false},{"citing_arxiv_id":"2410.01252","citing_title":"Resource-efficient equivariant quantum convolutional neural networks","ref_index":35,"is_internal_anchor":false},{"citing_arxiv_id":"2410.04435","citing_title":"QKAN: quantum Kolmogorov-Arnold networks with applications in machine learning and multivariate state preparation","ref_index":47,"is_internal_anchor":false},{"citing_arxiv_id":"2501.04679","citing_title":"Exploring nontrivial topology at quantum criticality in a superconducting processor","ref_index":29,"is_internal_anchor":false},{"citing_arxiv_id":"2510.19928","citing_title":"Mind the gaps: The fraught road to quantum advantage","ref_index":120,"is_internal_anchor":false},{"citing_arxiv_id":"2602.10049","citing_title":"Random Quantum Circuits as Seeds for Continuous Generative Models","ref_index":9,"is_internal_anchor":false},{"citing_arxiv_id":"2506.20587","citing_title":"How to use quantum computers for biomolecular free energies","ref_index":44,"is_internal_anchor":false},{"citing_arxiv_id":"2509.07573","citing_title":"On the Complexity of Quantum States and Circuits from the Orthogonal and Symplectic Groups","ref_index":11,"is_internal_anchor":false},{"citing_arxiv_id":"2510.02430","citing_title":"Mitigating the barren plateau problem in linear optics","ref_index":17,"is_internal_anchor":false},{"citing_arxiv_id":"2510.19928","citing_title":"Mind the gaps: The fraught road to quantum advantage","ref_index":120,"is_internal_anchor":false},{"citing_arxiv_id":"2601.02233","citing_title":"PauliEngine: High-Performant Symbolic Arithmetic for Quantum Operations","ref_index":14,"is_internal_anchor":false},{"citing_arxiv_id":"2602.18377","citing_title":"Theory and interpretability of Quantum Extreme Learning Machines: a Pauli-transfer matrix approach","ref_index":29,"is_internal_anchor":false},{"citing_arxiv_id":"2604.18846","citing_title":"Trainability Beyond Linearity in Variational Quantum Objectives","ref_index":11,"is_internal_anchor":false},{"citing_arxiv_id":"2604.09957","citing_title":"Mitigating Barren Plateaus in Variational Quantum Circuits through PDE-Constrained Loss Functions","ref_index":41,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IDJHNKMU7AJOB6SOZ246CEWSTX","json":"https://pith.science/pith/IDJHNKMU7AJOB6SOZ246CEWSTX.json","graph_json":"https://pith.science/api/pith-number/IDJHNKMU7AJOB6SOZ246CEWSTX/graph.json","events_json":"https://pith.science/api/pith-number/IDJHNKMU7AJOB6SOZ246CEWSTX/events.json","paper":"https://pith.science/paper/IDJHNKMU"},"agent_actions":{"view_html":"https://pith.science/pith/IDJHNKMU7AJOB6SOZ246CEWSTX","download_json":"https://pith.science/pith/IDJHNKMU7AJOB6SOZ246CEWSTX.json","view_paper":"https://pith.science/paper/IDJHNKMU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.00781&json=true","fetch_graph":"https://pith.science/api/pith-number/IDJHNKMU7AJOB6SOZ246CEWSTX/graph.json","fetch_events":"https://pith.science/api/pith-number/IDJHNKMU7AJOB6SOZ246CEWSTX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IDJHNKMU7AJOB6SOZ246CEWSTX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IDJHNKMU7AJOB6SOZ246CEWSTX/action/storage_attestation","attest_author":"https://pith.science/pith/IDJHNKMU7AJOB6SOZ246CEWSTX/action/author_attestation","sign_citation":"https://pith.science/pith/IDJHNKMU7AJOB6SOZ246CEWSTX/action/citation_signature","submit_replication":"https://pith.science/pith/IDJHNKMU7AJOB6SOZ246CEWSTX/action/replication_record"}},"created_at":"2026-07-05T10:59:58.078608+00:00","updated_at":"2026-07-05T10:59:58.078608+00:00"}