Document Open Access Logo

Decidability of Fully Quantum Nonlocal Games with Noisy Maximally Entangled States

Authors Minglong Qin , Penghui Yao

PDF
Thumbnail PDF

File

LIPIcs.ICALP.2023.97.pdf
  • Filesize: 0.87 MB
  • 20 pages

Document Identifiers

Author Details

Minglong Qin
  • State Key Laboratory for Novel Software Technology, Nanjing University, China
Penghui Yao
  • State Key Laboratory for Novel Software Technology, Nanjing University, China
  • Hefei National Laboratory, 230088, China

Funding

This work was supported by National Natural Science Foundation of China (Grant No. 61972191), Innovation Program for Quantum Science and Technology (Grant No. 2021ZD0302900) and the Program for Innovative Talents and Entrepreneur in Jiangsu.
  • Yao, Penghui: Grant No. 61972191, 2021ZD0302900.

Acknowledgements

We thank Zhengfeng Ji for helpful discussion. We also thank the anonymous reviewers for their careful reading and many helpful comments and suggestions.

Cite AsGet BibTex

Minglong Qin and Penghui Yao. Decidability of Fully Quantum Nonlocal Games with Noisy Maximally Entangled States. In 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 261, pp. 97:1-97:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
https://doi.org/10.4230/LIPIcs.ICALP.2023.97

Abstract

This paper considers the decidability of fully quantum nonlocal games with noisy maximally entangled states. Fully quantum nonlocal games are a generalization of nonlocal games, where both questions and answers are quantum and the referee performs a binary POVM measurement to decide whether they win the game after receiving the quantum answers from the players. The quantum value of a fully quantum nonlocal game is the supremum of the probability that they win the game, where the supremum is taken over all the possible entangled states shared between the players and all the valid quantum operations performed by the players. The seminal work MIP^* = RE [Zhengfeng Ji et al., 2020; Zhengfeng Ji et al., 2020] implies that it is undecidable to approximate the quantum value of a fully nonlocal game. This still holds even if the players are only allowed to share (arbitrarily many copies of) maximally entangled states. This paper investigates the case that the shared maximally entangled states are noisy. We prove that there is a computable upper bound on the copies of noisy maximally entangled states for the players to win a fully quantum nonlocal game with a probability arbitrarily close to the quantum value. This implies that it is decidable to approximate the quantum values of these games. Hence, the hardness of approximating the quantum value of a fully quantum nonlocal game is not robust against the noise in the shared states. This paper is built on the framework for the decidability of non-interactive simulations of joint distributions [Badih Ghazi et al., 2016; De et al., 2018; Ghazi et al., 2018] and generalizes the analogous result for nonlocal games in [Qin and Yao, 2021]. We extend the theory of Fourier analysis to the space of super-operators and prove several key results including an invariance principle and a dimension reduction for super-operators. These results are interesting in their own right and are believed to have further applications.

Subject Classification

ACM Subject Classification
  • Theory of computation → Quantum complexity theory
Keywords
  • Fully quantum nonlocal games
  • Fourier analysis
  • Dimension reduction

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Related Versions

