Litcius/Paper detail

Bounding the Joint Numerical Range of Pauli Strings by Graph Parameters

Zhen‐Peng Xu, René Schwonnek, Andreas Winter

2024PRX Quantum13 citationsDOIOpen Access PDF

Abstract

The relations among a given set of observables on a quantum system are effectively captured by their so-called joint numerical range, which is the set of tuples of jointly attainable expectation values. Here we explore geometric properties of this construct for Pauli strings, whose pairwise commutation and anticommutation relations determine a graph <a:math xmlns:a="http://www.w3.org/1998/Math/MathML" display="inline" overflow="scroll"><a:mi>G</a:mi></a:math>. We investigate the connection between the parameters of this graph and the structure of minimal ellipsoids encompassing the joint numerical range, and we develop this approach in different directions. As a consequence, we find counterexamples to a conjecture by de Gois [Phys. Rev. A 107, 062211 (2023)], and answer an open question raised by Hastings and O’Donnell [, pp. 776–789], which implies a new graph parameter that we call “<d:math xmlns:d="http://www.w3.org/1998/Math/MathML" display="inline" overflow="scroll"><d:mi>β</d:mi><d:mo stretchy="false">(</d:mo><d:mi>G</d:mi><d:mo stretchy="false">)</d:mo></d:math>.” Furthermore, we provide new insights into the perennial problem of estimating the ground-state energy of a many-body Hamiltonian. Our methods give lower bounds on the ground-state energy, which are typically hard to come by, and might therefore be useful in a variety of related fields. Published by the American Physical Society 2024

Topics & Concepts

Bounding overwatchPauli exclusion principleRange (aeronautics)Joint (building)GraphCombinatoricsMathematicsPhysicsComputer scienceStructural engineeringQuantum mechanicsEngineeringArtificial intelligenceAerospace engineeringQuantum Computing Algorithms and ArchitectureGraph theory and applicationsQuantum chaos and dynamical systems