{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:VZIYECYRW6QYEJBA5P7YS2BYBJ","short_pith_number":"pith:VZIYECYR","schema_version":"1.0","canonical_sha256":"ae51820b11b7a1822420ebff8968380a5caedf2716e6ac848a660b5a37b1789f","source":{"kind":"arxiv","id":"1807.11845","version":2},"attestation_state":"computed","paper":{"title":"Quantum Correlations Can Speed Up All Classical Computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Carlos Perez-Delgado, Sai Vinjanampathy","submitted_at":"2018-07-31T14:54:50Z","abstract_excerpt":"Quantum algorithms that can speed up certain tasks, such as factorisation and unstructured search, have driven a decades-long development of quantum computers and quantum technologies. Yet, outside specialized applications, quantum computers are believed to offer no advantage over classical computers. Here, we present a method which exploits quantum effects to speed up all possible classical computations. This method-which we call Coherent Parallelization (CP)-exploits quantum correlations generated by higher-order Hamiltonians to speed up any possible classical computation by a factor that de"},"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":"1807.11845","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-07-31T14:54:50Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"cb61d10c41b3ef3b372e8b739823737fb87433a9fcb6e602a962f5e7334866d7","abstract_canon_sha256":"10ce7295e0986abe3f67e64b9e59c78e5e33bc478d20a4b7056ce674a51b0973"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:31.148611Z","signature_b64":"PmKOgHGJINP1z2WkDa6vVV4IMiYgLaNT0pxnAbe2aQCkgCrJJr9MZFDouDXLZYQGKxhAt/WRyitABwczn07FDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ae51820b11b7a1822420ebff8968380a5caedf2716e6ac848a660b5a37b1789f","last_reissued_at":"2026-05-17T23:41:31.147835Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:31.147835Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Correlations Can Speed Up All Classical Computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Carlos Perez-Delgado, Sai Vinjanampathy","submitted_at":"2018-07-31T14:54:50Z","abstract_excerpt":"Quantum algorithms that can speed up certain tasks, such as factorisation and unstructured search, have driven a decades-long development of quantum computers and quantum technologies. Yet, outside specialized applications, quantum computers are believed to offer no advantage over classical computers. Here, we present a method which exploits quantum effects to speed up all possible classical computations. This method-which we call Coherent Parallelization (CP)-exploits quantum correlations generated by higher-order Hamiltonians to speed up any possible classical computation by a factor that de"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.11845","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":""},"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":"1807.11845","created_at":"2026-05-17T23:41:31.147947+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.11845v2","created_at":"2026-05-17T23:41:31.147947+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.11845","created_at":"2026-05-17T23:41:31.147947+00:00"},{"alias_kind":"pith_short_12","alias_value":"VZIYECYRW6QY","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_16","alias_value":"VZIYECYRW6QYEJBA","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_8","alias_value":"VZIYECYR","created_at":"2026-05-18T12:32:59.047623+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VZIYECYRW6QYEJBA5P7YS2BYBJ","json":"https://pith.science/pith/VZIYECYRW6QYEJBA5P7YS2BYBJ.json","graph_json":"https://pith.science/api/pith-number/VZIYECYRW6QYEJBA5P7YS2BYBJ/graph.json","events_json":"https://pith.science/api/pith-number/VZIYECYRW6QYEJBA5P7YS2BYBJ/events.json","paper":"https://pith.science/paper/VZIYECYR"},"agent_actions":{"view_html":"https://pith.science/pith/VZIYECYRW6QYEJBA5P7YS2BYBJ","download_json":"https://pith.science/pith/VZIYECYRW6QYEJBA5P7YS2BYBJ.json","view_paper":"https://pith.science/paper/VZIYECYR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.11845&json=true","fetch_graph":"https://pith.science/api/pith-number/VZIYECYRW6QYEJBA5P7YS2BYBJ/graph.json","fetch_events":"https://pith.science/api/pith-number/VZIYECYRW6QYEJBA5P7YS2BYBJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VZIYECYRW6QYEJBA5P7YS2BYBJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VZIYECYRW6QYEJBA5P7YS2BYBJ/action/storage_attestation","attest_author":"https://pith.science/pith/VZIYECYRW6QYEJBA5P7YS2BYBJ/action/author_attestation","sign_citation":"https://pith.science/pith/VZIYECYRW6QYEJBA5P7YS2BYBJ/action/citation_signature","submit_replication":"https://pith.science/pith/VZIYECYRW6QYEJBA5P7YS2BYBJ/action/replication_record"}},"created_at":"2026-05-17T23:41:31.147947+00:00","updated_at":"2026-05-17T23:41:31.147947+00:00"}