10 citations · 10 across the 2 of their papers we have counts for
7 papers
Fully Characterizing Lossy Catalytic Computation
Marten Folkertsma, Ian Mertz, Florian Speelman +1
A catalytic machine is a model of computation where a traditional space-bounded machine is augmented with an additional, significantly larger, "catalytic" tape, which, while being…
An efficient combination of quantum error correction and authentication
Yfke Dulek, Garazi Muguruza, Florian Speelman
When sending quantum information over a channel, we want to ensure that the message remains intact. Quantum error correction and quantum authentication both aim to protect (quantum…
A Guide for New Program Committee Members at Theoretical Computer Science Conferences
Yfke Dulek, Stacey Jeffery, Christian Majenz +3
In theoretical computer science, conferences play an important role in the scientific process. The decisions whether to accept or reject articles is taken by the program committee…
The Quantum Strong Exponential-Time Hypothesis
Harry Buhrman, Subhasree Patro, Florian Speelman
The strong exponential-time hypothesis (SETH) is a commonly used conjecture in the field of complexity theory. It states that CNF formulas cannot be analyzed for satisfiability wit…
Round elimination in exact communication complexity
Jop Briët, Harry Buhrman, Debbie Leung +2
We study two basic graph parameters, the chromatic number and the orthogonal rank, in the context of classical and quantum exact communication complexity. In particular, we conside…
Asymptotic performance of port-based teleportation
Matthias Christandl, Felix Leditzky, Christian Majenz +3
Quantum teleportation is one of the fundamental building blocks of quantum Shannon theory. While ordinary teleportation is simple and efficient, port-based teleportation (PBT) enab…