pith. sign in

arxiv: 2509.11979 · v3 · submitted 2025-09-15 · 🪐 quant-ph · math.CA· math.FA

Approximating the operator norm of local Hamiltonians via few quantum states

Lars Becker , Joseph Slote , Alexander Volberg , Haonan Zhang This is my paper

Pith reviewed 2026-05-18 16:47 UTC · model grok-4.3

classification 🪐 quant-ph math.CAmath.FA
keywords local Hamiltoniansoperator normproduct statesquantum norm designd-local operatorsdiscretizationPauli expansionrandom Hamiltonians
0
0 comments X

The pith

For any d-local Hamiltonian the operator norm is at most C(d) times the largest absolute expectation on a fixed set of roughly (1+ε)^n product states.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper establishes a discretization inequality showing that the operator norm of any d-local Hermitian operator on n qubits is controlled by its maximum expectation value over a small, fixed collection of product states. This collection, independent of the operator itself, has size exponential in n but far smaller than the full Hilbert space dimension, and the controlling constant depends only on the locality degree d. The result covers general non-homogeneous local Hamiltonians, extending earlier work that handled only homogeneous cases or lower locality. If the inequality holds, norms of local operators become approximable without diagonalizing the full matrix or searching the entire state space. The same construction yields bounds on Rademacher projections at all levels and explicit estimates for the norms of random local Hamiltonians.

Core claim

Whenever A is d-local, i.e., deg(A) ≤ d, the operator norm satisfies ||A|| ≤ C(d) max_{ψ ∈ X_n} |⟨ψ|A|ψ⟩|, where C(d) depends only on d and X_n is an A-independent collection of product states whose cardinality can be as small as (1+ε)^n.

What carries the argument

A quantum norm design: a fixed, A-independent collection of product states that discretizes the quadratic forms of all d-local operators simultaneously.

If this is right

  • Rademacher projections are bounded for all levels.
  • Explicit upper bounds become available for the operator norms of random d-local Hamiltonians.
  • The same approximation applies to non-homogeneous d-local operators, not only homogeneous ones.
  • Norm computation for local Hamiltonians reduces to evaluating a quadratic form on an exponentially smaller set of states.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • Local quantum operators may have their extremal behavior captured by expectations on product states alone.
  • These designs could support efficient classical algorithms for estimating ground-state energies or other properties of local Hamiltonians.
  • Analogous fixed discretizations might exist for other operator norms or for measures of entanglement in many-body systems.

Load-bearing premise

A single collection of product states chosen independently of A exists and works uniformly for the discretization inequality across every d-local Hamiltonian.

What would settle it

Exhibit a concrete d-local Hamiltonian A for which the maximum of |⟨ψ|A|ψ⟩| over the proposed X_n is much smaller than ||A|| divided by C(d).

read the original abstract

Consider a Hermitian operator $A$ acting on a complex Hilbert space of dimension $2^n$. We show that when $A$ has small degree in the Pauli expansion, or in other words, $A$ is a local $n$-qubit Hamiltonian, its operator norm can be approximated independently of $n$ by maximizing $|\braket{\psi|A|\psi}|$ over a small collection $\mathbf{X}_n$ of product states $\ket{\psi}\in (\mathbf{C}^{2})^{\otimes n}$. More precisely, we show that whenever $A$ is $d$-local, \textit{i.e.,} $\deg(A)\le d$, we have the following discretization-type inequality: \[ \|A\|\le C(d)\max_{\psi\in \mathbf{X}_n}|\braket{\psi|A|\psi}|. \] The constant $C(d)$ depends only on $d$. This collection $\mathbf{X}_n$ of $\psi$'s, termed a \emph{quantum norm design}, is independent of $A$, and consists of product states, and can have cardinality as small as $(1+\eps)^n$, which is essentially tight. Previously, norm designs were known only for homogeneous $d$-localHamiltonians $A$ \cite{L,BGKT,ACKK}, and for non-homogeneous $2$-local traceless $A$ \cite{BGKT}. Several other results, such as boundedness of Rademacher projections for all levels and estimates of operator norms of random Hamiltonians, are also given.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

1 major / 2 minor

