{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:ZAIP7RQ7NKQJ47C57XHOCFLSVL","short_pith_number":"pith:ZAIP7RQ7","schema_version":"1.0","canonical_sha256":"c810ffc61f6aa09e7c5dfdcee11572aaf0ac3d4f2839b55eb4dbdadac69e1d69","source":{"kind":"arxiv","id":"2505.23978","version":1},"attestation_state":"computed","paper":{"title":"How to Verify that a Small Device is Quantum, Unconditionally","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Giulio Malavolta, Tamer Mour","submitted_at":"2025-05-29T20:09:22Z","abstract_excerpt":"A proof of quantumness (PoQ) allows a classical verifier to efficiently test if a quantum machine is performing a computation that is infeasible for any classical machine. In this work, we propose a new approach for constructing PoQ protocols where soundness holds unconditionally assuming a bound on the memory of the prover, but otherwise no restrictions on its runtime. In this model, we propose two protocols:\n  1. A simple protocol with a quadratic gap between the memory required by the honest parties and the memory bound of the adversary. The soundness of this protocol relies on Raz's (class"},"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.23978","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-05-29T20:09:22Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"16ba3fd636de2a0efe236930fef2096656ecc9f2e290d0679680c27e1ff12efd","abstract_canon_sha256":"29bbf923a8856191793aa1f791b0fb9b03002ffaa02a14c65f049b00bd18cac2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:12:39.430426Z","signature_b64":"isWtXsAgrlgu3uTk/QqbF0OV9NuVCh7a6jZul4YFA8COw1Y55/ywm1WATmZ3GcD5fiiQiQPrjWFlvrmvbYNsCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c810ffc61f6aa09e7c5dfdcee11572aaf0ac3d4f2839b55eb4dbdadac69e1d69","last_reissued_at":"2026-07-05T11:12:39.429805Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:12:39.429805Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"How to Verify that a Small Device is Quantum, Unconditionally","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Giulio Malavolta, Tamer Mour","submitted_at":"2025-05-29T20:09:22Z","abstract_excerpt":"A proof of quantumness (PoQ) allows a classical verifier to efficiently test if a quantum machine is performing a computation that is infeasible for any classical machine. In this work, we propose a new approach for constructing PoQ protocols where soundness holds unconditionally assuming a bound on the memory of the prover, but otherwise no restrictions on its runtime. In this model, we propose two protocols:\n  1. A simple protocol with a quadratic gap between the memory required by the honest parties and the memory bound of the adversary. The soundness of this protocol relies on Raz's (class"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.23978","kind":"arxiv","version":1},"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.23978/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.23978","created_at":"2026-07-05T11:12:39.429867+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.23978v1","created_at":"2026-07-05T11:12:39.429867+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.23978","created_at":"2026-07-05T11:12:39.429867+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZAIP7RQ7NKQJ","created_at":"2026-07-05T11:12:39.429867+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZAIP7RQ7NKQJ47C5","created_at":"2026-07-05T11:12:39.429867+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZAIP7RQ7","created_at":"2026-07-05T11:12:39.429867+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/ZAIP7RQ7NKQJ47C57XHOCFLSVL","json":"https://pith.science/pith/ZAIP7RQ7NKQJ47C57XHOCFLSVL.json","graph_json":"https://pith.science/api/pith-number/ZAIP7RQ7NKQJ47C57XHOCFLSVL/graph.json","events_json":"https://pith.science/api/pith-number/ZAIP7RQ7NKQJ47C57XHOCFLSVL/events.json","paper":"https://pith.science/paper/ZAIP7RQ7"},"agent_actions":{"view_html":"https://pith.science/pith/ZAIP7RQ7NKQJ47C57XHOCFLSVL","download_json":"https://pith.science/pith/ZAIP7RQ7NKQJ47C57XHOCFLSVL.json","view_paper":"https://pith.science/paper/ZAIP7RQ7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.23978&json=true","fetch_graph":"https://pith.science/api/pith-number/ZAIP7RQ7NKQJ47C57XHOCFLSVL/graph.json","fetch_events":"https://pith.science/api/pith-number/ZAIP7RQ7NKQJ47C57XHOCFLSVL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZAIP7RQ7NKQJ47C57XHOCFLSVL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZAIP7RQ7NKQJ47C57XHOCFLSVL/action/storage_attestation","attest_author":"https://pith.science/pith/ZAIP7RQ7NKQJ47C57XHOCFLSVL/action/author_attestation","sign_citation":"https://pith.science/pith/ZAIP7RQ7NKQJ47C57XHOCFLSVL/action/citation_signature","submit_replication":"https://pith.science/pith/ZAIP7RQ7NKQJ47C57XHOCFLSVL/action/replication_record"}},"created_at":"2026-07-05T11:12:39.429867+00:00","updated_at":"2026-07-05T11:12:39.429867+00:00"}