Engineering Papers⌕ Search

DOE OSTI · 1976554

The Markov gap for geometric reflected entropy

Abstract

The reflected entropy S R (A : B) of a density matrix ρ AB is a bipartite correlation measure lower-bounded by the quantum mutual information I(A : B). In holographic states satisfying the quantum extremal surface formula, where the reflected entropy is related to the area of the entanglement wedge cross-section, there is often an order-N 2 gap between S R and I. We provide an information-theoretic interpretation of this gap by observing that S R - I is related to the fidelity of a particular Markov recovery problem that is impossible in any state whose entanglement wedge cross-section has a nonempty boundary; for this reason, we call the quantity S R - I the Markov gap. We then prove that for time-symmetric states in pure AdS 3 gravity, the Markov gap is universally lower bounded by log(2)ℓ AdS /2G N times the number of endpoints of the cross-section. We provide evidence that this lower bound continues to hold in the presence of bulk matter, and comment on how it might generalize above three bulk dimensions. Finally, we explore the Markov recovery problem controlling S R - I using fixed area states. This analysis involves deriving a formula for the quantum fidelity — in fact, for all the sandwiched Rényi relative entropies — between fixed area states with one versus two fixed areas, which may be of independent interest. We discuss, throughout the paper, connections to the general theory of multipartite entanglement in holography.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Hayden, Patrick, Parrikar, Onkar, Sorce, Jonathan. 2021-10-06. The Markov gap for geometric reflected entropy. https://doi.org/10.1007/jhep10(2021)047

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related reports

Vidyut3d: A GPU accelerated fluid solver for non-equilibrium plasmas on adaptive grids

We present the numerical methods, programming methodology, verification, and performance assessment of a non-equilibrium plasma fluid solver that can effectively utilize current and upcoming central processing and graphics processing unit (CPU+GPU) architectures, in this work. Our plasma fluid model solves the coupled conservation equations for species transport, electrostatic Poisson and electron temperature on adaptive Cartesian grids. Our solver is written using performance portable adaptive-grid/particle management library, AMReX, and is portable over widely available vendor specific GPU architectures. We present verification of our solver using method of manufactured solutions that indicate formal second order accuracy with central diffusion and fifth-order weighted-essentially-non-oscillatory (WENO) advection scheme. We also verify our solver with published literature on capacitive discharges and atmospheric pressure streamer propagation. We demonstrate the use of our solver on two 3D simulation cases: an atmospheric streamer propagation in Ar-H2 mixtures and a low pressure three-electrode radio frequency reactor. Our performance studies on three different CPU+GPU architectures indicate ~ 150-400X speed-up using AMD and NVIDIA GPUs per time step compared to a single CPU core for a 4 million cell simulation with 15 species.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Evaluating the Limits of QAOA Parameter Transfer at High-Rounds on Sparse Ising Models With Geometrically Local Cubic Terms

The emergent practical applicability of the Quantum Approximate Optimization Algorithm (QAOA) for approximate combinatorial optimization is a subject of considerable interest. One of the primary limitations of QAOA is the task of finding a set of good parameters, which is usually done using a variational optimization loop. Parameter transfer, or parameter concentration, is a phenomenon where QAOA angles trained on problem instances that are self-similar tend to perform well for other problem instances from that similar class. This suggests a potentially highly efficient and scalable non-variational learning method for QAOA angle finding. In this work, we systematically study QAOA parameter transferability from small problem sizes (16 and 27 decision variables) onto large problem instances (up to 156 qubits) for heavy-hex graph Ising models with geometrically local higher order terms using the Julia based QAOA simulation tool \texttt{JuliQAOA} to perform classical angle finding for up to $49$ QAOA layers ($p$). Parameter transfer of the fixed angles is validated using a combination of full statevector, Projected Entangled Pair States (PEPS), Matrix Product State (MPS), and LOWESA numerical simulations. We find that the QAOA parameter transfer from single instances applied to other (unseen) problem instances does not in general provide monotonically improving performance as a function of $p$ - there are many cases where the performance temporarily decreases as a function of $p$ - but despite this the transferred angles have a general trend of improved expectation value as the QAOA depth increases, in many cases converging close to the true ground-state energy of the $100+$ qubit instances. We also sample the hardware-compatible Ising models using the ensemble of transfer-learned QAOA parameters on several superconducting qubit IBM Quantum processors with 127, 133, and 156 qubits. We find continuous solution quality improvement of the hardware-compatible QAOA circuits run on the IBM NISQ processors up to $p=5$ on \texttt{ibm\_fez}, up to $p=9$ on \texttt{ibm\_torino}, and up to $p=10$ on \texttt{ibm\_pittsburgh}.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