14 papers
(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…
Catalytic entanglement transformations with noisy hardware
Hemant Sharma, Aleksandr Mokeev, Jonas Helsen +1
The availability of certain entangled resource states (catalyst states) can enhance the rate of converting several less entangled states into fewer highly entangled states in a pro…
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…
Trotter error and gate complexity of the SYK and sparse SYK models
Yiyuan Chen, Jonas Helsen, Maris Ozols
The Sachdev--Ye--Kitaev (SYK) model is a prominent model of strongly interacting fermions that serves as a toy model of quantum gravity and black hole physics. In this work, we stu…