Binding complexity and multiparty entanglement
We introduce “binding complexity”, a new notion of circuit complexity which quantifies the difficulty of distributing entanglement among multiple parties, each consisting of many local degrees of freedom. We define binding complexity of a given state as the minimal number of quantum gates that must act between parties to prepare it. To illustrate the new notion we compute it in a toy model for a scalar field theory, using certain multiparty entangled states which are analogous to configurations that are known in AdS/CFT to correspond to multiboundary wormholes. Pursuing this analogy, we show that our states can be prepared by the Euclidean path integral in (0 + 1)-dimensional quantum mechanics on graphs with wormhole-like structure. We compute the binding complexity of our states by adapting the Euler-Arnold approach to Nielsen’s geometrization of gate counting, and find a scaling with entropy that resembles a result for the interior volume of holographic multiboundary wormholes. We also compute the binding complexity of general coherent states in perturbation theory, and show that for “double-trace deformations” of the Hamiltonian the effects resemble expansion of a wormhole interior in holographic theories.
KeywordsAdS-CFT Correspondence Black Holes
This article is distributed under the terms of the Creative Commons Attribution License (CC-BY 4.0), which permits any use, distribution and reproduction in any medium, provided the original author(s) and source are credited.
- P.W. Shor, Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer, SIAM J. Comput. 26 (1997) 1484 [quant-ph/9508027].
- W. Dür, G. Vidal and J.I. Cirac, Three qubits can be entangled in two inequivalent ways, Phys. Rev. A 62 (Nov, 2000) 062314 [quant-ph/0005115].
- V. Coffman, J. Kundu and W.K. Wootters, Distributed entanglement, Phys. Rev. A 61 (2000) 052306 [quant-ph/9907047].
- F. Diker, Deterministic construction of arbitrary w states with quadratically increasing number of two-qubit gates, arXiv:1606.09290.
- M.A. Nielsen, A geometric approach to quantum circuit lower bounds, quant-ph/0502070.
- M.R. Dowling and M.A. Nielsen, The geometry of quantum computation, quant-ph/0701004.
- T. Tao, The Euler-Arnold equation, https://terrytao.wordpress.com/2010/06/07/the-euler-arnold-equation/ (2010).
- M.A. Nielsen et al., Quantum dynamics as a physical resource, Phys. Rev. A 67 (2003) 052301 [quant-ph/0208077].
- A. Peres, Separability criterion for density matrices, Phys. Rev. Lett. 77 (1996) 1413 [quant-ph/9604005].
- M. Horodecki, P. Horodecki and R. Horodecki, Separability of mixed states: necessary and sufficient conditions, Phys. Lett. A 223 (1996) 1 [quant-ph/9605038].
- G. Vidal and R.F. Werner, Computable measure of entanglement, Phys. Rev. A 65 (2002) 032314 [quant-ph/0102117].
- S. Rana, Negative eigenvalues of partial transposition of arbitrary bipartite states, Phys. Rev. A 87 (2013) 054301 [arXiv:1304.6775].
- R. Simon, Peres-horodecki separability criterion for continuous variable systems, Phys. Rev. Lett. 84 (2000) 2726 [quant-ph/9909044].
- R.F. Werner and M.M. Wolf, Bound entangled gaussian states, Phys. Rev. Lett. 86 (2001) 3658 [quant-ph/0009118].
- E. Shchukin and W. Vogel, Inseparability criteria for continuous bipartite quantum states, Phys. Rev. Lett. 95 (2005) 230502 [quant-ph/0508132].