alphaFeedback

WorksMathematics

Continuum Coulomb hardness with binary nuclear charges

AI contributions
  • unreleased internal OpenAI model
View details
Ancillary data
Formal proof, 4 proof or workflow links
View

Abstract

We prove that approximating the electronic Coulomb spectral infimum in three-dimensional space is QMA-hard when positive integer nuclear charges are encoded in binary. The nuclei have distinct rational positions, the electron number is unary, and the energy is minimized over all antisymmetric continuum states and spin sectors. A deterministic classical polynomial-time reduction produces instances with threshold separation at least one. The nuclear charges may be exponentially large, but every output has polynomial bit length.

The problem and the result

The exact molecular electronic Hamiltonian has unusually rigid input data: its external potential is generated by a list of positive nuclei. A hardness proof for a matrix obtained by projecting onto supplied orbitals does not by itself establish hardness for this operator. Projection provides an upper bound on the ground energy, while a reduction also needs a lower bound that excludes all omitted continuum states. We give such a reduction for the integer-charge, rational-position encoding below.

The precise promise problem

Fix a positive integer cc. An input consists of distinct positions R1,…,RM∈Q3R_1,\ldots,R_M \in\mathbb{Q}^3, positive integers Z1,…,ZMZ_1,\ldots,Z_M, an electron number N≥1N \ge1, and rational thresholds a<ba < b. Here M≥1M \ge1, NN is encoded in unary, and the charges are encoded in binary. Every coordinate and threshold is encoded as a signed binary numerator and a positive binary denominator in lowest terms, using a fixed standard self-delimiting encoding. Write LL for the total bit length and require b−a≥L−cb-a \ge L^{-c}.

On ⋀NL2(R3;C2)\bigwedge^N L^2(\mathbb{R}^3;\mathbb{C}^2) consider, in atomic units,

H(R,Z,N)=−12∑ℓ=1NΔxℓ−∑ℓ=1N∑α=1MZα∣xℓ−Rα∣+∑1≤ℓ<k≤N1∣xℓ−xk∣.(1)H(R,Z,N)=-\frac{1}{2}\sum_{\ell=1}^{N}\Delta_{x_\ell}-\sum_{\ell=1}^{N}\sum_{\alpha=1}^{M}\frac{Z_\alpha}{\lvert x_\ell-R_\alpha\rvert}+\sum_{1\le\ell<k\le N}\frac{1}{\lvert x_\ell-x_k\rvert}. \tag*{(1)}

The form domain is

QN=H1((R3)N;(C2)⊗N)∩⋀NL2(R3;C2).\mathcal{Q}_N=H^1\left((\mathbb{R}^3)^N;(\mathbb{C}^2)^{\otimes N}\right)\cap\bigwedge^N L^2(\mathbb{R}^3;\mathbb{C}^2).

Antisymmetry exchanges spatial and spin coordinates together. We use the lower-bounded self-adjoint Coulomb operator associated with the closed form on QN\mathcal{Q}_N. The three-dimensional Hardy inequality, applied with other coordinates fixed, gives infinitesimal form bounds for the finitely many Coulomb terms and justifies this convention. Set

E0(R,Z,N)=inf⁡Spec⁡H(R,Z,N).E_0(R,Z,N)=\inf\operatorname{Spec} H(R,Z,N).

The YES promise is E0≤aE_0 \leq a, and the NO promise is E0≥bE_0 \geq b. No requirement is made outside the promise.

There is no supplied basis, electron state, magnetic field, or independently adjustable external potential. The minimization includes every total-spin sector. Nuclear repulsion is omitted because the energy convention is electronic and the nuclei are clamped. The problem places no neutrality, fixed-element, or separate nuclear-separation promise on its inputs. In particular, the threshold gap is a precision requirement; it does not assert a molecular spectral gap, a discrete eigenvalue at the infimum, or an efficiently preparable ground state.

Theorem 1.1. The promise problem above is QMA-hard under deterministic classical polynomial-time many-one reductions for c=1c = 1. The reduction can produce instances with b−a≥1b-a \geq1.

Thus the exact clamped-nuclei problem is QMA-hard for a fixed inverse-polynomial precision, with the input conventions in Table 1. The binary encoding of unrestricted positive nuclear charges is essential to the construction given here. Charges and inverse nuclear separations may have exponentially large values; their descriptions still have polynomial length. The theorem makes no claim of membership in QMA, or of hardness under an additional bound on nuclear charges.

