Lower bounds on bipartite entanglement in noisy graph states
Abstract: Graph states are a key resource for a number of applications in quantum information theory. Due to the inherent noise in noisy intermediate-scale quantum (NISQ) era devices, it is important to understand the effects noise has on the usefulness of graph states. We consider a noise model where the initial qubits undergo depolarizing noise before the application of the CZ operations that generate edges between qubits situated at the nodes of the resulting graph state. For this model we develop a method for calculating the coherent information -- a lower bound on the rate at which entanglement can be distilled, across a bipartition of the graph state. We also identify some patterns on how adding more nodes or edges affects the bipartite distillable entanglement. As an application, we find a family of graph states that maintain a strictly positive coherent information for any amount of (non-maximal) depolarizing noise.
- All-photonic quantum repeaters. Nature Communications, 6(1), April 2015.
- Fusion-based quantum computation, 2021.
- Entangling quantum memories via heralded photonic bell measurement. Phys. Rev. Res., 5(3):033149, September 2023.
- Distillation of secret key and entanglement from quantum states. Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, 461(2053):207–235, jan 2005.
- Entanglement in the stabilizer formalism. arXiv preprint quant-ph/0406168, 2004.
- Distributing graph states across quantum networks. In 2021 IEEE International Conference on Quantum Computing and Engineering (QCE), pages 324–333, 2021.
- Purification of large bicolorable graph states. Physical Review A, 74(3):032318, 2006.
- Daniel Gottesman. Stabilizer codes and quantum error correction. arXiv preprint quant-ph/9705052, 1997.
- Reverse coherent information. Physical Review Letters, 102(21), may 2009.
- Entanglement in graph states and its applications. arXiv preprint quant-ph/0602096, 2006.
- Multiparty entanglement in graph states. Physical Review A, 69(6):062311, 2004.
- A.Yu. Kitaev. Fault-tolerant quantum computation by anyons. Annals of Physics, 303(1):2–30, January 2003.
- Distributing graph states over arbitrary quantum networks. Phys. Rev. A, 100(5):052333, November 2019.
- Clifford manipulations of stabilizer states: A graphical rule book for clifford unitaries and measurements on cluster states, and application to photonic quantum computing. arXiv preprint arXiv:2312.02377, 2023.
- A one-way quantum computer. Phys. Rev. Lett., 86:5188–5191, May 2001.
- Peter W. Shor. Scheme for reducing decoherence in quantum computer memory. Phys. Rev. A, 52:R2493–R2496, Oct 1995.
- Graph states as a resource for quantum metrology. Phys. Rev. Lett., 124:110502, Mar 2020.
- Quantum repeaters based on atomic ensembles and linear optics. Rev. Mod. Phys., 83:33–80, Mar 2011.
- Quantum internet: A vision for the road ahead. Science, 362(6412):eaam9288, 2018.
- Mark M Wilde. From classical to quantum shannon theory. arXiv preprint arXiv:1106.1445, 2011.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.