From the 1 of 7 linked papers with an AI index.
7 papers
UC, Categorically: Rigorous Diagrammatic Proofs
Pooya Farshim, Martti Karvonen, Andre Knispel +2
Category theory is a mathematical theory of composition, widely used in logic, computing, and physics. Here we apply it to give a theory of secure composition. In particular, we pr…
Algebraic paradoxes in adaptive quantum computation
Samson Abramsky, Rui Soares Barbosa, Carmen Constantin +1
The paper shows that any adaptive Z₂‑linear measurement‑based quantum computation that deterministically computes a non‑affine Boolean function must involve a quantum resource that…
Comment on 'The axiom of choice and the no-signalling principle'
Martti Karvonen
The main claim of Baumeler et al. (Proc. R. Soc. A 481, 20240601; arXiv:2206.08467) is that "functional (deterministic) no-signalling resources can be stronger than probabilistic o…
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…
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…
Towards a Unified Theory of Time-Varying Data
Benjamin Merlin Bumpus, James Fairbanks, Martti Karvonen +2
What is a time-varying graph, a time-varying topological space, or, more generally, a mathematical structure that evolves over time? In this work, we lay the foundations for a gene…