Input or conventionSpecification
Nuclear positionsPairwise distinct Rα∈Q3R_\alpha\in\mathbb{Q}^3; binary rational coordinates
Nuclear chargesPositive integers ZαZ_\alpha, encoded in binary
Electron numberN≥1N \geq1, encoded in unary
State spaceFull spinful antisymmetric continuum space; all spin sectors
External dataNuclear list only; no supplied orbital basis or magnetic field
Energy thresholdsRational a<ba < b; YES: E0≤aE_0 \leq a; NO: E0≥bE_0 \geq b
Promise precisionb−a≥L−1b-a \geq L^{-1} in the theorem, for total input length LL
Constructed separationb−a≥1b-a \geq1; a threshold separation, not a spectral gap
Energy conventionClamped-nucleus electronic energy; nuclear repulsion omitted

Table 1. The input model and the precision attained by the reduction. Rational data use the self-delimiting encoding specified in the text.

For clarity, QMA-hardness means that every promise problem admitting polynomial-time quantum verification with a polynomial-size quantum witness reduces to this one by a deterministic classical polynomial-time map preserving YES and NO instances. We use a standard QMA-complete Heisenberg problem as the source. The sole complexity-theoretic input is stated precisely in (2); the subsequent construction and its analytic estimates are proved below.

Context and the continuum obstruction

Electronic-structure complexity has several distinct formulations. Liu, Christandl, and Verstraete established QMA-completeness of the finite-mode NN-representability problem under polynomial-time Turing reductions, using general two-body fermionic Hamiltonians in the argument [5]. Restricting the coefficients to those produced by an actual Coulomb potential is a further requirement. Whitfield, Love, and Aspuru-Guzik explained these distinctions and the role of magnetic fields in the early hardness results [16], Sections 3.1 and 6.1.

Schuch and Verstraete proved QMA-completeness for a Hubbard model with local magnetic fields and developed a continuum realization using designed scalar and spin-dependent potentials [13]. Their Hubbard-to-Heisenberg route and comparison with the complementary one-particle

space are relevant methodological predecessors. Positive point nuclei impose a different restriction on the external field; the continuum comparison needed here is proved in Section 5.

O’Gorman, Irani, Whitfield, and Fefferman proved QMA-completeness for electronic structure in a supplied finite basis [8], Theorem 1]. Their published Appendix D, Corollary 1, includes positive unit nuclear charges, but the basis remains part of the input; Section V explicitly raises the complete-space question. Indeed, if PP is an orbital projection, the variational inequality

inf⁡Spec⁡H≤min⁡Spec⁡(PHP|Ran⁡P)\inf\operatorname{Spec} H \le\min\operatorname{Spec}\left(PHP\middle|_{\operatorname{Ran} P}\right)

does not transfer a projected NO-instance lower bound to HH. A continuum hardness proof must exclude lower states outside that projection.

The Heisenberg hardness theorem of Cubitt, Montanaro, and Piddock [4, 3] supplies a field-free square-lattice source with signed polynomially bounded interactions. Its efficient spatially sparse construction is relevant: generic simulation of a dense interaction graph would not by itself give the required polynomial interaction scales. We use the singlet mediator of Piddock and Montanaro [11] to obtain a positive Heisenberg model, and then use repulsive Hubbard superexchange [1]. The finite calculations below supply explicit scalar shifts, errors, rationalization, and the geometric control required by the nuclear construction.

Schleich et al. [12] study chemically motivated preparation and dynamics through assumptions on accessible chemical processes. Those assumptions define a different computational task from deciding every promised spectral-infimum instance considered here.

The companion article QMA-hardness of continuum Coulomb energy with unit nuclear charges [9], Theorem 1] proves hardness with every Zα=1Z_\alpha= 1. Its construction uses positive continuous charge density, polynomial confinement, and equal-mass cubature. That theorem implies hardness of the larger binary-charge input class, but it does not use the binary-charge theorem proved here. Conversely, splitting our exponentially large charges into individual unit nuclei would not give polynomial output size. The present proof retains a distinct quantitative contribution: certified exponential-accuracy eigenvalue computation and relative tunneling calibration for widely separated hydrogenic wells.

Binding questions are also distinct from the decision problem. For the same kinetic normalization, the companion ionization theorem [10], Theorem 1.1] states that strict binding EN<EN−1E_N < E_{N-1} implies N≤Ztot+CMN \le Z_{\mathrm{tot}} + CM for a universal CC, where Ztot=∑αZαZ_{\mathrm{tot}} = \sum_\alpha Z_\alpha and E0=0E_0 = 0 in that particle-number notation. It assumes distinct nuclei and charges at least one, with no separation condition. Our reduction imposes no strict-binding promise, so that bound supplies neither the continuum exclusion estimate nor a ground-state existence assertion. It is a scope comparison only.

