A note of Bell inequalities for graph states
From MaRDI portal
Publication:2239626
DOI10.1007/S10773-020-04647-2OpenAlexW3152620656MaRDI QIDQ2239626FDOQ2239626
Authors: Mengfei Niu, Xiaole Lv, Zhengli Chen, Wen-Hua Wang 
Publication date: 5 November 2021
Published in: International Journal of Theoretical Physics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10773-020-04647-2
Recommendations
Communication, information (94Axx) Groups and algebras in quantum theory (81Rxx) Foundations, quantum information and its processing, quantum axioms, and philosophy (81Pxx)
Cites Work
- Quantum cryptography based on Bell’s theorem
- Proposed experiment to test local hidden-variable theories
- Steering, entanglement, nonlocality, and the Einstein-Podolsky-Rosen paradox
- Graph states for quantum secret sharing
- Quantum secret sharing
- Self-testing protocols based on the chained Bell inequalities
- Multiparty entanglement in graph states
- Self testing quantum apparatus
- A note on quantum coherence
- A note of coherence for duality quantum computers acting on pure states
Cited In (6)
- Scalable Bell inequalities for graph states of arbitrary prime local dimension and self-testing
- Shor–Laflamme distributions of graph states and noise robustness of entanglement
- Condition for zero and nonzero discord in graph Laplacian quantum states
- A graph-separation theorem for quantum causal models
- Quantum experiments and graphs II: Quantum interference, computation, and state generation
- A bonding model of entanglement for N-qubit graph states
This page was built for publication: A note of Bell inequalities for graph states
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2239626)
