{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:MIOIGZZGUSENGOQ6CIA2CGTFIL","short_pith_number":"pith:MIOIGZZG","schema_version":"1.0","canonical_sha256":"621c836726a488d33a1e1201a11a6542f464a95728f45345ede874a521720dc0","source":{"kind":"arxiv","id":"2501.15238","version":1},"attestation_state":"computed","paper":{"title":"Complete Quantum Relational Hoare Logics from Optimal Transport Duality","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cs.LO","authors_text":"Gilles Barthe, Li Zhou, Minbo Gao, Theo Wang","submitted_at":"2025-01-25T15:01:25Z","abstract_excerpt":"We introduce a quantitative relational Hoare logic for quantum programs. Assertions of the logic range over a new infinitary extension of positive semidefinite operators. We prove that our logic is sound, and complete for bounded postconditions and almost surely terminating programs. Our completeness result is based on a quantum version of the duality theorem from optimal transport. We also define a complete embedding into our logic of a relational Hoare logic with projective assertions."},"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":"2501.15238","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2025-01-25T15:01:25Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"770babf3bc7d830aec35849aea9b96583660d0d2c76011e1648a15de2b655d38","abstract_canon_sha256":"95f5dbb89c7b625cb88b279b47bc330e2bc0858531e3f73bb6d5e30e3297b1aa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:05:26.163027Z","signature_b64":"kdl+rx11DsICF0dHlGYqU/Q0GDOfxW85kVXzZ3vAyHjxGFElK70brnEi/TsH+0CMDFpz4W3oIXKEYwRnTfgQCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"621c836726a488d33a1e1201a11a6542f464a95728f45345ede874a521720dc0","last_reissued_at":"2026-07-05T10:05:26.162493Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:05:26.162493Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Complete Quantum Relational Hoare Logics from Optimal Transport Duality","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cs.LO","authors_text":"Gilles Barthe, Li Zhou, Minbo Gao, Theo Wang","submitted_at":"2025-01-25T15:01:25Z","abstract_excerpt":"We introduce a quantitative relational Hoare logic for quantum programs. Assertions of the logic range over a new infinitary extension of positive semidefinite operators. We prove that our logic is sound, and complete for bounded postconditions and almost surely terminating programs. Our completeness result is based on a quantum version of the duality theorem from optimal transport. We also define a complete embedding into our logic of a relational Hoare logic with projective assertions."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.15238","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/2501.15238/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":"2501.15238","created_at":"2026-07-05T10:05:26.162549+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.15238v1","created_at":"2026-07-05T10:05:26.162549+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.15238","created_at":"2026-07-05T10:05:26.162549+00:00"},{"alias_kind":"pith_short_12","alias_value":"MIOIGZZGUSEN","created_at":"2026-07-05T10:05:26.162549+00:00"},{"alias_kind":"pith_short_16","alias_value":"MIOIGZZGUSENGOQ6","created_at":"2026-07-05T10:05:26.162549+00:00"},{"alias_kind":"pith_short_8","alias_value":"MIOIGZZG","created_at":"2026-07-05T10:05:26.162549+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2510.07051","citing_title":"Complete Relational Logic for Infinite-Dimensional Quantum Programs with Unbounded Assertions","ref_index":10,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MIOIGZZGUSENGOQ6CIA2CGTFIL","json":"https://pith.science/pith/MIOIGZZGUSENGOQ6CIA2CGTFIL.json","graph_json":"https://pith.science/api/pith-number/MIOIGZZGUSENGOQ6CIA2CGTFIL/graph.json","events_json":"https://pith.science/api/pith-number/MIOIGZZGUSENGOQ6CIA2CGTFIL/events.json","paper":"https://pith.science/paper/MIOIGZZG"},"agent_actions":{"view_html":"https://pith.science/pith/MIOIGZZGUSENGOQ6CIA2CGTFIL","download_json":"https://pith.science/pith/MIOIGZZGUSENGOQ6CIA2CGTFIL.json","view_paper":"https://pith.science/paper/MIOIGZZG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.15238&json=true","fetch_graph":"https://pith.science/api/pith-number/MIOIGZZGUSENGOQ6CIA2CGTFIL/graph.json","fetch_events":"https://pith.science/api/pith-number/MIOIGZZGUSENGOQ6CIA2CGTFIL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MIOIGZZGUSENGOQ6CIA2CGTFIL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MIOIGZZGUSENGOQ6CIA2CGTFIL/action/storage_attestation","attest_author":"https://pith.science/pith/MIOIGZZGUSENGOQ6CIA2CGTFIL/action/author_attestation","sign_citation":"https://pith.science/pith/MIOIGZZGUSENGOQ6CIA2CGTFIL/action/citation_signature","submit_replication":"https://pith.science/pith/MIOIGZZGUSENGOQ6CIA2CGTFIL/action/replication_record"}},"created_at":"2026-07-05T10:05:26.162549+00:00","updated_at":"2026-07-05T10:05:26.162549+00:00"}