Summary. The manuscript proves that for any d-local Hermitian operator A on n qubits (deg(A) ≤ d), the operator norm satisfies ||A|| ≤ C(d) max_{ψ ∈ X_n} |⟨ψ|A|ψ⟩|, where C(d) depends only on d and X_n is an A-independent collection of product states whose cardinality can be as small as (1+ε)^n for any ε > 0. This is termed a quantum norm design and extends prior results that were limited to homogeneous d-local or traceless 2-local cases. Additional results include boundedness of Rademacher projections at all levels and norm estimates for random Hamiltonians.

Significance. If the central discretization holds with the stated parameter independence, the result supplies a uniform, n-independent approximation of local-Hamiltonian norms from an exponentially small but sub-exponential number of product states. This strengthens the toolkit for analyzing local operators and could support algorithmic applications such as variational methods or shadow tomography. The extension beyond homogeneous cases and the provision of explicit auxiliary results on Rademacher projections are concrete strengths.

major comments (1)
  1. [Abstract / main theorem] Abstract and main theorem statement: the claim that C(d) depends only on d while |X_n| can be taken as (1+ε)^n for arbitrarily small ε > 0 is in tension with the geometry of the construction. Any A-independent product-state net must ε-net the Bloch sphere on each qubit; a δ-net on S^2 has size Θ(δ^{-2}), so |X_n| scales as (δ^{-O(1)})^n. To keep the additive error per local term below η (and thereby keep the global factor bounded by a d-only constant), δ must be O(η / poly(d)). Sending ε → 0 therefore forces δ → 0 and C to diverge with 1/ε. The manuscript must either exhibit an explicit construction in which C remains d-only for every ε, or record the dependence C(d,ε) explicitly.
minor comments (2)
  1. [Introduction] The notation for the degree deg(A) and the precise definition of d-locality should be stated once in the introduction with a reference to the Pauli expansion, rather than only in the abstract.
  2. [Introduction] The comparison with prior norm-design results (L, BGKT, ACKK) would benefit from a short table or paragraph clarifying which cases were previously covered and what is new for non-homogeneous d-local operators.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for the careful reading and constructive comments on our manuscript. We address the major comment on the abstract and main theorem statement below, and we will make the necessary revisions to resolve the noted tension.

read point-by-point responses

  1. Referee: [Abstract / main theorem] Abstract and main theorem statement: the claim that C(d) depends only on d while |X_n| can be taken as (1+ε)^n for arbitrarily small ε > 0 is in tension with the geometry of the construction. Any A-independent product-state net must ε-net the Bloch sphere on each qubit; a δ-net on S^2 has size Θ(δ^{-2}), so |X_n| scales as (δ^{-O(1)})^n. To keep the additive error per local term below η (and thereby keep the global factor bounded by a d-only constant), δ must be O(η / poly(d)). Sending ε → 0 therefore forces δ → 0 and C to diverge with 1/ε. The manuscript must either exhibit an explicit construction in which C remains d-only for every ε, or record the dependence C(d,ε) explicitly.

    Authors: We thank the referee for this insightful comment, which correctly identifies a subtlety in how the parameters interact in our construction. The quantum norm design is built by selecting, for each qubit, a small number of states whose effective covering radius depends on ε. To ensure the discretization error remains controlled for the d-local terms, the constant C must incorporate a factor that grows as ε decreases. We will therefore revise the manuscript to record the dependence explicitly as C(d, ε). We will update the abstract and Theorem 1 to state ||A|| ≤ C(d, ε) max |<ψ|A|ψ>|, and we will include in the proof the relation between δ, ε, and the resulting C. This change clarifies the result without affecting its validity or the significance of the other contributions. revision: yes

Circularity Check

0 steps flagged

No significant circularity; derivation is a self-contained mathematical proof

full rationale

The paper proves the discretization inequality ||A|| ≤ C(d) max_{ψ∈X_n} |⟨ψ|A|ψ⟩| for every d-local Hermitian A, where X_n is an A-independent collection of product states with |X_n| as small as (1+ε)^n. This is established via direct mathematical arguments that construct or prove existence of the quantum norm design without defining quantities in terms of the target bound or renaming fitted parameters as predictions. Prior citations to [L,BGKT,ACKK] and [BGKT] address only homogeneous or 2-local cases and are not load-bearing for the general d-local extension; the current derivation does not reduce to those results by construction. No self-definitional steps, ansatz smuggling, or uniqueness theorems imported from overlapping authors appear in the claimed chain. The result is therefore self-contained against external mathematical benchmarks.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The proof relies on standard facts from functional analysis and quantum information; no free parameters or invented entities are visible in the abstract.

