3 citations · 7 across the 17 of their papers we have counts for
6 papers · 1 filter
Logical information localisation in stabiliser codes via single-qubit measurements
Jelena Mackeprang, Hemant Sharma, Jonas Helsen
Stabiliser path finding (SPF) has previously been introduced as a method to localise logical information in a stabiliser code undergoing loss onto a single pre-specified target qub…
(Almost) quadruply optimal unitary designs in 1D
Guoding Liu, Jonas Helsen
We construct -qubit approximate unitary -designs in 1D systems, achieving circuit depth with relative error and requiring $O(…
On Clifford hierarchy testing and near-extremizers of noncommutative uniformity norms
Zongbo, Bao, Jop Briët +3
We consider the problem of testing whether an unknown unitary is close to a specified level of the Clifford hierarchy. Bu, Gu, and Jaffe proposed a candidate tester for this task b…
Arts & crafts: Strong random unitaries and geometric locality
Marten Folkertsma, Lorenzo Grevink, Jonas Helsen +1
We study the problem of constructing strong approximate unitary -designs on -dimensional grids (and more generally on Cartesian products of graphs), building on the work of S…
Error correction with brickwork Clifford circuits
Twan Kroll, Jonas Helsen
We prove that random 1D Clifford brickwork circuits form (in expectation) good approximate quantum error correction codes in logarithmic depth. Our proof makes use of the statistic…
A Bravyi-König theorem for Floquet codes generated by locally conjugate instantaneous stabiliser groups
Jelena Mackeprang, Jonas Helsen
The Bravyi-König (BK) theorem is an important no-go theorem for the dynamics of topological stabiliser quantum error correcting codes. It states that any logical operation on a …