2000 character limit reached
Quantum LOSR networks cannot generate graph states with high fidelity
Published 25 Aug 2022 in quant-ph | (2208.12100v2)
Abstract: Quantum networks lead to novel notions of locality and correlations and an important problem concerns the question of which quantum states can be experimentally prepared with a given network structure and devices and which not. We prove that all multi-qubit graph states arising from a connected graph cannot originate from any quantum network with bipartite sources, as long as feed-forward and quantum memories are not available. Moreover, the fidelity of a multi-qubit graph state and any network state cannot exceed $9/10$. Similar results can also be established for a large class of multi-qudit graph states.
- V. Giovannetti, S. Lloyd, and L. Maccone, Quantum metrology, Phys. Rev. Lett. 96, 010401 (2006).
- D. P. DiVincenzo, Quantum computation, Science 270, 255 (1995).
- C. H. Bennett and G. Brassard, Quantum cryptography: Public key distribution and coin tossing, Theor. Comput. Sci. 560, 7 (2014).
- F. Hahn, J. de Jong, and A. Pappa, Anonymous quantum conference key agreement, PRX Quantum 1, 020325 (2020).
- G. Vidal, W. Dür, and J. I. Cirac, Reversible combination of inequivalent kinds of multipartite entanglement, Phys. Rev. Lett. 85, 658 (2000).
- W. Dür, J. I. Cirac, and R. Tarrach, Separability and distillability of multiparticle quantum systems, Phys. Rev. Lett. 83, 3562 (1999).
- M. Horodecki, P. Horodecki, and R. Horodecki, Separability of mixed states: Necessary and sufficient conditions, Phys. Lett. A 223, 1 (1996).
- B. M. Terhal, Bell inequalities and the separability criterion, Phys. Lett. A 271, 319 (2000).
- O. Gühne, Y. Mao, and X.-D. Yu, Geometry of faithful entanglement, Phys. Rev. Lett. 126, 140503 (2021).
- A. Peres, Separability Criterion for Density Matrices, Phys. Rev. Lett. 77, 1413 (1996).
- O. Gühne and M. Seevinck, Separability criteria for genuine multiparticle entanglement, New J. Phys. 12, 053002 (2010).
- K. M. Audenaert and M. B. Plenio, Entanglement on mixed stabilizer states: normal forms and reduction procedures, New J. Phys. 7, 170 (2005).
- M. Hein, W. Dür, J. Eisert, R. Raussendorf, M. Nest, and H.-J. Briegel, Entanglement in graph states and its applications, in Proc. International School of Physics “Enrico Fermi”, Vol. 162 (2006) pp. 115–218, see also: arXiv:quant-ph/0602096.
- C. Palazuelos and J. I. de Vicente, Genuine multipartite entanglement of quantum states in the multiple-copy scenario, Quantum 6, 735 (2022).
- M.-X. Luo, New genuinely multipartite entanglement, Adv. Quantum Technol. 4, 2000123 (2021).
- E. Wolfe, R. W. Spekkens, and T. Fritz, The inflation technique for causal inference with latent variables, J. Causal Inference 7, 20170020 (2019).
- F. Huber and O. Gühne, Characterizing ground and thermal states of few-body Hamiltonians, Phys. Rev. Lett. 117, 010403 (2016).
- M. Bahramgiri and S. Beigi, Graph states under the action of local Clifford group in non-binary case, (2006), arXiv:0610267 [quant-ph] .
- E. Hostens, J. Dehaene, and B. De Moor, Stabilizer states and clifford operations for systems of arbitrary dimensions and modular arithmetic, Phys. Rev. A 71, 042315 (2005).
- D. Schlingemann, Stabilizer codes can be realized as graph codes, Quantum Inf. Comput. 4, 287 (2004).
- O. Makuta, L. T. Ligthart, and R. Augusiak, No graph states can be prepared in quantum networks with bipartite sources, (2022), arXiv:2208.12099 [quant-ph] .
- G. Tóth and O. Gühne, Entanglement detection in the stabilizer formalism, Phys. Rev. A 72, 022340 (2005).
- D. J. Griffiths, Introduction to Quantum Mechanics (Pearson, 2005).
Paper Prompts
Sign up for free to create and run prompts on this paper.
