{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:5GXUKWOQOFKGSY4HBHA2CV6LTI","short_pith_number":"pith:5GXUKWOQ","schema_version":"1.0","canonical_sha256":"e9af4559d0715469638709c1a157cb9a357fef9576c2d0f3867e694935b8c87a","source":{"kind":"arxiv","id":"2411.19896","version":1},"attestation_state":"computed","paper":{"title":"Efficient quantum-enhanced classical simulation for patches of quantum landscapes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"quant-ph","authors_text":"Armando Angrisani, Manuel S. Rudolph, M. Cerezo, Ricard Puig, Sacha Lerch, Supanut Thanasilp, Tyson Jones, Zo\\\"e Holmes","submitted_at":"2024-11-29T18:00:07Z","abstract_excerpt":"Understanding the capabilities of classical simulation methods is key to identifying where quantum computers are advantageous. Not only does this ensure that quantum computers are used only where necessary, but also one can potentially identify subroutines that can be offloaded onto a classical device. In this work, we show that it is always possible to generate a classical surrogate of a sub-region (dubbed a \"patch\") of an expectation landscape produced by a parameterized quantum circuit. That is, we provide a quantum-enhanced classical algorithm which, after simple measurements on a quantum "},"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":"2411.19896","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-11-29T18:00:07Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"71d63fa022f6b3d6bf7bce2c9223bdc4daa05fbaf64aae683ce115a1768d7307","abstract_canon_sha256":"7aebe2cdb5f0f08b89906633a62f7c165047adc01a7efcd97b1388a6ee000aef"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:42:09.948903Z","signature_b64":"bKqSpvjnpZSALHz2fVW+IZNDsUt8UXa4B3srFGfSlKhHxztPqKLPmnm2ssVGreG56RBvISr8CYycdZ7qYmK/Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e9af4559d0715469638709c1a157cb9a357fef9576c2d0f3867e694935b8c87a","last_reissued_at":"2026-07-05T09:42:09.948298Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:42:09.948298Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient quantum-enhanced classical simulation for patches of quantum landscapes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"quant-ph","authors_text":"Armando Angrisani, Manuel S. Rudolph, M. Cerezo, Ricard Puig, Sacha Lerch, Supanut Thanasilp, Tyson Jones, Zo\\\"e Holmes","submitted_at":"2024-11-29T18:00:07Z","abstract_excerpt":"Understanding the capabilities of classical simulation methods is key to identifying where quantum computers are advantageous. Not only does this ensure that quantum computers are used only where necessary, but also one can potentially identify subroutines that can be offloaded onto a classical device. In this work, we show that it is always possible to generate a classical surrogate of a sub-region (dubbed a \"patch\") of an expectation landscape produced by a parameterized quantum circuit. That is, we provide a quantum-enhanced classical algorithm which, after simple measurements on a quantum "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.19896","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/2411.19896/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":"2411.19896","created_at":"2026-07-05T09:42:09.948423+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.19896v1","created_at":"2026-07-05T09:42:09.948423+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.19896","created_at":"2026-07-05T09:42:09.948423+00:00"},{"alias_kind":"pith_short_12","alias_value":"5GXUKWOQOFKG","created_at":"2026-07-05T09:42:09.948423+00:00"},{"alias_kind":"pith_short_16","alias_value":"5GXUKWOQOFKGSY4H","created_at":"2026-07-05T09:42:09.948423+00:00"},{"alias_kind":"pith_short_8","alias_value":"5GXUKWOQ","created_at":"2026-07-05T09:42:09.948423+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":8,"internal_anchor_count":8,"sample":[{"citing_arxiv_id":"2606.20153","citing_title":"Optimizing resource allocation for accuracy in noisy variational quantum algorithms","ref_index":47,"is_internal_anchor":true},{"citing_arxiv_id":"2606.18515","citing_title":"Exponentially many initializations to avoid barren plateaus","ref_index":48,"is_internal_anchor":true},{"citing_arxiv_id":"2602.10049","citing_title":"Random Quantum Circuits as Seeds for Continuous Generative Models","ref_index":33,"is_internal_anchor":true},{"citing_arxiv_id":"2506.19461","citing_title":"Iterative Quantum Feature Maps","ref_index":17,"is_internal_anchor":true},{"citing_arxiv_id":"2510.02430","citing_title":"Mitigating the barren plateau problem in linear optics","ref_index":35,"is_internal_anchor":true},{"citing_arxiv_id":"2604.25631","citing_title":"Local tensor-train surrogates for quantum learning models","ref_index":44,"is_internal_anchor":true},{"citing_arxiv_id":"2604.19625","citing_title":"Coherent-State Propagation: A Computational Framework for Simulating Bosonic Quantum Systems","ref_index":274,"is_internal_anchor":true},{"citing_arxiv_id":"2604.20180","citing_title":"Tensor network surrogate models for variational quantum computation","ref_index":52,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5GXUKWOQOFKGSY4HBHA2CV6LTI","json":"https://pith.science/pith/5GXUKWOQOFKGSY4HBHA2CV6LTI.json","graph_json":"https://pith.science/api/pith-number/5GXUKWOQOFKGSY4HBHA2CV6LTI/graph.json","events_json":"https://pith.science/api/pith-number/5GXUKWOQOFKGSY4HBHA2CV6LTI/events.json","paper":"https://pith.science/paper/5GXUKWOQ"},"agent_actions":{"view_html":"https://pith.science/pith/5GXUKWOQOFKGSY4HBHA2CV6LTI","download_json":"https://pith.science/pith/5GXUKWOQOFKGSY4HBHA2CV6LTI.json","view_paper":"https://pith.science/paper/5GXUKWOQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.19896&json=true","fetch_graph":"https://pith.science/api/pith-number/5GXUKWOQOFKGSY4HBHA2CV6LTI/graph.json","fetch_events":"https://pith.science/api/pith-number/5GXUKWOQOFKGSY4HBHA2CV6LTI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5GXUKWOQOFKGSY4HBHA2CV6LTI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5GXUKWOQOFKGSY4HBHA2CV6LTI/action/storage_attestation","attest_author":"https://pith.science/pith/5GXUKWOQOFKGSY4HBHA2CV6LTI/action/author_attestation","sign_citation":"https://pith.science/pith/5GXUKWOQOFKGSY4HBHA2CV6LTI/action/citation_signature","submit_replication":"https://pith.science/pith/5GXUKWOQOFKGSY4HBHA2CV6LTI/action/replication_record"}},"created_at":"2026-07-05T09:42:09.948423+00:00","updated_at":"2026-07-05T09:42:09.948423+00:00"}