{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:S46UXQW6LVVZ5K4LNI643PVH4C","short_pith_number":"pith:S46UXQW6","schema_version":"1.0","canonical_sha256":"973d4bc2de5d6b9eab8b6a3dcdbea7e099207587c21e2404c82bf4de01909163","source":{"kind":"arxiv","id":"1810.05582","version":2},"attestation_state":"computed","paper":{"title":"Applying quantum algorithms to constraint satisfaction problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Ankur Khurana, Ashley Montanaro, Earl Campbell","submitted_at":"2018-10-12T15:40:57Z","abstract_excerpt":"Quantum algorithms can deliver asymptotic speedups over their classical counterparts. However, there are few cases where a substantial quantum speedup has been worked out in detail for reasonably-sized problems, when compared with the best classical algorithms and taking into account realistic hardware parameters and overheads for fault-tolerance. All known examples of such speedups correspond to problems related to simulation of quantum systems and cryptography. Here we apply general-purpose quantum algorithms for solving constraint satisfaction problems to two families of prototypical NP-com"},"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":"1810.05582","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2018-10-12T15:40:57Z","cross_cats_sorted":[],"title_canon_sha256":"8c1da80df030606896190dfe49e27a01be86d5c1d1272b8fc777a2af33a95ddb","abstract_canon_sha256":"5c2c0f5a895b7da88e97b19874895d0b4dc45cab602bf2a418a9443a524bc263"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:48.291389Z","signature_b64":"1HV4yNW11exC4h4BpjOLAxQTk7m8O6Dg0W4nASoPmypnDnQzSeO6BMvClI/tDJCnFXzicDcw38nezoURqeq2Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"973d4bc2de5d6b9eab8b6a3dcdbea7e099207587c21e2404c82bf4de01909163","last_reissued_at":"2026-05-17T23:39:48.290809Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:48.290809Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Applying quantum algorithms to constraint satisfaction problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Ankur Khurana, Ashley Montanaro, Earl Campbell","submitted_at":"2018-10-12T15:40:57Z","abstract_excerpt":"Quantum algorithms can deliver asymptotic speedups over their classical counterparts. However, there are few cases where a substantial quantum speedup has been worked out in detail for reasonably-sized problems, when compared with the best classical algorithms and taking into account realistic hardware parameters and overheads for fault-tolerance. All known examples of such speedups correspond to problems related to simulation of quantum systems and cryptography. Here we apply general-purpose quantum algorithms for solving constraint satisfaction problems to two families of prototypical NP-com"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.05582","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":"1810.05582","created_at":"2026-05-17T23:39:48.290903+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.05582v2","created_at":"2026-05-17T23:39:48.290903+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.05582","created_at":"2026-05-17T23:39:48.290903+00:00"},{"alias_kind":"pith_short_12","alias_value":"S46UXQW6LVVZ","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_16","alias_value":"S46UXQW6LVVZ5K4L","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_8","alias_value":"S46UXQW6","created_at":"2026-05-18T12:32:50.500415+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2409.17595","citing_title":"Magic state cultivation: growing T states as cheap as CNOT gates","ref_index":11,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/S46UXQW6LVVZ5K4LNI643PVH4C","json":"https://pith.science/pith/S46UXQW6LVVZ5K4LNI643PVH4C.json","graph_json":"https://pith.science/api/pith-number/S46UXQW6LVVZ5K4LNI643PVH4C/graph.json","events_json":"https://pith.science/api/pith-number/S46UXQW6LVVZ5K4LNI643PVH4C/events.json","paper":"https://pith.science/paper/S46UXQW6"},"agent_actions":{"view_html":"https://pith.science/pith/S46UXQW6LVVZ5K4LNI643PVH4C","download_json":"https://pith.science/pith/S46UXQW6LVVZ5K4LNI643PVH4C.json","view_paper":"https://pith.science/paper/S46UXQW6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.05582&json=true","fetch_graph":"https://pith.science/api/pith-number/S46UXQW6LVVZ5K4LNI643PVH4C/graph.json","fetch_events":"https://pith.science/api/pith-number/S46UXQW6LVVZ5K4LNI643PVH4C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S46UXQW6LVVZ5K4LNI643PVH4C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S46UXQW6LVVZ5K4LNI643PVH4C/action/storage_attestation","attest_author":"https://pith.science/pith/S46UXQW6LVVZ5K4LNI643PVH4C/action/author_attestation","sign_citation":"https://pith.science/pith/S46UXQW6LVVZ5K4LNI643PVH4C/action/citation_signature","submit_replication":"https://pith.science/pith/S46UXQW6LVVZ5K4LNI643PVH4C/action/replication_record"}},"created_at":"2026-05-17T23:39:48.290903+00:00","updated_at":"2026-05-17T23:39:48.290903+00:00"}