Mechanism of the reduction

We first replace each signed Heisenberg bond by positive interactions with a strongly bound ancillary singlet. A repulsive Hubbard model at half filling then realizes these positive exchanges through virtual double occupancy: its low-energy singly occupied states carry the spins, and the effective exchange is proportional to the square of the hopping strength. The continuum construction must therefore realize prescribed small positive hoppings together with a fixed onsite repulsion. The continuum comparison retains all configurations and spin sectors in the selected orbitals; single occupancy is obtained in the finite Hubbard analysis, not imposed on admissible continuum states.

The construction uses a large integer scale Z∗≍eDZ_* \asymp e^D, where DD is a fixed polynomial in the source size. In dilated coordinates y=Z∗xy = Z_*x, each site contains a nucleus of charge close to Z∗Z_* and a weaker positive secondary nucleus. Their normalized one-electron states are close to hydrogen ground states. A secondary displacement tunes each isolated-well energy of the dilated operator to −1/2-1/2 with exponentially small error. The effective model uses the shifted physical energy divided by Z∗Z_*. In these units, hopping amplitudes are Z∗Z_* times their dilated one-electron values, while the onsite electron repulsion approaches the fixed constant 5/85/8.

Three quantitative ingredients make the continuum and bit-complexity requirements compatible.

(i) The sites are placed so that small displacements can independently change every required bond length to first order, with a quantitative bound on the displacement size. A relative tail estimate, proved with capped remote fields and comparison barriers, converts these changes into controlled hopping ratios. Absolute proximity to a hydrogen orbital would not give the required relative precision.

(ii) A graded polynomial Ritz space evaluates a one-well eigenvalue to exponential accuracy in polynomial time. Uniform analytic estimates, an explicit rational mass-matrix lower bound, and certified eigenvalue enclosures make the procedure valid even for skinny cells and ill-conditioned intermediate bases. The unknown eigenfunction is used only to prove approximation, not as an input to the algorithm.

(iii) Localization yields a fixed gap on the entire one-particle complement. A kinetic-trace and Hardy estimate controls Coulomb coupling on every fermionic superposition in the selected modes. Completing a square against the complementary gap gives a lower bound for the full many-electron spectral infimum.

These arguments provide quantitative tools for constructions involving exponentially weak tunneling and a continuum representation. Their uniformity is part of the proof: errors must remain small after multiplication by Z∗Z_*, and all required precision must cost only polynomially many bits. The numerical construction combines local polynomial approximation through a partition of unity, in the sense of Melenk and Babuška [7], with separate rational conditioning and integration bounds. The complement estimate uses spatial localization [14] and a quadratic elimination argument whose finite-dimensional analogue is second-order perturbation theory [2]. These methods are credited at their points of use; their needed quantitative forms are proved here.

The order of construction and the order of justification deserve separate attention. We first prescribe the finite Hubbard hoppings and compute the primary centers from positive integrals of explicit capped Coulomb fields. These surrogate fields do not involve any unknown orbital or secondary displacement. Only after rounding the primary centers and fixing the integer charges do we tune the secondary nuclei. The surrogate replacement bounds are uniform throughout the tuning cube, and the relative orbital estimates apply to every tuned output. Finally, the continuum lower bound transfers the Hubbard NO promise to arbitrary wavefunctions, and an affine change of energy transfers both promises to rational physical thresholds.

Section 2 develops the finite models and the contact layout. Section 3 proves the isolated-well estimates and the eigenvalue oracle. Section 4 computes the positions and calibrates hopping. Section 5 proves the full continuum comparison. Section 6 chooses all parameters, gives the classical reduction in its actual order of execution, and verifies the final thresholds and encoding.

Throughout, constants denoted by C,c>0C,c > 0 are independent of the large scale parameters and may change between estimates. A polynomial bound always means a fixed polynomial with uniform coefficients and degree. Exponentially small bounds are stated explicitly when they are later amplified. All operator inequalities involving unbounded Hamiltonians are quadratic-form inequalities unless their bounded compressions are specified.

Finite models and a controllable contact geometry

We first reduce a signed spin Hamiltonian to a half-filled Hubbard model. The geometric construction is part of this reduction: every Hubbard hopping will later be set by a small displacement of a nuclear site. For a finite-dimensional self-adjoint operator AA, write E(A)E(A) for its smallest eigenvalue. On two spin-1/2 sites set

hijs=XiXj+YiYj+ZiZj=σi⋅σj.h_{ij}^{s}=X_iX_j+Y_iY_j+Z_iZ_j=\boldsymbol{\sigma}_i\cdot\boldsymbol{\sigma}_j .

