3 citations · 7 across the 17 of their papers we have counts for
6 papers · 1 filter
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…