46 citations · 217 across the 25 of their papers we have counts for
28 papers
Circular sorting, strong complete mappings and wreath product constructions
Paul Bastide, Anurag Bishnoi, Carla Groenland +2
We continue the study of Adin, Alon and Roichman [arXiv:2502.14398, 2025] on the number of steps required to sort labelled points on a circle by transpositions. Imagine that th…
Semidefinite lower bounds for covering codes
Dion Gijswijt, Sven Polak
Let denote the minimum size of a -ary covering code of word length and covering radius . In other words, is the minimum size of a set of -ary cod…
Automorphism groups of Cayley graphs generated by general transposition sets
Dion Gijswijt, Frank de Meijer
In this paper we study the Cayley graph of the symmetric group generated by a set of transpositions . We show that for the Cayley graph is…
Exploiting Symmetries in Optimal Quantum Circuit Design
Frank de Meijer, Dion Gijswijt, Renata Sotirov
A physical limitation in quantum circuit design is the fact that gates in a quantum system can only act on qubits that are physically adjacent in the architecture. To overcome this…
Near-term to distillation protocols using graph codes
Kenneth Goodenough, Sébastian de Bone, Vaishnavi L. Addala +4
Noisy hardware forms one of the main hurdles to the realization of a near-term quantum internet. Distillation protocols allows one to overcome this noise at the cost of an increase…
Blocking sets, minimal codes and trifferent codes
Anurag Bishnoi, Jozefien D'haeseleer, Dion Gijswijt +1
We prove new upper bounds on the smallest size of affine blocking sets, that is, sets of points in a finite affine space that intersect every affine subspace of a fixed codimension…