Its eigenvalues are −3-3 on the singlet and 11 on the triplet, so ∥hijs∥=3\lVert h_{ij}^{s}\rVert=3.

The source problem and a quantitative perturbation bound

Theorem 2.1 (Source problem). There is a QMA-complete promise problem whose Hamiltonians are

Hin=∑e=LRJehLRsH_{\mathrm{in}}=\sum_{e=LR}J_eh_{LR}^{s}

on finite, nonwrapping subgraphs of the square lattice, with no one-qubit terms. The signed weights JeJ_e are rational. The number of vertices and edges, the lattice extent, the weight magnitudes, and the threshold magnitudes are bounded by fixed polynomials in the source size n≥2n\ge2. The rational thresholds as<bsa_s<b_s have separation δs=bs−as≥1/poly⁡(n)\delta_s=b_s-a_s\ge1/\operatorname{poly}(n).

This is the square-lattice Heisenberg consequence of [3], using the polynomial-weight spatially sparse branch of Lemma 47 there. The Heisenberg interaction has rank-three coupling matrix, so it is outside the exceptional rank-one family in that theorem; the square-lattice construction has no one-qubit fields. The following normalization makes the encoding interface explicit.

Let δ>0\delta>0 be a known rational inverse-polynomial lower bound on the incoming gap, let qsq_s be the number of weighted edges, and put ε0=δ/100\varepsilon_0=\delta/100. Round each edge coefficient within ε0/max⁡{1,qs}\varepsilon_0/\max\{1,q_s\}. Since ∥hijs∥=3\lVert h_{ij}^{s}\rVert=3, the resulting Hamiltonian changes by norm at most 3ε03\varepsilon_0. If the source also has an identity coefficient c0c_0 and thresholds a0,b0a_0,b_0, approximate each of those three numbers within ε0\varepsilon_0, obtaining c~0,a~0,b~0\widetilde{c}_0,\widetilde{a}_0,\widetilde{b}_0. For the rounded Hamiltonian with its identity term removed, set

as=a~0−c~0+5ε0,bs=b~0−c~0−5ε0.a_s=\widetilde{a}_0-\widetilde{c}_0+5\varepsilon_0,\qquad b_s=\widetilde{b}_0-\widetilde{c}_0-5\varepsilon_0.

The two threshold approximation errors and the Hamiltonian error sum to at most 5ε05\varepsilon_0, so both promises survive. Moreover, bs−as≥δ−12ε0>0b_s-a_s\ge\delta-12\varepsilon_0>0. All rational descriptions have polynomial length. A connected grid component with vv vertices has coordinate diameter at most v−1v-1, by following its lattice paths; translating components into disjoint strips gives polynomial extent. These are normalization steps applied to the cited source, not additional conclusions imported from its statement.

This imported source theorem is the only hardness theorem we need. In what follows zero-weight edges are omitted. No lower bound on the magnitudes of the remaining weights is assumed, and no total-spin sector is selected. By appending an isolated original vertex if necessary, at a lattice position outside the existing finite drawing, we may assume that there is at least one original vertex. Tensoring with its uncoupled spin preserves the minimum energy and all polynomial bounds.

We use the following finite-dimensional estimate twice. It controls the bottom energy and does not require a gap within the encoded subspace. The effective second-order operator is the familiar one from Schrieffer–Wolff perturbation theory; see Bravyi, DiVincenzo, and Loss [2].

We prove the particular bound needed here directly, so its constants and the empty-complement case are explicit.

Lemma 2.2 (Second-order bottom-energy estimate). Let A>0A > 0 be a finite-dimensional self-adjoint operator, let P≠0P \ne0 project onto its kernel, and put Q=I−PQ = I - P. Suppose A≥gQA \ge gQ for some g>0g > 0. Let B=B∗B = B^* satisfy PBP=0PBP = 0 and ∥B∥≤ϵg\lVert B\rVert\le\epsilon g, where 0≤ϵ<1/20 \le\epsilon< 1/2. Define A−1A^{-1} to vanish on PP. Then

∣E(A+B)−E(−PBA−1BP∣P)∣≤2gϵ3.(2)\left|E(A+B)-E\left(-PBA^{-1}BP\big|_P\right)\right| \le2g\epsilon^3. \tag*{(2)}

The conclusion also holds when Q=0Q = 0.

Proof. Let K=PBA−1BP≥0K = PBA^{-1}BP \ge0 and κ=∥K∥\kappa= \lVert K\rVert. Since Bp∈QBp \in Q for p∈Pp \in P,

