{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:NZMOWAAUIZMMAY2ONUE4CTLQJS","short_pith_number":"pith:NZMOWAAU","schema_version":"1.0","canonical_sha256":"6e58eb00144658c0634e6d09c14d704cb3351e5c9662911a504c3dc952de6150","source":{"kind":"arxiv","id":"2007.15808","version":1},"attestation_state":"computed","paper":{"title":"Breaking simple quantum position verification protocols with little entanglement","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andrea Olivo, Andr\\'e Chailloux, Fr\\'ed\\'eric Grosshans, Ulysse Chabaud","submitted_at":"2020-07-31T02:19:55Z","abstract_excerpt":"Instantaneous nonlocal quantum computation (INQC) evades apparent quantum and relativistic constraints and allows to attack generic quantum position verification (QPV) protocols (aiming at securely certifying the location of a distant prover) at an exponential entanglement cost. We consider adversaries sharing maximally entangled pairs of qudits and find low-dimensional INQC attacks against the simple practical family of QPV protocols based on single photons polarized at an angle $\\theta$. We find exact attacks against some rational angles, including some sitting outside of the Clifford hierar"},"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":"2007.15808","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2020-07-31T02:19:55Z","cross_cats_sorted":[],"title_canon_sha256":"ec61ca1bf53f76304252b62d481ed063897d74a4556ba676635fceb73a044416","abstract_canon_sha256":"9c42cacb76c9414c4692c58ec4bb0f17797ec6a60ba71caef1f20efdc1dcbd96"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:23:38.439826Z","signature_b64":"ptezHXHF7oEyNWYYMFzi0bhSg3iCla9Qq8fycx/NaMPBGbDBtn7Zsuz4QrkESokTYIdWIOj9kmk9W0Qrn5U4Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6e58eb00144658c0634e6d09c14d704cb3351e5c9662911a504c3dc952de6150","last_reissued_at":"2026-07-05T01:23:38.439405Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:23:38.439405Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Breaking simple quantum position verification protocols with little entanglement","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andrea Olivo, Andr\\'e Chailloux, Fr\\'ed\\'eric Grosshans, Ulysse Chabaud","submitted_at":"2020-07-31T02:19:55Z","abstract_excerpt":"Instantaneous nonlocal quantum computation (INQC) evades apparent quantum and relativistic constraints and allows to attack generic quantum position verification (QPV) protocols (aiming at securely certifying the location of a distant prover) at an exponential entanglement cost. We consider adversaries sharing maximally entangled pairs of qudits and find low-dimensional INQC attacks against the simple practical family of QPV protocols based on single photons polarized at an angle $\\theta$. We find exact attacks against some rational angles, including some sitting outside of the Clifford hierar"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.15808","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/2007.15808/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":"2007.15808","created_at":"2026-07-05T01:23:38.439461+00:00"},{"alias_kind":"arxiv_version","alias_value":"2007.15808v1","created_at":"2026-07-05T01:23:38.439461+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.15808","created_at":"2026-07-05T01:23:38.439461+00:00"},{"alias_kind":"pith_short_12","alias_value":"NZMOWAAUIZMM","created_at":"2026-07-05T01:23:38.439461+00:00"},{"alias_kind":"pith_short_16","alias_value":"NZMOWAAUIZMMAY2O","created_at":"2026-07-05T01:23:38.439461+00:00"},{"alias_kind":"pith_short_8","alias_value":"NZMOWAAU","created_at":"2026-07-05T01:23:38.439461+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.26354","citing_title":"Equivalence of non-local computation tasks beyond Clifford operations","ref_index":37,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NZMOWAAUIZMMAY2ONUE4CTLQJS","json":"https://pith.science/pith/NZMOWAAUIZMMAY2ONUE4CTLQJS.json","graph_json":"https://pith.science/api/pith-number/NZMOWAAUIZMMAY2ONUE4CTLQJS/graph.json","events_json":"https://pith.science/api/pith-number/NZMOWAAUIZMMAY2ONUE4CTLQJS/events.json","paper":"https://pith.science/paper/NZMOWAAU"},"agent_actions":{"view_html":"https://pith.science/pith/NZMOWAAUIZMMAY2ONUE4CTLQJS","download_json":"https://pith.science/pith/NZMOWAAUIZMMAY2ONUE4CTLQJS.json","view_paper":"https://pith.science/paper/NZMOWAAU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2007.15808&json=true","fetch_graph":"https://pith.science/api/pith-number/NZMOWAAUIZMMAY2ONUE4CTLQJS/graph.json","fetch_events":"https://pith.science/api/pith-number/NZMOWAAUIZMMAY2ONUE4CTLQJS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NZMOWAAUIZMMAY2ONUE4CTLQJS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NZMOWAAUIZMMAY2ONUE4CTLQJS/action/storage_attestation","attest_author":"https://pith.science/pith/NZMOWAAUIZMMAY2ONUE4CTLQJS/action/author_attestation","sign_citation":"https://pith.science/pith/NZMOWAAUIZMMAY2ONUE4CTLQJS/action/citation_signature","submit_replication":"https://pith.science/pith/NZMOWAAUIZMMAY2ONUE4CTLQJS/action/replication_record"}},"created_at":"2026-07-05T01:23:38.439461+00:00","updated_at":"2026-07-05T01:23:38.439461+00:00"}