Paper sets out information-flow security proofs for quantum programs
Original title: Secure Information Flow in Quantum Programs
Noninterference and simulation-based definitions are proved equivalent, with verification via quantum Hoare logic and self-conjugation.
The paper develops semantic foundations and verification methods for secure information flow in quantum programs, where superposition, entanglement, and mixed classical-quantum state make leakage harder to reason about. It defines a noninterference notion that generalizes the classical one and a simulation-based notion that models an attacker, then proves the two equivalent. Standard self-composition fails because of an obstruction analogous to the no-cloning theorem, so the authors introduce self-conjugation using the deferred measurement principle and properties of unitary operations, inside a quantum Hoare logic proof framework. Examples are drawn from the quantum one-time pad, quantum error correction, and anonymous entanglement generation.
- Two security notions, noninterference and attacker simulation, are proved equivalent.
- Self-composition is rejected because of a no-cloning-like obstruction.
- Self-conjugation uses deferred measurement and unitary properties.
- Verification is framed in quantum Hoare logic.
- Examples include the quantum one-time pad and quantum error correction.
From the original article
1 min read at arxiv.orgInformation-flow security aims to prevent the leakage of confidential information through program execution. This problem becomes fundamentally subtler for quantum programs, because their states may involve superposition and entanglement, and their executions may involve intricate interactions between classical and quantum variables.
By Zhicheng Zhang · arxiv.org
A short excerpt; the article and its images belong to the publisher. Summary, key facts and assessment above are AI-written from the article and can be wrong.