Introduction
The (1 + 1)-dimensional Gross-Neveu model describes N f N_f N f relativistic fermion flavors coupled by a local four-fermion interaction. In the infinite-volume massless theory, asymptotic freedom and dimensional transmutation accompany dynamical mass generation associated with spontaneous breaking of a discrete chiral symmetry [1 , 2 ] . Although it has no dynamical gauge field and does not reproduce the full structure of quantum chromodynamics, the model provides a controlled setting for nonperturbative fermion dynamics. Matrix-product-state studies have characterized its chiral symmetry breaking, mass-gap scaling, entanglement structure, and relativistic continuum behavior [3 , 4 ] . These features motivate its use as a benchmark for interacting-fermion state preparation. Here we study preparation accuracy for finite-lattice Hamiltonians at fixed lattice spacing.
Reliable preparation of interacting low-energy states is a prerequisite for Hamiltonian calculations of correlation functions, real-time evolution, and scattering. Direct Monte Carlo treatments of real-time path integrals encounter oscillatory phase [5 ] , and Euclidean calculations at finite fermion density can suffer from sign problems [6 ] . Tensor-network methods remain highly effective in one dimension [7 ] , but quantum simulation represents unitary time evolution directly and therefore motivates circuit constructions for the vacuum and low-lying spectrum [8 ] . Finite systems accessible to classical reference calculations provide benchmarks for assessing these constructions.
Several Gross-Neveu state-preparation proposals have treated the interacting vacuum as an input to a subsequent dynamical calculation. Adiabatic vacuum preparation was incorporated into a fermionic quantum-field-theory scattering algorithm [9 ] ; later proposals sought to reduce this cost by compiling classically obtained matrix-product states by preparing gapped fermionic ground states site by site [10 , 11 ] . Other quantum studies have focused on real-time correlators, propagators, scattering observables, and hardware-aware multi-flavor dynamics [12 , 13 , 14 ] . Together, these developments motivate variational circuits that incorporate the exact charges and interaction structure of low-energy states from the outset.
The closest circuit-level ground-state studies use different finite-lattice formulations and circuit architectures. A four-qubit hardware-efficient Variational Quantum Eigensolver (VQE) calculation treated the massless two-flavor model and compared energies and computational-basis probabilities with exact-diagonalization and density-matrix renormalization-group results [15 , 16 ] . Its displayed circuit does not preserve total or flavor-resolved fermion number by construction, and its finite-lattice interaction differs from the Dirac-cell scalar-density-square interaction used here. More recently, adaptive variational quantum imaginary-time evolution was applied to massive Gross-Neveu and Thirring models for N f = 1 , 2 , 3 , 4 N_f = 1,2,3,4 N f = 1 , 2 , 3 , 4 and registers through 20 qubits [17 ] . The present fixed-ansatz calculations achieve smaller relative energy errors than the quoted benchmarks at the available comparison points, with each error measured against the reference energy of its respective finite-lattice Hamiltonian. Ref. [17 ] uses a naïve two-component Dirac discretization, whereas we use staggered fermions; the discretizations and computational resources differ, so these numbers compare reported benchmark errors rather than establish a matched algorithmic ranking.
The lattice Hamiltonian considered here commutes with every flavor number N b N_b N b and consequently with the total number N = ∑ b N b N = \sum_b N_b N = ∑ b N b . With a reference state of definite charge, symmetry-preserving circuits restrict the variational search to the corresponding conserved-charge sector [18 ] . A total-number-conserving ansatz permits occupation transfer among flavors, whereas a flavor-number-conserving ansatz forbids such transfer while retaining diagonal cross-flavor correlations. Preserving every N b N_b N b enforces mutually commuting Abelian charges but does not by itself impose the full non-Abelian flavor symmetry. Our two fixed families share the circuit graph, layer organization, and local-phase parametrization. Removing the cross-flavor exchange parameters imposes individual flavor-number conservation. Under the optimization protocol used here, this restriction yields smaller final energy errors in the completed two-flavor comparisons, demonstrating a practical benefit of the stronger charge constraint for these benchmarks.
Adaptive construction addresses the complementary problem of selecting the circuit architecture. ADAPT-VQE grows the ansatz by ranking candidate generators through energy gradients and reoptimizing after each selection [19 ] . SC-ADAPT-VQE organizes operators into translated bulk sums and boundary-sensitive surface corrections; for the Schwinger model, structures determined on classically tractable lattices were used to construct circuits for larger systems [20 ] . We adapt this approach to the Gross-Neveu Hamiltonian using a compact, range-truncated pool. In addition to mass-hopping bulk and surface families, it contains an interaction-sensitive family obtained from the cross-flavor component of the interaction-hopping commutator. Every retained generator preserves each N b N_b N b and has a local flavor-number-preserving circuit realization. At fixed flavor number, range caps, and append count, the precompilation local-factor count grows linearly with volume while the shared-parameter count remains fixed.
We benchmark the circuits using classical simulations in massless and massive regimes, with reference energies and states obtained using the density-matrix renormalization group (DMRG), a tensor-network method, and exact diagonalization for the small-system spectral comparisons. Selected massive flavor-number-conserving fixed-ansatz benchmarks span N f = 1 , 2 , 3 , 4 N_f = 1,2,3,4 N f = 1 , 2 , 3 , 4 and registers through 30 qubits, with relative energy errors of approximately 1 × 10 − 5 1 \times10^{-5} 1 × 1 0 − 5 –2 × 10 − 4 2 \times10^{-4} 2 × 1 0 − 4 . Selected massive SC-ADAPT benchmarks with N f = 1 , 2 , 3 N_f = 1,2,3 N f = 1 , 2 , 3 have relative energy errors below 2.1 × 10 − 3 2.1 \times10^{-3} 2.1 × 1 0 − 3 through 30 qubits. The complete one-flavor sequence is unchanged over L D = 12 L_D = 12 L D = 12 –15. In a retrospective test, freezing its ten-generator L D = 12 L_D = 12 L D = 12 sequence and tabulated four-decimal parameters gives relative energy errors of 1.97 × 10 − 3 1.97 \times10^{-3} 1.97 × 1 0 − 3 –2.03 × 10 − 3 2.03 \times10^{-3} 2.03 × 1 0 − 3 at L D = 13 L_D = 13 L D = 13 –15 without target-side selection or reoptimization. This establishes finite-volume energy transfer for the specified rounded circuit. Matrix-product-state (MPS) evaluations extend the one-flavor study to L D = 30 , 50 , 100 , 200 L_D = 30,50,100,200 L D = 30 , 50 , 100 , 200 , corresponding to 60–400 qubits, using frozen source parameters for the first three volumes and a mixed extrapolation and frozen-parameter prescription for the last. At maximum bond dimension 256, their energies differ from the DMRG references by approximately 0.35%–1.76%. These finite-bond evaluations retain numerical error, and fixed-accuracy performance at arbitrary volumes remains to be tested.
Following a charge-preserving sequential-deflation strategy [21 ] , we also prepare the lowest four states by within-sector rank k = 0 , 1 , 2 , 3 k = 0,1,2,3 k = 0 , 1 , 2 , 3 in the ( N 0 , N 1 ) = ( 2 , 2 ) (N_0,N_1) = (2,2) ( N 0 , N 1 ) = ( 2 , 2 ) sector of massless and massive eight-qubit systems. The massive k = 3 k = 3 k = 3 target belongs to a degenerate global eigenspace rather than being the global third excited state. A projector onto the complete eigenspace supplies a basis-independent fidelity diagnostic. These benchmarks distinguish state preparation within a conserved-charge sector from ordering in the complete spectrum.
Section II defines the Hamiltonian and qubit conventions. Sections III and IV present the fixed and adaptive circuits, respectively. Ground-state benchmarks and the transfer tests appear in Sec. V, followed by sector-resolved excited states in Sec. VI and conclusions in Sec. VII.
Continuum and Lattice Hamiltonians, Symmetries, and Qubit Conventions
Continuum Normalization and Staggered Hamiltonian
The massless Gross-Neveu model is defined in Ref. [1 ] . We study its bare-mass deformation for N f N_f N f interacting Dirac-fermion flavors in 1 + 1 1+1 1 + 1 dimensions, with continuum normalization
L = ∑ b = 0 N f − 1 ψ ˉ b i γ μ ∂ μ ψ b − m ∑ b = 0 N f − 1 ψ ˉ b ψ b + g 2 2 ( ∑ b = 0 N f − 1 ψ ˉ b ψ b ) 2 (1) \mathcal{L} = \sum_{b=0}^{N_f-1} \bar{\psi}_b i\gamma^\mu\partial_\mu\psi_b - m \sum_{b=0}^{N_f-1} \bar{\psi}_b\psi_b + \frac{g^2}{2}\left(\sum_{b=0}^{N_f-1}\bar{\psi}_b\psi_b\right)^2 \tag*{(1)} L = b = 0 ∑ N f − 1 ψ ˉ b i γ μ ∂ μ ψ b − m b = 0 ∑ N f − 1 ψ ˉ b ψ b + 2 g 2 b = 0 ∑ N f − 1 ψ ˉ b ψ b 2 (1)
Here m m m and g 2 g^2 g 2 are the bare mass and four-fermion coupling, respectively. At m = 0 m = 0 m = 0 , the action is invariant under the discrete chiral transformation ψ b → γ 5 ψ b \psi_b \to\gamma^5\psi_b ψ b → γ 5 ψ b , ψ ˉ b → − ψ ˉ b γ 5 \bar{\psi}_b \to-\bar{\psi}_b\gamma^5 ψ ˉ b → − ψ ˉ b γ 5 , with γ 5 = γ 0 γ 1 \gamma^5 = \gamma^0\gamma^1 γ 5 = γ 0 γ 1 ; the bare mass term explicitly breaks this symmetry.
We discretize space with staggered fermions while retaining continuous time [22 ] . The open chain contains 2 L D 2L_D 2 L D staggered sites, j = 0 , … , 2 L D − 1 j = 0,\ldots,2L_D - 1 j = 0 , … , 2 L D − 1 , separated by the lattice spacing a a a . Sites 2 n 2n 2 n and 2 n + 1 2n + 1 2 n + 1 represent the two components associated with Dirac cell n n n . The explicit staggered spinor map is given in Eq. (31) of Appendix A.
We retain two phase-equivalent hopping conventions. In convention I I I , the staggered fields χ j , b \chi_{j,b} χ j , b give the current-form hopping term
H h o p ( I ) = − i 2 a ∑ j = 0 2 L D − 2 ∑ b = 0 N f − 1 ( χ j , b † χ j + 1 , b − χ j + 1 , b † χ j , b ) . (2) H_{\mathrm{hop}}^{(I)}=-\frac{i}{2a}\sum_{j=0}^{2L_D-2}\sum_{b=0}^{N_f-1}\left(\chi_{j,b}^{\dagger}\chi_{j+1,b}-\chi_{j+1,b}^{\dagger}\chi_{j,b}\right). \tag*{(2)} H hop ( I ) = − 2 a i j = 0 ∑ 2 L D − 2 b = 0 ∑ N f − 1 ( χ j , b † χ j + 1 , b − χ j + 1 , b † χ j , b ) . (2)
The local number rephasing χ j , b = i j c j , b \chi_{j,b}=i^j c_{j,b} χ j , b = i j c j , b converts it to the uniform real-hopping convention R R R ,
H h o p ( R ) = 1 2 a ∑ j = 0 2 L D − 2 ∑ b = 0 N f − 1 ( c j , b † c j + 1 , b + c j + 1 , b † c j , b ) . (3) H_{\mathrm{hop}}^{(R)}=\frac{1}{2a}\sum_{j=0}^{2L_D-2}\sum_{b=0}^{N_f-1}\left(c_{j,b}^{\dagger}c_{j+1,b}+c_{j+1,b}^{\dagger}c_{j,b}\right). \tag*{(3)} H hop ( R ) = 2 a 1 j = 0 ∑ 2 L D − 2 b = 0 ∑ N f − 1 ( c j , b † c j + 1 , b + c j + 1 , b † c j , b ) . (3)
The rephasing is diagonal in the occupation basis and therefore leaves all number operators, the mass term, and the interaction unchanged. The two representations may consequently be written as
H ( α ) = H m + H h o p ( α ) + H i n t , α ∈ { I , R } . (4) H^{(\alpha)}=H_m+H_{\mathrm{hop}}^{(\alpha)}+H_{\mathrm{int}},\qquad\alpha\in\{I,R\}. \tag*{(4)} H ( α ) = H m + H hop ( α ) + H int , α ∈ { I , R } . (4)
With n ^ j , b = χ j , b † χ j , b = c j , b † c j , b \hat{n}_{j,b}=\chi_{j,b}^{\dagger}\chi_{j,b}=c_{j,b}^{\dagger}c_{j,b} n ^ j , b = χ j , b † χ j , b = c j , b † c j , b , the common staggered mass term is
H m = m 2 ∑ j = 0 2 L D − 1 ∑ b = 0 N f − 1 ( − 1 ) j ( 2 n ^ j , b − 1 ) . (5) H_m=\frac{m}{2}\sum_{j=0}^{2L_D-1}\sum_{b=0}^{N_f-1}(-1)^j(2\hat{n}_{j,b}-1). \tag*{(5)} H m = 2 m j = 0 ∑ 2 L D − 1 b = 0 ∑ N f − 1 ( − 1 ) j ( 2 n ^ j , b − 1 ) . (5)
The four-fermion interaction is
H i n t = − g 2 2 a ∑ n = 0 L D − 1 D n 2 , H_{\mathrm{int}}=-\frac{g^2}{2a}\sum_{n=0}^{L_D-1}D_n^2, H int = − 2 a g 2 n = 0 ∑ L D − 1 D n 2 ,
D n = ∑ b = 0 N f − 1 ( n ^ 2 n , b − n ^ 2 n + 1 , b ) . (6) D_n=\sum_{b=0}^{N_f-1}\left(\hat{n}_{2n,b}-\hat{n}_{2n+1,b}\right). \tag*{(6)} D n = b = 0 ∑ N f − 1 ( n ^ 2 n , b − n ^ 2 n + 1 , b ) . (6)
The operator D n D_n D n is the cellwise staggered scalar-density difference. Its expansion contains both same-flavor terms and cross-flavor density-density couplings, as displayed in Eq. (39) of Appendix A. These terms couple flavor densities without transferring occupation between flavors. Accordingly,
N b = ∑ j = 0 2 L D − 1 n ^ j , b , [ H , N b ] = 0 , N_b=\sum_{j=0}^{2L_D-1}\hat{n}_{j,b},\qquad[H,N_b]=0, N b = j = 0 ∑ 2 L D − 1 n ^ j , b , [ H , N b ] = 0 ,
N = ∑ b = 0 N f − 1 N b . (7) N=\sum_{b=0}^{N_f-1}N_b. \tag*{(7)} N = b = 0 ∑ N f − 1 N b . (7)
The exact conservation of every N b N_b N b , and therefore of the total number N N N , underlies the two symmetry-preserving fixed variational families and the SC-ADAPT pool constructed below.
Qubit Layout and Jordan-Wigner Convention
One qubit is assigned to each staggered fermionic mode. The register size and site-major register index are
N q = 2 L D N f , (8) N_q=2L_DN_f, \tag*{(8)} N q = 2 L D N f , (8)
q ( j , b ) = j N f + b . (9) q(j,b)=jN_f+b. \tag*{(9)} q ( j , b ) = j N f + b . (9)
The function q ( j , b ) q(j,b) q ( j , b ) specifies the site-major register index; it does not define the algebraic Jordan-Wigner parity path. Following the general Jordan-Wigner transformation [23 ] , we choose this path to advance along the staggered-site coordinate j j j at fixed flavor b b b , with a Klein factor enforcing anticommutation between different flavor chains. Thus the parity convention is flavor-chain ordered even though the qubit labels are site-major. In particular, it is not the flattened Jordan-Wigner ordering q = 0 , 1 , … , N q − 1 q=0,1,\ldots,N_q-1 q = 0 , 1 , … , N q − 1 . The explicit convention-specific transformation is given in Eq. (35) of Appendix A.
For α ∈ { I , R } \alpha\in\{I,R\} α ∈ { I , R } , let P q ( α ) P_q^{(\alpha)} P q ( α ) , with P ∈ { X , Y , Z } P\in\{X,Y,Z\} P ∈ { X , Y , Z } , denote the Pauli operators in convention α \alpha α . The on-site Z Z Z rotations implementing χ j , b = i j c j , b \chi_{j,b}=i^jc_{j,b} χ j , b = i j c j , b leave Z q Z_q Z q unchanged and map the nearest-neighbor hopping strings as
H h o p ( I ) ⟷ X Y − Y X 4 a , H_{\mathrm{hop}}^{(I)}\longleftrightarrow\frac{XY-YX}{4a}, H hop ( I ) ⟷ 4 a X Y − Y X ,
H h o p ( R ) ⟷ X X + Y Y 4 a . (10) H_{\mathrm{hop}}^{(R)}\longleftrightarrow\frac{XX+YY}{4a}. \tag*{(10)} H hop ( R ) ⟷ 4 a X X + Y Y . (10)
with the site and flavor sums understood. Their complete Pauli forms, together with the mass term, are given in Appendix A. Convention superscripts on X X X and Y Y Y are suppressed below when the choice is unambiguous.
The interaction is obtained from
D n = 1 2 ∑ b = 0 N f − 1 [ Z q ( 2 n + 1 , b ) − Z q ( 2 n , b ) ] , (11) D_n=\frac{1}{2}\sum_{b=0}^{N_f-1}\left[Z_{q(2n+1,b)}-Z_{q(2n,b)}\right], \tag*{(11)} D n = 2 1 b = 0 ∑ N f − 1 [ Z q ( 2 n + 1 , b ) − Z q ( 2 n , b ) ] , (11)
E c o n s t ( i n t ) = − g 2 L D N f 4 a . E_{\mathrm{const}}^{(\mathrm{int})}=-\frac{g^2L_DN_f}{4a}. E const ( int ) = − 4 a g 2 L D N f .
The second line is the identity contribution generated by the same-flavor terms in D n 2 D_n^2 D n 2 . It must be retained or subtracted consistently when absolute variational energies are compared with exact diagonalization.
Throughout the fixed-ansatz calculations, we use the current-hopping convention I I I . The SC-ADAPT construction and its numerical results use the uniform real-hopping convention R R R . These conventions are related by the local rephasing χ j , b = i j c j , b \chi_{j,b}=i^jc_{j,b} χ j , b = i j c j , b ; they use the same site-major register labels and the same flavor-chain parity convention.
Symmetry-Preserving Fixed Variational Ansätze
Traditional VQEs in the literature often utilize universal ansätze such as the hardware-efficient ansatz [24 ] used in Ref. [16 ] . While these ansätze have generally high expressivity, they do not respect the symmetries of the Hamiltonian and require little physics input. The hardware-efficient circuit considered here uses S U ( 2 ) SU(2) S U ( 2 ) blocks connecting qubits along the Hamiltonian graph. However, the lattice Hamiltonian conserves the flavor charges N b N_b N b and their sum N N N , as defined in Sec. II, which are both violated by the efficient S U ( 2 ) SU(2) S U ( 2 ) construction. We thus construct two fixed variational families that enforce these symmetries at different levels. The total-number-conserving family fixes N N N but permits occupation transfer among flavors, whereas the flavor-number-conserving family fixes every N b N_b N b separately.
Reference sector and local blocks
Both families begin from the odd-site-filled computational-basis state
∣ Φ 0 ⟩ = ⨂ j = 0 2 L D − 1 ⨂ b = 0 N f − 1 ∣ n j , b ( 0 ) ⟩ q ( j , b ) , n j , b ( 0 ) = 1 − ( − 1 ) j 2 . (12) |\Phi_0\rangle= \bigotimes_{j=0}^{2L_D-1}\bigotimes_{b=0}^{N_f-1} |n_{j,b}^{(0)}\rangle_{q(j,b)},
\qquad
n_{j,b}^{(0)} = \frac{1-(-1)^j}{2}. \tag*{(12)} ∣ Φ 0 ⟩ = j = 0 ⨂ 2 L D − 1 b = 0 ⨂ N f − 1 ∣ n j , b ( 0 ) ⟩ q ( j , b ) , n j , b ( 0 ) = 2 1 − ( − 1 ) j . (12)
It satisfies N b ∣ Φ 0 ⟩ = L D ∣ Φ 0 ⟩ N_b|\Phi_0\rangle= L_D|\Phi_0\rangle N b ∣ Φ 0 ⟩ = L D ∣ Φ 0 ⟩ for every flavor and N ∣ Φ 0 ⟩ = N f L D ∣ Φ 0 ⟩ N|\Phi_0\rangle= N_fL_D|\Phi_0\rangle N ∣ Φ 0 ⟩ = N f L D ∣ Φ 0 ⟩ . This occupation-basis definition is invariant under the local rephasing that relates hopping conventions I I I and R R R . The fixed constructions and benchmarks use convention I I I ; accordingly, the convention-suppressed X X X and Y Y Y operators below denote the convention-I I I Pauli axes introduced in Sec. II B.
For a Pauli string P P P , we use
R P ( ϑ ) ≡ e − i ϑ P , (13) R_P(\vartheta) \equiv e^{-i\vartheta P}, \tag*{(13)} R P ( ϑ ) ≡ e − i ϑP , (13)
and write products in operator order, so that the rightmost factor acts first. Let u u u and v v v denote arbitrary qubit indices.
The elementary total-number-conserving block is
B u v ( α , β , γ ) = R Z v ( − γ ) R Z u ( γ ) × R Z u Z v ( β ) × R Y u Y v ( α ) R X u X v ( α ) . (14) B_{uv}(\alpha,\beta,\gamma) = R_{Z_v}(-\gamma)R_{Z_u}(\gamma)
\times R_{Z_uZ_v}(\beta)
\times R_{Y_uY_v}(\alpha)R_{X_uX_v}(\alpha). \tag*{(14)} B uv ( α , β , γ ) = R Z v ( − γ ) R Z u ( γ ) × R Z u Z v ( β ) × R Y u Y v ( α ) R X u X v ( α ) . (14)
The tied X X XX X X and Y Y YY Y Y rotations generate number-preserving exchange, while the Z Z ZZ Z Z and local Z Z Z rotations are diagonal in the occupation basis. On a same-flavor pair, the exchange redistributes occupation within one flavor. On a cross-flavor pair, it can exchange ∣ 10 ⟩ |10\rangle ∣10 ⟩ and ∣ 01 ⟩ |01\rangle ∣01 ⟩ , preserving the total number while changing the two flavor occupations separately. The detailed conservation algebra is given in Appendix B.
To preserve every N b N_b N b , off-diagonal exchange is restricted to pairs from the same flavor. For such a pair, cross-flavor correlations are introduced without occupation transfer through
D u v ( γ , δ ) = R Z v ( − γ ) R Z u ( γ ) R Z u Z v ( δ ) , u = q ( j , b ) , v = q ( k , c ) , b ≠ c . (15) D_{uv}(\gamma,\delta) = R_{Z_v}(-\gamma)R_{Z_u}(\gamma)R_{Z_uZ_v}(\delta),
\qquad
u=q(j,b),\quad v=q(k,c),\quad b\ne c. \tag*{(15)} D uv ( γ , δ ) = R Z v ( − γ ) R Z u ( γ ) R Z u Z v ( δ ) , u = q ( j , b ) , v = q ( k , c ) , b = c . (15)
The complete B B B and D D D blocks commute with every flavor charge for the qubits that they act upon. The local phases are anti-tied and generate the relative direction Z u − Z v Z_u-Z_v Z u − Z v . This tying is an architectural choice rather than a consequence of flavor or number conservation, because Z u Z_u Z u and Z v Z_v Z v separately commute with all occupation-number operators.
For arbitrary variational parameters, the total-number circuit remains in the sector N = N f L D N=N_fL_D N = N f L D but may leave the individual sectors N b = L D N_b=L_D N b = L D . The flavor-number circuit remains in the joint sector N b = L D N_b=L_D N b = L D for every b b b . These restrictions are enforced by the circuit blocks themselves and require neither penalty terms nor post-selection.
Benchmark circuit architectures
One layer contains translated blocks on every same-flavor nearest-neighbor bond, a second same-flavor block on every intracell pair, and four intracell cross-flavor topologies for each unordered flavor pair, as seen in Figure 1 . A parameter tuple is shared over translations of a fixed flavor, edge class, and cross-flavor topology, while distinct layers receive independent tuples. The total-number family uses B B B on all three edge classes; the flavor-number family uses B B B on the same-flavor classes and D D D on the cross-flavor classes. The total number of blocks for a single layer of this graph is N b l o c k s = 2 L D N f 2 + L D N f − N f N_{\mathrm{blocks}}=2L_DN_f^2+L_DN_f-N_f N blocks = 2 L D N f 2 + L D N f − N f . Although the total number of gates is highly dependent on the implementation of the entangling Pauli exponentials within the native architecture of the hardware, the scheduled Pauli rotation count can be used to provide an estimate of the resource count. Specifically, for the flavor-number-conserving ansatz, we have N P a u l i s t r i n g s = 6 L D N f 2 + 9 L D N f − 5 N f N_{\mathrm{Pauli\ strings}} = 6LDN_f^2 + 9LDN_f - 5N_f N Pauli strings = 6 L D N f 2 + 9 L D N f − 5 N f per layer, which linearly depends on the number of lattice sites and quadratically on the number of flavors. The quadratic flavor number dependence is also observed in the parameter count N p a r a m e t e r s = 4 N f 2 + 2 N f N_{\mathrm{parameters}} = 4N_f^2 + 2N_f N parameters = 4 N f 2 + 2 N f per layer, which remains independent of the number of lattice sites. Following a brickwall structure, all even-start bonds are applied first and all odd-start bonds second; the two parity sweeps share the same tuple for a given flavor. The additional intracell stage follows these nearest-neighbor stages. Full edge-set, schedules, and ordered-product definitions are collected in Appendix B.
Figure 1. Example circuit for the flavor-number-conserving ansatz, with N f = 2 N_f = 2 N f = 2 and L D = 2 L_D = 2 L D = 2 . For the total-number-conserving ansatz, the D D D blocks that act on off-diagonal qubit pairs are also replaced by the B B B blocks that redistribute occupation across different flavors while preserving the total number.
The two constructions thus match in their circuit graph, local-phase parametrization, nearest-neighbor product order, circuit depth, and block count. The parameter and Pauli string counts differ slightly due to the difference in their cross-flavor gate content, which is the source of the stronger flavor-number constraint. Restricting optimization to the target flavor-number sector is consistent with the improved energies achieved by the flavor-number-conserving ansatz.
Finally, “flavor-number-conserving” refers here to exact preservation of the mutually commuting Abelian charges { N b } \{N_b\} { N b } . It does not imply enforcement of the full non-Abelian flavor symmetry, commutation with generators that mix flavor labels, or restriction to a specified irreducible representation of the full flavor group.
SC-ADAPT CONSTRUCTION
The SC-ADAPT ansatz follows the append-and-reoptimize procedure of ADAPT-VQE [19 ] and the volume-surface organization of Ref. [20 ] , extended here to the multi-flavor Gross-Neveu Hamiltonian. Open boundaries break exact lattice-translation invariance, while translated volume sums capture repeated bulk structure and separate surface families supply boundary-local directions. The ansatz uses the reference state in Eq. (12) and the uniform real-hopping convention (R).
For an implemented factorized candidate U ~ i ( θ ) \widetilde{U}_i(\theta) U i ( θ ) , the raw selection metric is the magnitude of the centered append-point energy score
g i F D = E i ( δ ) − E i ( − δ ) 2 δ , δ = 10 − 3 , E i ( θ ) = ⟨ ψ ∣ U ~ i † ( θ ) H U ~ i ( θ ) ∣ ψ ⟩ . (16) g_i^{\mathrm{FD}} = \frac{E_i(\delta)-E_i(-\delta)}{2\delta},
\qquad
\delta= 10^{-3},
\qquad
E_i(\theta) = \langle\psi|\widetilde{U}_i^\dagger(\theta)H\widetilde{U}_i(\theta)|\psi\rangle. \tag*{(16)} g i FD = 2 δ E i ( δ ) − E i ( − δ ) , δ = 1 0 − 3 , E i ( θ ) = ⟨ ψ ∣ U i † ( θ ) H U i ( θ ) ∣ ψ ⟩ . (16)
At each append step, we select the candidate with the largest ∣ g i F D ∣ |g_i^{\mathrm{FD}}| ∣ g i FD ∣ and then reoptimize all circuit parameters. Selected operators remain available for subsequent reuse. Because g i F D g_i^{\mathrm{FD}} g i FD estimates the derivative with respect to the implemented circuit coordinate, its magnitude depends on candidate normalization, including the factor η g \eta_g η g in the interaction-hopping family. The pool caps, candidate normalizations, and fixed factor orders are consequently part of the algorithmic specification rather than conventions under which the raw ranking is invariant.
SC-ADAPT Construction
Gross-Neveu Volume-Surface Pool
For compactness, introduce the Hermitian same-flavor current
J j , b ( d ) = i ( c j , b † c j + d , b − c j + d , b † c j , b ) . (17) J_{j,b}^{(d)} = i\left(c_{j,b}^{\dagger}c_{j+d,b}-c_{j+d,b}^{\dagger}c_{j,b}\right). \tag*{(17)} J j , b ( d ) = i ( c j , b † c j + d , b − c j + d , b † c j , b ) . (17)
The four pool families are the mass-hopping volume generator
O m h V ( d ) ≡ i [ Θ m V , Θ h V ( d ) ] = ∑ j = 0 2 L D − 1 − d ∑ b = 0 N f − 1 ( − 1 ) j J j , b ( d ) , d o d d , (18) O_{mh}^{V}(d) \equiv i[\Theta_m^{V},\Theta_h^{V}(d)]
= \sum_{j=0}^{2L_D-1-d}\sum_{b=0}^{N_f-1}(-1)^jJ_{j,b}^{(d)},
\qquad d\ \mathrm{odd}, \tag*{(18)} O mh V ( d ) ≡ i [ Θ m V , Θ h V ( d )] = j = 0 ∑ 2 L D − 1 − d b = 0 ∑ N f − 1 ( − 1 ) j J j , b ( d ) , d odd , (18)
which vanishes for even d d d , two boundary-local counter-parts O m h S 0 ( d ) O_{mh}^{S0}(d) O mh S 0 ( d ) and O m h S 1 ( d ) O_{mh}^{S1}(d) O mh S 1 ( d ) , and the Gross-Neveu-specific interaction-hopping volume family
O g h V ( d ) ≡ i [ Θ g V , Θ h V ( d ) ] c r o s s . (19) O_{gh}^{V}(d) \equiv i[\Theta_g^{V},\Theta_h^{V}(d)]_{\mathrm{cross}} . \tag*{(19)} O g h V ( d ) ≡ i [ Θ g V , Θ h V ( d ) ] cross . (19)
Here the parent operators Θ m V \Theta_m^{V} Θ m V , Θ h V ( d ) \Theta_h^{V}(d) Θ h V ( d ) , and Θ g V \Theta_g^{V} Θ g V , the surface endpoint formulas, and all normalizations are defined in Appendix § 4.2.1 . The cross-flavor projection retains terms in which a current of flavor β \beta β is multiplied by a density difference Δ n , b = n ^ 2 n , b − n ^ 2 n + 1 , b \Delta_{n,b} = \hat{n}_{2n,b} - \hat{n}_{2n+1,b} Δ n , b = n ^ 2 n , b − n ^ 2 n + 1 , b of a distinct flavor b ≠ β b \ne\beta b = β . Every retained generator commutes with every N b N_b N b . This is an additional property of the selected Gross-Neveu pool, not the defining bulk-surface principle of SC-ADAPT. Unlike O m h V ( d ) O_{mh}^{V}(d) O mh V ( d ) , the interaction-hopping commutator need not vanish for even d d d ; restricting it to odd d d d is a pool-design choice.
Geometric Family and Numerical Pool
The default numerical pool is
O m h V : d = 1 , 3 , 5 , O m h S 0 : d = 1 , 3 , O m h S 1 : d = 1 , 3 , O g h V : d = 1 , 3 , (20) \begin{aligned}
O_{mh}^{V} &: \ d = 1,3,5,\\
O_{mh}^{S0} &: \ d = 1,3,\\
O_{mh}^{S1} &: \ d = 1,3,\\
O_{gh}^{V} &: \ d = 1,3, \tag*{(20)}
\end{aligned} O mh V O mh S 0 O mh S 1 O g h V : d = 1 , 3 , 5 , : d = 1 , 3 , : d = 1 , 3 , : d = 1 , 3 , (20)
with unavailable distances omitted on short chains. The full geometric ranges are given in Appendix § 4.2.1 . These caps and the omission of interaction-hopping surface operators are numerical truncation choices, not completeness or minimality statements.
The candidate circuits use the R ± R_{\pm} R ± and X-pattern circuit convention of Figure 3 in Ref. [20 ] . Each local current block and each controlled-Z-dressed current block is exact, whereas exponentials of the volume or surface sums are represented by fixed first-order ordered products. The local identities, family-specific normalizations, and complete schedules are specified in Appendix § 4.2.1 .
Figure 3. Ground-state fidelity convergence for 8-qubit flavor-number-conserving ansatz with m = 0 m = 0 m = 0 , g 2 = 1.0 g^{2} = 1.0 g 2 = 1.0 , N f = 2 N_{f} = 2 N f = 2 , L D = 2 L_{D} = 2 L D = 2 , and open boundary conditions.
For fixed N f N_f N f and fixed distance caps, the number of translated local factors in each volume candidate grows linearly with L D L_D L D , while the surface families remain boundary local. At fixed append count, the full circuit therefore has linear precompilation local-factor growth and a volume-independent number of shared variational coordinates. This defines the scalability of the circuit construction used here. It does not determine the append count or compiled depth required at fixed accuracy, or the end-to-end cost of classical simulation and optimization.
Ground-State Numerical Results
Numerical Setup
The statevector and matrix-product-state circuit simulations reported below were performed classically using CUDA-Q [25 ] ; the two-flavor exact charge-sector calculation described in § 4 F uses a separate implementation. For the fixed circuit ansatze, we use SciPy’s Sequential Least Squares Programming (SLSQP) optimizer with a tolerance of 10 − 10 10^{-10} 1 0 − 10 and a maximum of 1000 iterations. The examples in Figure 2 and Figure 3 converge before this limit. The adaptive construction also utilizes the SLSQP optimizer, but with a tolerance of 1 × 10 − 8 1 \times10^{-8} 1 × 1 0 − 8 and a numerical-Jacobian finite-difference step size of 1 × 10 − 4 1 \times10^{-4} 1 × 1 0 − 4 for a maximum of 300 iterations. For the additional one-flavor source calculations at L D = 10 L_D = 10 L D = 10 –14 14 14 used in the extrapolation of § 4 F, the prescribed ten-generator architecture is reoptimized with SLSQP using f t o l = 10 − 12 \mathrm{ftol} = 10^{-12} ftol = 1 0 − 12 , a finite-difference step of 10 − 6 10^{-6} 1 0 − 6 , and at most 300 iterations.
Figure 2. Ground-state energy convergence for 8-qubit flavor-number-conserving ansatz with m = 0 m = 0 m = 0 , g 2 = 1.0 g^2 = 1.0 g 2 = 1.0 , N f = 2 N_f = 2 N f = 2 , L D = 2 L_D = 2 L D = 2 , and open boundary conditions.
All calculations use open boundary conditions and lattice spacing a = 1 a = 1 a = 1 . Reference and variational energies use the same energy-zero prescription, including the interaction identity contribution. The ground-state reference energies are obtained with DMRG, with agreement with exact diagonalization to machine precision for the checked systems through 16 qubits. The two-flavor fixed results at g 2 = 1.0 g^2 = 1.0 g 2 = 1.0 as well as later benchmark points use five layers for both the total-number and flavor-number-conserving ansätze. Fixed circuits use convention I I I , while SC-ADAPT uses convention R R R , raw-score selection with δ = 10 − 3 \delta= 10^{-3} δ = 1 0 − 3 , and the interaction-family normalization η g h = 0.2 \eta_{gh} = 0.2 η g h = 0.2 ; the unitary equivalence of the two hopping conventions is discussed in Sec. II B.
We assess each variational result against the corresponding reference energy of the same finite-volume Hamiltonian. For X ∈ { N , F , S C } X \in\{N,F,\mathrm{SC}\} X ∈ { N , F , SC } , define the relative energy error
ϵ E , X = ∣ E X − E 0 ∣ ∣ E 0 ∣ , (21) \epsilon_{E,X} = \frac{\lvert E_X - E_0\rvert}{\lvert E_0\rvert}, \tag*{(21)} ϵ E , X = ∣ E 0 ∣ ∣ E X − E 0 ∣ , (21)
where E 0 E_0 E 0 is the ground-state reference energy; E N E_N E N and
E F E_F E F are obtained with the total-number-conserving and flavor-number-conserving fixed ansatz families, respectively, all respecting the graph of the Hamiltonian; and E S C E_{\mathrm{SC}} E SC is the SC-ADAPT result. The quantity ϵ E \epsilon_E ϵ E is an energy diagnostic, not a state fidelity. The error values in the small-system benchmark tables are reconstructed from the displayed energies and inherit their rounding precision. In Table VII , the percentage errors are instead calculated from the unrounded energies. There, MPS simulations evaluate the transferred circuits, while independently optimized DMRG states provide the ground-state references. The MPS calculations use CUDA-Q 0.14.2 in double precision with maximum bond dimension 256. The absolute and relative truncation cutoffs are both 10 − 13 10^{-13} 1 0 − 13 for L D = 30 , 50 , 100 L_D = 30, 50, 100 L D = 30 , 50 , 100 and both 10 − 12 10^{-12} 1 0 − 12 for L D = 200 L_D = 200 L D = 200 , where the GESVD singular-value decomposition is used.
Table VII. One-flavor circuit evaluations at m = 0.5 m = 0.5 m = 0.5 , g 2 = 0.4 g^2 = 0.4 g 2 = 0.4 , and a = 1 a = 1 a = 1 , with open boundaries and half filling. Energy densities are E = E / L D \mathcal{E} = E/L_D E = E / L D ; percentage errors are measured relative to the corresponding DMRG reference. All MPS evaluations use maximum bond dimension 256. The first three rows use frozen L D = 12 L_D = 12 L D = 12 parameters; the final row uses the extrapolation prescription described in the text.
Two-Flavor Comparison
For N f = 2 N_f = 2 N f = 2 , the register contains N q = 4 L D N_q = 4L_D N q = 4 L D qubits. Tables I and II cover the common range L D = 3 L_D = 3 L D = 3 –7 7 7 for the fixed as well as SC-ADAPT constructions. For both massless and massive comparisons at L D = 3 L_D = 3 L D = 3 –7 7 7 , the displayed errors satisfy ϵ E , F < ϵ E , N < ϵ E , S C \epsilon_{E,F} < \epsilon_{E,N} < \epsilon_{E,\mathrm{SC}} ϵ E , F < ϵ E , N < ϵ E , SC . For the fixed constructions, this ordering concerns circuits which are matched in optimization hyperparameters, circuit depth, and block count, thus isolating the charge preservation as its cause.
For each construction X X X , we note that ϵ E , X , m ≠ 0 ≤ ϵ E , X , m = 0 \epsilon_{E,X,m\ne0} \le\epsilon_{E,X,m=0} ϵ E , X , m = 0 ≤ ϵ E , X , m = 0 at matched circuit depth and parameter count. While this isolates the non-zero mass as the source for the improved accuracy across L D = 3 L_D = 3 L D = 3 –7 7 7 , this is simply an empirical observation for both the fixed and adaptive circuits.
Table 1. Ground-state energies for m = 0 m = 0 m = 0 , g 2 = 1.0 g^{2} = 1.0 g 2 = 1.0 , and N f = 2 N_{f} = 2 N f = 2 , with a = 1 a = 1 a = 1 and open boundary conditions.
Flavor-Number-Conserving Performance Across Flavor Number
Having empirically confirmed the improved performance with stronger symmetry constraints, the flavor-number-conserving ansatz is also tested across multiple flavor families and in a different coupling regime, benchmarking the accuracy against the configurations reported in Ref. [17 ] with m = 0.5 m = 0.5 m = 0.5 and g 2 = 0.4 g^{2} = 0.4 g 2 = 0.4 , where available.
As mentioned previously, the lattice Hamiltonian used by the authors of Ref. [17 ] uses a different fermion discretization, and both Hamiltonians thus have different spectra in the current finite limit. We thus compare only the relative energy errors reported in their work. The flavor-number-conserving ansatz improves upon reported benchmarks for the systems with up to 20 qubits tested in Ref. [17 ] and is further tested on systems through 30 qubits.
Table III shows that the flavor-number-conserving ansatz achieves a higher accuracy than all available current benchmarks ϵ ˉ E \bar{\epsilon}_{E} ϵ ˉ E . It is important to note that while all circuits are matched at depth, the parameter count is dependent on the number of flavors.
Table 2. Ground-state energies for m = 0.5 m = 0.5 m = 0.5 , g 2 = 1.0 g^{2} = 1.0 g 2 = 1.0 , and N f = 2 N_{f} = 2 N f = 2 , with a = 1 a = 1 a = 1 and open boundary conditions.
Table 3. Ground-state energies obtained by the flavor-number-conserving ansatz for m = 0.5 m = 0.5 m = 0.5 and g 2 = 0.4 g^{2} = 0.4 g 2 = 0.4 , with a = 1 a = 1 a = 1 and open boundary conditions. The qubit count is N q = 2 L D N f N_{q} = 2L_{D}N_{f} N q = 2 L D N f . Relative energy errors ϵ E , F \epsilon_{E,F} ϵ E , F are calculated from the rounded energies shown and compared with the errors ϵ ˉ E \bar{\epsilon}_{E} ϵ ˉ E reported in Ref. [17 ] where they are available.
SC-ADAPT Results Across Flavor Number
Table IV gives SC-ADAPT energies at m = 0.5 m = 0.5 m = 0.5 and g 2 = 0.4 g^{2} = 0.4 g 2 = 0.4 for N f = 1 , 2 , 3 N_{f} = 1, 2, 3 N f = 1 , 2 , 3 . For the large-volume one-flavor benchmark, the volume family was extended to d ≤ 9 d \le9 d ≤ 9 ; the default cap in Eq. (20) was used otherwise. Across the selected systems with N f = 1 , 2 , 3 N_{f} = 1, 2, 3 N f = 1 , 2 , 3 , which reach N q = 30 N_{q} = 30 N q = 30 , the relative energy error remains below 2.1 × 10 − 3 2.1 \times10^{-3} 2.1 × 1 0 − 3 .
Table IV. SC-ADAPT ground-state energies for m = 0.5 m = 0.5 m = 0.5 and g 2 = 0.4 g^2 = 0.4 g 2 = 0.4 , with a = 1 a = 1 a = 1 , open boundary conditions, and η g h = 0.2 \eta_{gh} = 0.2 η g h = 0.2 . The qubit count is N q = 2 L D N f N_q = 2L_DN_f N q = 2 L D N f . Relative energy errors are calculated from the rounded energies shown.
Sensitivity of SC-ADAPT Operator Selection
We abbreviate O m h V , S 0 , S 1 ( d ) O_{mh}^{V,S_{0},S_{1}}(d) O mh V , S 0 , S 1 ( d ) as V ( d ) , S 0 ( d ) , S 1 ( d ) V(d), S_{0}(d), S_{1}(d) V ( d ) , S 0 ( d ) , S 1 ( d ) and O g h V ( d ) O_{gh}^{V}(d) O g h V ( d ) as V g h ( d ) V_{gh}(d) V g h ( d ) .
We examine the sensitivity of operator selection to the finite-difference step and the relative normalization of the interaction-hopping family for N f = 2 N_{f} = 2 N f = 2 , L D = 4 L_{D} = 4 L D = 4 , m = 0.5 m = 0.5 m = 0.5 , and g 2 = 0.4 g^{2} = 0.4 g 2 = 0.4 , using the nine-element pool in Eq. (20) .
Energy expectation values are evaluated with noiseless statevectors in CUDA-Q 0.14.2. At each step, all variational parameters are reoptimized using SLSQP with maxiter = 300, eps = 10 − 4 10^{-4} 1 0 − 4 , and ftol = 10 − 8 10^{-8} 1 0 − 8 . For each of η g h = 0.1 , 0.2 , 0.3 \eta_{gh} = 0.1, 0.2, 0.3 η g h = 0.1 , 0.2 , 0.3 , we perform seven append-and-reoptimization steps; the sequence length is fixed independently of an adaptive convergence criterion. All reoptimizations terminate successfully. The selection scores and optimized energies for η g h = 0.2 \eta_{gh} = 0.2 η g h = 0.2 are listed in Table XVI of Appendix § 4.2.1 .
Table XVI. Representative raw-score SC-ADAPT selection sequence for N f = 2 N_f = 2 N f = 2 , L D = 4 L_D = 4 L D = 4 , m = 0.5 m = 0.5 m = 0.5 , g 2 = 0.4 g^2 = 0.4 g 2 = 0.4 , η g h = 0.2 \eta_{gh} = 0.2 η g h = 0.2 , and δ = 10 − 3 \delta= 10^{-3} δ = 1 0 − 3 . The selected and runner-up columns give the candidates with the two largest append-point magnitudes before optimization. The gap is their absolute score difference, E k E_k E k is the reoptimized energy, and r k r_k r k is the maximum post-optimization raw score within the retained pool.
At every one of the 21 pre-append states, the raw-score leader is unchanged over D = { 10 − 4 , 10 − 3 , 10 − 2 } D = \{10^{-4}, 10^{-3}, 10^{-2}\} D = { 1 0 − 4 , 1 0 − 3 , 1 0 − 2 } . For the candidate i k i_k i k selected at δ = 10 − 3 \delta= 10^{-3} δ = 1 0 − 3 , define
s δ , k = max δ ∈ D ∣ g i k F D ( δ ) ∣ − min δ ∈ D ∣ g i k F D ( δ ) ∣ ∣ g i k F D ( 10 − 3 ) ∣ . (22) s_{\delta,k} = \frac{\max_{\delta\in D} \lvert g_{i_k}^{\mathrm{FD}}(\delta)\rvert- \min_{\delta\in D} \lvert g_{i_k}^{\mathrm{FD}}(\delta)\rvert}{\lvert g_{i_k}^{\mathrm{FD}}(10^{-3})\rvert}. \tag*{(22)} s δ , k = ∣ g i k FD ( 1 0 − 3 )∣ max δ ∈ D ∣ g i k FD ( δ )∣ − min δ ∈ D ∣ g i k FD ( δ )∣ . (22)
The maximum of s δ , k s_{\delta,k} s δ , k over the 21 decisions is approximately 1.1 × 10 − 3 1.1 \times10^{-3} 1.1 × 1 0 − 3 . By contrast, the raw trajectory depends on η g h \eta_{gh} η g h : η g h = 0.1 \eta_{gh} = 0.1 η g h = 0.1 and 0.2 0.2 0.2 give the same sequence and final energies differing by 2.2 × 10 − 7 2.2 \times10^{-7} 2.2 × 1 0 − 7 , while η g h = 0.3 \eta_{gh} = 0.3 η g h = 0.3 selects V g h ( 1 ) V_{gh}(1) V g h ( 1 ) first and follows a different sequence. At the reference state, the crossover of the two leading raw scores occurs near η g h = 0.25 \eta_{gh} = 0.25 η g h = 0.25 . Thus η g h \eta_{gh} η g h is an explicit algorithmic hyperparameter of the raw-score prescription.
For each candidate, define the finite-step states ∣ ψ i ( θ ) ⟩ = U ~ i ( θ ) ∣ ψ ⟩ \lvert\psi_i(\theta)\rangle= \widetilde{U}_i(\theta)\lvert\psi\rangle ∣ ψ i ( θ )⟩ = U i ( θ ) ∣ ψ ⟩ at the current raw-selected state. As a normalization diagnostic, we evaluate the finite-step Fubini-Study tangent scale
σ i F S ( ϵ ) = 1 − ∣ ⟨ ψ i ( − ϵ ) ∣ ψ i ( + ϵ ) ⟩ ∣ 2 2 ϵ (23) \sigma_i^{\mathrm{FS}}(\epsilon) = \frac{\sqrt{1-\lvert\langle\psi_i(-\epsilon)\mid\psi_i(+\epsilon)\rangle\rvert^2}}{2\epsilon} \tag*{(23)} σ i FS ( ϵ ) = 2 ϵ 1 − ∣⟨ ψ i ( − ϵ ) ∣ ψ i ( + ϵ )⟩ ∣ 2 (23)
and the ratio ∣ g i F D / σ i F S ∣ \lvert g_i^{\mathrm{FD}}/ \sigma_i^{\mathrm{FS}}\rvert ∣ g i FD / σ i FS ∣ along the raw-selected trajectories, using ϵ = 10 − 3 \epsilon= 10^{-3} ϵ = 1 0 − 3 and checking ϵ = 10 − 4 \epsilon= 10^{-4} ϵ = 1 0 − 4 –10 − 2 10^{-2} 1 0 − 2 . At the reference state, this diagnostic gives approximately 3.7417 for both V ( 1 ) V(1) V ( 1 ) and V g h ( 1 ) V_{gh}(1) V g h ( 1 ) , a near tie at the resolution of the finite-step estimator. At steps 2–6 of the η g h = 0.2 \eta_{gh} = 0.2 η g h = 0.2 raw trajectory, the diagnostic and raw score have the same leader, whereas the diagnostic favors V g h ( 3 ) V_{gh}(3) V g h ( 3 ) rather than V ( 5 ) V(5) V ( 5 ) at step 7. These values are evaluated on states generated by raw selection and do not constitute a normalized-selection trajectory.
Finite-Volume Patterns and One-Flavor Parameter Transfer
Finite-volume sequence patterns provide the diagnostic used for circuit transfer in the Schwinger-model SC-ADAPT construction [20 ] . Table V lists the selected operator sequences. For one flavor, V g h V_{gh} V g h is absent and η g h \eta_{gh} η g h is irrelevant.
Table V. SC-ADAPT generator sequences for m = 0.5 m = 0.5 m = 0.5 , g 2 = 0.4 g^2 = 0.4 g 2 = 0.4 , and η g h = 0.2 \eta_{gh} = 0.2 η g h = 0.2 . The one-flavor rows give complete selected sequences. For two flavors, the L D = 4 L_D = 4 L D = 4 row gives the seven-append sequence at η g h = 0.2 \eta_{gh} = 0.2 η g h = 0.2 . The L D = 5 L_D = 5 L D = 5 –7 7 7 entries permit comparison of the displayed operator sequences, but complete step histories under a common stopping criterion are unavailable.
For N f = 1 N_f = 1 N f = 1 , the first four generators are common throughout L D = 7 L_D = 7 L D = 7 –15, while the complete ten-generator sequence is unchanged only for L D = 12 L_D = 12 L D = 12 –15. We therefore performed a retrospective transfer test from L D = 12 L_D = 12 L D = 12 to L D = 13 , 14 , 15 L_D = 13, 14, 15 L D = 13 , 14 , 15 . The ten-generator append sequence and its tabulated four-decimal L D = 12 L_D = 12 L D = 12 coordinates were held fixed. At each target volume, the translated volume factors were extended over the target bulk and the surface factors were reconstructed at the new endpoints. No target-side operator selection or parameter optimization was performed. The evaluations use noiseless statevectors in CUDA-Q 0.14.2 with double precision. The frozen coordinates are given in Appendix § 4.2.1 .
For the following comparison, define
ϵ E , e v a l = ∣ E e v a l − E 0 ∣ ∣ E 0 ∣ . (24) \epsilon_{E,\mathrm{eval}} = \frac{\lvert E_{\mathrm{eval}} - E_0\rvert}{\lvert E_0\rvert}. \tag*{(24)} ϵ E , eval = ∣ E 0 ∣ ∣ E eval − E 0 ∣ . (24)
For the frozen ten-generator one-flavor sequence, the translated factors give
N R ± = 92 L D − 282 , N p a r = 10. (25) \begin{aligned}
N_{R\pm} &= 92L_D - 282,\\
N_{\mathrm{par}} &= 10. \tag*{(25)}
\end{aligned} N R ± N par = 92 L D − 282 , = 10. (25)
The counts in Table VI thus realize the scalable construction over L D = 12 L_D = 12 L D = 12 -15: the shared-coordinate count is fixed while the precompilation primitive count grows linearly with volume. These counts refer to the ansatz factors and do not include reference preparation, measurements, routing, or compiler cancellations; they are not compiled circuit depths.
Table VI. One-flavor finite-volume transfer at m = 0.5 m = 0.5 m = 0.5 , g 2 = 0.4 g^2 = 0.4 g 2 = 0.4 , a = 1 a = 1 a = 1 , and open boundaries. The L D = 12 L_D = 12 L D = 12 row is the evaluation at the source volume, and the remaining rows use its frozen ten-generator sequence and ten tabulated four-decimal coordinates. N R ± N_{R\pm} N R ± is the total number of variable-angle current R − R_- R − primitives and fixed-angle X X X -pattern conjugation R + R_+ R + primitives before compilation. The additional digits in E e v a l E_{\mathrm{eval}} E eval resolve evaluations of the specified four-decimal parameters; they do not imply additional precision in the optimized parameters.
The relative energy error changes only from 1.925 × 10 − 3 1.925 \times10^{-3} 1.925 × 1 0 − 3 in the source-volume evaluation to 2.032 × 10 − 3 2.032 \times10^{-3} 2.032 × 1 0 − 3 at L D = 15 L_D = 15 L D = 15 . For comparison, let E o p t r e p l a y E_{\mathrm{opt}}^{\mathrm{replay}} E opt replay denote the energy evaluated at the independently optimized rounded target coordinates and define the absolute energy difference Δ E = E e v a l − E o p t r e p l a y \Delta E = E_{\mathrm{eval}} - E_{\mathrm{opt}}^{\mathrm{replay}} Δ E = E eval − E opt replay . Evaluating those coordinates lowers the L D = 13 L_D = 13 L D = 13 , 14, 15 energies by only 1.41 × 10 − 6 1.41 \times10^{-6} 1.41 × 1 0 − 6 , 6.11 × 10 − 6 6.11 \times10^{-6} 6.11 × 1 0 − 6 , and 1.20 × 10 − 5 1.20 \times10^{-5} 1.20 × 1 0 − 5 , respectively, in lattice energy units. These differences compare evaluations of rounded coordinate vectors and are not full-precision optimization gaps.
The calculation demonstrates finite-volume one-flavor parameter transfer within this scalable circuit construction: the frozen shared coordinates retain comparable energy accuracy over the tested window. The stable interval was identified retrospectively and the source coordinates and reference energies are rounded, so the demonstrated accuracy concerns this finite-volume energy test. State fidelity, local observables, and transfer of the multi-flavor V g h V_{gh} V g h family have not been tested. Neither fixed-accuracy performance at arbitrary volumes nor efficient end-to-end classical simulation and optimization follows from the linear circuit-factor count.
We extend the one-flavor evaluations to L D = 30 , 50 , 100 , 200 L_D = 30, 50, 100, 200 L D = 30 , 50 , 100 , 200 at the same m = 0.5 m = 0.5 m = 0.5 , g 2 = 0.4 g^2 = 0.4 g 2 = 0.4 , and half filling. The first row of Table V is first reoptimized at each source volume L D = 10 L_D = 10 L D = 10 -14. These calculations impose the same ordered architecture at every source volume; they do not repeat adaptive operator selection. The resulting coordinates are fitted separately to
θ i ( L D ) = θ i , ∞ + C i e − b i ( L D − 10 ) , (26) \theta_i(L_D) = \theta_{i,\infty} + C_i e^{-b_i(L_D-10)}, \tag*{(26)} θ i ( L D ) = θ i , ∞ + C i e − b i ( L D − 10 ) , (26)
with 0.01 ≤ b i ≤ 2 0.01 \le b_i \le2 0.01 ≤ b i ≤ 2 . The empirical coordinate-resolution criterion is 10 − 6 10^{-6} 1 0 − 6 : a retained fit must resolve the finite-volume variation and have a maximum absolute residual no larger than this value. Coordinates 3, 5, and 8 in the stated append order satisfy these criteria and are evaluated at L D = 200 L_D = 200 L D = 200 ; the other seven retain their optimized L D = 14 L_D = 14 L D = 14 values. This prescription does not establish exponential convergence of all ten coordinates, and the resolution criterion is not a statistical uncertainty. No target-side operator selection or parameter optimization is performed.
Table VII gives the MPS energy densities E = E / L D \mathcal{E} = E/L_D E = E / L D and 100 ϵ E , e v a l 100\epsilon_{E,\mathrm{eval}} 100 ϵ E , eval , with E e v a l = E M P S E_{\mathrm{eval}} = E_{\mathrm{MPS}} E eval = E MPS and E 0 = E D M R G E_0 = E_{\mathrm{DMRG}} E 0 = E DMRG in Eq. (24) . The deviations from DMRG are approximately 0.35%-1.76% across these 60-400-qubit evaluations. The finite-bond MPS evaluations retain appreciable simulation error, so these deviations cannot be attributed solely to the variational circuits. The different parameter prescriptions and numerical settings also preclude interpreting the rows as a controlled scaling law for the energy error.
For N f = 2 N_f = 2 N f = 2 , the leading sequence V ( 1 ) , V ( 3 ) , V g h ( 1 ) V(1), V(3), V_{gh}(1) V ( 1 ) , V ( 3 ) , V g h ( 1 ) recurs over L D = 4 L_D = 4 L D = 4 -7, although the available results do not yet establish stabilization of the full operator sequence. Keeping the seven-generator sequence obtained at L D = 7 L_D = 7 L D = 7 fixed, we successfully optimized its parameters at L D = 8 L_D = 8 L D = 8 within the joint charge sector N 0 = N 1 = 8 N_0 = N_1 = 8 N 0 = N 1 = 8 . Extending these calculations to larger volumes is limited by the cost and accuracy of classical circuit evaluation. The statevector in the fixed charge sector still requires exponentially growing memory, while the MPS calculations at the tested bond dimensions retain appreciable discrepancies from the exact energy of the same L D = 8 L_D = 8 L D = 8 circuit. We therefore restrict the large-volume transfer tests to the one-flavor case.
Excited States
The flavor-number-conserving fixed ansatz can also be used to target successive states in a chosen joint charge sector. We define the normalized trial state ∣ ψ ( θ ) ⟩ = U ( θ ) ∣ ψ r e f ⟩ |\psi(\theta)\rangle= U(\theta)|\psi_{\mathrm{ref}}\rangle ∣ ψ ( θ )⟩ = U ( θ ) ∣ ψ ref ⟩ and minimize the sequentially deflated objective
L k ( θ ) = ⟨ ψ ( θ ) ∣ H ∣ ψ ( θ ) ⟩ + ∑ i = 0 k − 1 λ i ∣ ⟨ Ψ ~ i ∣ ψ ( θ ) ⟩ ∣ 2 , (27) \mathcal{L}_k(\theta) = \langle\psi(\theta)|H|\psi(\theta)\rangle+ \sum_{i=0}^{k-1}\lambda_i\left|\langle\widetilde{\Psi}_i|\psi(\theta)\rangle\right|^2, \tag*{(27)} L k ( θ ) = ⟨ ψ ( θ ) ∣ H ∣ ψ ( θ )⟩ + i = 0 ∑ k − 1 λ i ⟨ Ψ i ∣ ψ ( θ )⟩ 2 , (27)
where k ≥ 1 k \ge1 k ≥ 1 is the zero-based rank within the chosen sector and ∣ Ψ ~ i ⟩ |\widetilde{\Psi}_i\rangle ∣ Ψ i ⟩ are normalized VQE states prepared at the preceding ranks in that sector. The ground-state objective is L 0 = ⟨ ψ ∣ H ∣ ψ ⟩ \mathcal{L}_0 = \langle\psi|H|\psi\rangle L 0 = ⟨ ψ ∣ H ∣ ψ ⟩ . For the massless and massive benchmarks, we set λ i = λ = 10 \lambda_i = \lambda= 10 λ i = λ = 10 in lattice energy units. Because the Hamiltonian commutes with each flavor charge, its complete finite-volume spectrum decomposes into distinct joint charge sectors. A flavor-number-conserving circuit initialized in ( N 0 , N 1 ) = ( 2 , 2 ) (N_0,N_1) = (2,2) ( N 0 , N 1 ) = ( 2 , 2 ) restricts the variational search to that sector, as in charge-preserving deflation methods [21 ] . Exact charge conservation fixes the search sector but does not by itself guarantee convergence or completeness at finite circuit depth.
For a nondegenerate exact target ∣ Ψ k ⟩ |\Psi_k\rangle ∣ Ψ k ⟩ , we report the bare variational energy, rather than the penalized objective, through
E V Q E ( k ) = ⟨ ψ k ∣ H ∣ ψ k ⟩ , E_{\mathrm{VQE}}^{(k)} = \langle\psi_k|H|\psi_k\rangle, E VQE ( k ) = ⟨ ψ k ∣ H ∣ ψ k ⟩ ,
ϵ E ( k ) = ∣ E V Q E ( k ) − E e x a c t ( k ) ∣ ∣ E e x a c t ( k ) ∣ , (28) \epsilon_E^{(k)} = \frac{\left|E_{\mathrm{VQE}}^{(k)} - E_{\mathrm{exact}}^{(k)}\right|}{\left|E_{\mathrm{exact}}^{(k)}\right|}, \tag*{(28)} ϵ E ( k ) = E exact ( k ) E VQE ( k ) − E exact ( k ) , (28)
ϵ F ( k ) = 1 − ∣ ⟨ Ψ k ∣ ψ k ⟩ ∣ 2 . \epsilon_F^{(k)} = 1-\left|\langle\Psi_k|\psi_k\rangle\right|^2. ϵ F ( k ) = 1 − ∣ ⟨ Ψ k ∣ ψ k ⟩ ∣ 2 .
We characterize the charge sectors of the four targeted levels and compare the prepared states ∣ ψ i ⟩ |\psi_i\rangle ∣ ψ i ⟩ with the exact eigenstates ∣ Ψ i ⟩ |\Psi_i\rangle ∣ Ψ i ⟩ . Table VIII gives the relative energy errors. The squared overlaps with the exact eigenstates and between the prepared states have the ideal values
Table VIII. Energy discrepancies for the lowest four states in the ( N 0 , N 1 ) = ( 2 , 2 ) (N_0,N_1)=(2,2) ( N 0 , N 1 ) = ( 2 , 2 ) sector at g 2 = 1.0 g^2=1.0 g 2 = 1.0 , a = 1 a=1 a = 1 , L D = 2 L_D=2 L D = 2 , and N f = 2 N_f=2 N f = 2 with open boundary conditions for m = 0 m=0 m = 0 and m = 0.5 m=0.5 m = 0.5 . Within-sector ranks k = 0 , 1 , 2 , 3 k=0,1,2,3 k = 0 , 1 , 2 , 3 correspond to global spectrum indices 0, 1, 2, and 3 for the massless case and 0, 5, 6, and 14 for the massive case, respectively.
∣ ⟨ Ψ i ∣ ψ j ⟩ ∣ 2 = δ i j \left|\langle\Psi_i|\psi_j\rangle\right|^2 = \delta_{ij} ∣ ⟨ Ψ i ∣ ψ j ⟩ ∣ 2 = δ ij
∣ ⟨ ψ i ∣ ψ j ⟩ ∣ 2 = δ i j , (29) \left|\langle\psi_i|\psi_j\rangle\right|^2 = \delta_{ij}, \tag*{(29)} ∣ ⟨ ψ i ∣ ψ j ⟩ ∣ 2 = δ ij , (29)
with the latter condition being a self-consistency check for the VQE, as both squared overlaps have the identity matrix as an ideal target, and approximate agreement is achieved for the VQE states.
Extended Spectrum for Massless Hamiltonian
For the massless Hamiltonian with m = 0 m = 0 m = 0 and g 2 = 1.0 g^2 = 1.0 g 2 = 1.0 , the first three excited states in the complete spectrum lie in the same number and flavor sector as the ground state. They are therefore not excluded by flavor-charge conservation and were targeted from the same reference. Figure 4 and Figure 5 show the overlap histories of the VQE
Figure 4. Squared overlap of VQE first excited state with the target VQE ground state minimized via the loss function with m = 0 m=0 m = 0 , g 2 = 1.0 g^2=1.0 g 2 = 1.0 , a = 1 a=1 a = 1 , L D = 2 L_D=2 L D = 2 , N f = 2 N_f=2 N f = 2 , open boundary conditions, and λ = 10 \lambda=10 λ = 10 applied to the deflation terms.
Figure 5. Squared overlap of VQE first excited state with the exact first excited state with m = 0 m = 0 m = 0 , g 2 = 1.0 g^2 = 1.0 g 2 = 1.0 , a = 1 a = 1 a = 1 , L D = 2 L_D = 2 L D = 2 , N f = 2 N_f = 2 N f = 2 , open boundary conditions, and λ = 10 \lambda= 10 λ = 10 applied to the deflation terms.
first excited state with the orthogonal VQE ground state used in the loss function penalty, and the target state, respectively, while Figure 6 and Figure 7 show the corresponding overlap histories for the second and third excited states, respectively. Table IX shows the fidelities between the VQE and target exact eigenstates, while Table X shows the fidelities between the different VQE states.
Table IX. Fidelities between the VQE states ψ \psi ψ and the exact eigenstates Ψ \Psi Ψ of the ( N 0 , N 1 ) = ( 2 , 2 ) (N_0,N_1) = (2,2) ( N 0 , N 1 ) = ( 2 , 2 ) sector of the massless eight-qubit benchmark with m = 0 m = 0 m = 0 , g 2 = 1.0 g^2 = 1.0 g 2 = 1.0 , a = 1 a = 1 a = 1 , L D = 2 L_D = 2 L D = 2 , N f = 2 N_f = 2 N f = 2 , open boundary conditions, and λ = 10 \lambda= 10 λ = 10 applied to the deflation terms. The ideal case is an identity matrix.
Table X. Fidelities between the VQE states ψ \psi ψ of the ( N 0 , N 1 ) = ( 2 , 2 ) (N_0,N_1) = (2,2) ( N 0 , N 1 ) = ( 2 , 2 ) sector of the massless eight-qubit benchmark with m = 0 m = 0 m = 0 , g 2 = 1.0 g^2 = 1.0 g 2 = 1.0 , a = 1 a = 1 a = 1 , L D = 2 L_D = 2 L D = 2 , N f = 2 N_f = 2 N f = 2 , open boundary conditions, and λ = 10 \lambda= 10 λ = 10 applied to the deflation terms. The ideal case is an identity matrix.
Figure 6. Squared overlap of VQE second excited state with the exact second excited state with m = 0 m = 0 m = 0 , g 2 = 1.0 g^2 = 1.0 g 2 = 1.0 , a = 1 a = 1 a = 1 , L D = 2 L_D = 2 L D = 2 , N f = 2 N_f = 2 N f = 2 , open boundary conditions, and λ = 10 \lambda= 10 λ = 10 applied to the deflation terms.
Figure 7. Squared overlap of the VQE third excited state with the exact third excited state with m = 0 m = 0 m = 0 , g 2 = 1.0 g^{2} = 1.0 g 2 = 1.0 , a = 1 a = 1 a = 1 , L D = 2 L_{D} = 2 L D = 2 , N f = 2 N_{f} = 2 N f = 2 , open boundary conditions, and λ = 10 \lambda= 10 λ = 10 applied to the deflation terms.
Table XI places these states in the complete energy-ordered spectrum. The next full-spectrum levels lie outside the ( 2 , 2 ) (2,2) ( 2 , 2 ) reference sector and therefore cannot be reached from the same initialization by this flavor-number-conserving circuit.
Table XI. Selected exact energies and charge sectors for the massless eight-qubit benchmark with m = 0 m = 0 m = 0 , g 2 = 1.0 g^{2} = 1.0 g 2 = 1.0 , a = 1 a = 1 a = 1 , L D = 2 L_{D} = 2 L D = 2 , N f = 2 N_{f} = 2 N f = 2 , and open boundary conditions. Global indices are zero-based positions in the complete energy-ordered spectrum.
Probing Particular Flavor Sectors for Massive Hamiltonian
For the massive benchmark, the exact ground state lies in the joint charge sector ( N 0 , N 1 ) = ( 2 , 2 ) (N_0,N_1)=(2,2) ( N 0 , N 1 ) = ( 2 , 2 ) . As shown in Table XII , the four globally lowest excited states share a degenerate eigenvalue and lie in the distinct sectors ( 3 , 2 ) (3,2) ( 3 , 2 ) , ( 2 , 3 ) (2,3) ( 2 , 3 ) , ( 1 , 2 ) (1,2) ( 1 , 2 ) , and ( 2 , 1 ) (2,1) ( 2 , 1 ) . These are valid eigenstates of the
Table XII. Selected exact energy levels for m = 0.5 m = 0.5 m = 0.5 , g 2 = 1.0 g^{2} = 1.0 g 2 = 1.0 , a = 1 a = 1 a = 1 , L D = 2 L_{D} = 2 L D = 2 , and N f = 2 N_{f} = 2 N f = 2 with open boundary conditions. Global indices are zero-based positions in the complete energy-ordered spectrum.
Hamiltonian, but they cannot be reached from the ( 2 , 2 ) (2,2) ( 2 , 2 ) reference by a circuit that preserves both flavor charges. The lowest exact excited eigenstate in the reference sector is therefore global index 5, which has within-sector rank k = 1 k = 1 k = 1 ; global index 6 has within-sector rank k = 2 k = 2 k = 2 .
The level at E e x a c t = − 3.3390 E_{\mathrm{exact}} = -3.3390 E exact = − 3.3390 , represented by global indices 13–15, is an exactly degenerate flavor-S U ( 2 ) \mathrm{SU}(2) SU ( 2 ) triplet. An eigensolver that diagonalizes only H H H may return an arbitrary orthonormal basis in this subspace, producing non-integer expectation values of N 0 N_0 N 0 and N 1 N_1 N 1 even though both charges are exactly conserved. Diagonalizing either charge within the degenerate subspace yields the simultaneous charge eigenstates (1, 3), (2, 2), and (3, 1). The (2, 2) member has within-sector rank k = 3 k = 3 k = 3 . Accordingly, a variational state should be compared either with that charge-resolved eigenvector or with the projector onto the complete degenerate subspace; squared overlaps with individual unrotated eigenvectors are basis-dependent diagnostics. For a degenerate target subspace D \mathcal{D} D , the basis-independent fidelity is instead
F D = ⟨ ψ k ∣ P D ∣ ψ k ⟩ = ∑ α ∈ D ∣ ⟨ E α ∣ ψ k ⟩ ∣ 2 , (30) F_{\mathcal{D}} = \langle\psi_k\lvert P_{\mathcal{D}}\lvert\psi_k\rangle= \sum_{\alpha\in\mathcal{D}} \lvert\langle E_\alpha\lvert\psi_k\rangle\rvert^2, \tag*{(30)} F D = ⟨ ψ k ∣ P D ∣ ψ k ⟩ = α ∈ D ∑ ∣⟨ E α ∣ ψ k ⟩ ∣ 2 , (30)
While the fidelities of the VQE states with states lying in other flavor or number sectors are many orders of magnitude lower than with other orthogonal states in the same sector, both of these diagnostics - the fidelity with the exact charge-resolved ( 2 , 2 ) (2, 2) ( 2 , 2 ) state in a basis commuting with the flavor operator, as well as the basis-independent degenerate subspace fidelity give equivalent measures of circuit performance and are numerically close, as seen in Table XIII . The fidelities reported in all other tables, however, are those with the exact flavor-diagonal state. The penalty construction, therefore, targets successive variational states within a chosen flavor-number sector, while exact diagonalization organizes the complete spectrum across all sectors.
Table XIII. Fidelities of the VQE third excited state lying in the ( 2 , 2 ) (2, 2) ( 2 , 2 ) sector with the triply degenerate flavor-diagonal states, as well as the degenerate subspace fidelity F D F_{D} F D with the flavor-unresolved basis from (30) for m = 0.5 m = 0.5 m = 0.5 , g 2 = 1.0 g^{2} = 1.0 g 2 = 1.0 , a = 1 a = 1 a = 1 , L D = 2 L_{D} = 2 L D = 2 , and N f = 2 N_{f} = 2 N f = 2 with open boundary conditions. Within-sector rank k = 3 k = 3 k = 3 corresponds to a triply degenerate subspace spanning global spectrum indices 13, 14, and 15.
Conclusions and Outlook
We have constructed and benchmarked symmetry-preserving fixed circuits and a problem-specific SC-ADAPT ansatz for ground-state and sector-resolved excited-state preparation in the lattice Gross-Neveu model. The fixed families preserve either total fermion number or every flavor number. Their common circuit graph, layer organization, and local-phase parametriza-
tion permit individual flavor-number conservation to be imposed by removing cross-flavor exchange parameters. in the two-flavor benchmarks, this restriction improves the achieved energies under the reported optimization protocol, demonstrating the practical benefit of incorporating the flavor charges into these circuits.
The selected massive flavor-number-conserving benchmarks span N f = 1 , 2 , 3 , 4 N_{f} = 1, 2, 3, 4 N f = 1 , 2 , 3 , 4 and register through 30 qubits, with relative energy errors of approximately 1 × 10 − 5 1 \times10^{-5} 1 × 1 0 − 5 –2 × 10 − 4 2 \times10^{-4} 2 × 1 0 − 4 . At the available comparison points, these errors are smaller than those reported in Ref. [17 ] , each normalized to the reference energy of its respective finite-lattice Hamiltonian. The different discretizations and computational resources make this a comparison of reported benchmark errors rather than a matched algorithmic ranking.
The Gross-Neveu SC-ADAPT pool combines translated mass-hopping bulk and boundary-sensitive generators with a cross-flavor interaction-hopping family. The resulting circuit construction has linear precompilation local-factor growth on a volume-independent shared-parameter count at fixed N f N_{f} N f , range caps, and append count. Selected massive benchmarks with N f = 1 , 2 , 3 N_{f} = 1, 2, 3 N f = 1 , 2 , 3 have relative energy errors below 2.1 × 10 − 3 2.1 \times10^{-3} 2.1 × 1 0 − 3 through 30 qubits. Transferring the ten-qubit sequence and four-decimal parameters from L D = 12 L_{D} = 12 L D = 12 to L D = 13 L_{D} = 13 L D = 13 –15 15 15 gives relative energy errors of 1.97 × 10 − 3 1.97 \times10^{-3} 1.97 × 1 0 − 3 –2.03 × 10 − 3 2.03 \times10^{-3} 2.03 × 1 0 − 3 without further optimization. Evaluations using independently optimized, rounded target parameters give comparable energies. The one-flavor study further extends circuit evaluations to 400 qubits without target-side optimization. At maximum MPS bond dimension 256, the reported energies differ from DMRG references by 0.35%–1.76%, including finite-bond evaluation error. These results supplement the nearby-volume test without establishing fixed-accuracy performance at arbitrary volumes. For two flavors, the common leading sequence does not yet establish stabilization of the full operator ordering. Fixed-sequence optimization is feasible at L D = 8 L_D = 8 L D = 8 , while larger-volume transfer remains limited by the accuracy and cost of classical circuit evaluation.
Table XIV. Fidelities between the VQE states ψ \psi ψ and the exact eigenstates Ψ \Psi Ψ of the ( N 0 , N 1 ) = ( 2 , 2 ) (N_0, N_1) = (2, 2) ( N 0 , N 1 ) = ( 2 , 2 ) sector of the massive eight-qubit benchmark with m = 0.5 m = 0.5 m = 0.5 , g 2 = 1.0 g^2 = 1.0 g 2 = 1.0 , a = 1 a = 1 a = 1 , L D = 2 L_D = 2 L D = 2 , N f = 2 N_f = 2 N f = 2 , open boundary conditions, and λ = 10 \lambda= 10 λ = 10 applied to the deflation terms. The ideal case is an identity matrix.
Table XV. Fidelities between the VQE states ψ \psi ψ of the ( N 0 , N 1 ) = ( 2 , 2 ) (N_0, N_1) = (2, 2) ( N 0 , N 1 ) = ( 2 , 2 ) sector of the massive eight-qubit benchmark with m = 0.5 m = 0.5 m = 0.5 , g 2 = 1.0 g^2 = 1.0 g 2 = 1.0 , a = 1 a = 1 a = 1 , L D = 2 L_D = 2 L D = 2 , N f = 2 N_f = 2 N f = 2 , open boundary conditions, and λ = 10 \lambda= 10 λ = 10 applied to the deflation terms. The ideal case is an identity matrix.
Charge-preserving sequential deflation prepares the lowest four states by within-sector rank in the ( N 0 , N 1 ) = ( 2 , 2 ) (N_0, N_1) = (2, 2) ( N 0 , N 1 ) = ( 2 , 2 ) sector of both massless and massive eight-qubit systems. The displayed results have small energy discrepancies and near-unit squared-overlap or eigenspace-projector fidelities. For the massive rank-3 target, the unique ( 2 , 2 ) (2, 2) ( 2 , 2 ) component of the triply degenerate global eigenspace has a charge-resolved fidelity equal to the basis-independent projector fidelity. Resolving the charges and degeneracies is therefore essential when identifying the prepared spectral states.
The present results concern state preparation on finite lattices at fixed spacing. Continuum extrapolation and renormalized mass-gap scaling are separate objectives, as illustrated by tensor-network studies of the model [4 ] . State fidelities, local observables, and controlled multi-flavor circuit evaluations would further assess transfer beyond the demonstrated energy benchmarks. Noisy circuit simulations and small hardware implementations provide direct next tests of preparation accuracy after compilation and in the presence of device errors. The prepared states also offer starting points for future real-time and scattering calculations [9 , 13 ] .
Acknowledgments
We thank Talal Chowdhury for useful discussion. VB is supported in part by the US DOE under Award No DE-SC0024673. KK is supported in part by the National Science Foundation through Grant PHY-2609759. KY is supported by the Brookhaven National Laboratory LDRD 24-061, 25-033, and the U.S. Department of Energy, Office of Science, Grants No. DE-SC0012704. This research used resources of the National Energy Research Scientific Computing Center, a DOE Office of Science User Facility supported by the Office of Science of the U.S. Department of Energy under Contract No. DE-AC02-05CH11231 using NERSC award HEP-ERCAP0034458. Additionally, this work also used resources available through the National Research Platform (NRP) at the University of California, San Diego [26 ] . NRP has been developed, and is supported in part, by funding from National Science Foundation, from awards 1730158, 1541012, 1541349, 1826967, 2121167, 2100237, and 2120019, as well as additional funding from community partners.
Staggered and Jordan-Wigner Algebra
Staggered Map and Phase Redefinition
The staggered discretization associates the two components of the Dirac field in cell n n n with the even and odd staggered sites:
\begin{pmatrix}\psi_{1,b}\\ \psi_{2,b}\end{pmatrix}
\underset{n}{\longleftrightarrow}
\frac{1}{\sqrt{a}}
\begin{pmatrix}\chi_{2n,b}\\ \chi_{2n+1,b}\end{pmatrix}. \tag*{(31)}\end{pmatrix}
For the rephasing χ j , b = i j c j , b \chi_{j,b}=i^{j}c_{j,b} χ j , b = i j c j , b , each open-chain link obeys
χ j , b † χ j + 1 , b = i c j , b † c j + 1 , b , \chi_{j,b}^{\dagger}\chi_{j+1,b}=i c_{j,b}^{\dagger}c_{j+1,b}, χ j , b † χ j + 1 , b = i c j , b † c j + 1 , b ,
χ j + 1 , b † χ j , b = − i c j + 1 , b † c j , b , \chi_{j+1,b}^{\dagger}\chi_{j,b}=-i c_{j+1,b}^{\dagger}c_{j,b}, χ j + 1 , b † χ j , b = − i c j + 1 , b † c j , b ,
χ j , b † χ j , b = c j , b † c j , b . (32) \chi_{j,b}^{\dagger}\chi_{j,b}=c_{j,b}^{\dagger}c_{j,b}. \tag*{(32)} χ j , b † χ j , b = c j , b † c j , b . (32)
Consequently,
− i 2 a ( χ j , b † χ j + 1 , b − χ j + 1 , b † χ j , b ) = 1 2 a ( c j , b † c j + 1 , b + c j + 1 , b † c j , b ) , (33) \begin{aligned}
-\frac{i}{2a}\left(\chi_{j,b}^{\dagger}\chi_{j+1,b}-\chi_{j+1,b}^{\dagger}\chi_{j,b}\right) \\
&=\frac{1}{2a}\left(c_{j,b}^{\dagger}c_{j+1,b}+c_{j+1,b}^{\dagger}c_{j,b}\right), \tag*{(33)}
\end{aligned} − 2 a i ( χ j , b † χ j + 1 , b − χ j + 1 , b † χ j , b ) = 2 a 1 ( c j , b † c j + 1 , b + c j + 1 , b † c j , b ) , (33)
which verifies Eq. (3) link by link. Because the transformation leaves every n ^ j , b \hat n_{j,b} n ^ j , b invariant, it also leaves H m H_m H m , D n 2 D_n^2 D n 2 , and all flavor charges unchanged.
For α ∈ { I , R } \alpha\in\{I,R\} α ∈ { I , R } , define
f j , b ( I ) ≡ χ j , b , f j , b ( R ) ≡ c j , b . (34) f_{j,b}^{(I)}\equiv\chi_{j,b},\qquad f_{j,b}^{(R)}\equiv c_{j,b}. \tag*{(34)} f j , b ( I ) ≡ χ j , b , f j , b ( R ) ≡ c j , b . (34)
We apply the same flavor-chain Jordan-Wigner ordering separately in each convention:
f j , b ( α ) = K b ( α ) ( ∏ ℓ = 0 j − 1 Z q ( ℓ , b ) ( α ) ) X q ( j , b ) ( α ) + i Y q ( j , b ) ( α ) 2 , f_{j,b}^{(\alpha)}=\mathcal{K}_{b}^{(\alpha)}
\left(\prod_{\ell=0}^{j-1}Z_{q(\ell,b)}^{(\alpha)}\right)
\frac{X_{q(j,b)}^{(\alpha)}+iY_{q(j,b)}^{(\alpha)}}{2}, f j , b ( α ) = K b ( α ) ( ℓ = 0 ∏ j − 1 Z q ( ℓ , b ) ( α ) ) 2 X q ( j , b ) ( α ) + i Y q ( j , b ) ( α ) ,
K b ( α ) = ∏ b ′ = 0 b − 1 ∏ ℓ = 0 2 L D − 1 Z q ( ℓ , b ′ ) ( α ) . (35) \mathcal{K}_{b}^{(\alpha)}=
\prod_{b'=0}^{b-1}\prod_{\ell=0}^{2L_D-1}Z_{q(\ell,b')}^{(\alpha)}. \tag*{(35)} K b ( α ) = b ′ = 0 ∏ b − 1 ℓ = 0 ∏ 2 L D − 1 Z q ( ℓ , b ′ ) ( α ) . (35)
The parity string in the first line follows increasing j j j within a fixed flavor chain. The Klein factor K b ( α ) \mathcal{K}_{b}^{(\alpha)} K b ( α ) orders the flavor chains algebraically and enforces anticommutation between distinct flavors. It cancels from Hamiltonian terms containing an even number of operators from every participating flavor. This algebraic ordering is independent of the site-major register index assigned to each qubit.
The relation f j , b ( I ) = i j f j , b ( R ) f_{j,b}^{(I)}=i^{j}f_{j,b}^{(R)} f j , b ( I ) = i j f j , b ( R ) is implemented by an on-site Z Z Z rotation at each staggered site. It rotates the local X X X and Y Y Y axes while leaving the occupation operator invariant:
Z q ( j , b ) ( I ) = Z q ( j , b ) ( R ) ≡ Z q ( j , b ) . (36) Z_{q(j,b)}^{(I)}=Z_{q(j,b)}^{(R)}\equiv Z_{q(j,b)}. \tag*{(36)} Z q ( j , b ) ( I ) = Z q ( j , b ) ( R ) ≡ Z q ( j , b ) . (36)
The mass, interaction, and flavor charges therefore have the same Pauli-Z Z Z representation in both conventions.
Interaction Decomposition and Identity Offset
For neighboring sites on the same flavor chain, the intermediate parity string is empty. Equation (A5) gives
− i ( f j , b ( I ) † f j + 1 , b ( I ) − f j + 1 , b ( I ) † f j , b ( I ) ) = 1 2 [ X q ( j , b ) ( I ) Y q ( j + 1 , b ) ( I ) − Y q ( j , b ) ( I ) X q ( j + 1 , b ) ( I ) ] , -i\left(f_{j,b}^{(I)\dagger}f_{j+1,b}^{(I)}-f_{j+1,b}^{(I)\dagger}f_{j,b}^{(I)}\right)
=\frac{1}{2}\left[X_{q(j,b)}^{(I)}Y_{q(j+1,b)}^{(I)}-Y_{q(j,b)}^{(I)}X_{q(j+1,b)}^{(I)}\right], − i ( f j , b ( I ) † f j + 1 , b ( I ) − f j + 1 , b ( I ) † f j , b ( I ) ) = 2 1 [ X q ( j , b ) ( I ) Y q ( j + 1 , b ) ( I ) − Y q ( j , b ) ( I ) X q ( j + 1 , b ) ( I ) ] ,
f j , b ( R ) † f j + 1 , b ( R ) + f j + 1 , b ( R ) † f j , b ( R ) = 1 2 [ X q ( j , b ) ( R ) X q ( j + 1 , b ) ( R ) + Y q ( j , b ) ( R ) Y q ( j + 1 , b ) ( R ) ] . (37) f_{j,b}^{(R)\dagger}f_{j+1,b}^{(R)}+f_{j+1,b}^{(R)\dagger}f_{j,b}^{(R)}
=\frac{1}{2}\left[X_{q(j,b)}^{(R)}X_{q(j+1,b)}^{(R)}+Y_{q(j,b)}^{(R)}Y_{q(j+1,b)}^{(R)}\right]. \tag*{(37)} f j , b ( R ) † f j + 1 , b ( R ) + f j + 1 , b ( R ) † f j , b ( R ) = 2 1 [ X q ( j , b ) ( R ) X q ( j + 1 , b ) ( R ) + Y q ( j , b ) ( R ) Y q ( j + 1 , b ) ( R ) ] . (37)
Together with n ^ j , b = ( 1 − Z q ( j , b ) ) / 2 \hat n_{j,b}=(1-Z_{q(j,b)})/2 n ^ j , b = ( 1 − Z q ( j , b ) ) /2 , these identities give the full Pauli hopping operators summarized in Eq. (10) and the Pauli form of the staggered mass term.
Define the flavor-resolved scalar-density difference
Δ n , b = n ^ 2 n , b − n ^ 2 n + 1 , b . (38) \Delta_{n,b}=\hat n_{2n,b}-\hat n_{2n+1,b}. \tag*{(38)} Δ n , b = n ^ 2 n , b − n ^ 2 n + 1 , b . (38)
Then
D n 2 = ∑ b = 0 N f − 1 Δ n , b 2 + 2 ∑ 0 ≤ b < b ′ ≤ N f − 1 Δ n , b Δ n , b ′ . (39) D_n^2=\sum_{b=0}^{N_f-1}\Delta_{n,b}^{2}
+2\sum_{0\le b<b'\le N_f-1}\Delta_{n,b}\Delta_{n,b'}. \tag*{(39)} D n 2 = b = 0 ∑ N f − 1 Δ n , b 2 + 2 0 ≤ b < b ′ ≤ N f − 1 ∑ Δ n , b Δ n , b ′ . (39)
The first term is flavor diagonal, whereas the second contains the cross-flavor density-density couplings. In the qubit representation,
Δ n , b = Z q ( 2 n + 1 , b ) − Z q ( 2 n , b ) 2 , \Delta_{n,b}=\frac{Z_{q(2n+1,b)}-Z_{q(2n,b)}}{2}, Δ n , b = 2 Z q ( 2 n + 1 , b ) − Z q ( 2 n , b ) ,
Δ n , b 2 = 1 2 [ I − Z q ( 2 n , b ) Z q ( 2 n + 1 , b ) ] . (40) \Delta_{n,b}^{2}=\frac{1}{2}\left[I-Z_{q(2n,b)}Z_{q(2n+1,b)}\right]. \tag*{(40)} Δ n , b 2 = 2 1 [ I − Z q ( 2 n , b ) Z q ( 2 n + 1 , b ) ] . (40)
Substitution into Eq. (6) gives
H i n t = − g 2 L D N f 4 a + g 2 4 a ∑ n = 0 L D − 1 ∑ b = 0 N f − 1 Z q ( 2 n , b ) Z q ( 2 n + 1 , b ) − g 2 a ∑ n = 0 L D − 1 ∑ 0 ≤ b < b ′ ≤ N f − 1 Δ n , b Δ n , b ′ . (41) H_{\mathrm{int}}=-\frac{g^{2}L_DN_f}{4a}
+\frac{g^{2}}{4a}\sum_{n=0}^{L_D-1}\sum_{b=0}^{N_f-1}Z_{q(2n,b)}Z_{q(2n+1,b)}
-\frac{g^{2}}{a}\sum_{n=0}^{L_D-1}\sum_{0\le b<b'\le N_f-1}\Delta_{n,b}\Delta_{n,b'}. \tag*{(41)} H int = − 4 a g 2 L D N f + 4 a g 2 n = 0 ∑ L D − 1 b = 0 ∑ N f − 1 Z q ( 2 n , b ) Z q ( 2 n + 1 , b ) − a g 2 n = 0 ∑ L D − 1 0 ≤ b < b ′ ≤ N f − 1 ∑ Δ n , b Δ n , b ′ . (41)
The first term is the interaction identity offset displayed in the main text, while the remaining terms contain the same-flavor and cross-flavor Pauli interactions.
Conservation Algebra and Fixed-Circuit Schedules
Pair-number conservation
For a qubit pair ( u , v ) (u,v) ( u , v ) , define
N u v = n ^ u + n ^ v = 2 I − Z u − Z v 2 , N_{uv}=\hat n_u+\hat n_v=\frac{2I-Z_u-Z_v}{2}, N uv = n ^ u + n ^ v = 2 2 I − Z u − Z v ,
A u v = X u X v + Y u Y v . (42) A_{uv}=X_uX_v+Y_uY_v. \tag*{(42)} A uv = X u X v + Y u Y v . (42)
Because X u X v X_uX_v X u X v and Y u Y v Y_uY_v Y u Y v commute,
R Y u Y v ( α ) R X u X v ( α ) = e − i α A u v . (43) R_{Y_uY_v}(\alpha)R_{X_uX_v}(\alpha)=e^{-i\alpha A_{uv}}. \tag*{(43)} R Y u Y v ( α ) R X u X v ( α ) = e − i α A uv . (43)
The tied product, rather than either factor separately, preserves pair occupation:
[ A u v , N u v ] = [ Z u Z v , N u v ] = [ Z u , N u v ] = [ Z v , N u v ] = 0. (44) [A_{uv},N_{uv}]=[Z_uZ_v,N_{uv}]
=[Z_u,N_{uv}]=[Z_v,N_{uv}]=0. \tag*{(44)} [ A uv , N uv ] = [ Z u Z v , N uv ] = [ Z u , N uv ] = [ Z v , N uv ] = 0. (44)
Thus the chronological action of B B B is an X X XX X X rotation, the equal-angle Y Y YY Y Y rotation, a Z Z ZZ Z Z rotation, and independent rotations about Z u Z_u Z u and Z v Z_v Z v . Every complete block preserves N u v N_{uv} N uv . For endpoints belonging to flavors b ≠ c b\ne c b = c , the exchange component commutes with N b + N c N_b+N_c N b + N c but not generally with N b N_b N b or N c N_c N c separately.
For the flavor-number-conserving ansatz, the B B B blocks, which have the X X / Y Y XX/YY X X / Y Y product, are used only when both endpoints belong to the same flavor, ensuring there is no redistribution of occupation between different flavors. The chronological action of D D D is a Z Z ZZ Z Z rotation followed by the + Z u +Z_u + Z u and − Z v -Z_v − Z v phases. Since every factor is diagonal, this block also commutes with every flavor charge when u u u and v v v belong to different flavors.
Edge classes and ordered layers
For each unordered flavor pair ( b < c ) (b<c) ( b < c ) , the four translated cross-flavor edge classes are
e b c s t ( n ) = ( q ( 2 n + s , b ) , q ( 2 n + t , c ) ) , e_{bc}^{st}(n)=\left(q(2n+s,b),q(2n+t,c)\right), e b c s t ( n ) = ( q ( 2 n + s , b ) , q ( 2 n + t , c ) ) ,
( s , t ) ∈ { ( 0 , 0 ) , ( 1 , 1 ) , ( 0 , 1 ) , ( 1 , 0 ) } , (s,t)\in\{(0,0),(1,1),(0,1),(1,0)\}, ( s , t ) ∈ {( 0 , 0 ) , ( 1 , 1 ) , ( 0 , 1 ) , ( 1 , 0 )} ,
0 ≤ n ≤ L D − 1 , 0 ≤ b < c ≤ N f − 1. (45) 0\le n\le L_D-1,\qquad0\le b<c\le N_f-1. \tag*{(45)} 0 ≤ n ≤ L D − 1 , 0 ≤ b < c ≤ N f − 1. (45)
For each flavor b b b , define the ordered edge lists
E n n b = ( ( q ( j , b ) , q ( j + 1 , b ) ) ) j = 0 2 L D − 2 , (46) \mathcal{E}_{\mathrm{nn}}^b=\left(\left(q(j,b),q(j+1,b)\right)\right)_{j=0}^{2L_D-2}, \tag*{(46)} E nn b = ( ( q ( j , b ) , q ( j + 1 , b ) ) ) j = 0 2 L D − 2 , (46)
E e v e n b = ( ( q ( 2 n , b ) , q ( 2 n + 1 , b ) ) ) n = 0 L D − 1 , \mathcal{E}_{\mathrm{even}}^b=\left(\left(q(2n,b),q(2n+1,b)\right)\right)_{n=0}^{L_D-1}, E even b = ( ( q ( 2 n , b ) , q ( 2 n + 1 , b ) ) ) n = 0 L D − 1 ,
E o d d b = ( ( q ( 2 n + 1 , b ) , q ( 2 n + 2 , b ) ) ) n = 0 L D − 2 , \mathcal{E}_{\mathrm{odd}}^b=\left(\left(q(2n+1,b),q(2n+2,b)\right)\right)_{n=0}^{L_D-2}, E odd b = ( ( q ( 2 n + 1 , b ) , q ( 2 n + 2 , b ) ) ) n = 0 L D − 2 ,
E c e l l b = ( ( q ( 2 n , b ) , q ( 2 n + 1 , b ) ) ) n = 0 L D − 1 . (47) \mathcal{E}_{\mathrm{cell}}^b=\left(\left(q(2n,b),q(2n+1,b)\right)\right)_{n=0}^{L_D-1}. \tag*{(47)} E cell b = ( ( q ( 2 n , b ) , q ( 2 n + 1 , b ) ) ) n = 0 L D − 1 . (47)
The entries of each list are written in gate-application order. For an ordered list E = ( e 1 , … , e M ) \mathcal{E}=(e_1,\ldots,e_M) E = ( e 1 , … , e M ) , a block family B B B , and a shared tuple λ \lambda λ , define
P [ B ; E , λ ] = B e M ( λ ) ⋯ B e 2 ( λ ) B e 1 ( λ ) , (48) \mathcal{P}[B;\mathcal{E},\lambda]=B_{e_M}(\lambda)\cdots B_{e_2}(\lambda)B_{e_1}(\lambda), \tag*{(48)} P [ B ; E , λ ] = B e M ( λ ) ⋯ B e 2 ( λ ) B e 1 ( λ ) , (48)
so that the edge e 1 e_1 e 1 is acted on first.
The cross-flavor edges are the e b c s t ( n ) e_{bc}^{st}(n) e b c s t ( n ) defined in Eq. (45) . For each unordered flavor pair b < c b<c b < c and topology ( s , t ) (s,t) ( s , t ) , the tuple λ b c , s t \lambda_{bc,st} λ b c , s t is shared over n n n , while distinct flavor pairs and topologies retain independent tuples.
Introduce the per-flavor products
Q p , b = P [ B ; E p b , λ n n , b ] , p ∈ { e v e n , o d d } . (49) Q_{p,b}=\mathcal{P}[B;\mathcal{E}_{p}^b,\lambda_{\mathrm{nn},b}],\qquad p\in\{\mathrm{even},\mathrm{odd}\}. \tag*{(49)} Q p , b = P [ B ; E p b , λ nn , b ] , p ∈ { even , odd } . (49)
For compactness, define ∏ ← b = 0 N f − 1 Q b ≡ Q N f − 1 ⋯ Q 0 \overleftarrow{\prod}_{b=0}^{N_f-1}Q_b\equiv Q_{N_f-1}\cdots Q_0 ∏ b = 0 N f − 1 Q b ≡ Q N f − 1 ⋯ Q 0 , so that flavor b = 0 b=0 b = 0 acts first. The nearest-neighbor schedule is thus
U n n = ( ∏ ← b = 0 N f − 1 Q o d d , b ) ( ∏ ← b = 0 N f − 1 Q e v e n , b ) . U_{\mathrm{nn}}=
\left(\overleftarrow{\prod}_{b=0}^{N_f-1}Q_{\mathrm{odd},b}\right)
\left(\overleftarrow{\prod}_{b=0}^{N_f-1}Q_{\mathrm{even},b}\right). U nn = ( ∏ b = 0 N f − 1 Q odd , b ) ( ∏ b = 0 N f − 1 Q even , b ) .
Thus the total-number stage and the flavor-number stage both traverse all even-start lists in increasing ( b , n ) (b,n) ( b , n ) , followed by all odd-start lists in the same order, using the same tuple in both parity sweeps. Chronologically, the additional intracell stage follows the nearest-neighbor stage and traverses increasing ( b , n ) (b,n) ( b , n ) with a distinct tuple λ c e l l , b \lambda_{\mathrm{cell},b} λ cell , b . The cross-flavor stage is last: it traverses increasing b b b , then c > b c>b c > b , then n n n , with within-cell order ( 0 , 0 ) , ( 1 , 1 ) , ( 0 , 1 ) , ( 1 , 0 ) (0,0),(1,1),(0,1),(1,0) ( 0 , 0 ) , ( 1 , 1 ) , ( 0 , 1 ) , ( 1 , 0 ) . Parameters are shared only within a fixed translated topology class.
Independent and anti-tied local phases
If the phases in B B B were independent, they would decompose as
γ Z u + δ Z v = γ − δ 2 D u v + γ + δ 2 S u v , \gamma Z_u+\delta Z_v=\frac{\gamma-\delta}{2}D_{uv}+\frac{\gamma+\delta}{2}S_{uv}, γ Z u + δ Z v = 2 γ − δ D uv + 2 γ + δ S uv ,
D u v = Z u − Z v , D_{uv}=Z_u-Z_v, D uv = Z u − Z v ,
S u v = Z u + Z v . (50) S_{uv}=Z_u+Z_v. \tag*{(50)} S uv = Z u + Z v . (50)
The anti-tied choice δ = − γ \delta=-\gamma δ = − γ retains only D u v D_{uv} D uv . With
C u v = X u Y v − Y u X v , (51) C_{uv}=X_uY_v-Y_uX_v, \tag*{(51)} C uv = X u Y v − Y u X v , (51)
the local exchange algebra is
[ D u v , A u v ] = − 4 i C u v , [ S u v , A u v ] = 0. (52) [D_{uv},A_{uv}]=-4iC_{uv},\qquad[S_{uv},A_{uv}]=0. \tag*{(52)} [ D uv , A uv ] = − 4 i C uv , [ S uv , A uv ] = 0. (52)
Thus, the relative phase is conjugate to the exchange direction and can rotate A u v A_{uv} A uv into a current-like direction. By contrast, S u v = 2 I − 2 N u v S_{uv}=2I-2N_{uv} S uv = 2 I − 2 N uv would be diagonal in pair occupation and vanish within the one-particle pair sector.
SC-ADAPT Operator Algebra and Circuit Schedules
Parent Operators and Geometric Pool
The volume parents and their Hamiltonian normalizations are
Θ m V = ∑ j = 0 2 L D − 1 ∑ b = 0 N f − 1 ( − 1 ) n ^ j , b , \Theta_m^{V}=\sum_{j=0}^{2L_D-1}\sum_{b=0}^{N_f-1}(-1)^{\hat n_{j,b}}, Θ m V = j = 0 ∑ 2 L D − 1 b = 0 ∑ N f − 1 ( − 1 ) n ^ j , b ,
Θ h V ( d ) = 1 2 ∑ j = 0 2 L D − 1 − d ∑ b = 0 N f − 1 ( c j , b † c j + d , b + H . c . ) , (53) \Theta_h^{V}(d)=\frac{1}{2}\sum_{j=0}^{2L_D-1-d}\sum_{b=0}^{N_f-1}\left(c_{j,b}^{\dagger}c_{j+d,b}+\mathrm{H.c.}\right), \tag*{(53)} Θ h V ( d ) = 2 1 j = 0 ∑ 2 L D − 1 − d b = 0 ∑ N f − 1 ( c j , b † c j + d , b + H.c. ) , (53)
Θ g V = ∑ n = 0 L D − 1 D n 2 . \Theta_g^{V}=\sum_{n=0}^{L_D-1}D_n^2. Θ g V = n = 0 ∑ L D − 1 D n 2 .
H m = m Θ m V , H h o p ( R ) = 1 a Θ h V ( 1 ) , H i n t = − g 2 2 a Θ g V . H_m=m\Theta_m^V,\quad H_{\mathrm{hop}}^{(R)}=\frac{1}{a}\Theta_h^V(1),\quad H_{\mathrm{int}}=-\frac{g^2}{2a}\Theta_g^V. H m = m Θ m V , H hop ( R ) = a 1 Θ h V ( 1 ) , H int = − 2 a g 2 Θ g V . {#eq:C2}
The staggered identity contribution to H m H_m H m cancels over the even number of sites. Each parent commutes with every N b N_b N b , so their commutators preserve all flavor numbers.
The two surface families used in the main text are
O m h S 0 ( d ) = 1 2 ∑ b = 0 N f − 1 [ J 0 , b ( d ) + J 2 L D − 1 − d , b ( d ) ] , (54) O_{mh}^{S0}(d)=\frac{1}{2}\sum_{b=0}^{N_f-1}\left[J_{0,b}^{(d)}+J_{2L_D-1-d,b}^{(d)}\right], \tag*{(54)} O mh S 0 ( d ) = 2 1 b = 0 ∑ N f − 1 [ J 0 , b ( d ) + J 2 L D − 1 − d , b ( d ) ] , (54)
O m h S 1 ( d ) = − 1 2 ∑ b = 0 N f − 1 [ J 1 , b ( d ) + J 2 L D − 2 − d , b ( d ) ] . O_{mh}^{S1}(d)=-\frac{1}{2}\sum_{b=0}^{N_f-1}\left[J_{1,b}^{(d)}+J_{2L_D-2-d,b}^{(d)}\right]. O mh S 1 ( d ) = − 2 1 b = 0 ∑ N f − 1 [ J 1 , b ( d ) + J 2 L D − 2 − d , b ( d ) ] .
They retain the boundary structures and staggered relative sign of the volume current, with half its local coefficient magnitude [20 ] .
The available odd separations are
D 0 = { d ∈ 2 Z + 1 : 1 ≤ d ≤ 2 L D − 3 } , \mathcal{D}_0=\{d\in2\mathbb{Z}+1:1\leq d\leq2L_D-3\}, D 0 = { d ∈ 2 Z + 1 : 1 ≤ d ≤ 2 L D − 3 } ,
D 1 = { d ∈ 2 Z + 1 : 1 ≤ d ≤ 2 L D − 5 } , (55) \mathcal{D}_1=\{d\in2\mathbb{Z}+1:1\leq d\leq2L_D-5\}, \tag*{(55)} D 1 = { d ∈ 2 Z + 1 : 1 ≤ d ≤ 2 L D − 5 } , (55)
where D 0 \mathcal{D}_0 D 0 applies to O m h V O_{mh}^V O mh V , O m h S 0 O_{mh}^{S0} O mh S 0 , and O g h V O_{gh}^V O g h V , and D 1 \mathcal{D}_1 D 1 to O m h S 1 O_{mh}^{S1} O mh S 1 . Before the numerical caps in Eq. (20) , the geometric pool is
P g e o m = { O m h V ( d ) , O m h S 0 ( d ) , O g h V ( d ) } d ∈ D 0 ∪ { O m h S 1 ( d ) } d ∈ D 1 . (56) \mathcal{P}_{\mathrm{geom}}=\left\{O_{mh}^V(d),O_{mh}^{S0}(d),O_{gh}^V(d)\right\}_{d\in\mathcal{D}_0}\cup\left\{O_{mh}^{S1}(d)\right\}_{d\in\mathcal{D}_1}. \tag*{(56)} P geom = { O mh V ( d ) , O mh S 0 ( d ) , O g h V ( d ) } d ∈ D 0 ∪ { O mh S 1 ( d ) } d ∈ D 1 . (56)
Current Strings and Mass-Hopping Reductions
In the convention-R R R Pauli frame, define the intermediate flavor-chain parity string
Z j , b ( d ) = ∏ ℓ = j + 1 j + d − 1 Z q ( ℓ , b ) , Z j , b ( 1 ) = I . (57) Z_{j,b}^{(d)}=\prod_{\ell=j+1}^{j+d-1}Z_{q(\ell,b)},\qquad Z_{j,b}^{(1)}=I. \tag*{(57)} Z j , b ( d ) = ℓ = j + 1 ∏ j + d − 1 Z q ( ℓ , b ) , Z j , b ( 1 ) = I . (57)
The two current strings and their antisymmetric combination are
P X Y ; j , b ( d ) = X q ( j , b ) Z j , b ( d ) × Y q ( j + d , b ) , P_{XY;j,b}^{(d)}=X_{q(j,b)}Z_{j,b}^{(d)}\times Y_{q(j+d,b)}, P X Y ; j , b ( d ) = X q ( j , b ) Z j , b ( d ) × Y q ( j + d , b ) ,
P Y X ; j , b ( d ) = Y q ( j , b ) Z j , b ( d ) × X q ( j + d , b ) , P_{YX;j,b}^{(d)}=Y_{q(j,b)}Z_{j,b}^{(d)}\times X_{q(j+d,b)}, P Y X ; j , b ( d ) = Y q ( j , b ) Z j , b ( d ) × X q ( j + d , b ) ,
K j , b ( d ) = P X Y ; j , b ( d ) − P Y X ; j , b ( d ) . (58) K_{j,b}^{(d)}=P_{XY;j,b}^{(d)}-P_{YX;j,b}^{(d)}. \tag*{(58)} K j , b ( d ) = P X Y ; j , b ( d ) − P Y X ; j , b ( d ) . (58)
The Jordan-Wigner transformation in Eq. (35) gives
J j , b ( d ) = − 1 2 K j , b ( d ) . (59) J_{j,b}^{(d)}=-\frac{1}{2}K_{j,b}^{(d)}. \tag*{(59)} J j , b ( d ) = − 2 1 K j , b ( d ) . (59)
For arbitrary d ≥ 1 d\geq1 d ≥ 1 , direct evaluation of the mass-hopping commutator yields
i [ Θ m V , Θ h V ( d ) ] = i 2 ∑ j = 0 2 L D − 1 − d ∑ b = 0 N f − 1 [ ( − 1 ) j − ( − 1 ) j + d ] × ( c j , b † c j + d , b − c j + d , b † c j , b ) . (60) i[\Theta_m^V,\Theta_h^V(d)]=\frac{i}{2}\sum_{j=0}^{2L_D-1-d}\sum_{b=0}^{N_f-1}\left[(-1)^j-(-1)^{j+d}\right]\times\left(c_{j,b}^{\dagger}c_{j+d,b}-c_{j+d,b}^{\dagger}c_{j,b}\right). \tag*{(60)} i [ Θ m V , Θ h V ( d )] = 2 i j = 0 ∑ 2 L D − 1 − d b = 0 ∑ N f − 1 [ ( − 1 ) j − ( − 1 ) j + d ] × ( c j , b † c j + d , b − c j + d , b † c j , b ) . (60)
This expression vanishes for even d d d . For odd d d d , Eqs. (18) and (C8) give
O m h V ( d ) = − 1 2 ∑ j = 0 2 L D − 1 − d ∑ b = 0 N f − 1 ( − 1 ) j K j , b ( d ) . (61) O_{mh}^V(d)=-\frac{1}{2}\sum_{j=0}^{2L_D-1-d}\sum_{b=0}^{N_f-1}(-1)^jK_{j,b}^{(d)}. \tag*{(61)} O mh V ( d ) = − 2 1 j = 0 ∑ 2 L D − 1 − d b = 0 ∑ N f − 1 ( − 1 ) j K j , b ( d ) . (61)
Similarly, Eq. (54) becomes
O m h S 0 ( d ) = − 1 4 ∑ b = 0 N f − 1 [ K 0 , b ( d ) + K 2 L D − 1 − d , b ( d ) ] , O_{mh}^{S0}(d)=-\frac{1}{4}\sum_{b=0}^{N_f-1}\left[K_{0,b}^{(d)}+K_{2L_D-1-d,b}^{(d)}\right], O mh S 0 ( d ) = − 4 1 b = 0 ∑ N f − 1 [ K 0 , b ( d ) + K 2 L D − 1 − d , b ( d ) ] ,
O m h S 1 ( d ) = + 1 4 ∑ b = 0 N f − 1 [ K 1 , b ( d ) + K 2 L D − 2 − d , b ( d ) ] . (62) O_{mh}^{S1}(d)=+\frac{1}{4}\sum_{b=0}^{N_f-1}\left[K_{1,b}^{(d)}+K_{2L_D-2-d,b}^{(d)}\right]. \tag*{(62)} O mh S 1 ( d ) = + 4 1 b = 0 ∑ N f − 1 [ K 1 , b ( d ) + K 2 L D − 2 − d , b ( d ) ] . (62)
Cross-Flavor Interaction-Hopping Reduction
Let
σ n ( j , d ) = δ 2 n , j − δ 2 n + 1 , j − δ 2 n , j + d + δ 2 n + 1 , j + d . (63) \sigma_n(j,d)=\delta_{2n,j}-\delta_{2n+1,j}-\delta_{2n,j+d}+\delta_{2n+1,j+d}. \tag*{(63)} σ n ( j , d ) = δ 2 n , j − δ 2 n + 1 , j − δ 2 n , j + d + δ 2 n + 1 , j + d . (63)
For a current of flavor β \beta β , the cross-flavor part of the commutator with D n 2 D_n^2 D n 2 retains the density differences Δ n , b \Delta_{n,b} Δ n , b with b ≠ β b\ne\beta b = β . The projected generator in Eq. (19) is therefore
O g h V ( d ) = ∑ n = 0 L D − 1 ∑ j = 0 2 L D − 1 − d ∑ β = 0 N f − 1 σ n ( j , d ) ∑ b = 0 b ≠ β N f − 1 Δ n , b J j , β ( d ) . (64) O_{gh}^V(d)=\sum_{n=0}^{L_D-1}\sum_{j=0}^{2L_D-1-d}\sum_{\beta=0}^{N_f-1}\sigma_n(j,d)\sum_{\substack{b=0\\b\ne\beta}}^{N_f-1}\Delta_{n,b}J_{j,\beta}^{(d)}. \tag*{(64)} O g h V ( d ) = n = 0 ∑ L D − 1 j = 0 ∑ 2 L D − 1 − d β = 0 ∑ N f − 1 σ n ( j , d ) b = 0 b = β ∑ N f − 1 Δ n , b J j , β ( d ) . (64)
Using Δ n , b = [ Z q ( 2 n + 1 , b ) − Z q ( 2 n , b ) ] / 2 \Delta_{n,b}=[Z_{q(2n+1,b)}-Z_{q(2n,b)}]/2 Δ n , b = [ Z q ( 2 n + 1 , b ) − Z q ( 2 n , b ) ] /2 and Eq. (59) gives
O g h V ( d ) = − 1 4 ∑ n = 0 L D − 1 ∑ j = 0 2 L D − 1 − d ∑ β = 0 N f − 1 σ n ( j , d ) ∑ b = 0 b ≠ β N f − 1 [ Z q ( 2 n + 1 , b ) − Z q ( 2 n , b ) ] K j , β ( d ) . (65) O_{gh}^V(d)=-\frac{1}{4}\sum_{n=0}^{L_D-1}\sum_{j=0}^{2L_D-1-d}\sum_{\beta=0}^{N_f-1}\sigma_n(j,d)\sum_{\substack{b=0\\b\ne\beta}}^{N_f-1}\left[Z_{q(2n+1,b)}-Z_{q(2n,b)}\right]K_{j,\beta}^{(d)}. \tag*{(65)} O g h V ( d ) = − 4 1 n = 0 ∑ L D − 1 j = 0 ∑ 2 L D − 1 − d β = 0 ∑ N f − 1 σ n ( j , d ) b = 0 b = β ∑ N f − 1 [ Z q ( 2 n + 1 , b ) − Z q ( 2 n , b ) ] K j , β ( d ) . (65)
Each factor Δ n , b J j , β ( d ) \Delta_{n,b}J_{j,\beta}^{(d)} Δ n , b J j , β ( d ) preserves every flavor number. The projection is defined in the fixed flavor basis and enforces the Abelian charges { N b } \{N_b\} { N b } . The symmetry constraint imposed by this projection is conservation of the Abelian charges { N b } \{N_b\} { N b } in the chosen flavor basis.
Exact Current Blocks
For an ordered qubit pair ( u , v ) (u,v) ( u , v ) , we adopt the circuit convention of Fig. 3 of Ref. [20 ] and define
R ± u v ( φ ) = exp [ − i φ 2 ( Y u X v ± X u Y v ) ] , κ u v = X u Y v − Y u X v . (66) R_{\pm}^{uv}(\varphi)=\exp\left[-\frac{i\varphi}{2}\left(Y_uX_v\pm X_uY_v\right)\right],\qquad\kappa_{uv}=X_uY_v-Y_uX_v. \tag*{(66)} R ± uv ( φ ) = exp [ − 2 i φ ( Y u X v ± X u Y v ) ] , κ uv = X u Y v − Y u X v . (66)
In particular,
R − u v ( φ ) = exp ( i φ 2 κ u v ) . (67) R_{-}^{uv}(\varphi)=\exp\left(\frac{i\varphi}{2}\kappa_{uv}\right). \tag*{(67)} R − uv ( φ ) = exp ( 2 i φ κ uv ) . (67)
With R y ( φ ) = e − i φ Y / 2 R_y(\varphi)=e^{-i\varphi Y/2} R y ( φ ) = e − i φ Y /2 and R z ( φ ) = e − i φ Z / 2 R_z(\varphi)=e^{-i\varphi Z/2} R z ( φ ) = e − i φZ /2 , the gate-application sequence is listed from left to right:
S u , H u ; Z v , H v , S v ; S_u,\ H_u;\qquad Z_v,\ H_v,\ S_v; S u , H u ; Z v , H v , S v ;
CNOT u → v ; \operatorname{CNOT}_{u\to v}; CNOT u → v ;
R y ( u ) ( ± φ ) , R z ( v ) ( φ ) ; (68) R_y^{(u)}(\pm\varphi),\ R_z^{(v)}(\varphi); \tag*{(68)} R y ( u ) ( ± φ ) , R z ( v ) ( φ ) ; (68)
\operatorname{CNOT}_{u\to v};
H_u,\ S_u^\dagger;\qquad S_v^\dagger,\ H_v,\ Z_v.
The positive sign in the R y R_y R y angle gives R + R_+ R + , and the negative sign gives R − R_- R − .
Extending the odd-range X patterns displayed in Ref. [20 ] in this convention, for odd d = 2 r + 1 d=2r+1 d = 2 r + 1 we use the following ordered construction. Let q k = q ( j + k , b ) q_k=q(j+k,b) q k = q ( j + k , b ) for k = 0 , … , d k=0,\ldots,d k = 0 , … , d . The forward legs apply, for ℓ = 0 , … , r − 1 \ell=0,\ldots,r-1 ℓ = 0 , … , r − 1 in increasing order,
R + q ℓ q ℓ + 1 ( − π / 2 ) , R_{+}^{q_\ell q_{\ell+1}}(-\pi/2), R + q ℓ q ℓ + 1 ( − π /2 ) ,
R + q d − ℓ − 1 q d − ℓ ( − π / 2 ) , (69) R_{+}^{q_{d-\ell-1}q_{d-\ell}}(-\pi/2), \tag*{(69)} R + q d − ℓ − 1 q d − ℓ ( − π /2 ) , (69)
followed by R − q r q r + 1 ( s d α ) R_{-}^{q_rq_{r+1}}(s_d\alpha) R − q r q r + 1 ( s d α ) , where
s d = ( − 1 ) r = ( − 1 ) ( d − 1 ) / 2 . (70) s_d=(-1)^r=(-1)^{(d-1)/2}. \tag*{(70)} s d = ( − 1 ) r = ( − 1 ) ( d − 1 ) /2 . (70)
The forward legs are then undone in reverse radial order using R + ( + π / 2 ) R_+(+\pi/2) R + ( + π /2 ) . If A j , b ( d ) A_{j,b}^{(d)} A j , b ( d ) denotes their ordered product, the complete X-pattern block satisfies the exact identity
W j , b ( d ) ( α ) = A j , b ( d ) † R − q r q r + 1 ( s d α ) A j , b ( d ) = exp [ i α 2 K j , b ( d ) ] . (71) \begin{aligned}
W_{j,b}^{(d)}(\alpha)=A_{j,b}^{(d)\dagger}R_{-}^{q_rq_{r+1}}(s_d\alpha)A_{j,b}^{(d)} \\
&=\exp\left[\frac{i\alpha}{2}K_{j,b}^{(d)}\right]. \tag*{(71)}
\end{aligned} W j , b ( d ) ( α ) = A j , b ( d ) † R − q r q r + 1 ( s d α ) A j , b ( d ) = exp [ 2 i α K j , b ( d ) ] . (71)
Conjugating the central current through the ordered legs yields s d = ( − 1 ) ( d − 1 ) / 2 s_d=(-1)^{(d-1)/2} s d = ( − 1 ) ( d − 1 ) /2 , consistent with the odd-range patterns displayed in Ref. [20 ] . This factor corrects the X-pattern orientation and is distinct from the staggered coefficient ( − 1 ) j (-1)^j ( − 1 ) j in O m h ( d ) O_{\mathrm{mh}}^{(d)} O mh ( d ) .
Mass-Hopping Product Schedules
Let L V ( d ) = ( ( j 1 , b 1 ) , … , ( j T V ( d ) , b T V ( d ) ) ) \mathcal{L}_V(d)=((j_1,b_1),\ldots,(j_{T_V^{(d)}},b_{T_V^{(d)}})) L V ( d ) = (( j 1 , b 1 ) , … , ( j T V ( d ) , b T V ( d ) )) denote the volume pairs in gate-application order. Define
B V , t ( d ) ( ϑ ) = W j t , b t ( d ) ( ( − 1 ) j t ϑ ) . (72) B_{V,t}^{(d)}(\vartheta)=W_{j_t,b_t}^{(d)}\left((-1)^{j_t}\vartheta\right). \tag*{(72)} B V , t ( d ) ( ϑ ) = W j t , b t ( d ) ( ( − 1 ) j t ϑ ) . (72)
Density-Dressed Blocks and Adaptive-Circuit Order
For the surface families, define the right-boundary start sites
ℓ 0 = 2 L D − 1 − d , ℓ 1 = 2 L D − 2 − d , (73) \ell_0=2L_D-1-d,\qquad\ell_1=2L_D-2-d, \tag*{(73)} ℓ 0 = 2 L D − 1 − d , ℓ 1 = 2 L D − 2 − d , (73)
and let t = 1 , … , 2 N f t=1,\ldots,2N_f t = 1 , … , 2 N f , with
B S 0 , t ( d ) ( ϑ ) = { W 0 , t − 1 ( d ) ( ϑ / 2 ) , 1 ≤ t ≤ N f , W ℓ 0 , t − N f − 1 ( d ) ( ϑ / 2 ) , N f < t ≤ 2 N f . (74) B_{S_0,t}^{(d)}(\vartheta)=
\begin{cases}
W_{0,t-1}^{(d)}(\vartheta/2), & 1\le t\le N_f,\\
W_{\ell_0,t-N_f-1}^{(d)}(\vartheta/2), & N_f<t\le2N_f.
\end{cases} \tag*{(74)} B S 0 , t ( d ) ( ϑ ) = { W 0 , t − 1 ( d ) ( ϑ /2 ) , W ℓ 0 , t − N f − 1 ( d ) ( ϑ /2 ) , 1 ≤ t ≤ N f , N f < t ≤ 2 N f . (74)
and
B S 1 , t ( d ) ( ϑ ) = { W 1 , t − 1 ( d ) ( − ϑ / 2 ) , 1 ≤ t ≤ N f , W ℓ 1 , t − N f − 1 ( d ) ( − ϑ / 2 ) , N f < t ≤ 2 N f . (75) B_{S_1,t}^{(d)}(\vartheta)=
\begin{cases}
W_{1,t-1}^{(d)}(-\vartheta/2), & 1\le t\le N_f,\\
W_{\ell_1,t-N_f-1}^{(d)}(-\vartheta/2), & N_f<t\le2N_f.
\end{cases} \tag*{(75)} B S 1 , t ( d ) ( ϑ ) = { W 1 , t − 1 ( d ) ( − ϑ /2 ) , W ℓ 1 , t − N f − 1 ( d ) ( − ϑ /2 ) , 1 ≤ t ≤ N f , N f < t ≤ 2 N f . (75)
Thus the left boundary is applied before the right boundary, with increasing flavor index at each boundary. Under standard rightmost-first operator action, the scheduled candidate is
U ~ X ( d ) ( ϑ ) = B X , T X ( d ) ( d ) ( ϑ ) × ⋯ × B X , 2 ( d ) ( ϑ ) B X , 1 ( d ) ( ϑ ) , X ∈ { V , S 0 , S 1 } . (76) \widetilde{U}_X^{(d)}(\vartheta)=B_{X,T_X^{(d)}}^{(d)}(\vartheta)\times\cdots\times B_{X,2}^{(d)}(\vartheta)B_{X,1}^{(d)}(\vartheta),
\qquad X\in\{V,S0,S1\}. \tag*{(76)} U X ( d ) ( ϑ ) = B X , T X ( d ) ( d ) ( ϑ ) × ⋯ × B X , 2 ( d ) ( ϑ ) B X , 1 ( d ) ( ϑ ) , X ∈ { V , S 0 , S 1 } . (76)
With the formal signs in Eqs. (61) and (54) ,
U ~ X ( d ) ( ϑ ) = e − i ϑ O m h X ( d ) + O ( ϑ 2 ) , X ∈ { V , S 0 , S 1 } . (77) \widetilde{U}_X^{(d)}(\vartheta)=e^{-i\vartheta O_{\mathrm{mh}}^X(d)}+O(\vartheta^2),
\qquad X\in\{V,S0,S1\}. \tag*{(77)} U X ( d ) ( ϑ ) = e − i ϑ O mh X ( d ) + O ( ϑ 2 ) , X ∈ { V , S 0 , S 1 } . (77)
The common minus sign is absorbed by θ = − ϑ \theta=-\vartheta θ = − ϑ . The factor 1 / 2 1/2 1/2 in the surface angles implements the relative normalization in Eq. (C3) and is retained in append-point gradient comparisons.
For the volume family, blocks are grouped by increasing flavor index. Within each flavor, all even starts precede all odd starts for d = 1 d=1 d = 1 and d = 3 d=3 d = 3 . For d > 3 d>3 d > 3 , the residue layers have stride d − 1 = 2 r d-1=2r d − 1 = 2 r and are ordered
0 , r , 1 , r + 1 , … , r − 1 , 2 r − 1 , (78) 0,r,1,r+1,\ldots,r-1,2r-1, \tag*{(78)} 0 , r , 1 , r + 1 , … , r − 1 , 2 r − 1 , (78)
with increasing start index within each layer. These fixed orders are part of the finite-depth candidate circuit.
Let q c = q ( ℓ , b ) q_c=q(\ell,b) q c = q ( ℓ , b ) be a cross-flavor density qubit and let the current of flavor β ≠ b \beta\ne b β = b begin at q 0 = q ( j , β ) q_0=q(j,\beta) q 0 = q ( j , β ) . Controlled-Z Z Z conjugation gives
CZ q c , q 0 K j , β ( d ) CZ q c , q 0 = Z q c K j , β ( d ) , (79) \operatorname{CZ}_{q_c,q_0}K_{j,\beta}^{(d)}\operatorname{CZ}_{q_c,q_0}=Z_{q_c}K_{j,\beta}^{(d)}, \tag*{(79)} CZ q c , q 0 K j , β ( d ) CZ q c , q 0 = Z q c K j , β ( d ) , (79)
and hence the exact dressed block
CZ q c , q 0 W j , β ( d ) ( α ) CZ q c , q 0 = exp [ i α 2 Z q c K j , β ( d ) ] . (80) \operatorname{CZ}_{q_c,q_0}W_{j,\beta}^{(d)}(\alpha)\operatorname{CZ}_{q_c,q_0}
=\exp\left[\frac{i\alpha}{2}Z_{q_c}K_{j,\beta}^{(d)}\right]. \tag*{(80)} CZ q c , q 0 W j , β ( d ) ( α ) CZ q c , q 0 = exp [ 2 i α Z q c K j , β ( d ) ] . (80)
Write Eq. (65) as the signed term list in gate-application order,
O g h V ( d ) = − 1 4 ∑ t = 1 T g h ( d ) s t Z t K t , s t ∈ { − 1 , + 1 } , (81) O_{gh}^{V}(d)=-\frac{1}{4}\sum_{t=1}^{T_{gh}^{(d)}}s_tZ_tK_t,\qquad s_t\in\{-1,+1\}, \tag*{(81)} O g h V ( d ) = − 4 1 t = 1 ∑ T g h ( d ) s t Z t K t , s t ∈ { − 1 , + 1 } , (81)
where repeated entries retain algebraic multiplicities. For each listed term, define
D t ( d ) ( ϑ ) = C Z q c , t , q 0 , t W t ( d ) ( η g h s t ϑ ) C Z q c , t , q 0 , t (82) D_t^{(d)}(\vartheta)=\mathrm{CZ}_{q_c,t,q_0,t}W_t^{(d)}(\eta_{gh}s_t\vartheta)\mathrm{CZ}_{q_c,t,q_0,t} \tag*{(82)} D t ( d ) ( ϑ ) = CZ q c , t , q 0 , t W t ( d ) ( η g h s t ϑ ) CZ q c , t , q 0 , t (82)
η g h = 0.2 \eta_{gh}=0.2 η g h = 0.2 .
The implemented interaction candidate is
U ~ V g h ( d ) ( ϑ ) = D T g h ( d ) ( d ) ( ϑ ) ⋯ D 2 ( d ) ( ϑ ) D 1 ( d ) ( ϑ ) = e − 2 i η g h ϑ O g h V ( d ) + O ( ϑ 2 ) . (83) \begin{aligned}
\widetilde{U}_{V_{gh}}^{(d)}(\vartheta)=D_{T_{gh}^{(d)}}^{(d)}(\vartheta)\cdots D_2^{(d)}(\vartheta)D_1^{(d)}(\vartheta) \\
&=e^{-2i\eta_{gh}\vartheta O_{gh}^{V}(d)}+O(\vartheta^2). \tag*{(83)}
\end{aligned} U V g h ( d ) ( ϑ ) = D T g h ( d ) ( d ) ( ϑ ) ⋯ D 2 ( d ) ( ϑ ) D 1 ( d ) ( ϑ ) = e − 2 i η g h ϑ O g h V ( d ) + O ( ϑ 2 ) . (83)
Thus the implemented append-point generator is − 2 η g h O g h V ( d ) = − 0.4 O g h V ( d ) -2\eta_{gh}O_{gh}^{V}(d)=-0.4O_{gh}^{V}(d) − 2 η g h O g h V ( d ) = − 0.4 O g h V ( d ) for the value η g h = 0.2 \eta_{gh}=0.2 η g h = 0.2 used in the reported calculations. Its overall sign is absorbable into an unrestricted optimized parameter, while its magnitude rescales the raw append-point score relative to the other families and can therefore affect the selected sequence. The coefficient η g h \eta_{gh} η g h is a dimensionless pool-normalization, or gradient-preconditioning, hyperparameter introduced to reduce the raw-score scale of the larger density-dressed family; it is distinct from the Hamiltonian coupling g 2 g^2 g 2 . We use η g h = 0.2 \eta_{gh}=0.2 η g h = 0.2 for the benchmark circuits.
The interaction factors are ordered by physical cell, hopping flavor, distinct dressing flavor, active density site (odd then even), dressing-density endpoint (odd then even), and current endpoint (left then right when present). If ( U ~ 1 , … , U ~ M ) (\widetilde{U}_1,\ldots,\widetilde{U}_M) ( U 1 , … , U M ) is the selected sequence in append order, then
∣ ψ M ⟩ = U ~ M ⋯ U ~ 2 U ~ 1 ∣ Φ 0 ⟩ . (84) |\psi_M\rangle=\widetilde{U}_M\cdots\widetilde{U}_2\widetilde{U}_1|\Phi_0\rangle. \tag*{(84)} ∣ ψ M ⟩ = U M ⋯ U 2 U 1 ∣ Φ 0 ⟩ . (84)
Each R ± R_{\pm} R ± primitive, complete X-pattern block W W W , and controlled-Z-dressed W W W block is exact. First-order product error enters only when the exponential of a sum of translated or overlapping blocks is replaced by the fixed ordered product. The complete current and dressed-current blocks preserve every N b N_b N b , although their internal basis-change gates need not do so individually, and the resulting candidate circuits remain real in the occupation basis.
Representative SC-ADAPT Selection Scores
For the N f = 2 N_f=2 N f = 2 , L D = 4 L_D=4 L D = 4 calculation discussed in § 4 E, define
r k = max i ∈ P ∣ g i , k F D ∣ , (85) r_k=\max_{i\in\mathcal{P}}\left|g_{i,k}^{\mathrm{FD}}\right|, \tag*{(85)} r k = i ∈ P max g i , k FD , (85)
where the score is evaluated after reoptimization at step k k k . This is a maximum over the retained pool P \mathcal{P} P , not a Hilbert-space residual, and its magnitude depends on the candidate coordinates. Table XVI reports the two leading pre-append candidates, the selected score, and their score gap at each step.
Finite-Volume Sequence Coordinates
For the one-flavor transfer test, the frozen append order is the N f = 1 N_f=1 N f = 1 , L D = 12 L_D=12 L D = 12 –15 sequence in Table V , with the tabulated L D = 12 L_D=12 L D = 12 coordinate vector
θ 12 t a b = ( − 0.3065 , 0.0384 , − 0.0058 , − 0.1179 , 0.0015 , 0.0530 , − 0.0527 , 0.0514 , 0.0113 , − 0.0004 ) . (86) \boldsymbol{\theta}_{12}^{\mathrm{tab}}=(-0.3065,0.0384,-0.0058,
-0.1179,0.0015,0.0530,-0.0527,
0.0514,0.0113,-0.0004). \tag*{(86)} θ 12 tab = ( − 0.3065 , 0.0384 , − 0.0058 , − 0.1179 , 0.0015 , 0.0530 , − 0.0527 , 0.0514 , 0.0113 , − 0.0004 ) . (86)
The two occurrences of V ( 1 ) V(1) V ( 1 ) are distinct append coordinates.
The optimized parameters discussed here are coordinates of the implemented fixed factorization rather than uniformly normalized coefficients of the formal generators; the V g h V_{gh} V g h coordinates include the fixed η g h = 0.2 \eta_{gh}=0.2 η g h = 0.2 scaling. Within the one-flavor stability window L D = 12 L_D=12 L D = 12 –15, the leading V ( 1 ) V(1) V ( 1 ) coordinate changes from − 0.3065 -0.3065 − 0.3065 to − 0.3043 -0.3043 − 0.3043 , while the second V ( 1 ) V(1) V ( 1 ) occurrence changes from 0.0113 0.0113 0.0113 to 0.0095 0.0095 0.0095 . For two flavors, from L D = 4 L_D=4 L D = 4 to 7, the leading V ( 1 ) V(1) V ( 1 ) coordinate changes from − 0.25019 -0.25019 − 0.25019 to − 0.24506 -0.24506 − 0.24506 , and the V g h ( 1 ) V_{gh}(1) V g h ( 1 ) coordinate from − 0.02857 -0.02857 − 0.02857 to − 0.02649 -0.02649 − 0.02649 . These changes are small but nonzero and do not establish an infinite-volume limit.
The one-flavor V ( 9 ) V(9) V ( 9 ) generator first appears at L D = 8 L_D=8 L D = 8 , while V ( 7 ) V(7) V ( 7 ) occupies the eighth position at L D = 7 L_D=7 L D = 7 , the sixth at L D = 8 L_D=8 L D = 8 –11, and the fifth at L D = 12 L_D=12 L D = 12 –15. The origin of these finite-volume changes in operator order remains unresolved. Finite-volume interchange among retained operators was also observed in the Schwinger-model study [20 ] .
References