{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:VFR6WSADVTL4MTCQ2GN2SXFKPR","short_pith_number":"pith:VFR6WSAD","schema_version":"1.0","canonical_sha256":"a963eb4803acd7c64c50d19ba95caa7c6dd9a4d62a330bad64fd0150a56cdd0c","source":{"kind":"arxiv","id":"2509.09033","version":1},"attestation_state":"computed","paper":{"title":"Generative quantum advantage for classical and quantum problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"quant-ph","authors_text":"Hartmut Neven, Hsin-Yuan Huang, Jarrod R. McClean, Michael Broughton, Norhan Eassa, Ryan Babbush","submitted_at":"2025-09-10T22:06:28Z","abstract_excerpt":"Recent breakthroughs in generative machine learning, powered by massive computational resources, have demonstrated unprecedented human-like capabilities. While beyond-classical quantum experiments can generate samples from classically intractable distributions, their complexity has thwarted all efforts toward efficient learning. This challenge has hindered demonstrations of generative quantum advantage: the ability of quantum computers to learn and generate desired outputs substantially better than classical computers. We resolve this challenge by introducing families of generative quantum mod"},"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":"2509.09033","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-09-10T22:06:28Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"b6d3d978317123520f4752f9f0001e5b9fa3ca205eff55d007c49d4aa564f5c1","abstract_canon_sha256":"cef1b92baa464805be040be0cc6683c12e1913b4a56231ab373251a7bae06c72"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:09:28.045037Z","signature_b64":"mja78DJC5KTxv3YYxi7b0i6UVcFjPYXi1vCdqKQOmseC6Fsydc52NxuIDijA58T1TcHRfcMQgMAzS0hMD5SOAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a963eb4803acd7c64c50d19ba95caa7c6dd9a4d62a330bad64fd0150a56cdd0c","last_reissued_at":"2026-07-05T12:09:28.044360Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:09:28.044360Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generative quantum advantage for classical and quantum problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"quant-ph","authors_text":"Hartmut Neven, Hsin-Yuan Huang, Jarrod R. McClean, Michael Broughton, Norhan Eassa, Ryan Babbush","submitted_at":"2025-09-10T22:06:28Z","abstract_excerpt":"Recent breakthroughs in generative machine learning, powered by massive computational resources, have demonstrated unprecedented human-like capabilities. While beyond-classical quantum experiments can generate samples from classically intractable distributions, their complexity has thwarted all efforts toward efficient learning. This challenge has hindered demonstrations of generative quantum advantage: the ability of quantum computers to learn and generate desired outputs substantially better than classical computers. We resolve this challenge by introducing families of generative quantum mod"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.09033","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/2509.09033/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":"2509.09033","created_at":"2026-07-05T12:09:28.044451+00:00"},{"alias_kind":"arxiv_version","alias_value":"2509.09033v1","created_at":"2026-07-05T12:09:28.044451+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.09033","created_at":"2026-07-05T12:09:28.044451+00:00"},{"alias_kind":"pith_short_12","alias_value":"VFR6WSADVTL4","created_at":"2026-07-05T12:09:28.044451+00:00"},{"alias_kind":"pith_short_16","alias_value":"VFR6WSADVTL4MTCQ","created_at":"2026-07-05T12:09:28.044451+00:00"},{"alias_kind":"pith_short_8","alias_value":"VFR6WSAD","created_at":"2026-07-05T12:09:28.044451+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":11,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.28483","citing_title":"Quantum Fourier Generative Models Trainable at Large Scale","ref_index":12,"is_internal_anchor":false},{"citing_arxiv_id":"2605.21286","citing_title":"Software Between Quantum and Machine Learning -- And Down to Pulses","ref_index":7,"is_internal_anchor":false},{"citing_arxiv_id":"2606.29636","citing_title":"Lie Group Diffusion Models for Hardware-Aware Quantum Circuit Synthesis","ref_index":19,"is_internal_anchor":false},{"citing_arxiv_id":"2605.21286","citing_title":"Software Between Quantum and Machine Learning -- And Down to Pulses","ref_index":7,"is_internal_anchor":false},{"citing_arxiv_id":"2603.06440","citing_title":"Toward Generative Quantum Utility via Correlation-Complexity Map","ref_index":18,"is_internal_anchor":false},{"citing_arxiv_id":"2603.24654","citing_title":"Spectral methods: crucial for machine learning, natural for quantum computers?","ref_index":25,"is_internal_anchor":false},{"citing_arxiv_id":"2605.03629","citing_title":"Adversarial Effects on Expressibility and Trainability in Distributed Variational Quantum Algorithms","ref_index":21,"is_internal_anchor":false},{"citing_arxiv_id":"2604.11578","citing_title":"Minimizing classical resources in variational measurement-based quantum computation for generative modeling","ref_index":16,"is_internal_anchor":false},{"citing_arxiv_id":"2604.07639","citing_title":"Exponential quantum advantage in processing massive classical data","ref_index":28,"is_internal_anchor":false},{"citing_arxiv_id":"2605.06734","citing_title":"Gated QKAN-FWP: Scalable Quantum-inspired Sequence Learning","ref_index":43,"is_internal_anchor":false},{"citing_arxiv_id":"2604.15441","citing_title":"Quantum computation at the edge of chaos","ref_index":37,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VFR6WSADVTL4MTCQ2GN2SXFKPR","json":"https://pith.science/pith/VFR6WSADVTL4MTCQ2GN2SXFKPR.json","graph_json":"https://pith.science/api/pith-number/VFR6WSADVTL4MTCQ2GN2SXFKPR/graph.json","events_json":"https://pith.science/api/pith-number/VFR6WSADVTL4MTCQ2GN2SXFKPR/events.json","paper":"https://pith.science/paper/VFR6WSAD"},"agent_actions":{"view_html":"https://pith.science/pith/VFR6WSADVTL4MTCQ2GN2SXFKPR","download_json":"https://pith.science/pith/VFR6WSADVTL4MTCQ2GN2SXFKPR.json","view_paper":"https://pith.science/paper/VFR6WSAD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2509.09033&json=true","fetch_graph":"https://pith.science/api/pith-number/VFR6WSADVTL4MTCQ2GN2SXFKPR/graph.json","fetch_events":"https://pith.science/api/pith-number/VFR6WSADVTL4MTCQ2GN2SXFKPR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VFR6WSADVTL4MTCQ2GN2SXFKPR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VFR6WSADVTL4MTCQ2GN2SXFKPR/action/storage_attestation","attest_author":"https://pith.science/pith/VFR6WSADVTL4MTCQ2GN2SXFKPR/action/author_attestation","sign_citation":"https://pith.science/pith/VFR6WSADVTL4MTCQ2GN2SXFKPR/action/citation_signature","submit_replication":"https://pith.science/pith/VFR6WSADVTL4MTCQ2GN2SXFKPR/action/replication_record"}},"created_at":"2026-07-05T12:09:28.044451+00:00","updated_at":"2026-07-05T12:09:28.044451+00:00"}