References

  1. Salman Beigi. A new quantum data processing inequality. Journal of Mathematical Physics, 54(8):082202, 2013. URL: https://doi.org/10.1063/1.4818985.
  2. Cyril Branciard, Denis Rosset, Yeong-Cherng Liang, and Nicolas Gisin. Measurement-device-independent entanglement witnesses for all entangled quantum states. Phys. Rev. Lett., 110:060405, February 2013. URL: https://doi.org/10.1103/PhysRevLett.110.060405.
  3. Francesco Buscemi. All entangled quantum states are nonlocal. Phys. Rev. Lett., 108:200401, May 2012. URL: https://doi.org/10.1103/PhysRevLett.108.200401.
  4. Eric G. Cavalcanti, Michael J. W. Hall, and Howard M. Wiseman. Entanglement verification and steering when alice and bob cannot be trusted. Phys. Rev. A, 87:032306, March 2013. URL: https://doi.org/10.1103/PhysRevA.87.032306.
  5. Kai-Min Chung, Xiaodi Wu, and Henry Yuen. Parallel Repetition for Entangled k-player Games via Fast Quantum Search. In David Zuckerman, editor, 30th Conference on Computational Complexity (CCC 2015), volume 33 of Leibniz International Proceedings in Informatics (LIPIcs), pages 512-536, Dagstuhl, Germany, 2015. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik. URL: https://doi.org/10.4230/LIPIcs.CCC.2015.512.
  6. Richard Cleve, Peter Hoyer, Benjamin Toner, and John Watrous. Consequences and limits of nonlocal strategies. In Proceedings of the 19th IEEE Annual Conference on Computational Complexity, CCC '04, pages 236-249, Washington, DC, USA, 2004. IEEE Computer Society. URL: https://doi.org/10.1109/CCC.2004.9.
  7. Anindya De, Elchanan Mossel, and Joe Neeman. Non interactive simulation of correlated distributions is decidable. In Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA '18, pages 2728-2746, Philadelphia, PA, USA, 2018. Society for Industrial and Applied Mathematics. URL: http://dl.acm.org/citation.cfm?id=3174304.3175478.
  8. Payam Delgosha and Salman Beigi. Impossibility of local state transformation via hypercontractivity. Communications in Mathematical Physics, 332(1):449-476, November 2014. URL: https://doi.org/10.1007/s00220-014-2105-y.
  9. Joseph Fitzsimons, Zhengfeng Ji, Thomas Vidick, and Henry Yuen. Quantum proof systems for iterated exponential time, and beyond. In Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, STOC 2019, New York, NY, USA, 2019. ACM. Google Scholar
  10. Joseph Fitzsimons and Thomas Vidick. A multiprover interactive proof system for the local hamiltonian problem. In Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science, ITCS '15, pages 103-112, New York, NY, USA, 2015. Association for Computing Machinery. URL: https://doi.org/10.1145/2688073.2688094.
  11. Badih Ghazi, Pritish Kamath, and Prasad Raghavendra. Dimension reduction for polynomials over gaussian space and applications. In Proceedings of the 33rd Computational Complexity Conference, CCC '18, pages 28:1-28:37, Germany, 2018. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik. URL: https://doi.org/10.4230/LIPIcs.CCC.2018.28.
  12. Badih Ghazi, Pritish Kamath, and Madhu Sudan. Decidability of non-interactive simulation of joint distributions. In 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS), pages 545-554, Los Alamitos, CA, USA, October 2016. IEEE Computer Society. URL: https://doi.org/10.1109/FOCS.2016.65.
  13. Aram W. Harrow, Ashley Montanaro, and Anthony J. Short. Limitations on quantum dimensionality reduction. In Luca Aceto, Monika Henzinger, and Jiří Sgall, editors, Automata, Languages and Programming, pages 86-97, Berlin, Heidelberg, 2011. Springer Berlin Heidelberg. Google Scholar
  14. Tsuyoshi Ito and Thomas Vidick. A multi-prover interactive proof for NEXP sound against entangled provers. In Proceedings of the 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science, FOCS '12, pages 243-252, Washington, DC, USA, 2012. IEEE Computer Society. URL: https://doi.org/10.1109/FOCS.2012.11.
  15. Zhengfeng Ji. Classical verification of quantum proofs. In Proceedings of the Forty-eighth Annual ACM Symposium on Theory of Computing, STOC '16, pages 885-898, New York, NY, USA, 2016. ACM. URL: https://doi.org/10.1145/2897518.2897634.
  16. Zhengfeng Ji, Anand Natarajan, Thomas Vidick, John Wright, and Henry Yuen. MIP^* = RE. arXiv preprint, 2020. URL: https://arxiv.org/abs/2001.04383.
  17. Zhengfeng Ji, Anand Natarajan, Thomas Vidick, John Wright, and Henry Yuen. Quantum soundness of the classical low individual degree test. arXiv preprint, 2020. URL: https://arxiv.org/abs/2009.12982.
  18. Nathaniel Johnston, Rajat Mittal, Vincent Russo, and John Watrous. Extended non-local games and monogamy-of-entanglement games. Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, 472(2189):20160003, May 2016. URL: https://doi.org/10.1098/rspa.2016.0003.
  19. S. Kamath and V. Anantharam. On non-interactive simulation of joint distributions. IEEE Transactions on Information Theory, 62(6):3419-3435, June 2016. URL: https://doi.org/10.1109/TIT.2016.2553672.
  20. J. Kempe, O. Regev, and B. Toner. Unique games with entangled provers are easy. SIAM Journal on Computing, 39(7):3207-3229, 2010. URL: https://doi.org/10.1137/090772885.
  21. Julia Kempe, Hirotada Kobayashi, Keiji Matsumoto, Ben Toner, and Thomas Vidick. Entangled games are hard to approximate. In Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science, FOCS '08, pages 447-456, Washington, DC, USA, 2008. IEEE Computer Society. URL: https://doi.org/10.1109/FOCS.2008.8.
  22. Debbie Leung, Ben Toner, and John Watrous. Coherent state exchange in multi-prover quantum interactive proof systems. Chicago Journal of Theoretical Computer Science, 2013(11), August 2013. Google Scholar
  23. Elchanan Mossel, Ryan O'Donnell, and Krzysztof Oleszkiewicz. Noise stability of functions with low influences: Invariance and optimality. Annals of Mathematics, 171:295-341, March 2010. Google Scholar
  24. A. Natarajan and J. Wright. NEEXP is contained in MIP. In 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS), pages 510-518, Los Alamitos, CA, USA, November 2019. IEEE Computer Society. URL: https://doi.org/10.1109/FOCS.2019.00039.
  25. Ryan O'Donnell. Analysis of Boolean Functions. Cambridge University Press, Cambridge, UK, 2013. Google Scholar
  26. Minglong Qin and Penghui Yao. Nonlocal games with noisy maximally entangled states are decidable. SIAM Journal on Computing, 50(6):1800-1891, 2021. Google Scholar
  27. Oded Regev and Thomas Vidick. Quantum XOR games. ACM Trans. Comput. Theory, 7(4), August 2015. URL: https://doi.org/10.1145/2799560.
  28. C. J. Stark and A. W. Harrow. Compressibility of positive semidefinite factorizations and quantum models. IEEE Transactions on Information Theory, 62(5):2867-2880, 2016. URL: https://doi.org/10.1109/TIT.2016.2538278.
  29. John Watrous. Theory of Quantum Information. Cambridge University Press, Cambridge, UK, 2018. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact