Pith. sign in

REVIEW 2 cited by

Bell Inequalities for Graph States

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv quant-ph/0410059 v2 pith:FD5DNXFX submitted 2004-10-07 quant-ph

classification quant-ph
keywords graphstatesinequalitiesbellentanglementmaximallypropertiesstate
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

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 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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Calibrated hypergraph states: II calibrated hypergraph state construction and applications

    quant-ph 2025-01 conditional novelty 6.0 of 10

    Calibrated hypergraph states over Galois rings generalize weighted hypergraph states, are stabilizer and locally maximally entangleable, and reduce to the weighted class in the qubit case only.

  2. Calibrated hypergraph states: I calibrated hypergraph and multi qudit state monads

    quant-ph 2025-01 conditional novelty 6.0 of 10

    Calibrated hypergraphs and multi-qudit states are shown to form graded Ω monads, providing a categorical foundation for a broad generalization of hypergraph states.

Pith tools