WorksMathematics
QMA-hardness of continuum Coulomb energy with unit nuclear charges
Abstract
We prove that approximating the electronic ground-energy infimum for clamped unit-charge nuclei is QMA-hard on the full spinful fermionic continuum space. A deterministic classical polynomial-time reduction produces polynomially many nuclei at distinct rational positions and polynomially many electrons, with polynomial rational bit lengths and threshold separation at least one. No orbital basis, magnetic field, or additional external potential is supplied, and no binding assumption is imposed.
Introduction
An electronic ground-energy problem specifies both an external potential and the states over which the energy is minimized. These choices matter for computational hardness. A finite collection of orbitals can encode a hard spin system, yet an arbitrary continuum state may have lower energy than every state in that collection. Likewise, a freely designed potential can create a useful array of wells without being the potential of positive point nuclei. We prove hardness when the only external data are rational positions of nuclei of charge one, and the minimization is over the full spinful fermionic continuum space.
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 [10]. Their reduction to Heisenberg exchange and their comparison with the complementary one-particle space are predecessors of the finite and continuum estimates used here. Requiring the external potential to come solely from positive point nuclei imposes a further restriction.
O’Gorman, Irani, Whitfield, and Fefferman proved QMA-completeness for electronic structure in a supplied finite orbital basis [6 Theorem 1]. Their journal version includes a construction with positive unit point charges [6 Appendix D, Corollary 1]. The supplied basis restricts the admissible many-electron states, as the authors emphasize in their discussion of the infinite-dimensional problem in Section V. A projected energy supplies a variational upper bound on the continuum infimum; transferring a NO instance also requires a lower bound on every omitted continuum state. The present theorem retains both unit nuclei and unrestricted spinful continuum minimization.
The electronic promise problem
Let clamped nuclei have pairwise distinct positions , and let be the number of electrons. Each nucleus has charge . In atomic units the electronic Hamiltonian is
Its Hilbert space and form domain are
Antisymmetry exchanges position and spin together. No spin sector is selected. We use the lower-bounded self-adjoint operator associated with the closed Coulomb quadratic form on , and write . Equivalently, is the infimum of this form over normalized vectors in , whether or not it is attained; see [12 Theorems 2.13 and 2.19] for the closed-form representation and variational characterization. Section 7 gives the form bounds and core argument used in the continuum comparison.
The instance and its encoding are specified in Table 1. The promise excludes energies strictly between the thresholds. Nuclear repulsion is omitted: for clamped positions it is a fixed geometry-dependent scalar, whereas (H) defines the electronic-energy convention used throughout.
| Input or convention | Specification |
| Nuclear positions | Pairwise distinct rational triples |
| Nuclear charges | for every |
| Electron number | , encoded in unary |
| Thresholds | Rational numbers |
| Rational encoding | Signed binary numerator and positive binary denominator in lowest terms; fixed self-delimiting encoding |
| Input length | : total length of the binary and unary data |
| Promise | ; YES if , NO if |
| Energy convention | Electronic energy; clamped nuclear repulsion omitted |
Table 1. The unit-charge input model. The decision-threshold separation is an input precision promise, not a spectral-gap assumption.
Theorem 1 (Unit-charge Coulomb hardness). The electronic promise problem for (H) on , with distinct rational nuclear positions, all nuclear charges equal to one, unary electron number, and rational thresholds separated by at least , is QMA-hard under deterministic classical polynomial-time many-one reductions. The reduction produces polynomially many nuclei and electrons, polynomial rational bit lengths, and threshold separation at least one. The only output data are the nuclear positions, electron number, and thresholds.
Thus the bounded-charge problem holds with the absolute charge bound and precision exponent . The theorem imposes no neutrality, binding, existence of a ground eigenvector, molecular spectral-gap, or lower nuclear-separation promise. It supplies no orbital basis, electronic state, magnetic field, or additional external potential. Membership in QMA is not asserted. The constructed inequality is stronger than the input requirement ; neither inequality specifies an excitation gap of the molecule.
The strict-binding excess-charge bound in [8 Theorem 1.1] bounds how many electrons fixed nuclei can bind strictly. Such a bound supplies neither a finite-dimensional truncation nor the continuum lower bound required here.
The companion article [7 Theorem 1.1 and Section 2] develops the finite-gadget framework in greater detail and proves full-continuum hardness with binary-encoded nuclear charges. Its large-charge analytic construction and the polynomial-scale realization here are distinct. Our proof starts directly from the same external spin source and includes the finite estimates it uses; it does not invoke the companion’s hardness theorem.
Proof strategy
The starting point is the QMA-hard energy problem for signed Heisenberg exchange on finite square-lattice subgraphs. We use the spatially sparse construction of Cubitt, Montanaro, and Piddock, whose polynomial interaction scales are essential here [3 Theorem 48, Lemma 47, and Section 10.1]. Section 2 puts this source in a rational encoding with an explicit remaining promise gap.
The finite part of the reduction has two stages. Section 3 replaces signed exchange by positive exchange using singlet-pair mediators [9 Section 2.4 and Lemma 5], and gives a planar layout with independently adjustable link lengths. Section 4 associates one localized spatial mode, with two spin states, to each of the resulting sites. With electrons, a positive occupancy penalty favors one electron per site. Virtual hopping through double occupancy then gives the prescribed positive spin exchange, by the superexchange mechanism of Anderson [1]. The direct Coulomb coefficients enter that penalty and its virtual-excitation denominators explicitly.
The remaining construction realizes these modes using unit nuclei. We first work in dilated coordinates , with a polynomially large scale. After dividing energies by , a unit nucleus has coupling . Section 5 constructs a nonnegative continuous nuclear density producing the planar wells and transverse confinement. A broad, constant-density slab supplies the positive curvature needed to keep the modified density nonnegative. Small changes in the well depths supply a one-site counterterm for the long-range direct electron repulsion.
Section 6 replaces the density by distinct point nuclei. A smooth flow transports uniform density to the constructed density. Applying this flow to a tensor-product two-point Gauss rule preserves equal node masses. The mass is chosen to be exactly , so returning to physical coordinates gives charge one at every nucleus. Rational rounding of the positions is included in the estimates.
The key analytical distinction is between the replacement error on arbitrary form-domain vectors and its compression to the localized modes. The latter is smaller because the modes have smooth Coulomb fields. In Section 7, a uniform one-particle complementary gap excludes low energies from the omitted continuum space, and square completion makes coupling to that space enter the energy quadratically. This gives a lower energy bound on every antisymmetric form-domain state, uniformly in spin, and a matching variational upper bound from the mode space. Together they compare the full continuum infimum with the finite fermion ground energy. Retaining the direct Coulomb interaction and its counterterm is necessary at the polynomial scales used here. Section 8 completes the deterministic computation of the nuclear positions and thresholds, including all scalar shifts.
The lattice source and rational normalization
We first fix the finite input and its error budget. The output of this section is a signed rational Heisenberg Hamiltonian with polynomial geometric extent and coefficients, together with a positive inverse-polynomial decision gap.
Our starting problem is the field-free square-lattice Heisenberg energy problem, which is QMA-hard by Theorem 48 and Section 10.1 of Cubitt, Montanaro and Piddock [3], using the polynomial-weight spatially sparse construction of their Lemma 47. The Hamiltonian on a finite, nonwrapping square-lattice subgraph is
on spins , where the components are Pauli matrices and there are no one-site terms. YES instances have ground energy at most the lower threshold, and NO instances have ground energy at least the upper threshold. The cited construction supplies polynomial bounds on lattice size and coefficient magnitudes and an inverse-polynomial promise gap. The following deterministic normalizations give signed rational coefficients, rational thresholds , and polynomial geometric extent.
For completeness, let be a known rational inverse-polynomial lower bound for the incoming promise gap, and let be the number of weighted edges. Set . Rounding each weight within changes the Hamiltonian norm by at most . Write the incoming scalar as , with if absent, and the incoming thresholds as . Approximate these three numbers within , obtaining . The rational Hamiltonian without the scalar then has valid thresholds
The offsets allow for the Hamiltonian, for the scalar, and for the threshold. Thus both promise implications survive, and . Polynomial magnitudes and inverse-polynomial accuracy require only polynomial rational bit lengths. A connected square-grid component with vertices has coordinate diameter at most , by following lattice paths. Translating components into disjoint strips therefore gives polynomial extent without changing their weighted graphs.
Put , . All polynomial choices below can use fixed size, magnitude and inverse-gap bounds for this source. We can translate coordinates to keep them polynomially bounded, omit zero weights, and assume a nonempty vertex set (add a free spin if needed).
The quantity is the error budget used in the finite reductions below. It concerns the normalized spin instance; the final electronic thresholds will be obtained from an explicitly computed affine energy map in Section 7.3.
Positive spin model
We convert the signed lattice Hamiltonian into a positive-exchange model whose interaction strengths can be encoded by distances. Singlet-pair mediators implement the sign conversion; fixed planar templates then make the resulting link lengths independently adjustable. The same-member versus opposite-member sign mechanism is the isotropic specialization of the mediators in Piddock and Montanaro [9 Section 2.4 and Lemma 5]. We keep the quantitative proof here, including the scalar shifts and the terms unchanged during subdivision.
Energy reduction through singlet pairs
Write for the smallest energy in finite dimensions. The following elementary second-order estimate is a form of the usual effective Hamiltonian expansion [2 Section 3.2]; we prove precisely the bottom-energy statement needed here. In particular, the first-order block need not vanish.
Lemma 2 (Second-order bottom-energy estimate). Let be self-adjoint operators on a finite-dimensional Hilbert space. Suppose has kernel projection , , where and , and . Then
where the inverse vanishes on the kernel.
Proof. Indeed . At that energy the -equation can be solved in terms of the nonzero -component of a ground vector. The inverse on used there is ; it differs from by by the resolvent identity. The -equation gives the lower estimate. For the upper estimate take a unit ground vector for the displayed compression and use as trial vector. Its energy numerator is the compressed energy plus , and the normalization changes this result by at most the same order. The statement includes . □
First delete all extremely small source weights, below a fixed inverse polynomial in absolute value chosen so the deletion error is at most , by . Here and below such cutoffs can be rational. The following operation can be made on a set of edges simultaneously, keeping the other terms unchanged. For each replaced edge , of weight , insert a fresh central pair , with bond , and two spokes
Here is a common large positive integer. Recall that with eigenvalues on the singlet and triplets, respectively. The new energy is the previous one minus
up to error that can be made at most . To verify this shift, penalize excitations of the fresh pairs by , with singlet kernel for each pair and gap ; the rest has norm at most if the entering model has polynomial size and weights. The first-order compression is the unreplaced part.
Only two actions on the same fresh pair contribute to the inverse term, with denominator . Pauli products on one member of that singlet have expectation (components indexed by ), and products across the pair have , by the singlet Pauli relations. Thus the negative inverse term gives per edge. The estimate just proved permits a polynomially large .
Apply this conversion first to all surviving signed edges. For each of its spokes make a path of length nine by two subdivision stages, each using the same operation for positive weights (a path of length three per replaced edge). In the first subdivision replace both spokes, and in the second replace all edges of their resulting paths, not the original central-pair bond. Each stage can use its own polynomial scale as there are only three stages total. Thus in the final positive model there are, per input edge still present, one central bond and two nine-link paths, from to and from to . Let be the total number of sites (including original vertices); every actual link weight and its reciprocal are polynomially bounded. There is a sum of scalar shifts from the operations, such that
All these intermediate weights and shifts are polynomial-time approximable to inverse polynomial error (the square roots need not be exact rational outputs).
Independently adjustable contact lengths
Equation (1) completes the energy conversion. To encode its positive weights by orbital hopping, we now need a geometry in which changing one link length does not constrain the others. Here is a planar contact layout in which all the links have independently adjustable lengths; see Figure 1. Start with original grid spacing 17. Orient the edges in the two positive axial directions, and within each edge gadget use planar coordinates along that direction and in a perpendicular direction, origin at . In the positive input sign case set , ; in the negative sign case set , . Recall and , respectively. Each nine-link path joins two on-axis points 8 or 8.5 apart. Orient it along the edge in order of increasing first coordinate. Make the first two, middle (fifth), and last two steps unit forward steps on that direction, and use two unit forward-sloping steps (steps 3 and 4) with first component for span 8, for span 8.5, balanced by two steps (6 and 7) with transverse components negated.
The link lengths now equal one, and nonlinks have distance at least 1.4. Indeed consecutive separations projected along a main path/backbone are at least ; nonconsecutive sites on it are separated by at least 1.5, and the extra side site for a negative sign is at distance at least from sites other than its central neighbor (the steps immediately there are straight). These bounds also give separation along each entire axial lattice line across successive gadgets. Parallel lines cannot interfere. Transverse offsets are at most ; off-axis internal sites have along-axis projection at least away from bounding original grid coordinates. Against sites of a perpendicular orientation this already gives separation greater than 1.4. If both internal sites of perpendicular orientations are on-axis, their coordinate differences in the two directions are at least one each. Original vertices other than a gadget’s two endpoints are far from its internal sites by grid spacing. This verifies the separation.
The unit-length layout already separates links from nonlinks. We now show that its link lengths can vary independently without losing that separation.
There is a fixed such that any prescribed link lengths in can be implemented with original vertices fixed and nonlinks still at distance . To prove this, consider one original-edge gadget. We can first change the central length by moving , then vary each path’s internal sites while its endpoint velocities are prescribed.
For a path with unit step vectors , a linear dependence with coefficients among the rows of its fixed-end length differential would give, at each internal vertex,
All vectors would therefore be equal. Since the path has nonparallel steps, they must all vanish. The differential is thus surjective, as is the full gadget’s link-length differential on its internal-site variables.
Choose a fixed right inverse for each of the two templates and restrict the internal-site displacements to its image. In these coordinates the length increment map is , with and . On a small fixed ball, ; for a sufficiently small prescribed increment , the iteration is a contraction of that ball. Choose the ball small enough to preserve the nonlink separation, and then fix accordingly. These solves have fixed dimension and algebraic initial data. Approximating the iterations with guard precision computes positions to any inverse-polynomial error in polynomial time. Because the original vertices stay fixed, separate gadgets can be solved independently; their number does not shrink the allowed length interval.

