activity
20212026
most citedComposing Conversational Negation

4 citations · 11 across the 11 of their papers we have counts for

collaborators

12 papers

quant-ph2026

SpiderCSS: Scalable Fault-Tolerant CSS State Preparation

Boldizsár Poór, Andrey Boris Khesin, Sarah Meng Li +3

Fault-tolerant preparation of logical states is a critical primitive for the realization of large-scale fault-tolerant quantum computing. This paper introduces SpiderCSS, a scalabl…

quant-ph2026

Resource-adaptive distributed fault tolerance with very noisy Bell pairs

Moritz Schmidt, Martin Moureau, Benjamin Rodatz +3

Distributed architectures have been proposed as a pathway to large-scale quantum computers. Combined with the need for fault-tolerance, such architectures require distributed quant…

quant-ph2026

Preserving MWPM-Decodability in Fault-Equivalent Rewrites

Maximilian Schweikart, Linnea Grans-Samuelsson, Aleks Kissinger +1

Decoding a quantum error correction code is generally NP-hard, but corrections must be applied at a high frequency to suppress noise successfully. Matchable codes, like the surface…

quant-ph2026★ 1 cited

SpiderCat: Optimal Fault-Tolerant Cat State Preparation

Andrey Boris Khesin, Sarah Meng Li, Boldizsár Poór +3

The ability to fault-tolerantly prepare CAT states, also known as multi-qubit GHZ states, is an important primitive for quantum error correction. It is required for Shor-style synd…

quant-ph2025

Ultra Low Overhead Syndrome Extraction for the Steane code

Boldizsár Poór, Benjamin Rodatz, Aleks Kissinger

We establish a new performance benchmark for the fault-tolerant syndrome extraction of the [[7, 1, 3]] Steane code with a dynamic protocol. Our method is built on two highly optimi…

quant-ph2025

Completeness for Fault Equivalence of Clifford ZX Diagrams

Maximilian Rüsch, Aleks Kissinger, Benjamin Rodatz

Two circuits are considered to be equivalent under noise if the effect of faults on one circuit is no worse than the effect of faults on the other circuit. We call this relationshi…

quant-ph2025★ 2 cited

Fault Tolerance by Construction

Benjamin Rodatz, Boldizsár Poór, Aleks Kissinger

A key challenge in fault-tolerant quantum computing is synthesising and optimising circuits in a noisy environment, as traditional techniques often fail to account for the effect o…

quant-ph2024★ 3 cited

Floquetifying stabiliser codes with distance-preserving rewrites

Benjamin Rodatz, Boldizsár Poór, Aleks Kissinger

Stabiliser codes with large weight measurements can be challenging to implement fault-tolerantly. To overcome this, we propose a Floquetification procedure which, given a stabilise…

cs.LG2024

A Pattern Language for Machine Learning Tasks

Benjamin Rodatz, Ian Fan, Tuomas Laakkonen +3

We formalise the essential data of objective functions as equality constraints on composites of learners. We call these constraints "tasks", and we investigate the idealised view t…

cs.CL2023★ 1 cited

A Pipeline For Discourse Circuits From CCG

Jonathon Liu, Razin A. Shaikh, Benjamin Rodatz +2

There is a significant disconnect between linguistic theory and modern NLP practice, which relies heavily on inscrutable black-box architectures. DisCoCirc is a newly proposed mode…

cs.CL2021★ 4 cited

Composing Conversational Negation

Razin A. Shaikh, Lia Yeh, Benjamin Rodatz +1

Negation in natural language does not follow Boolean logic and is therefore inherently difficult to model. In particular, it takes into account the broader understanding of what is…

cs.CG2021

Near-Delaunay Metrics

Nathan van Beusekom, Kevin Buchin, Hidde Koerts +3

We study metrics that assess how close a triangulation is to being a Delaunay triangulation, for use in contexts where a good triangulation is desired but constraints (e.g., maximu…