Binding complexity and multiparty entanglement
Journal Article
·
· Journal of High Energy Physics (Online)
- Univ. of Pennsylvania, Philadelphia, PA (United States); Vrije Univ. Brussel (VUB), and International Solvay Inst. (Belgium). Theoretische Natuurkunde; DOE/OSTI
- Univ. of Pennsylvania, Philadelphia, PA (United States)
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.
- Research Organization:
- Duke Univ., Durham, NC (United States)
- Sponsoring Organization:
- It From Qubit Simons Collaboration; National Science Foundation (NSF); Simons Foundation; USDOE Office of Science (SC)
- Grant/Contract Number:
- FG02-05ER41367
- OSTI ID:
- 1609628
- Journal Information:
- Journal of High Energy Physics (Online), Journal Name: Journal of High Energy Physics (Online) Journal Issue: 2 Vol. 2019; ISSN 1029-8479
- Publisher:
- Springer BerlinCopyright Statement
- Country of Publication:
- United States
- Language:
- English
Similar Records
Multipartite reflected entropy
Secure multiparty computation with a dishonest majority via quantum means
Quantum channel capacities: Multiparty communication
Journal Article
·
Mon Oct 07 20:00:00 EDT 2019
· Journal of High Energy Physics (Online)
·
OSTI ID:1574424
Secure multiparty computation with a dishonest majority via quantum means
Journal Article
·
Tue Jun 15 00:00:00 EDT 2010
· Physical Review. A
·
OSTI ID:21439500
Quantum channel capacities: Multiparty communication
Journal Article
·
Sun Oct 15 00:00:00 EDT 2006
· Physical Review. A
·
OSTI ID:20857854