Binding complexity and multiparty entanglement
Open Access
- 12 February 2019
- journal article
- research article
- Published by Springer Nature in Journal of High Energy Physics
- Vol. 2019 (2) , 69
Abstract
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.Keywords
All Related Versions
This publication has 54 references indexed in Scilit:
- Circuit complexity in fermionic field theoryPhysical Review D, 2018
- Circuit complexity in interacting QFTs and RG flowsJournal of High Energy Physics, 2018
- Circuit complexity for coherent statesJournal of High Energy Physics, 2018
- Circuit complexity for free fermionsJournal of High Energy Physics, 2018
- Evolution of complexity following a quantum quench in free field theoryJournal of High Energy Physics, 2018
- Circuit complexity in quantum field theoryJournal of High Energy Physics, 2017
- Quantum Computational Riemannian and Sub-Riemannian GeodesicsProgress of Theoretical Physics, 2012
- Three qubits can be entangled in two inequivalent waysPhysical Review A, 2000
- Distributed entanglementPhysical Review A, 2000
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum ComputerSIAM Journal on Computing, 1997