Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
143 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Dimension Independent Disentanglers from Unentanglement and Applications (2402.15282v1)

Published 23 Feb 2024 in quant-ph and cs.CC

Abstract: Quantum entanglement is a key enabling ingredient in diverse applications. However, the presence of unwanted adversarial entanglement also poses challenges in many applications. In this paper, we explore methods to "break" quantum entanglement. Specifically, we construct a dimension-independent k-partite disentangler (like) channel from bipartite unentangled input. We show: For every $d,\ell\ge k$, there is an efficient channel $\Lambda: \mathbb{C}{d\ell} \otimes \mathbb{C}{d\ell} \to \mathbb{C}{dk}$ such that for every bipartite separable state $\rho_1\otimes \rho_2$, the output $\Lambda(\rho_1\otimes\rho_2)$ is close to a k-partite separable state. Concretely, for some distribution $\mu$ on states from $\mathbb{C}d$, $$ \left|\Lambda(\rho_1 \otimes \rho_2) - \int | \psi \rangle \langle \psi |{\otimes k} d\mu(\psi)\right|1 \le \tilde O \left(\left(\frac{k{3}}{\ell}\right){1/4}\right). $$ Moreover, $\Lambda(| \psi \rangle \langle \psi |{\otimes \ell}\otimes | \psi \rangle \langle \psi |{\otimes \ell}) = | \psi \rangle \langle \psi |{\otimes k}$. Without the bipartite unentanglement assumption, the above bound is conjectured to be impossible. Leveraging our disentanglers, we show that unentangled quantum proofs of almost general real amplitudes capture NEXP, greatly relaxing the nonnegative amplitudes assumption in the recent work of QMA+(2)=NEXP. Specifically, our findings show that to capture NEXP, it suffices to have unentangled proofs of the form $| \psi \rangle = \sqrt{a} | \psi+ \rangle + \sqrt{1-a} | \psi_- \rangle$ where $| \psi_+ \rangle$ has non-negative amplitudes, $| \psi_- \rangle$ only has negative amplitudes and $| a-(1-a) | \ge 1/poly(n)$ with $a \in [0,1]$. Additionally, we present a protocol achieving an almost largest possible gap before obtaining QMAR(k)=NEXP$, namely, a 1/poly(n) additive improvement to the gap results in this equality.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (32)
  1. The power of unentanglement. In Proceedings of the 23rd IEEE Conference on Computational Complexity (CCC), pages 223–236, 2008.
  2. Stabilization of quantum computations by symmetrization. SIAM Journal on Computing, 26(5), 1997.
  3. Faithful squashed entanglement. Communications in Mathematical Physics, 2011.
  4. Salman Beigi. NP vs QMAlog(2). Quantum Info. Comput., 2010.
  5. J. S. Bell. On the einstein podolsky rosen paradox. Physics Physique Fizika, 1, Nov 1964.
  6. Quantum Merlin-Arthur and Proofs Without Relative Phase. In Proceedings of the 15th Innovations in Theoretical Computer Science Conference (ITCS), volume 287, pages 9:1–9:19, 2024.
  7. Quantum de finetti theorems under local measurements with applications. In Proceedings of the 45th ACM Symposium on Theory of Computing (STOC), 2013.
  8. Fernando G. S. L. Brandao and Aram W. Harrow. Estimating operator norms using covering nets, 2015.
  9. All languages in NP have very short quantum proofs. In 2009 Third International Conference on Quantum, Nano and Micro Technologies, pages 34–37, 2009.
  10. Proposed experiment to test local hidden-variable theories. Phys. Rev. Lett., 23, Oct 1969.
  11. One-and-a-half quantum de finetti theorems. Communications in mathematical physics, 273(2):473–498, 2007.
  12. Complete family of separability criteria. Physical Review A, 69, 2004.
  13. Can quantum-mechanical description of physical reality be considered complete? Phys. Rev., 47, May 1935.
  14. On QMA protocols with two short quantum proofs. Quantum Info. Comput., 2012.
  15. Aram W Harrow. The church of the symmetric subspace. arXiv preprint arXiv:1308.6595, 2013.
  16. Quantum entanglement. Rev. Mod. Phys., 81:865–942, Jun 2009.
  17. Sample-optimal tomography of quantum states. IEEE Transactions on Information Theory, 2017.
  18. Testing product states, quantum merlin-arthur games and tensor optimization. J. ACM, 60(1), feb 2013.
  19. An improved semidefinite programming hierarchy for testing entanglement. Communications in Mathematical Physics, 2017.
  20. MIP*=RE, 2020.
  21. The Power of Unentangled Quantum Proofs with Non-negative Amplitudes. In Proceedings of the 55th ACM Symposium on Theory of Computing (STOC), 2023.
  22. Quantum merlin-arthur proof systems: Are multiple merlins more helpful to arthur? In Algorithms and Computation, 2003.
  23. The efficiency of quantum identity testing of multiple states. Journal of Physics A: Mathematical and Theoretical, 41(39):395309, sep 2008.
  24. A de Finetti representation for finite symmetric quantum states. Journal of Mathematical Physics, 46(12), 2005.
  25. Quantum Computation and Quantum Information: 10th Anniversary Edition. Cambridge University Press, 2010.
  26. Efficient quantum tomography. In Proceedings of the 48th ACM Symposium on Theory of Computing (STOC), 2016.
  27. Attila Pereszlényi. Multi-prover quantum merlin-arthur proof systems with small gap, 2012.
  28. Renato Renner. Security of quantum key distribution. International Journal of Quantum Information, 2008.
  29. Epsilon-net method for optimizations over separable states. In Proceedings of the 39th International Colloquium on Automata, Languages and Programming (ICALP), 2012.
  30. Testing matrix product states. In Proceedings of the 33rd ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 1679–1701, 2022.
  31. Unitary property testing lower bounds by polynomials. In Proceedings of the 14th Innovations in Theoretical Computer Science Conference (ITCS), 2023.
  32. John Watrous. The Theory of Quantum Information. Cambridge University Press, 2018.
Citations (3)

Summary

We haven't generated a summary for this paper yet.