On the public citation graph

Relational proofs for quantum programs

https://doi.org/10.1145/3371089
0 signed · 61 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-1-4612-1236-2openalex-snapshot
Coupling, Stationarity, and Regeneration
inferredcites →https://doi.org/10.1007/978-3-540-24754-8_1openalex-snapshot
A Brief Survey of Quantum Programming Languages
inferredcites →https://doi.org/10.1007/978-3-540-71050-9openalex-snapshot
Optimal Transport: Old and New
inferredcites →https://doi.org/10.1007/978-3-642-10622-4_7openalex-snapshot
A Logic for Formal Verification of Quantum Programs
inferredcites →https://doi.org/10.1007/978-3-642-36742-7_33openalex-snapshot
Equivalence Checking of Quantum Protocols
inferredcites →https://doi.org/10.1007/978-3-662-48899-7_27openalex-snapshot
Relational Reasoning via Probabilistic Coupling
inferredcites →https://doi.org/10.1007/s00220-016-2609-8openalex-snapshot
Tight Uniform Continuity Bounds for Quantum Entropies: Conditional Entropy, Relative Entropy Distance and Energy Constraints
inferredcites →https://doi.org/10.1007/s11128-012-0432-5openalex-snapshot
Quantum walks: a comprehensive review
inferredcites →https://doi.org/10.1016/b978-0-12-802306-8.00004-5openalex-snapshot
Logic for quantum programs
inferredcites →https://doi.org/10.1016/j.entcs.2006.04.003openalex-snapshot
Reasoning About Imperative Quantum Programs
inferredcites →https://doi.org/10.1016/j.scico.2013.03.016openalex-snapshot
Verification of quantum programs
inferredcites →https://doi.org/10.1016/j.tcs.2007.06.011openalex-snapshot
Proof rules for the correctness of quantum programs
inferredcites →https://doi.org/10.1016/j.tcs.2019.08.026openalex-snapshot
Strassen's theorem for quantum couplings
inferredcites →https://doi.org/10.1017/s0960129504004256openalex-snapshot
Towards a quantum programming language
inferredcites →https://doi.org/10.1017/s0960129506005251openalex-snapshot
Quantum weakest preconditions
inferredcites →https://doi.org/10.1080/00107151031000110776openalex-snapshot
Quantum random walks: An introductory overview
inferredcites →https://doi.org/10.1103/physreva.67.042317openalex-snapshot
Optimal encryption of quantum bits
inferredcites →https://doi.org/10.1103/physrevlett.70.1895openalex-snapshot
Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
inferredcites →https://doi.org/10.1109/lics.2004.1319636openalex-snapshot
A categorical semantics of quantum protocols
inferredcites →https://doi.org/10.1109/lics.2019.8785779openalex-snapshot
Quantum Hoare Logic with Ghost Variables
inferredcites →https://doi.org/10.1142/s0219025716500120openalex-snapshot
Diagonal couplings of quantum Markov chains
inferredcites →https://doi.org/10.1145/1480881.1480894openalex-snapshot
Formal certification of code-based cryptographic proofs
inferredcites →https://doi.org/10.1145/175007.175019openalex-snapshot
A Bernoulli factory
inferredcites →https://doi.org/10.1145/2049706.2049708openalex-snapshot
Floyd--hoare logic for quantum programs
inferredcites →https://doi.org/10.1145/2103656.2103670openalex-snapshot
Probabilistic relational reasoning for differential privacy
inferredcites →https://doi.org/10.1145/2492061openalex-snapshot
Probabilistic Relational Reasoning for Differential Privacy
inferredcites →https://doi.org/10.1145/2933575.2934554openalex-snapshot
Proving Differential Privacy via Probabilistic Couplings
inferredcites →https://doi.org/10.1145/3158145openalex-snapshot
Proving expected sensitivity of probabilistic programs
inferredcites →https://doi.org/10.1145/3290346openalex-snapshot
Quantum relational Hoare logic
inferredcites →https://doi.org/10.1145/3313276.3316378openalex-snapshot
Gentle measurement of quantum states and differential privacy
inferredcites →https://doi.org/10.1145/3314221.3314584openalex-snapshot
An applied quantum Hoare logic
inferredcites →https://doi.org/10.4230/lipics.concur.2015.441openalex-snapshot
Toward Automatic Verification of Quantum Cryptographic Protocols

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/smr.2419openalex-snapshot
Quantum software testing: State of the art
inferred← citeshttps://doi.org/10.1007/978-3-031-05324-5_9openalex-snapshot
Quantum Software Testing: Current Trends and Emerging Proposals
inferred← citeshttps://doi.org/10.1007/978-3-031-50521-8_8openalex-snapshot
Local Reasoning About Probabilistic Behaviour for Classical–Quantum Programs
inferred← citeshttps://doi.org/10.1007/978-3-031-64136-7_6openalex-snapshot
Quantum Software Quality Metrics
inferred← citeshttps://doi.org/10.1007/978-3-031-65633-0_22openalex-snapshot
Approximate Relational Reasoning for Quantum Programs
inferred← citeshttps://doi.org/10.1007/978-981-96-7423-7_2openalex-snapshot
Generating Property-Based Tests for Quantum Algorithms
inferred← citeshttps://doi.org/10.1016/b978-0-44-315942-8.00009-5openalex-snapshot
Introduction
inferred← citeshttps://doi.org/10.1016/b978-0-44-315942-8.00016-2openalex-snapshot
Quantum Hoare logic
inferred← citeshttps://doi.org/10.1016/b978-0-44-315942-8.00018-6openalex-snapshot
Verification of quantum programs
inferred← citeshttps://doi.org/10.1016/b978-0-44-315942-8.00030-7openalex-snapshot
References
inferred← citeshttps://doi.org/10.1016/j.ic.2026.105417openalex-snapshot
A practical quantum Hoare logic with classical variables, I
inferred← citeshttps://doi.org/10.1109/lics52264.2021.9470673openalex-snapshot
A Quantum Interpretation of Bunched Logic & Quantum Separation Logic
inferred← citeshttps://doi.org/10.1109/lics65433.2025.00072openalex-snapshot
Complete Quantum Relational Hoare Logics from Optimal Transport Duality
inferred← citeshttps://doi.org/10.1142/s021819402441002xopenalex-snapshot
Quantum Software Engineering: Practical Challenges
inferred← citeshttps://doi.org/10.1145/3434286openalex-snapshot
On algebraic abstractions for concurrent separation logics
inferred← citeshttps://doi.org/10.1145/3456877openalex-snapshot
Quantum Hoare Logic with Classical Variables
inferred← citeshttps://doi.org/10.1145/3460120.3484567openalex-snapshot
EasyPQC: Verifying Post-Quantum Cryptography
inferred← citeshttps://doi.org/10.1145/3498691openalex-snapshot
Twist: sound reasoning for purity and entanglement in Quantum programs
inferred← citeshttps://doi.org/10.1145/3519939.3523713openalex-snapshot
Algebraic reasoning of Quantum programs via non-idempotent Kleene algebra
inferred← citeshttps://doi.org/10.1145/3527316openalex-snapshot
On incorrectness logic for Quantum programs
inferred← citeshttps://doi.org/10.1145/3571222openalex-snapshot
CoqQ: Foundational Verification of Quantum Programs
inferred← citeshttps://doi.org/10.1145/3704876openalex-snapshot
A Quantitative Probabilistic Relational Hoare Logic
inferred← citeshttps://doi.org/10.1145/3704878openalex-snapshot
Automating Equational Proofs in Dirac Notation
inferred← citeshttps://doi.org/10.1145/3704889openalex-snapshot
Coinductive Proofs for Temporal Hyperliveness
inferred← citeshttps://doi.org/10.1145/3729293openalex-snapshot
Efficient Formal Verification of Quantum Error Correcting Programs
inferred← citeshttps://doi.org/10.1145/3763153openalex-snapshot
Scalable Equivalence Checking and Verification of Shallow Quantum Circuits
inferred← citeshttps://doi.org/10.1145/3776658openalex-snapshot
An Expressive Assertion Language for Quantum Programs
inferred← citeshttps://doi.org/10.1145/3815573openalex-snapshot
Reasoning about Parameterized Recursive Quantum Programs with Ancilla Data and Probabilistic Control
inferred← citeshttps://doi.org/10.2139/ssrn.7361162openalex-snapshot
Local Reasoning about Probabilistic Behaviour for Classical-Quantum Programs
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.