2000 character limit reached
Noise robustness and threshold of many-body quantum magic
Published 28 Oct 2024 in quant-ph | (2410.21215v1)
Abstract: Understanding quantum magic (i.e., nonstabilizerness) in many-body quantum systems is challenging but essential to the study of quantum computation and many-body physics. We investigate how noise affects magic properties in entangled many-body quantum states by quantitatively examining the magic decay under noise, with a primary aim being to understand the stability of magic associated with different kinds of entanglement structures. As a standard model, we study hypergraph states, a representative class of many-body magic states, subject to depolarizing noise. First, we show that interactions facilitated by high-degree gates are fragile to noise. In particular, the $\mathrm{C}{n-1}Z$ state family exhibits a vanishing magic threshold of $\Theta(1/n)$. Furthermore, we demonstrate efficiently preparable families of hypergraph states without local magic but with a non-vanishing magic threshold which signifies robust magic that is entirely embedded in global entanglement. We also discuss the qudit case based on the discrete Wigner formalism.
- Aram W. Harrow and Ashley Montanaro, “Quantum computational supremacy,” Nature 549, 203–209 (2017).
- Eric Chitambar and Gilad Gour, “Quantum resource theories,” Rev. Mod. Phys. 91, 025001 (2019).
- Daniel Gottesman, “The heisenberg representation of quantum computers,” arXiv preprint quant-ph/9807006 (1998).
- Scott Aaronson and Daniel Gottesman, “Improved simulation of stabilizer circuits,” Phys. Rev. A 70, 052328 (2004).
- Sergey Bravyi and Alexei Kitaev, “Universal quantum computation with ideal clifford gates and noisy ancillas,” Phys. Rev. A 71, 022316 (2005).
- Victor Veitch, S A Hamed Mousavian, Daniel Gottesman, and Joseph Emerson, “The resource theory of stabilizer quantum computation,” New Journal of Physics 16, 013009 (2014).
- Mark Howard and Earl Campbell, “Application of a resource theory for magic states to fault-tolerant quantum computing,” Phys. Rev. Lett. 118, 090501 (2017).
- Zi-Wen Liu and Andreas Winter, “Many-body quantum magic,” PRX Quantum 3, 020333 (2022).
- John Preskill, “Quantum Computing in the NISQ era and beyond,” Quantum 2, 79 (2018).
- Sitan Chen, Jordan Cotler, Hsin-Yuan Huang, and Jerry Li, “The complexity of nisq,” Nature Communications 14, 6001 (2023).
- Peter W. Shor, “Scheme for reducing decoherence in quantum computer memory,” Phys. Rev. A 52, R2493–R2496 (1995).
- Daniel Gottesman, Stabilizer Codes and Quantum Error Correction, Ph.D. thesis, California Institute of Technology (1997).
- Dorit Aharonov, Xun Gao, Zeph Landau, Yunchao Liu, and Umesh Vazirani, “A polynomial-time classical algorithm for noisy random circuit sampling,” in Proceedings of the 55th Annual ACM Symposium on Theory of Computing, STOC 2023 (Association for Computing Machinery, New York, NY, USA, 2023) p. 945–957.
- Yuguo Shao, Fuchuan Wei, Song Cheng, and Zhengwei Liu, “Simulating noisy variational quantum algorithms: A polynomial approach,” Phys. Rev. Lett. 133, 120603 (2024).
- Thomas Schuster, Chao Yin, Xun Gao, and Norman Y Yao, “A polynomial-time classical algorithm for noisy quantum circuits,” arXiv preprint arXiv:2407.12768 (2024).
- Weixiao Sun, Fuchuan Wei, Yuguo Shao, and Zhaohui Wei, “The sudden death of quantum advantage in correlation generations,” arXiv preprint arXiv:2407.03088 (2024).
- Ryszard Horodecki, Paweł Horodecki, Michał Horodecki, and Karol Horodecki, “Quantum entanglement,” Rev. Mod. Phys. 81, 865–942 (2009).
- Patricia Contreras-Tejada, Carlos Palazuelos, and Julio I. de Vicente, “Asymptotic survival of genuine multipartite entanglement in noisy quantum networks depends on the topology,” Phys. Rev. Lett. 128, 220501 (2022).
- Daniel Miller, Daniel Loss, Ivano Tavernelli, Hermann Kampermann, Dagmar Bruß, and Nikolai Wyderka, “Shor–laflamme distributions of graph states and noise robustness of entanglement,” Journal of Physics A: Mathematical and Theoretical 56, 335303 (2023).
- M Rossi, M Huber, D Bruß, and C Macchiavello, “Quantum hypergraph states,” New Journal of Physics 15, 113022 (2013).
- Ri Qu, Juan Wang, Zong-shang Li, and Yan-ru Bao, “Encoding hypergraphs into quantum states,” Phys. Rev. A 87, 022311 (2013).
- Michael Levin and Zheng-Cheng Gu, “Braiding statistics approach to symmetry-protected topological phases,” Phys. Rev. B 86, 115109 (2012).
- Jacob Miller and Akimasa Miyake, “Hierarchy of universal entanglement in 2d measurement-based quantum computation,” npj Quantum Information 2, 16036 (2016).
- Jacob Miller and Akimasa Miyake, “Latent computational complexity of symmetry-protected topological order with fractional symmetry,” Phys. Rev. Lett. 120, 170503 (2018).
- Tyler D. Ellison, Kohtaro Kato, Zi-Wen Liu, and Timothy H. Hsieh, “Symmetry-protected sign problem and magic in quantum phases of matter,” Quantum 5, 612 (2021).
- Robert Raussendorf and Hans J. Briegel, “A one-way quantum computer,” Phys. Rev. Lett. 86, 5188–5191 (2001).
- Markus Heinrich and David Gross, “Robustness of Magic and Symmetries of the Stabiliser Polytope,” Quantum 3, 132 (2019).
- Hiroki Hamaguchi, Kou Hamada, and Nobuyuki Yoshioka, “Handbook for efficiently quantifying robustness of magic,” arXiv preprint arXiv:2311.01362 (2023).
- Lorenzo Leone, Salvatore F. E. Oliviero, and Alioscia Hamma, “Stabilizer rényi entropy,” Phys. Rev. Lett. 128, 050402 (2022).
- James R. Seddon and Earl T. Campbell, “Quantifying magic for multi-qubit operations,” Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences 475, 20190251 (2019).
- Michael Beverland, Earl Campbell, Mark Howard, and Vadym Kliuchnikov, “Lower bounds on the non-clifford resources for quantum computations,” Quantum Science and Technology 5, 035009 (2020).
- Yosep Kim, Alexis Morvan, Long B. Nguyen, Ravi K. Naik, Christian Jünger, Larry Chen, John Mark Kreikebaum, David I. Santiago, and Irfan Siddiqi, “High-fidelity three-qubit itoffoli gate for fixed-frequency superconducting qubits,” Nature Physics 18, 783–788 (2022).
- Long B. Nguyen, Yosep Kim, Akel Hashim, Noah Goss, Brian Marinelli, Bibek Bhandari, Debmalya Das, Ravi K. Naik, John Mark Kreikebaum, Andrew N. Jordan, David I. Santiago, and Irfan Siddiqi, “Programmable heisenberg interactions between floquet qubits,” Nature Physics 20, 240–246 (2024).
- D. Bluvstein, S. J. Evered, A. A. Geim, S. H. Li, H. Zhou, T. Manovitz, S. Ebadi, M. Cain, M. Kalinowski, D. Hangleiter, J. P. B. Ataides, N. Maskara, I. Cong, X. Gao, P. S. Rodriguez, T. Karolyshyn, G. Semeghini, M. J. Gullans, M. Greiner, V. Vuletić, and M. D. Lukin, “Logical quantum processor based on reconfigurable atom arrays,” Nature 626, 58–65 (2024).
- Yi-Fei Wang, Yixu Wang, Yu-An Chen, Wenjun Zhang, Tao Zhang, Jiazhong Hu, Wenlan Chen, Yingfei Gu, and Zi-Wen Liu, “Efficient fault-tolerant implementations of non-Clifford gates with reconfigurable atom arrays,” arXiv e-prints , arXiv:2312.09111 (2023), arXiv:2312.09111 [quant-ph] .
- Xin Wang, Mark M. Wilde, and Yuan Su, “Efficiently computable bounds for magic state distillation,” Phys. Rev. Lett. 124, 090505 (2020).
- A. Mari and J. Eisert, “Positive wigner functions render classical simulation of quantum computation efficient,” Phys. Rev. Lett. 109, 230503 (2012).
- F. E. S. Steinhoff, C. Ritz, N. I. Miklin, and O. Gühne, “Qudit hypergraph states,” Phys. Rev. A 95, 052340 (2017).
- Fei-Lei Xiong, Yi-Zheng Zhen, Wen-Fei Cao, Kai Chen, and Zeng-Bing Chen, “Qudit hypergraph states and their properties,” Phys. Rev. A 97, 012323 (2018).
- Lingxuan Feng and Shunlong Luo, “Connecting continuous and discrete wigner functions via gkp encoding,” International Journal of Theoretical Physics 63, 40 (2024).
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.
