Physical Review Letters · 2005 · 235 citations · 28 references
Natural SciencesPhysicsInformation TheoryQuantum ComputingQuantum MechanicsGraph TheoryQuantum BitsQuantum EntanglementQuantum Information TheoryQuantum MeasurementQuantum StatesBell InequalitiesBell NonlocalityBell StatesBipartite EntanglementEntanglement MeasuresEntanglement TheoryGeometric Measure Theory
We investigate the nonlocal properties of graph states. To this aim, we derive a family of Bell inequalities which require three measurement settings for each party and are maximally violated by graph states. In turn, for each graph state there is an inequality maximally violated only by that state. We show that for certain types of graph states the violation of these inequalities increases exponentially with the number of qubits. We also discuss connections to other entanglement properties such as the positivity of the partial transpose or the geometric measure of entanglement.
28
Robert Raussendorf, Hans J. Briegel · Physical Review Letters · 2001 · 4.5K citations
Bell’s theorem without inequalities
Daniel M. Greenberger, Michael Horne, Abner Shimony et al. · American Journal of Physics · 1990 · 2.4K citations · Full text
Experimental one-way quantum computing
Philip Walther, Katharina Resch, Terry Rudolph et al. · Nature · 2005 · 1.3K citations · Full text