On the public citation graph

Quantum Hoare Logic with Classical Variables

https://doi.org/10.1145/3456877
0 signed · 84 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/11874683_16openalex-snapshot
Reasoning About States of Probabilistic Sequential Programs
inferredcites →https://doi.org/10.1007/3-540-12732-1openalex-snapshot
States, Effects, and Operations Fundamental Notions of Quantum Theory
inferredcites →https://doi.org/10.1007/978-1-4757-2714-2openalex-snapshot
Verification of Sequential and Concurrent Programs
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/s00165-018-0465-3openalex-snapshot
Toward automatic verification of quantum programs
inferredcites →https://doi.org/10.1007/s00165-019-00501-3openalex-snapshot
Fifty years of Hoare’s logic
inferredcites →https://doi.org/10.1016/0022-0000(81)90036-2openalex-snapshot
Semantics of probabilistic programs
inferredcites →https://doi.org/10.1016/0022-0000(85)90012-1openalex-snapshot
A probabilistic PDL
inferredcites →https://doi.org/10.1016/j.entcs.2006.04.003openalex-snapshot
Reasoning About Imperative Quantum Programs
inferredcites →https://doi.org/10.1016/j.entcs.2015.12.021openalex-snapshot
VPHL: A Verified Partial-Correctness Logic for Probabilistic Programs
inferredcites →https://doi.org/10.1016/j.tcs.2007.02.040openalex-snapshot
Reasoning about probabilistic sequential programs
inferredcites →https://doi.org/10.1016/j.tcs.2014.05.025openalex-snapshot
Quantum cryptography: Public key distribution and coin tossing
inferredcites →https://doi.org/10.1017/s0025557200071461openalex-snapshot
An Introduction to the Theory of Numbers. By G. H. Hardy and E. M. Wright. 2nd edition. Pp. xvi, 407 25s. 1945. (Oxford)
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.1103/physrevlett.103.150502openalex-snapshot
Quantum Algorithm for Linear Systems of Equations
inferredcites →https://doi.org/10.1103/physrevlett.68.3121openalex-snapshot
Quantum cryptography using any two nonorthogonal states
inferredcites →https://doi.org/10.1103/physrevlett.69.2881openalex-snapshot
Communication via one- and two-particle operators on Einstein-Podolsky-Rosen states
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.1103/revmodphys.68.733openalex-snapshot
Quantum computation and Shor's factoring algorithm
inferredcites →https://doi.org/10.1109/sfcs.1994.365700openalex-snapshot
Algorithms for quantum computation: discrete logarithms and factoring
inferredcites →https://doi.org/10.1119/1.1463744openalex-snapshot
Quantum Computation and Quantum Information
inferredcites →https://doi.org/10.1137/s0097539795293172openalex-snapshot
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
inferredcites →https://doi.org/10.1140/epjd/e2003-00242-2openalex-snapshot
Toward an architecture for quantum programming
inferredcites →https://doi.org/10.1142/s012905410200114xopenalex-snapshot
VERIFYING PROBABILISTIC PROGRAMS USING A HOARE LIKE LOGIC
inferredcites →https://doi.org/10.1145/2049706.2049708openalex-snapshot
Floyd--hoare logic for quantum programs
inferredcites →https://doi.org/10.1145/229542.229547openalex-snapshot
Probabilistic predicate transformers
inferredcites →https://doi.org/10.1145/237814.237866openalex-snapshot
A fast quantum mechanical algorithm for database search
inferredcites →https://doi.org/10.1145/2933575.2935317openalex-snapshot
Reasoning about Recursive Probabilistic Programs
inferredcites →https://doi.org/10.1145/3290344openalex-snapshot
Quantitative robustness analysis of quantum programs
inferredcites →https://doi.org/10.1145/3290346openalex-snapshot
Quantum relational Hoare logic
inferredcites →https://doi.org/10.1145/3314221.3314584openalex-snapshot
An applied quantum Hoare logic
inferredcites →https://doi.org/10.1145/3371089openalex-snapshot
Relational proofs for quantum programs
inferredcites →https://doi.org/10.1145/357980.358017openalex-snapshot
A method for obtaining digital signatures and public-key cryptosystems
inferredcites →https://doi.org/10.1145/359340.359342openalex-snapshot
A method for obtaining digital signatures and public-key cryptosystems
inferredcites →https://doi.org/10.1145/363235.363259openalex-snapshot
An axiomatic basis for computer programming
inferredcites →https://doi.org/10.1145/382780.382781openalex-snapshot
Unconditional security in quantum cryptography
inferredcites →https://doi.org/10.1515/9781400889921openalex-snapshot
Mathematical Foundations of Quantum Mechanics
inferredcites →https://doi.org/10.48550/arxiv.1810.11334openalex-snapshot
Reasoning about Parallel Quantum Programs
inferredcites →https://doi.org/10.48550/arxiv.1904.04304openalex-snapshot
Verification Logics for Quantum Programs

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-3-031-37709-9_7openalex-snapshot
AutoQ: An Automata-Based Quantum Circuit Verifier
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-75783-9_9openalex-snapshot
Quantum Computing: From Weakest Preconditions to Voltage Pulses
inferred← citeshttps://doi.org/10.1007/978-3-031-90660-2_5openalex-snapshot
AutoQ 2.0: From Verification of Quantum Circuits to Verification of Quantum Programs
inferred← citeshttps://doi.org/10.1007/978-3-031-98685-7_1openalex-snapshot
Verifying Fault-Tolerance of Quantum Error Correction Codes
inferred← citeshttps://doi.org/10.1007/978-3-032-09303-5_7openalex-snapshot
Verification Paradigms for Quantum Computing
inferred← citeshttps://doi.org/10.1007/978-3-032-32537-2_15openalex-snapshot
A Practical Specification Language for Automatic Quantum Program Verification
inferred← citeshttps://doi.org/10.1007/978-3-032-32537-2_16openalex-snapshot
Formal Verification of Quantum Ancilla Safety
inferred← citeshttps://doi.org/10.1007/s11128-026-05296-wopenalex-snapshot
Weakest precondition calculus and relative completeness of satisfaction-based quantum Hoare logic
inferred← citeshttps://doi.org/10.1016/b978-0-44-315942-8.00015-0openalex-snapshot
Quantum while-programs
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.2023.105077openalex-snapshot
Abstract interpretation, Hoare logic, and incorrectness logic for quantum programs
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.1016/j.tcs.2022.02.017openalex-snapshot
Formal semantics of a classical-quantum language
inferred← citeshttps://doi.org/10.1016/j.tcs.2026.116150openalex-snapshot
Probabilistic predicate transformers II: partially observable probability
inferred← citeshttps://doi.org/10.1088/2058-9565/ac47f1openalex-snapshot
Weakly measured while loops: peeking at quantum states
inferred← citeshttps://doi.org/10.1109/ase63991.2025.00203openalex-snapshot
Exact Inference for Quantum Circuits: A Testing Oracle for Quantum Software Stacks
inferred← citeshttps://doi.org/10.1109/qce57702.2023.00087openalex-snapshot
PCOAST: A Pauli-Based Quantum Circuit Optimization Framework
inferred← citeshttps://doi.org/10.1140/epjqt/s40507-025-00462-yopenalex-snapshot
A cross-chain model with underlying security and scalability based on quantum algorithm
inferred← citeshttps://doi.org/10.1142/s0218126624501123openalex-snapshot
Formalizing the Semantics of a Classical-Quantum Imperative Language in Coq
inferred← citeshttps://doi.org/10.1145/3517145openalex-snapshot
Verification of Distributed Quantum Programs
inferred← citeshttps://doi.org/10.1145/3571222openalex-snapshot
CoqQ: Foundational Verification of Quantum Programs
inferred← citeshttps://doi.org/10.1145/3582016.3582039openalex-snapshot
Verification of Nondeterministic Quantum Programs
inferred← citeshttps://doi.org/10.1145/3591270openalex-snapshot
An Automata-Based Framework for Verification and Bug Hunting in Quantum Circuits
inferred← citeshttps://doi.org/10.1145/3624483openalex-snapshot
Formal Verification of Quantum Programs: Theory, Tools, and Challenges
inferred← citeshttps://doi.org/10.1145/3691632openalex-snapshot
Termination and Universal Termination Problems for Nondeterministic Quantum Programs
inferred← citeshttps://doi.org/10.1145/3704868openalex-snapshot
Verifying Quantum Circuits with Level-Synchronized Tree Automata
inferred← citeshttps://doi.org/10.1145/3704878openalex-snapshot
Automating Equational Proofs in Dirac Notation
inferred← citeshttps://doi.org/10.1145/3720433openalex-snapshot
QbC: Quantum Correctness by Construction
inferred← citeshttps://doi.org/10.1145/3729293openalex-snapshot
Efficient Formal Verification of Quantum Error Correcting Programs
inferred← citeshttps://doi.org/10.1145/3756907.3756908openalex-snapshot
Counting Qubits and Gates: Resource Analysis in Quantum Programming Languages
inferred← citeshttps://doi.org/10.1145/3763157openalex-snapshot
Embedding Quantum Program Verification into Dafny
inferred← citeshttps://doi.org/10.1145/3770083openalex-snapshot
Refinement Calculus of Quantum Programs with Projective Assertions
inferred← citeshttps://doi.org/10.1145/3776658openalex-snapshot
An Expressive Assertion Language for Quantum Programs
inferred← citeshttps://doi.org/10.1145/3776712openalex-snapshot
Parameterized Verification of Quantum Circuits
inferred← citeshttps://doi.org/10.1145/3783996openalex-snapshot
A Brief History of Formal Methods in China
inferred← citeshttps://doi.org/10.1145/3808314openalex-snapshot
Hybrid Path-Sums for Hybrid Quantum Programs
inferred← citeshttps://doi.org/10.1145/3839506openalex-snapshot
Verifying Repeat-until-Success Protocols using Automata
inferred← citeshttps://doi.org/10.2139/ssrn.4157524openalex-snapshot
Abstract Interpretation, Hoare Logic, and Incorrectness Logic for Quantum Programs
inferred← citeshttps://doi.org/10.2139/ssrn.7361162openalex-snapshot
Local Reasoning about Probabilistic Behaviour for Classical-Quantum Programs
inferred← citeshttps://doi.org/10.22331/q-2026-07-23-2172openalex-snapshot
Hoare meets Heisenberg: A Lightweight Logic for Quantum Programs
inferred← citeshttps://doi.org/10.48550/arxiv.2102.00759openalex-snapshot
Ethical Quantum Computing: A Roadmap
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.