{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:6EUUREV4YEQEOAKMW3IX7FBLHU","short_pith_number":"pith:6EUUREV4","schema_version":"1.0","canonical_sha256":"f1294892bcc12047014cb6d17f942b3d39a5426e5b42ffd3e15ec5f286761680","source":{"kind":"arxiv","id":"1705.02817","version":2},"attestation_state":"computed","paper":{"title":"Efficient classical verification of quantum computations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Richard Jozsa, Sergii Strelchuk","submitted_at":"2017-05-08T10:41:42Z","abstract_excerpt":"We propose an efficient scheme for verifying quantum computations in the `high complexity' regime i.e. beyond the remit of classical computers. Previously proposed schemes remarkably provide confidence against arbitrarily malicious adversarial behaviour in the misfunctioning of the quantum computing device. Our scheme is not secure against arbitrarily adversarial behaviour, but may nevertheless be sufficiently acceptable in many practical situations. With this concession we gain in manifest simplicity and transparency, and in contrast to previous schemes, our verifier is entirely classical. It"},"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":"1705.02817","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-05-08T10:41:42Z","cross_cats_sorted":[],"title_canon_sha256":"dd2399278d0296a40ea051f720acc86602b3bc0a9196f8d34d0241c67769aa9b","abstract_canon_sha256":"c5db695140411a7ee11c7632ca036c085a6a708363f1adaa3282b46b16f8530f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:49.953753Z","signature_b64":"tb9q4uqZSt05ar/0cIB33OvjVJ8Jqi50fSjY7u7E9btdNJ1QZjDdveps1nLJcDoM7eEB6FH+kfpei4ODuN33DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f1294892bcc12047014cb6d17f942b3d39a5426e5b42ffd3e15ec5f286761680","last_reissued_at":"2026-05-18T00:43:49.953262Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:49.953262Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient classical verification of quantum computations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Richard Jozsa, Sergii Strelchuk","submitted_at":"2017-05-08T10:41:42Z","abstract_excerpt":"We propose an efficient scheme for verifying quantum computations in the `high complexity' regime i.e. beyond the remit of classical computers. Previously proposed schemes remarkably provide confidence against arbitrarily malicious adversarial behaviour in the misfunctioning of the quantum computing device. Our scheme is not secure against arbitrarily adversarial behaviour, but may nevertheless be sufficiently acceptable in many practical situations. With this concession we gain in manifest simplicity and transparency, and in contrast to previous schemes, our verifier is entirely classical. It"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.02817","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":"1705.02817","created_at":"2026-05-18T00:43:49.953333+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.02817v2","created_at":"2026-05-18T00:43:49.953333+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.02817","created_at":"2026-05-18T00:43:49.953333+00:00"},{"alias_kind":"pith_short_12","alias_value":"6EUUREV4YEQE","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_16","alias_value":"6EUUREV4YEQEOAKM","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_8","alias_value":"6EUUREV4","created_at":"2026-05-18T12:31:03.183658+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/6EUUREV4YEQEOAKMW3IX7FBLHU","json":"https://pith.science/pith/6EUUREV4YEQEOAKMW3IX7FBLHU.json","graph_json":"https://pith.science/api/pith-number/6EUUREV4YEQEOAKMW3IX7FBLHU/graph.json","events_json":"https://pith.science/api/pith-number/6EUUREV4YEQEOAKMW3IX7FBLHU/events.json","paper":"https://pith.science/paper/6EUUREV4"},"agent_actions":{"view_html":"https://pith.science/pith/6EUUREV4YEQEOAKMW3IX7FBLHU","download_json":"https://pith.science/pith/6EUUREV4YEQEOAKMW3IX7FBLHU.json","view_paper":"https://pith.science/paper/6EUUREV4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.02817&json=true","fetch_graph":"https://pith.science/api/pith-number/6EUUREV4YEQEOAKMW3IX7FBLHU/graph.json","fetch_events":"https://pith.science/api/pith-number/6EUUREV4YEQEOAKMW3IX7FBLHU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6EUUREV4YEQEOAKMW3IX7FBLHU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6EUUREV4YEQEOAKMW3IX7FBLHU/action/storage_attestation","attest_author":"https://pith.science/pith/6EUUREV4YEQEOAKMW3IX7FBLHU/action/author_attestation","sign_citation":"https://pith.science/pith/6EUUREV4YEQEOAKMW3IX7FBLHU/action/citation_signature","submit_replication":"https://pith.science/pith/6EUUREV4YEQEOAKMW3IX7FBLHU/action/replication_record"}},"created_at":"2026-05-18T00:43:49.953333+00:00","updated_at":"2026-05-18T00:43:49.953333+00:00"}