1.1k citations · 2.9k across the 11 of their papers we have counts for
Showing 2004Show all
2 papers · 1 filter
quant-ph2004★ 5 cited
Algorithmic complexity of quantum states
C. Mora, H. J. Briegel
In this paper we give a definition for the Kolmogorov complexity of a pure quantum state. In classical information theory the algorithmic complexity of a string is a measure of the…
quant-ph2004★ 236 cited
Bell Inequalities for Graph States
Otfried Guehne, Geza Toth, Philipp Hyllus +1
We investigate the non-local properties of graph states. To this aim, we derive a family of Bell inequalities which require three measurement settings for each party and are maxima…