{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:Q6DSSRH3NS52HLPYAUTODAQNHM","short_pith_number":"pith:Q6DSSRH3","schema_version":"1.0","canonical_sha256":"87872944fb6cbba3adf80526e1820d3b082fa418eb66065ceb98cfa9cdd17be9","source":{"kind":"arxiv","id":"2505.22502","version":2},"attestation_state":"computed","paper":{"title":"Assessing Quantum Advantage for Gaussian Process Regression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"quant-ph","authors_text":"Dominic Lowe, M.S. Kim, Roberto Bondesan","submitted_at":"2025-05-28T15:50:56Z","abstract_excerpt":"Gaussian Process Regression is a well-known machine learning technique for which several quantum algorithms have been proposed. We show here that in a wide range of scenarios these algorithms show no exponential speedup. We achieve this by rigorously proving that the condition number of a kernel matrix scales at least linearly with the matrix size under general assumptions on the data and kernel. We additionally prove that the sparsity and Frobenius norm of a kernel matrix scale linearly under similar assumptions. The implications for the quantum algorithms runtime are independent of the compl"},"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":"2505.22502","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-05-28T15:50:56Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"e303fc02289d056bea78dd18f974b99e9888d7f76d458f1abafefecfc2481cad","abstract_canon_sha256":"c33ad9f558165ddf403d28d2c73382490bef97ac6b50960313732c06ee6aa84e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:31:28.191354Z","signature_b64":"BGTiC+z/ZmIOrMXnzhmG+qfCuTB+gXv62cRHGG0huOl9IWBnq0+5FK480sVQqyDLJavbENhF+8Xv/fDkkTbnCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"87872944fb6cbba3adf80526e1820d3b082fa418eb66065ceb98cfa9cdd17be9","last_reissued_at":"2026-07-05T11:31:28.190848Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:31:28.190848Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Assessing Quantum Advantage for Gaussian Process Regression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"quant-ph","authors_text":"Dominic Lowe, M.S. Kim, Roberto Bondesan","submitted_at":"2025-05-28T15:50:56Z","abstract_excerpt":"Gaussian Process Regression is a well-known machine learning technique for which several quantum algorithms have been proposed. We show here that in a wide range of scenarios these algorithms show no exponential speedup. We achieve this by rigorously proving that the condition number of a kernel matrix scales at least linearly with the matrix size under general assumptions on the data and kernel. We additionally prove that the sparsity and Frobenius norm of a kernel matrix scale linearly under similar assumptions. The implications for the quantum algorithms runtime are independent of the compl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.22502","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/2505.22502/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":"2505.22502","created_at":"2026-07-05T11:31:28.190909+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.22502v2","created_at":"2026-07-05T11:31:28.190909+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.22502","created_at":"2026-07-05T11:31:28.190909+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q6DSSRH3NS52","created_at":"2026-07-05T11:31:28.190909+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q6DSSRH3NS52HLPY","created_at":"2026-07-05T11:31:28.190909+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q6DSSRH3","created_at":"2026-07-05T11:31:28.190909+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.11994","citing_title":"Spectral Estimation with Free Decompression","ref_index":42,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Q6DSSRH3NS52HLPYAUTODAQNHM","json":"https://pith.science/pith/Q6DSSRH3NS52HLPYAUTODAQNHM.json","graph_json":"https://pith.science/api/pith-number/Q6DSSRH3NS52HLPYAUTODAQNHM/graph.json","events_json":"https://pith.science/api/pith-number/Q6DSSRH3NS52HLPYAUTODAQNHM/events.json","paper":"https://pith.science/paper/Q6DSSRH3"},"agent_actions":{"view_html":"https://pith.science/pith/Q6DSSRH3NS52HLPYAUTODAQNHM","download_json":"https://pith.science/pith/Q6DSSRH3NS52HLPYAUTODAQNHM.json","view_paper":"https://pith.science/paper/Q6DSSRH3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.22502&json=true","fetch_graph":"https://pith.science/api/pith-number/Q6DSSRH3NS52HLPYAUTODAQNHM/graph.json","fetch_events":"https://pith.science/api/pith-number/Q6DSSRH3NS52HLPYAUTODAQNHM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q6DSSRH3NS52HLPYAUTODAQNHM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q6DSSRH3NS52HLPYAUTODAQNHM/action/storage_attestation","attest_author":"https://pith.science/pith/Q6DSSRH3NS52HLPYAUTODAQNHM/action/author_attestation","sign_citation":"https://pith.science/pith/Q6DSSRH3NS52HLPYAUTODAQNHM/action/citation_signature","submit_replication":"https://pith.science/pith/Q6DSSRH3NS52HLPYAUTODAQNHM/action/replication_record"}},"created_at":"2026-07-05T11:31:28.190909+00:00","updated_at":"2026-07-05T11:31:28.190909+00:00"}