0≤κ≤∥B∥2g≤gϵ2.(3)0 \le\kappa\le\frac{\lVert B\rVert^2}{g} \le g\epsilon^2. \tag*{(3)}

For p∈Pp \in P and q∈Qq \in Q, the inequality QBQ≥−ϵgQ≥−ϵA∣QQBQ \ge-\epsilon gQ \ge-\epsilon A|_Q gives

References

  1. [1]P. W. Anderson. New approach to the theory of superexchange interactions. Physical Review, 115:2–13, 1959.
  2. [2]Sergey Bravyi, David P. DiVincenzo, and Daniel Loss. Schrieffer–Wolff transformation for quantum many-body systems. Annals of Physics, 326(10):2793–2826, 2011.DOI
  3. [3]Toby Cubitt, Ashley Montanaro, and Stephen Piddock. Universal quantum Hamiltonians. arXiv:1701.05182v4 [quant-ph], 2019. Full manuscript, version 4, 31 May 2019. Online version.DOI
  4. [4]Toby S. Cubitt, Ashley Montanaro, and Stephen Piddock. Universal quantum Hamiltonians. Proceedings of the National Academy of Sciences, 115(38):9497–9502, 2018.DOI
  5. [5]Yi-Kai Liu, Matthias Christandl, and Frank Verstraete. Quantum computational complexity of the N-representability problem: QMA complete. Physical Review Letters, 98:110503, 2007.pubmed.ncbi.nlm.nih.gov/17501036
  6. [6]Yvon Maday and Carlo Marcati. Regularity and hp discontinuous Galerkin finite element approximation of linear elliptic eigenvalue problems with singular potentials. Mathematical Models and Methods in Applied Sciences, 29(8):1585–1617, 2019.
  7. [7]J. M. Melenk and I. Babuška. The partition of unity finite element method: Basic theory and applications. Computer Methods in Applied Mechanics and Engineering, 139(1–4):289–314, 1996.DOI
  8. [8]Bryan O’Gorman, Sandy Irani, James Whitfield, and Bill Fefferman. Intractability of electronic structure in a fixed basis. PRX Quantum, 3(2):020322, 2022. Online version.
  9. [9]OpenAI. QMA-hardness of continuum Coulomb energy with unit nuclear charges. OpenAI Math Release preprint OAI:QMA-hardness-of-continuum-Coulomb-energy-with-unit-nuclear-charges-September-24-2026, 2026.
  10. [10]OpenAI. Uniform excess charge for Coulomb molecules and the outer radius of neutral atoms. OpenAI Math Release preprint OAI:Uniform-excess-charge-for-Coulomb-molecules-and-the-outer-radius-of-neutral-atoms-September-24-2026, 2026.
  11. [11]Stephen Piddock and Ashley Montanaro. The complexity of antiferromagnetic interactions and 2D lattices. Quantum Information and Computation, 17(7–8):636–672, 2017.arxiv.org/abs/1506.04014
  12. [12]Philipp Schleich, Lasse Bjørn Kristensen, Jorge A. Campos-Gonzalez-Angulo, Abdulrahman Aldossary, Davide Avagliano, Mohsen Bagherimehrab, Christoph Gorgulla, Joe Fitzsimons, and Alán Aspuru-Guzik. Chemically motivated simulation problems are efficiently solvable on a quantum computer. Digital Discovery, 5(1):64–87, 2026. Online version.DOI
  13. [13]Norbert Schuch and Frank Verstraete. Computational complexity of interacting electrons and fundamental limitations of density functional theory. Nature Physics, 5:732–735, 2009.DOI
  14. [14]Barry Simon. Semiclassical analysis of low lying eigenvalues. I. non-degenerate minima: asymptotic expansions. Annales de l’Institut Henri Poincaré, Section A, Physique Théorique, 38(3):295–308, 1983.
  15. [15]Gerald Teschl. Mathematical Methods in Quantum Mechanics: With Applications to Schrödinger Operators, volume 99 of Graduate Studies in Mathematics. American Mathematical Society, 2009. First edition, Theorem 6.4. Author-hosted text.
  16. [16]James Daniel Whitfield, Peter John Love, and Alán Aspuru-Guzik. Computational complexity in electronic structure. Physical Chemistry Chemical Physics, 15:397–411, 2013.

Paper details

vlnc:W_my8mm9ax
v1 · latestHistory (1)

published · Fresh — published within the last 30 days

Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

LicenseRef-OpenAI-public

DOI · 10.83295/by6b-7ewc

Original source

  • Mathematics

unreleased internal OpenAI model · View statement →

Looking for related papers…
Contents