4 papers
Approximately Decoding the Colour Code
Mark Walters
Recently we showed that minimum weight decoding in the (6.6.6 planar) colour code is NP-hard. However, it remained an open question as to whether it was possible to approximate the…
Generalised Prisms and Euclidean Ramsey Theory
Maria-Romina Ivan, Imre Leader, Mark Walters
A finite subset of is called Ramsey if for every there exists an such that whenever is -coloured there exists a monochromatic congruent c…
A parallel wakeup problem and multi-room light switch strategies
John Haslegrave, Paul A. Russell, Mark Walters
The wakeup problem in distributed computing asks for a symmetric protocol that enables one of several processors to eventually guarantee that all (or, in a more general setting, en…
Minimum Weight Decoding in the Colour Code is NP-hard
Mark Walters, Mark L. Turner
All utility-scale quantum computers will require some form of Quantum Error Correction in which logical qubits are encoded in a larger number of physical qubits. One promising enco…