axioms (1)
  • standard math Standard properties of the operator norm and Pauli expansion for Hermitian operators on (C^2)^⊗n
    Invoked implicitly when defining d-local Hamiltonians via degree in Pauli basis.

pith-pipeline@v0.9.0 · 5830 in / 1293 out tokens · 29494 ms · 2026-05-18T16:47:48.530332+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

29 extracted references · 29 canonical work pages

  1. [1]

    Quantum t -designs: t -wise Independence in the Quantum World

    Andris Ambainis and Joseph Emerson. Quantum t -designs: t -wise Independence in the Quantum World. In CCC '07--- P roceedings of the 22nd Annual IEEE Conference on Computational Complexity , pages 129--140

    work page

  2. [2]

    Anschuetz, David Gamarnik, Bobak T

    Eric R. Anschuetz, David Gamarnik, Bobak T. Kiani , Bounds on the ground state energy of quantum p -spin Hamiltonians , pp. 1-54, arXiv2404.0723 v2

    work page arXiv

  3. [3]

    Anschuetz, Chi-Fang Chen, Bobak T

    Eric R. Anschuetz, Chi-Fang Chen, Bobak T. Kiani, Robbie King , Strongly interacting fermions are non-trivial yet non-glassy , pp. 1--24, arXiv2408.15699v4

    work page arXiv

  4. [4]

    Fernando G. S. L. Brand\ ao and Aram W. Harrow. Product-state approximations to quantum ground states (extended abstract). In S TOC '13--- P roceedings of the 2013 ACM S ymposium on T heory of C omputing , pages 871--880. ACM, New York, 2013

    work page 2013

  5. [5]

    Approximation algorithms for quantum many-body problems

    Sergey Bravyi, David Gosset, Robert K\"onig, and Kristan Temme. Approximation algorithms for quantum many-body problems. J. Math. Phys. , 60(3):032203, 18, 2019

    work page 2019

  6. [6]

    Positive definite matrices

    Rajendra Bhatia. Positive definite matrices . Princeton Series in Applied Mathematics. Princeton University Press, Princeton, NJ, 2007

    work page 2007

  7. [7]

    Dimension-free discretizations of the uniform norm by small product sets

    Lars Becker, Ohad Klein, Joseph Slote, Alexander Volberg, and Haonan Zhang. Dimension-free discretizations of the uniform norm by small product sets. Invent. Math. , 239(2):469--503, 2025

    work page 2025

  8. [8]

    Dirichlet series and holomorphic functions in high dimensions , volume 37 of New Mathematical Monographs

    Andreas Defant, Domingo Garc\'ia, Manuel Maestre, and Pablo Sevilla-Peris. Dirichlet series and holomorphic functions in high dimensions , volume 37 of New Mathematical Monographs . Cambridge University Press, Cambridge, 2019

    work page 2019

  9. [9]

    Delsarte, J

    P. Delsarte, J. M. Goethals, and J. J. Seidel. Spherical codes and designs. Geometriae Dedicata , 6(3):363--388, 1977

    work page 1977

  10. [10]

    On the F ourier spectrum of functions on B oolean cubes

    Andreas Defant, Mieczys aw Masty o, and Antonio P\'erez. On the F ourier spectrum of functions on B oolean cubes. Math. Ann. , 374(1-2):653--680, 2019

    work page 2019

  11. [11]

    Optimal polynomial meshes exist on any multivariate convex domain

    Feng Dai and Andriy Prymak. Optimal polynomial meshes exist on any multivariate convex domain. Found. Comput. Math. , 24(3):989--1018, 2024

    work page 2024

  12. [12]

    Polynomial inequalities on the H amming cube

    Alexandros Eskenazis and Paata Ivanisvili. Polynomial inequalities on the H amming cube. Probab. Theory Related Fields , 178(1-2):235--287, 2020

    work page 2020

  13. [13]

    Learning low-degree functions from a logarithmic number of random queries

    Alexandros Eskenazis and Paata Ivanisvili. Learning low-degree functions from a logarithmic number of random queries. In S TOC '22--- P roceedings of the 54th A nnual ACM SIGACT S ymposium on T heory of C omputing , pages 203--207. ACM, New York, [2022] 2022

    work page 2022

  14. [14]

    Quantum hamiltonian complexity

    Sevag Gharibian, Yichen Huang, Zeph Landau, Seung Woo Shin, et al. Quantum hamiltonian complexity. Foundations and Trends in Theoretical Computer Science , 10(3):159--282, 2015

    work page 2015

  15. [15]

    Approximation algorithms for QMA -complete problems

    Sevag Gharibian and Julia Kempe. Approximation algorithms for QMA -complete problems. SIAM J. Comput. , 41(4):1028--1050, 2012

    work page 2012

  16. [16]

    Learning to predict arbitrary quantum processes

    Hsin-Yuan Huang, Sitan Chen, and John Preskill. Learning to predict arbitrary quantum processes. PRX Quantum , 4(4):040337, 2023

    work page 2023

  17. [17]

    Extremal eigenvalues of local hamiltonians

    Aram W Harrow and Ashley Montanaro. Extremal eigenvalues of local hamiltonians. Quantum , 1:6, 2017

    work page 2017

  18. [18]

    Factorization theory for spaces of operators

    Marius Junge. Factorization theory for spaces of operators. Habilitation thesis. Kiel university, 1996

    work page 1996

  19. [19]

    The complexity of the local H amiltonian problem

    Julia Kempe, Alexei Kitaev, and Oded Regev. The complexity of the local H amiltonian problem. In F STTCS 2004: F oundations of software technology and theoretical computer science , volume 3328 of Lecture Notes in Comput. Sci. , pages 372--383. Springer, Berlin, 2004

    work page 2004

  20. [20]

    A. Yu. Kitaev, A. H. Shen, and M. N. Vyalyi. Classical and quantum computation , volume 47 of Graduate Studies in Mathematics . American Mathematical Society, Providence, RI, 2002. Translated from the 1999 Russian original by Lester J.\ Senechal

    work page 2002

  21. [21]

    Elliott H. Lieb. The classical limit of quantum spin systems. Comm. Math. Phys. , 31:327--340, 1973

    work page 1973

  22. [22]

    On bounded bilinear forms in an infinite number of variables

    John E Littlewood. On bounded bilinear forms in an infinite number of variables. The Quarterly Journal of Mathematics , (1):164--174, 1930

    work page 1930

  23. [23]

    Lust-Piquard, In\'egalit´es de Khintchine dans C_p ( 1 < p < )

    F. Lust-Piquard, In\'egalit´es de Khintchine dans C_p ( 1 < p < ) . C. R. Acad. Sci. Paris S\'erie I Math. 303 (1986), 289--292

    work page 1986

  24. [24]

    Milman and Gideon Schechtman

    Vitali D. Milman and Gideon Schechtman. Asymptotic theory of finite-dimensional normed spaces , volume 1200 of Lecture Notes in Mathematics . Springer-Verlag, Berlin, 1986. With an appendix by M. Gromov

    work page 1986

  25. [25]

    Non-commutative vector valued L_p -spaces and completely p -summing map

    Gilles Pisier. Non-commutative vector valued L_p -spaces and completely p -summing map. Ast\'erisque, tome 247 (1998), pp.1--138

    work page 1998

  26. [26]

    Russo and H

    B. Russo and H. A. Dye. A note on unitary operators in C -algebras. Duke Math. J. , 33:413--416, 1966

    work page 1966

  27. [27]

    Noncommutative Bohnenblust--Hille Inequality for qudit systems

    Joseph Slote, Alexander Volberg and Haonan Zhang. Noncommutative Bohnenblust--Hille Inequality for qudit systems. arXiv preprint , arXiv:2406.08509

    work page arXiv

  28. [28]

    Noncommutative B ohnenblust- H ille inequalities

    Alexander Volberg and Haonan Zhang. Noncommutative B ohnenblust- H ille inequalities. Math. Ann. , 389(2):1657--1676, 2024

    work page 2024

  29. [29]

    Quantum computational complexity

    John Watrous. Quantum computational complexity. In Computational complexity. V ols. 1--6 , pages 2361--2387. Springer, New York, 2012

    work page 2012