3 papers
math.CT2026
A Critical Pair Enumeration Algorithm for String Diagram Rewriting
Anna Matsui, Innocent Obi, Guillaume Sabbagh +4
Critical pair analysis provides a convenient and computable criterion of confluence, which is a fundamental property in rewriting theory, for a wide variety of rewriting systems. B…
quant-ph2025
Why cut-and-choose quantum state verification cannot be both efficient and secure
Fabian Wiesner, Ziad Chaoui, Diana Kessler +2
Quantum state verification plays a vital role in many quantum cryptographic protocols, as it allows the use of quantum states from untrusted sources. While some progress has been m…
quant-ph2024
Why quantum state verification cannot be both efficient and secure: a categorical approach
Fabian Wiesner, Ziad Chaoui, Diana Kessler +2
The advantage of quantum protocols lies in the inherent properties of the shared quantum states. These states are sometimes provided by sources that are not trusted, and therefore…