{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:M6RV6YUHSAVIXRZPG6WA2NKCTZ","short_pith_number":"pith:M6RV6YUH","schema_version":"1.0","canonical_sha256":"67a35f6287902a8bc72f37ac0d35429e571cfd0cc95cbb4a2b0f87a95ebf25c0","source":{"kind":"arxiv","id":"1807.08970","version":2},"attestation_state":"computed","paper":{"title":"Computational speedups using small quantum devices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CC"],"primary_cat":"quant-ph","authors_text":"J. Ignacio Cirac, Vedran Dunjko, Yimin Ge","submitted_at":"2018-07-24T09:01:50Z","abstract_excerpt":"Suppose we have a small quantum computer with only M qubits. Can such a device genuinely speed up certain algorithms, even when the problem size is much larger than M? Here we answer this question to the affirmative. We present a hybrid quantum-classical algorithm to solve 3SAT problems involving n>>M variables that significantly speeds up its fully classical counterpart. This question may be relevant in view of the current quest to build small quantum computers."},"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.08970","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-07-24T09:01:50Z","cross_cats_sorted":["cs.AI","cs.CC"],"title_canon_sha256":"44bfb5209f2061ed3b95abef24060d8faad73e7593859d17e400b6c577afb120","abstract_canon_sha256":"f4288997dd27df08bf847f793ef993e081ab37a4ac454c767232768ee026a65e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:36.326252Z","signature_b64":"Wp1O2U1gR18SoeDCijDX/Y5IBRQW/ygbFqVPtKXIgK45AIX7kHHFOk1drYD+cz/mHmXnYVHSFqq9sSeyIpB3Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"67a35f6287902a8bc72f37ac0d35429e571cfd0cc95cbb4a2b0f87a95ebf25c0","last_reissued_at":"2026-05-17T23:57:36.325731Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:36.325731Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computational speedups using small quantum devices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CC"],"primary_cat":"quant-ph","authors_text":"J. Ignacio Cirac, Vedran Dunjko, Yimin Ge","submitted_at":"2018-07-24T09:01:50Z","abstract_excerpt":"Suppose we have a small quantum computer with only M qubits. Can such a device genuinely speed up certain algorithms, even when the problem size is much larger than M? Here we answer this question to the affirmative. We present a hybrid quantum-classical algorithm to solve 3SAT problems involving n>>M variables that significantly speeds up its fully classical counterpart. This question may be relevant in view of the current quest to build small quantum computers."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.08970","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.08970","created_at":"2026-05-17T23:57:36.325820+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.08970v2","created_at":"2026-05-17T23:57:36.325820+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.08970","created_at":"2026-05-17T23:57:36.325820+00:00"},{"alias_kind":"pith_short_12","alias_value":"M6RV6YUHSAVI","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_16","alias_value":"M6RV6YUHSAVIXRZP","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_8","alias_value":"M6RV6YUH","created_at":"2026-05-18T12:32:37.024351+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/M6RV6YUHSAVIXRZPG6WA2NKCTZ","json":"https://pith.science/pith/M6RV6YUHSAVIXRZPG6WA2NKCTZ.json","graph_json":"https://pith.science/api/pith-number/M6RV6YUHSAVIXRZPG6WA2NKCTZ/graph.json","events_json":"https://pith.science/api/pith-number/M6RV6YUHSAVIXRZPG6WA2NKCTZ/events.json","paper":"https://pith.science/paper/M6RV6YUH"},"agent_actions":{"view_html":"https://pith.science/pith/M6RV6YUHSAVIXRZPG6WA2NKCTZ","download_json":"https://pith.science/pith/M6RV6YUHSAVIXRZPG6WA2NKCTZ.json","view_paper":"https://pith.science/paper/M6RV6YUH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.08970&json=true","fetch_graph":"https://pith.science/api/pith-number/M6RV6YUHSAVIXRZPG6WA2NKCTZ/graph.json","fetch_events":"https://pith.science/api/pith-number/M6RV6YUHSAVIXRZPG6WA2NKCTZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M6RV6YUHSAVIXRZPG6WA2NKCTZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M6RV6YUHSAVIXRZPG6WA2NKCTZ/action/storage_attestation","attest_author":"https://pith.science/pith/M6RV6YUHSAVIXRZPG6WA2NKCTZ/action/author_attestation","sign_citation":"https://pith.science/pith/M6RV6YUHSAVIXRZPG6WA2NKCTZ/action/citation_signature","submit_replication":"https://pith.science/pith/M6RV6YUHSAVIXRZPG6WA2NKCTZ/action/replication_record"}},"created_at":"2026-05-17T23:57:36.325820+00:00","updated_at":"2026-05-17T23:57:36.325820+00:00"}