3 citations · 7 across the 17 of their papers we have counts for
18 papers
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 …
Clifford testing: algorithms and lower bounds
Marcel Hinsche, Zongbo Bao, Philippe van Dordrecht +3
We consider the problem of Clifford testing, which asks whether a black-box -qubit unitary is a Clifford unitary or at least -far from every Clifford unitary. We gi…
Anticoncentration is (almost) all you need
Markus Heinrich, Jonas Haferkamp, Ingo Roth +1
Until very recently, it was generally believed that the (approximate) 2-design property is strictly stronger than anticoncentration of random quantum circuits, mainly because it wa…
Will it glue? On short-depth designs beyond the unitary group
Lorenzo Grevink, Jonas Haferkamp, Markus Heinrich +4
We study the formation of short-depth designs beyond the unitary group. We provide a range of results on several groups of broad interest in quantum information science: the Cliffo…
Minimising the number of edges in LC-equivalent graph states
Hemant Sharma, Kenneth Goodenough, Johannes Borregaard +2
Graph states are a powerful class of entangled states with numerous applications in quantum communication and quantum computation. Local Clifford (LC) operations that map one graph…
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…
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…
Random regular graph states are complex at almost any depth
Soumik Ghosh, Dominik Hangleiter, Jonas Helsen
Graph states are fundamental objects in the theory of quantum information due to their simple classical description and rich entanglement structure. They are also intimately relate…
Single-copy stabilizer testing
Marcel Hinsche, Jonas Helsen
We consider the problem of testing whether an unknown -qubit quantum state is a stabilizer state, with only single-copy access. We give an algorithm solving this pro…
Tolerant testing of stabilizer states with a polynomial gap via a generalized uncertainty relation
Zongbo Bao, Philippe van Dordrecht, Jonas Helsen
We prove a conjecture of Arunachalam & Dutt ([AD24]) on the existence of a tolerant stabilizer testing algorithm, and achieve an exponential improvement in the parameters of the te…
Mutual information fluctuations and non-stabilizerness in random circuits
Arash Ahmadi, Jonas Helsen, Cagan Karaca +1
The emergence of quantum technologies has brought much attention to the characterization of quantum resources as well as the classical simulatability of quantum processes. Quantum…
Noise-mitigated randomized measurements and self-calibrating shadow estimation
E. Onorati, J. Kitzinger, J. Helsen +4
Randomized measurements are increasingly appreciated as powerful tools to estimate properties of quantum systems, e.g., in the characterization of hybrid classical-quantum computat…
Quantum PCPs: on Adaptivity, Multiple Provers and Reductions to Local Hamiltonians
Harry Buhrman, Jonas Helsen, Jordi Weggemans
We define a general formulation of quantum PCPs, which captures adaptivity and multiple unentangled provers, and give a detailed construction of the quantum reduction to a local Ha…