2 papers
cs.CC2026
Certification complexity of Boolean functions
Chandrima Kayal, Sophie Laplante, Émile Larroque +2
Certificate complexity is a fundamental measure of complexity of Boolean functions f which counts the number of bits of an input that need to be known in order for the va…
quant-ph2023
Complete Graphical Language for Hermiticity-Preserving Superoperators
Titouan Carette, Timothée Hoffreumon, Émile Larroque +1
Universal and complete graphical languages have been successfully designed for pure state quantum mechanics, corresponding to linear maps between Hilbert spaces, and mixed states q…