{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:DGDSN5ZPLS34L4BMMP7IEI5Q6B","short_pith_number":"pith:DGDSN5ZP","schema_version":"1.0","canonical_sha256":"198726f72f5cb7c5f02c63fe8223b0f04545e5289db2ae2a1612a3b30e2f43b2","source":{"kind":"arxiv","id":"2112.00811","version":2},"attestation_state":"computed","paper":{"title":"Revisiting dequantization and quantum advantage in learning tasks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IT","cs.LG","math.IT"],"primary_cat":"quant-ph","authors_text":"Hsin-Yuan Huang, Jarrod R. McClean, Jordan Cotler","submitted_at":"2021-12-01T20:05:56Z","abstract_excerpt":"It has been shown that the apparent advantage of some quantum machine learning algorithms may be efficiently replicated using classical algorithms with suitable data access -- a process known as dequantization. Existing works on dequantization compare quantum algorithms which take copies of an n-qubit quantum state $|x\\rangle = \\sum_{i} x_i |i\\rangle$ as input to classical algorithms which have sample and query (SQ) access to the vector $x$. In this note, we prove that classical algorithms with SQ access can accomplish some learning tasks exponentially faster than quantum algorithms with quant"},"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":"2112.00811","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2021-12-01T20:05:56Z","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"title_canon_sha256":"f90ee03b7a27765be64f7a29fc933832cdb8b88e3cc7b1dbc8ad74adde4d00ed","abstract_canon_sha256":"c2505b8c1c4f19176b16f358e68527f5ee4cecfb956d4c5e78b750536e09f2d1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:38:08.591209Z","signature_b64":"Gu2vX9clymg3qpnqc1NzNza48xZAZHksBjdxkDFLUVwdaT+iL+8jM5wyQnvwTIdufJ7EIF9pSL7HPgPBYXFqBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"198726f72f5cb7c5f02c63fe8223b0f04545e5289db2ae2a1612a3b30e2f43b2","last_reissued_at":"2026-07-05T03:38:08.590627Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:38:08.590627Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Revisiting dequantization and quantum advantage in learning tasks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IT","cs.LG","math.IT"],"primary_cat":"quant-ph","authors_text":"Hsin-Yuan Huang, Jarrod R. McClean, Jordan Cotler","submitted_at":"2021-12-01T20:05:56Z","abstract_excerpt":"It has been shown that the apparent advantage of some quantum machine learning algorithms may be efficiently replicated using classical algorithms with suitable data access -- a process known as dequantization. Existing works on dequantization compare quantum algorithms which take copies of an n-qubit quantum state $|x\\rangle = \\sum_{i} x_i |i\\rangle$ as input to classical algorithms which have sample and query (SQ) access to the vector $x$. In this note, we prove that classical algorithms with SQ access can accomplish some learning tasks exponentially faster than quantum algorithms with quant"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.00811","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/2112.00811/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":"2112.00811","created_at":"2026-07-05T03:38:08.590690+00:00"},{"alias_kind":"arxiv_version","alias_value":"2112.00811v2","created_at":"2026-07-05T03:38:08.590690+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.00811","created_at":"2026-07-05T03:38:08.590690+00:00"},{"alias_kind":"pith_short_12","alias_value":"DGDSN5ZPLS34","created_at":"2026-07-05T03:38:08.590690+00:00"},{"alias_kind":"pith_short_16","alias_value":"DGDSN5ZPLS34L4BM","created_at":"2026-07-05T03:38:08.590690+00:00"},{"alias_kind":"pith_short_8","alias_value":"DGDSN5ZP","created_at":"2026-07-05T03:38:08.590690+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":6,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2509.02795","citing_title":"Geodesics of Quantum Feature Maps on the Space of Quantum Operators","ref_index":22,"is_internal_anchor":false},{"citing_arxiv_id":"2509.25821","citing_title":"On the Complexity of the Succinct State Local Hamiltonian Problem","ref_index":55,"is_internal_anchor":false},{"citing_arxiv_id":"2509.25829","citing_title":"The Guided Local Hamiltonian Problem for Stoquastic Hamiltonians","ref_index":20,"is_internal_anchor":false},{"citing_arxiv_id":"2604.03346","citing_title":"Learning PDEs for Portfolio Optimization with Quantum Physics-Informed Neural Networks","ref_index":51,"is_internal_anchor":false},{"citing_arxiv_id":"2604.25631","citing_title":"Local tensor-train surrogates for quantum learning models","ref_index":30,"is_internal_anchor":false},{"citing_arxiv_id":"2604.19625","citing_title":"Coherent-State Propagation: A Computational Framework for Simulating Bosonic Quantum Systems","ref_index":136,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DGDSN5ZPLS34L4BMMP7IEI5Q6B","json":"https://pith.science/pith/DGDSN5ZPLS34L4BMMP7IEI5Q6B.json","graph_json":"https://pith.science/api/pith-number/DGDSN5ZPLS34L4BMMP7IEI5Q6B/graph.json","events_json":"https://pith.science/api/pith-number/DGDSN5ZPLS34L4BMMP7IEI5Q6B/events.json","paper":"https://pith.science/paper/DGDSN5ZP"},"agent_actions":{"view_html":"https://pith.science/pith/DGDSN5ZPLS34L4BMMP7IEI5Q6B","download_json":"https://pith.science/pith/DGDSN5ZPLS34L4BMMP7IEI5Q6B.json","view_paper":"https://pith.science/paper/DGDSN5ZP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2112.00811&json=true","fetch_graph":"https://pith.science/api/pith-number/DGDSN5ZPLS34L4BMMP7IEI5Q6B/graph.json","fetch_events":"https://pith.science/api/pith-number/DGDSN5ZPLS34L4BMMP7IEI5Q6B/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DGDSN5ZPLS34L4BMMP7IEI5Q6B/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DGDSN5ZPLS34L4BMMP7IEI5Q6B/action/storage_attestation","attest_author":"https://pith.science/pith/DGDSN5ZPLS34L4BMMP7IEI5Q6B/action/author_attestation","sign_citation":"https://pith.science/pith/DGDSN5ZPLS34L4BMMP7IEI5Q6B/action/citation_signature","submit_replication":"https://pith.science/pith/DGDSN5ZPLS34L4BMMP7IEI5Q6B/action/replication_record"}},"created_at":"2026-07-05T03:38:08.590690+00:00","updated_at":"2026-07-05T03:38:08.590690+00:00"}