Figure 1. The two fixed contact templates, drawn at their actual relative coordinates. Every drawn link has length one, and each bent path has nine links. The original vertices remain at and . For , the central pair is , and the paths join to and to . For , it is , and both paths meet . Nonlinks are not drawn.
Localized modes and the finite fermion model
The positive spin model now fixes the target exchange strengths . This section constructs smooth localized modes and a finite fermion Hamiltonian whose low-energy spin interaction reproduces up to scale and a scalar shift. Its occupancy penalty retains the intersite direct Coulomb coefficients. Computing the cost of virtual double occupancy determines the required hopping, which we then obtain by choosing the mode separations.
We work in coordinates with . The common will be polynomially large. After dividing energies by , kinetic energy is the usual , each unit nucleus has coupling , and electron repulsion has coefficient .
Local modes and Coulomb coefficients
Take , and fix
These functions have more bounded continuous derivatives than needed below (in particular through order six). is nonpositive and compactly supported, and is strictly positive, radial, exponentially decaying. For details,
solves the equation by the Gaussian heat kernel identity. For , it and the derivatives needed below are bounded in absolute value by , by differentiating on and using ; for example integrate with this bound from to , bounding the omitted tails directly by Gaussian or exponential decay. Integrating over in the inner half disk and also gives a lower bound on of the form .
The isolated planar operator has ground state , energy , and a fixed positive gap above that mode. Indeed the shifted form on test functions is ; by closure and local positivity this gives nonnegativity and a simple kernel. A unit sequence perpendicular to the kernel with form tending to zero would be bounded in and, upon extraction, converge weakly and locally in (strongly on compact sets). By compact support of its limit would be in the kernel, hence zero. But then the shift of the form precludes convergence of the form values to zero. For the transverse direction we use the normalized Gaussian of with energy , , where is a large fixed integer to be chosen. This mode too has a fixed gap (same positive ground-state identity, with compactness here from confinement).
We will place the planar centers at scale using the contact layout. For all sufficiently accurate implementations, we require minimum spacing , nonlink spacing , and extent . Define
These constants measure direct electron repulsion: is the same-site coefficient and the coefficient between sites and . They are bounded uniformly. The function is radial as indicated and uniformly Lipschitz, as follows by translating the smooth density with decaying derivatives.
To control departures from one electron per site, we need a uniform lower bound on the Coulomb quadratic form. We prove , with fixed , uniformly over these separated geometries once the polynomial scale is sufficiently large. For real coefficients , put . Choose a fixed smooth nonnegative, nonzero test bump near the origin, and let be its disjoint translates to the centers . With , Poisson’s equation and integration by parts give
for these smooth decaying densities, or first after truncation at infinity. To bound the left side below even for signed , let . Its diagonal entries equal a fixed , while the row and column sums of its off-diagonal entries are exponentially small in , up to a polynomial factor in . Thus , with at our scales, and
The displayed Coulomb inequality proves the required lower bound. Here and below we take so large a power of that exponential-in- bounds beat the polynomial factors. In particular, applying the bound to two sites and coefficients shows that is bounded away from zero for every distance in use; it is also uniformly bounded above.
The occupancy penalty and spin exchange
For the moment keep any geometry satisfying the separation bounds, and let the hopping strengths be free parameters. On canonical fermion modes, two spins at each site, restrict to electrons and write for total occupancy at site . For this finite model we multiply dilated energies by , so its Coulomb coefficients have no factor. The direct Coulomb interaction is
Set . A diagonal one-body term cancels the terms linear in the occupancy defects: using and ,
Section 5 will produce this one-body term by adjusting the well depths. The finite Hamiltonian to be realized is therefore
The nonnegative quadratic penalty has kernel exactly the singly occupied spin space. It has a fixed gap: a nonzero integer defect vector has sum zero, hence squared length at least two, so its penalty is at least by Coulomb coercivity.
Hopping vanishes on first-order compression to single occupancy. Its second-order effect is the double-occupancy superexchange familiar from Anderson [1 Eqs. (12)–(13), (18)–(21)]; his transfer-energy discussion also retains intersite Coulomb contributions. The normalization and error bound below are proved for the precise matrix used here.
One allowed hop on creates a doubly occupied site and an empty site. Its defect vector is on that pair and zero elsewhere, so its excitation energy is exactly . Only a hop on the same link can restore single occupancy in one further step. For hopping strength , the negative second-order operator is
Indeed the triplets do not hop into same-site pairs, while the singlet hops into two orthogonal doubly occupied states with amplitudes of magnitude . Apply the creation and annihilation operators to to obtain these amplitudes. Other sites can be placed after these two in the ordering: changing the ordering of singly occupied sites gives only an overall sign on the spin space.
With a common positive parameter to be fixed below, choose target hoppings
They give the effective spin term . Their hopping operator has norm at most , uniformly over admissible separated geometries. By Lemma 2, the energy remainder is at most , since the penalty gap is uniform. Fix a rational inverse-polynomial small enough that the lemma applies and this remainder is at most . This choice is independent of and of the final centers.
Calibrating the separations
The modes supply the hopping profile
It is positive, uniformly Lipschitz, and lies between and by the tail estimates. The continuum compression will supply hopping in the units of . Although the occupancy penalty involves every pair, the target hopping on link depends only on its own distance through . Thus each link requires a scalar solve for
At and , respectively, is positive and negative if the fixed polynomial exponent in is sufficiently large. Indeed the first term has respective sizes and , up to powers of , whereas the target has polynomial upper and inverse-polynomial lower bounds in .
Bisection with approximate sign tests finds an inverse-polynomially small residual: stop if the sign is ambiguous within the evaluation error, or continue until the bracket width times a Lipschitz bound is small enough. No monotonicity or derivative lower bound is required. The link-length construction in Section 3, rescaled by , then implements all these distances at once. Its contraction solves and a final rational approximation give rational centers with the required separations and hopping accuracy. Section 8 details the numerical evaluation.
From now on, means at these final centers with . Choose the per-link calibration accuracy so that replacing by changes the total Hamiltonian norm by at most . Together with the second-order remainder, this gives
Polynomial scale convention
Equation (5) fixes the finite-model accuracy required of the continuum construction. All subsequent errors must fit inside an inverse-polynomial fraction of in the energy units of .
In the estimates below denotes a polynomial upper bound with uniform coefficients and exponents, which may be enlarged between uses. All requirements of the form "make small" for fixed , with required smallness at worst inverse polynomial in , can be imposed simultaneously. Specifically we take an integer growing as a sufficiently large fixed power of (allowing a fixed factor) and put
Here will be the side length of the cubature cells in Section 6; the relation gives each of their eight nodes the mass needed for a unit nucleus. Other magnitudes such as the large box used below will have stated polynomial bounds in , ; its volume will enter only when explicitly accounted for. The fixed only has to dominate bounded potential derivatives as described next and can be chosen before these scale choices.
Synthesis by a nonnegative charge density
We now construct an attractive Coulomb potential whose low-energy matrix realizes the modes and hopping of Section 4. A broad slab supplies the transverse oscillator near the modes and a positive background density. Adding the planar wells then changes the density by a bounded, compactly supported term, so the total density remains nonnegative. We first construct this potential, then establish a fixed energy cost outside the mode space and compute its matrix on that space.
The slab and the well-depth counterterm
Use integers of size between and , and . (For one can use a binary bit-length scale.) Let
The occupancy identity (C) requires the one-body diagonal , where . Put . Since , a small increase in each well depth has the required sign and size. Take a fixed sufficiently smooth cutoff between 0 and 1, supported inside , equal to 1 for ; it may be piecewise polynomial with rational data. Define
These are polynomially bounded independent of ; hence at our scales. For all the derivatives we need of are bounded independently, by disjoint planar supports. Choose the fixed integer so large, using , that . There is no circularity, since the bound based on , , does not depend on the vertical Gaussian or . The centers fit well inside the horizontal box for our scale. Thus
by compact support and the fundamental solution identity. Thus the density in (4) lies between and on . Its total mass is , because . The next estimates show that the truncated slab approximates the harmonic potential near the modes and provides a global lower bound outside that region.
Here are useful background estimates with constants independent of , :
Indeed at each is minimized at , and is also nondecreasing in for fixed . These statements follow one coordinate at a time by integration of even decreasing kernels on centered intervals. At , extending the horizontal integration to the plane in the difference between and gives for exactly , by polar integration. The omitted difference costs , by inverse cube decay outside horizontal radius . For , the change relative to the horizontal center is bounded by . For example translate the integration square instead of translating the kernel. The first derivatives then come from sides at distance at least , and second derivatives are bounded by by integrating first derivatives of the kernel on the sides. Evenness at zero gives the bound. Finally and .
The one-particle gap and residual
The potential has now been expressed as the Coulomb field of a nonnegative density. Before replacing it by point nuclei we need two properties: a fixed energy gap outside the prescribed modes, and a small residual on those modes. The gap will control arbitrary continuum states, while the residual will control mixing with the mode space.
Let the shifted continuous one-particle operator, still before point-charge replacement, be
We suppress the tensor identity on spin. Let project onto the span of the , including both spins when present, and write for their spatial Gram matrix. Exponential tails and the spacing give : for example, each off-diagonal overlap is , by leaving part of the decay as an integrable factor. We use the orthonormal modes
In particular, unit vectors in have polynomially bounded one-particle kinetic energy.
Proposition 3 (Continuous one-particle control). For the density and separated centers constructed above, with the polynomial scale chosen sufficiently large, there are fixed constants such that
The inequalities are quadratic-form inequalities on the one-particle domain, and the last bound is an operator norm from the range of to . All estimates hold with either spin included.
Proof. For the first inequality compare below, using (5), with the separable planar multiwell plus the vertical operator with capped potential , shifted by . Errors in the lower bound are , since and the terms are small and bounded everywhere.
For clarity we detail the gap argument. In the plane use a quadratic partition of unity consisting of cutoffs about each site (equal to one inside radius , supported at radius ) and a remaining exterior function. They can be built by smooth angle interpolation from to on the transition annuli using sine and cosine, with squared gradients summing to or less. The localization form identity (IMS localization; compare [11 Lemma 3.1]), obtained here by the product rule with kinetic coefficient , then costs . In each site term use the isolated ground and gap bound, and in the exterior use the free kinetic lower bound. This gives
where projects on the planar translates of , can be taken below the isolated gap and , and the small bound can be made uniformly small. In detail, with site cutoffs and , the site term evaluated on is at least
the exterior term also bounds its share of the term as there is no well on its support. The sum of rank-one operators from the cutoff ground-state modes differs from by at most , by the tails and Gram bound.
Similarly localize the vertical problem with an inner cutoff equal to one on , supported on , and an exterior function. Use the harmonic gap and the large potential lower bound on the respective terms, at gradient cost , with Gaussian loss on the rank-one mode. This gives a vertical lower bound , where . Since on the spatial space and
the tensor sum has a fixed gap on once the errors are small.
The slowly small errors such as here are needed only for a fixed gap estimate, not as the energy accuracy per particle.
The kinetic lower bound in (8) follows from (7) or background minimality and bounded . For the residual estimate, (7), the crude global background bound, and the mode tails give
Indeed moments with , suffice there, and outside this region the Gaussian or planar exponential beats the global polynomial magnitudes, using . The cutoff defect in versus acting on any mode is likewise negligible. Since , the remaining residual is a sum of other wells acting on the small planar tails and the term with . This proves (6).
The compressed one-particle matrix
The fixed complementary gap alone does not give the required energy accuracy. We therefore compute the matrix on the prescribed modes, including its diagonal counterterm, to a sharper scale.
The continuous one-body compression can now be evaluated more precisely. On the nonorthogonal functions before Gram correction, the column on mode comes, up to background and cutoff errors as above, from
On row , the leading contribution is by construction; the other-well integrals there use two tail factors. On row the first sum at gives . The cases of the first sum are products of two tail factors at a third site; each such integral is by the spacing and compact well support. Terms with the explicit give only negligible off-diagonal errors (at least one planar tail on each well support, hence bounded by altogether on such an entry). Nonlink hoppings cost at most per term.
To pass to the orthonormal modes, let . The matrix becomes , and
by (6). Here is the shifted matrix: subtracting before making this estimate removes the large background scalar. The correction therefore remains negligible after multiplication by .
Define the spatial matrix
The preceding estimates give
This is the required one-particle compression, with the identity on spin. The diagonal supplies the depth counterterm, and the link entries supply the calibrated hopping.
Replacing the density by unit nuclei
Our input is the nonnegative density in (6). We must replace its Coulomb field by finitely many equal masses , so that physical nuclear charges are all one. The construction has two distinct error requirements: a form bound on arbitrary states and a stronger compression bound on the smooth localized modes.
The comparison with uses energies multiplied by . A compressed error must therefore be smaller than , up to the required polynomial margin. The error coupling the mode space to its complement can be larger: the fixed complementary gap makes its energy contribution quadratic, as proved in Section 7.1. With , a cubature rule exact through degree three will give an compressed error and an form error. Both resulting energy errors are in the units of , up to polynomial factors.
Transport and charge placement
The density interpolation uses Moser’s deformation method [5 Section 4], also developed by Dacorogna and Moser [4 Section II, Lemma 3]. Here the vector field is explicit and compactly supported inside the box; the following continuity-equation calculation proves the required transport directly. Write , so that and is the desired density on . Since , the time-dependent vector field on full space
has uniformly bounded derivatives through order four. It vanishes outside the well cylinders strictly inside the box. Let be its flow from time zero and put . The ODE and its differentiated equations give bounded derivatives of through order four and a bounded Lipschitz inverse. The flow is the identity off the cylinders and preserves .
The identity gives
Thus the flow transports the uniform measure to the target density. The last formula also shows how to retain equal cubature masses: move the nodes by and keep their weights unchanged.
Since , , are integers, cubes of side tile . On each cube use the eight tensor products of the two equal-weight Gauss points per coordinate, at the midpoint plus or minus . The rule integrates polynomials of total degree at most three exactly, by the corresponding moments on each interval. Map these nodes by . Their common mass remains ; polynomial exactness is used in the original cube coordinates, on integrands composed with .
Each exact mapped point will be approximated within Euclidean error at most
by rational points , and the physical nuclear positions are . They remain distinct by node separation and bi-Lipschitz bounds.
Form and compression estimates
Let be the shifted one-particle operator with these actual point nuclei in dilated units, i.e. with potential .
Proposition 4 (Unit-nucleus replacement). For the transported degree-three cubature and rational rounding just specified, with , the shifted continuous and point-nucleus operators satisfy
The first estimate holds for every one-particle function . The second is the norm of the compressed form on the localized-mode space . Both bounds are in dilated energy units.
Proof. We first work at the exact transported nodes. On an original grid cube , write , , for its Gauss nodes. Taylor’s theorem and exactness through degree three give the common error estimate
whenever has four bounded derivatives on . We apply this first to the singular Coulomb kernel away from its singularity, then to the smooth fields obtained after compression.
General form estimate. For fixed evaluation point , the charge integral is of the kernel against uniform density in . For cubes whose images touch a ball of radius a fixed large constant times about , there are only such cubes. Their continuous contribution is by bounded transformed density. The discrete one is bounded by a sum of with .
On farther cubes, the pure fourth derivative of the kernel is bounded by . Distances to are comparable within each such cube, and the bi-Lipschitz change of variables has bounded Jacobian. Summing the pure derivative contributions therefore costs at most
The other chain-rule terms contain a derivative of of order at least two and a kernel derivative bounded by , . Such terms occur only on cells meeting the well cylinders, of combined volume . Below distance one they are bounded by the same inverse fifth power; beyond distance one their contribution is at most .
This proves a pointwise absolute error bound by plus the close-node sum above. In particular there is no factor the size of the large horizontal area in this bound.
The close-node balls have bounded overlap also upon any fixed dilation. Around each node one has
This follows by a cutoff and the three-dimensional Hardy inequality , which follows also by the divergence formula for and Cauchy–Schwarz. Summing gives the general form bound, since .
Compressed estimate. For compression use the smooth Coulomb fields
Their derivatives through order four are uniformly bounded (differentiate the translated densities). Fourth derivatives satisfy
Indeed derivatives of the product density decay exponentially about , uniformly by bounded derivatives on the other factor. At a large distance , use a smooth density cutoff supported within distance of that center and equal to one inside , with the cutoff radius held fixed when differentiating. There one uses pure kernel derivative decay, and on the remaining tail one differentiates the cut-off density instead, with exponentially small bounds. This proves the assertion. Applying the same degree-three cubature to now costs for each entry: pure fourth derivatives have summable volume bounds as just proved, and other chain-rule terms live on the exceptional cells. Gram correction and taking matrix norms cost at most polynomial factors. This proves the second estimate for exact nodes.
Rounding. A center shift of size changes the inverse distance by at most . Cauchy–Schwarz and translated Hardy inequalities bound its form by . Summing the masses gives the total bound , where
This is smaller than both required errors, also after compression because the modes have polynomial kinetic bounds. It completes (7).
We have obtained the two replacement estimates with constants independent of the horizontal area of the slab. The full mass enters only the rounding bound, where the chosen coordinate accuracy absorbs it. Section 7 now combines these estimates with the fixed complementary gap and the compressed matrix from Section 5.
Many-electron continuum estimate
The point nuclei have now been fixed. We must compare their electronic energy with the finite Hamiltonian on all continuum states. First we eliminate the space in which some electron lies outside the localized modes, using the fixed gap and the two replacement estimates. Then we identify the compressed Hamiltonian, keeping direct Coulomb repulsion exactly at its leading order.
In the dilated coordinates the full operator after dividing by and shifting by is
We work on the antisymmetric space with spins and its form domain. The Coulomb forms used here have the variational meaning specified in Section 1, whether or not their energy infima are attained. Indeed, fiberwise Hardy and Cauchy–Schwarz give, for every and every fixed center ,
The same estimate applies to a pair singularity by fixing the other coordinates. For each finite nuclear configuration, summing with sufficiently small gives a closed lower-bounded form whose shifted form norm is equivalent to the norm. Smooth compactly supported antisymmetric functions form a core. The spectral infimum is therefore the infimum of the form over normalized states, and the form estimates below extend from this core by continuity.
Let project onto the space in which all particles lie in , and write
The smooth decaying modes lie in the form domain, so their compression is well defined. The one-particle kinetic bound gives for .
Let
where the compression is defined by the form. This is a finite-dimensional minimum because projects onto the -electron space built from one-particle spin modes.
Control outside the orbital space
Proposition 5 (Eliminating the continuum complement). For the unit-nucleus construction above with , and sufficiently large polynomial scale , the full antisymmetric -electron operator in dilated and shifted units satisfies
The lower bound holds on every normalized antisymmetric state, including every spin sector.
Proof. The proof needs a lower bound on the complementary space, a bound on its coupling to , and then a square completion. Write
By (6), as one-particle forms,
for some : the diagonal and cross terms involving are controlled by . Since , summing gives a fixed positive lower bound for on once is small. We also have the kinetic lower bound . A convex combination, with a sufficiently small weight of order on the kinetic bound, retains a positive term and gives
for . By (7) on each coordinate and positivity of , this estimate persists with half that coefficient for .
For , equation (6) gives . Hardy applied with one particle coordinate at a time also gives . Finally, polarizing the form bound in (7) and using the bound on controls the point-nucleus replacement in the mixed block. Together these estimates give
The same estimates show that the compressed form has norm less than at sufficiently large scale. Set and let bound the mixed block. Decompose any normalized form-domain vector as , where and . Subtracting makes the -diagonal form nonnegative and leaves at least on the complement. Hence, with all pairings interpreted as forms,
This proves the lower bound in (8); the upper bound follows by testing a minimizing vector in . The lower-bound argument applies to every normalized antisymmetric state, in any spin sector, without any binding or ground-eigenvector assumption.
Compressed energy
It remains to evaluate . Section 5 computed the one-particle matrix in the orthonormal modes , to accuracy . Multiplying the compressed replacement error in (7) by costs only , so the same matrix accuracy holds for the point nuclei. For the repulsion , the pair matrix on the original modes before Gram correction has spatial entries from products of two transition densities. Keeping only as the respective densities gives the direct coefficients . Any unequal indices within a density give an exponentially small error: for , and the Coulomb field of the other density product in absolute value is uniformly bounded by orbital boundedness and decay. The matrix of direct interactions in the product basis is bounded, and Gram correction changes its entries negligibly.
These entrywise estimates give a many-electron operator-norm error of at most . To see the dimension dependence, write the one- and two-body matrices in the orthonormal spin modes. Each coefficient multiplies a monomial or , of norm at most one. There are only and such monomials, respectively, so summing their coefficient errors costs a polynomial factor on the entire fermion space. In this representation, the retained two-body term is
The retained one-body diagonal is . At the filling , the identity (C) combines these terms into the first line of (2), including its scalar. The hopping matrix gives the remaining line of the calibrated . We have thus identified the compressed Hamiltonian, and the comparison with the full continuum follows.
Proposition 6 (Continuum-to-fermion energy comparison). For the constructed unit nuclei with , let be the dilated and shifted continuum operator above and let be the finite fermion Hamiltonian (2). At sufficiently large polynomial scale,
Proof. The one- and two-body matrix estimates just obtained compare with within . Multiplying (8) by contributes only , which fits within that bound. □
This analysis treats long-range diagonal effects and possible charge transfer at the virtual-excitation scale in (2)–(3), rather than requiring all intersite Coulomb matrix elements to be negligible compared to the input promise gap.
Table 2 records the different roles of the errors. In particular the arbitrary-state form error cannot be used as a direct energy error after multiplication by .
| Estimate | Error scale | Role in the comparison |
| General form replacement, (7) | Controls mixed blocks in the norm | |
| Compressed replacement, (7) | Direct error on the mode space | |
| Complement elimination, (8) | Square of the mixed-block scale | |
| Last two errors after multiplication by | Error in the units of | |
| Total comparison, (9) | Includes the other mode-matrix errors |
Table 2. Error scales up to polynomial factors . The first three rows use the units of ; the last two use the units of . The and localization losses establish a fixed complementary gap and do not enter the energy-precision budget.
Physical energies and thresholds
Choose the polynomial scale in large enough that (9) costs at most and that . All earlier smallness, separation, and calibration estimates hold simultaneously by the stated growth choices. Undoing the dilation and scalar shift gives the physical energy exactly as
Combining (1), (3), and (9) now gives a total error at most , and hence at most , from
Take output thresholds rationally approximating and each within . For a YES source instance,
For a NO source instance, the reversed estimate gives
Since , the threshold separation satisfies
Thus both promises survive rational rounding, and the reduction meets the required output separation .
Implementability and encoding
The preceding construction specifies the nuclear configuration, and Section 7.3 gives threshold accuracies that preserve the source promise. It remains to compute those outputs in deterministic polynomial time. We first fix the order of the scales, then explain how to evaluate the orbital integrals and transported nodes to the required accuracy.
Order and uniformity of the scale choices
Fix the bounded well data and the integer using the positivity bound in (6), under the conditions that the well supports are disjoint and . As explained there, that derivative bound uses only , , , so it does not depend on the later Gaussian or Coulomb coefficients. Next fix the source cutoff and three spin gadget penalty scales from the source size and gap bounds. Fix the inverse-polynomial rational using the uniform Coulomb coercivity constant for sufficiently large . Finally choose
with sufficiently large absolute positive integers .
At this last stage, , , the layout extent, and already have fixed polynomial size bounds. Their actual values, including the centers and , may be computed after is fixed. Each remaining smallness condition has the form bounded by a specified inverse polynomial in , with fixed . The endpoint brackets for hopping calibration have the same fixed-power character. A sufficiently large fixed therefore meets every asymptotic requirement; increasing covers all and the fixed separation and gap conditions. The constants whose existence was proved in the preceding estimates can be dominated by absolute constants in these choices.
The uniformity of this argument depends on the bounds already proved: the polynomials come from fixed-order derivatives and moments, fixed-dimensional wells and gadgets, and polynomially many matrix entries. The large box is treated separately. Its effects were bounded in (5), by orbital tails, and by the summable fourth derivatives in the cubature argument. Its total mass enters only the much smaller node-rounding error. Thus no exponent needs to grow with the input, and , the box volume, and are all polynomial in after the fixed choice of .
Numerical evaluation and hopping calibration
All required real quantities can be evaluated to inverse-polynomial absolute accuracy. This includes the large scalar shift in (10): since is multiplied by , evaluating it within
uses at most one quarter of the allowed threshold error . The other scalar terms can be allocated the remaining budget in the same way, because their amplification factors and their number are polynomially bounded. The magnitude therefore causes no demand for exponentially fine absolute precision.
We give elementary integration procedures for the quantities used in the construction. In the Gaussian heat formula for and its derivatives, substitute and rescale the Gaussian integration variable. For a derivative of any required order, the result is
This integrand is regular at . The needed derivatives of are bounded piecewise polynomials with bounded first derivatives. Polynomial integration cutoffs make the Gaussian tails smaller than any prescribed inverse-polynomial error; on the remaining domain the integrand and its Lipschitz bound are polynomially bounded. Elementary grid sums in this fixed dimension therefore suffice. Division by in and its derivatives occurs only on the unit disk, where has a fixed positive lower bound. The other decaying orbital integrals, including normalization and hopping integrals, can likewise be truncated about their centers with polynomial cutoffs.
For Coulomb integrations, including and , replace inside radius by , with an appropriately small inverse polynomial. Integrating the local singularity against bounded densities gives an error of order times the relevant polynomial volume bounds. The capped kernel has Lipschitz constant at most , so grid sums again give the required accuracy in polynomial time. All integrations have fixed dimension and fixed nesting depth. Exponentials, logarithms, square roots, and the other elementary constants can also be evaluated by rational approximations to the required accuracy; the arguments and reciprocal absolute tolerances are polynomially bounded. Square roots at zero can be handled by bisection. Choosing guard precision for the nested evaluations keeps their accumulated errors within the allotted budgets.
The link hopping equations have strict endpoint brackets, from exponential decay at the two prescribed distance scales and polynomial upper and inverse lower bounds on their targets. In approximate bisection, evaluate the residual to a small fraction of its per-link tolerance. If the sign is ambiguous, the residual is already small enough. Otherwise retain the sign-change bracket until its width times the Lipschitz bound is within tolerance. No derivative lower bound is needed. The fixed layout contractions and subsequent rational center approximations can be computed more accurately than these tolerances require.
Flow evaluation and rational coordinates
Once the rational centers are fixed, their exact real coefficients define a reference density and a reference flow . We approximate the images under that flow; numerical evaluation of is part of the velocity evaluation error. Thus all numerical and final rational rounding errors can be charged to the single displacement budget , without changing the reference density or any cell mass.
The flow lasts for time one and has uniformly bounded velocities and first derivatives in space and time. Euler stepping with an inverse-polynomial time mesh therefore suffices. More explicitly, for mesh (the reciprocal of the number of steps), initial error , per-step arithmetic error , and velocity evaluation error , the final position error is
Indeed a step multiplies the preceding error by at most and adds . Each parameter can be chosen inverse polynomially small so that the final error is at most . Rounding intermediate positions on sufficiently fine rational grids keeps their bit lengths polynomial. Near support boundaries, the specified smooth vanishing and derivative bounds give the same error control. None of these operations uses a many-electron wavefunction.
Output size and encoding
There are point nuclei, polynomially many in , and every nucleus has charge one. Their rational physical positions, the unary electron number, and the rational thresholds from Section 7.3 can all be computed with polynomial encoding lengths. Reducing rational outputs to lowest terms gives the specified input format. To define the map on every input, one may first check the source syntax and the fixed polynomial bounds used in the construction, and output a fixed instance when they fail; this does not affect either promised implication.
The deterministic construction thus supplies the outputs whose energy comparison and threshold margins were proved in (10) and the following inequalities. With the electronic-energy convention that omits nuclear repulsion, this completes the proof of Theorem 1, with and .
References
References
- [1]P. W. Anderson. New approach to the theory of superexchange interactions. Physical Review 115(1):2–13, 1959. https://doi.org/10.1103/PhysRev.115.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. https://doi.org/10.1016/j.aop.2011.06.004. Numbered formulas and sections refer to arXiv:1105.0675v1: https://arxiv.org/abs/1105.0675v1.
- [3]Toby S. Cubitt, Ashley Montanaro, and Stephen Piddock. Universal quantum Hamiltonians. Proceedings of the National Academy of Sciences 115(38):9497–9502, 2018. https://doi.org/10.1073/pnas.1804949115. Extended manuscript, arXiv:1701.05182v4, 31 May 2019; theorem numbering refers to this version: https://arxiv.org/pdf/1701.05182v4.
- [4]Bernard Dacorogna and Jürgen Moser. On a partial differential equation involving the Jacobian determinant. Annales de l’Institut Henri Poincaré C, Analyse non linéaire 7(1):1–26, 1990. https://www.numdam.org/item/AIHPC_1990__7_1_1_0/.DOI
- [5]Jürgen Moser. On the volume elements on a manifold. Transactions of the American Mathematical Society 120:286–294, 1965. https://doi.org/10.1090/S0002-9947-1965-0182927-5.
- [6]Bryan O’Gorman, Sandy Irani, James Whitfield, and Bill Fefferman. Intractability of electronic structure in a fixed basis. PRX Quantum 3:020322, 2022. https://doi.org/10.1103/PRXQuantum.3.020322.
- [7]OpenAI. Continuum Coulomb hardness with binary nuclear charges. OpenAI Math Release preprint OAI:Continuum-Coulomb-hardness-with-binary-nuclear-charges-September-24-2026, 2026.
- [8]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.
- [9]Stephen Piddock and Ashley Montanaro. The complexity of antiferromagnetic interactions and 2D lattices. Quantum Information and Computation 17(7–8):636–672, 2017. https://www.rintonpress.com/xxqic17/qic-17-78/0636-0672.pdf.arxiv.org/abs/1506.04014
- [10]Norbert Schuch and Frank Verstraete. Computational complexity of interacting electrons and fundamental limitations of density functional theory. Nature Physics 5:732–735, 2009. https://doi.org/10.1038/nphys1370. Manuscript and supplementary arguments: https://arxiv.org/abs/0712.0483v2.
- [11]Barry Simon. Semiclassical analysis of low lying eigenvalues. I. Non-degenerate minima: asymptotic expansions. Annales de l’Institut Henri Poincaré A, Physique théorique 38(3):295–308, 1983. https://www.numdam.org/item/AIHPA_1983__38_3_295_0/.
- [12]Gerald Teschl. Mathematical Methods in Quantum Mechanics: With Applications to Schrödinger Operators. Graduate Studies in Mathematics 99, American Mathematical Society, 2009, first edition. https://www.mat.univie.ac.at/~gerald/ftp/book-schroe/schroe.pdf. First-edition corrections: https://www.mat.univie.ac.at/~gerald/ftp/book-schroe/errata.pdf.