{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:RIZI3HQVAEKWUXEE56UKC6VO26","short_pith_number":"pith:RIZI3HQV","schema_version":"1.0","canonical_sha256":"8a328d9e1501156a5c84efa8a17aaed7a8518054812e54a535408de480d8e28f","source":{"kind":"arxiv","id":"1901.05184","version":2},"attestation_state":"computed","paper":{"title":"Relational Proofs for Quantum Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cs.LO","authors_text":"Gilles Barthe, Justin Hsu, Li Zhou, Mingsheng Ying, Nengkun Yu","submitted_at":"2019-01-16T09:00:28Z","abstract_excerpt":"Relational verification of quantum programs has many potential applications in quantum and post-quantum security and other domains. We propose a relational program logic for quantum programs. The interpretation of our logic is based on a quantum analogue of probabilistic couplings. We use our logic to verify non-trivial relational properties of quantum programs, including uniformity for samples generated by the quantum Bernoulli factory, reliability of quantum teleportation against noise (bit and phase flip), security of quantum one-time pad and equivalence of quantum walks."},"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":"1901.05184","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2019-01-16T09:00:28Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"d0a7ec289db45deefec3086d6fa9a4c03b7991bef1f7f95f73526e0a8b7fc3c9","abstract_canon_sha256":"2f743ff1a0f946abef1ceedb08e69779c275f3dc58601df623f4a2464913f2ae"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:25:25.807913Z","signature_b64":"zN64EtKaX1XJuaCHUp04ypTdl7Ln/FIzVzkZ2fXhMoP/6QasfqAgiGGcq59/YG7sVk7tJg7i3WOOUDxoDsdrDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8a328d9e1501156a5c84efa8a17aaed7a8518054812e54a535408de480d8e28f","last_reissued_at":"2026-07-05T00:25:25.807429Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:25:25.807429Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Relational Proofs for Quantum Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cs.LO","authors_text":"Gilles Barthe, Justin Hsu, Li Zhou, Mingsheng Ying, Nengkun Yu","submitted_at":"2019-01-16T09:00:28Z","abstract_excerpt":"Relational verification of quantum programs has many potential applications in quantum and post-quantum security and other domains. We propose a relational program logic for quantum programs. The interpretation of our logic is based on a quantum analogue of probabilistic couplings. We use our logic to verify non-trivial relational properties of quantum programs, including uniformity for samples generated by the quantum Bernoulli factory, reliability of quantum teleportation against noise (bit and phase flip), security of quantum one-time pad and equivalence of quantum walks."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.05184","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1901.05184/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":"1901.05184","created_at":"2026-07-05T00:25:25.807492+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.05184v2","created_at":"2026-07-05T00:25:25.807492+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.05184","created_at":"2026-07-05T00:25:25.807492+00:00"},{"alias_kind":"pith_short_12","alias_value":"RIZI3HQVAEKW","created_at":"2026-07-05T00:25:25.807492+00:00"},{"alias_kind":"pith_short_16","alias_value":"RIZI3HQVAEKWUXEE","created_at":"2026-07-05T00:25:25.807492+00:00"},{"alias_kind":"pith_short_8","alias_value":"RIZI3HQV","created_at":"2026-07-05T00:25:25.807492+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/RIZI3HQVAEKWUXEE56UKC6VO26","json":"https://pith.science/pith/RIZI3HQVAEKWUXEE56UKC6VO26.json","graph_json":"https://pith.science/api/pith-number/RIZI3HQVAEKWUXEE56UKC6VO26/graph.json","events_json":"https://pith.science/api/pith-number/RIZI3HQVAEKWUXEE56UKC6VO26/events.json","paper":"https://pith.science/paper/RIZI3HQV"},"agent_actions":{"view_html":"https://pith.science/pith/RIZI3HQVAEKWUXEE56UKC6VO26","download_json":"https://pith.science/pith/RIZI3HQVAEKWUXEE56UKC6VO26.json","view_paper":"https://pith.science/paper/RIZI3HQV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.05184&json=true","fetch_graph":"https://pith.science/api/pith-number/RIZI3HQVAEKWUXEE56UKC6VO26/graph.json","fetch_events":"https://pith.science/api/pith-number/RIZI3HQVAEKWUXEE56UKC6VO26/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RIZI3HQVAEKWUXEE56UKC6VO26/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RIZI3HQVAEKWUXEE56UKC6VO26/action/storage_attestation","attest_author":"https://pith.science/pith/RIZI3HQVAEKWUXEE56UKC6VO26/action/author_attestation","sign_citation":"https://pith.science/pith/RIZI3HQVAEKWUXEE56UKC6VO26/action/citation_signature","submit_replication":"https://pith.science/pith/RIZI3HQVAEKWUXEE56UKC6VO26/action/replication_record"}},"created_at":"2026-07-05T00:25:25.807492+00:00","updated_at":"2026-07-05T00:25:25.807492+00:00"}