sVQNHE: Symmetry & Sign Hybrid Eigensolvers

• sVQNHE is an overloaded term in variational quantum computing, referring to dual methods that utilize either symmetry constraints or sign-structure separation.
• The 2022 method uses symmetry-preserving circuits and cost-function penalties to restrict the Hilbert space for low-energy spin Hamiltonian eigenstates.
• The 2025 method integrates classical neural amplitude models with shallow quantum sign layers to decouple amplitude learning from phase encoding, reducing measurement overhead.

Searching arXiv for sVQNHE and closely related papers. sVQNHE is an overloaded acronym in variational quantum computing. In one usage, it denotes the symmetry enhanced variational quantum spin eigensolver, a symmetry-aware extension of VQE and weighted SSVQE for low-energy spectra of spin Hamiltonians. In another, it denotes the sign-Variational Quantum-Neural Hybrid Eigensolver or sign-VQNHE, a neural-guided hybrid algorithm that decouples amplitude learning from sign or phase learning. The two methods address different bottlenecks—symmetry-sector restriction in one case, and sign-structure learning plus measurement efficiency in the other—but both are formulated for NISQ-era variational workloads (Lyu et al., 2022, Ren et al., 10 Jul 2025).

1. Terminology and lineage

The acronym has been used for two distinct algorithms.

Usage	Expansion	Core mechanism
2022 usage	symmetry enhanced variational quantum spin eigensolver	Symmetry restriction through hardware-preserving circuits, cost penalties, or hybrid sector targeting
2025 usage	sign-Variational Quantum-Neural Hybrid Eigensolver	Classical neural amplitude model plus shallow quantum sign or phase circuit with layerwise guidance

The 2022 method is rooted in the VQE and SSVQE tradition. Its baseline multi-state objective is

$$\mathrm{cost} = \sum_{i=1}^{k} w_{i} \langle \phi_{i}| U^{\dagger}(\vec{\theta}) H U(\vec{\theta}) | \phi_{i} \rangle,$$

with $w_1 > w_2 > \cdots > w_k > 0$, and its main intervention is to restrict the variational search to symmetry sectors relevant to the target eigenstates (Lyu et al., 2022).

The 2025 method is instead a redesign of the earlier Variational Quantum-Neural Hybrid Eigensolver (VQNHE), where a parameterized quantum state is classically post-processed by a diagonal operator

$\hat f=\sum_s f(s)\,|s\rangle\langle s|.$

In VQNHE, the variational object is effectively

$$|\psi_{\theta,\phi}\rangle \propto \hat f_\phi U_\theta|0^n\rangle,$$

and the 2025 sign-VQNHE specializes this quantum-neural template to sign-structure learning by assigning amplitudes to the neural module and sign or phase information to shallow diagonal quantum layers (Zhang et al., 2021).

A useful disambiguation is therefore structural rather than lexical. The 2022 sVQNHE is a symmetry-constrained eigensolver for spin models; the 2025 sVQNHE is a sign-structure-focused quantum-neural hybrid eigensolver.

2. Symmetry-enhanced variational quantum spin eigensolver

The 2022 sVQNHE targets low-energy excited states of spin Hamiltonians by exploiting conserved quantities to reduce the effective search space. Its primary benchmark is the antiferromagnetic Heisenberg chain

$$H_{0} = J \sum_{i=1}^{N-1} \boldsymbol{\sigma}^{i} \cdot \boldsymbol{\sigma}^{i+1},$$

with

$$[H_0, S_{tot}^2]=0, \qquad [H_0, S_{\alpha}]=0 \quad (\alpha=x,y,z),$$

where

$$S_\alpha=\frac{1}{2}\sum_i \sigma_{\alpha}^i, \qquad S_{tot}^2 = S_x^2 + S_y^2 + S_z^2.$$

Energy eigenstates can therefore be labeled by $(s,s_z)$, and the full Hilbert space decomposes into symmetry sectors (Lyu et al., 2022).

Three symmetry-preserving strategies are introduced. In the hardware symmetry preserving strategy, the circuit is designed so that

$[U(\vec{\theta}),Q_a]=0$

for the relevant conserved operators $Q_a$, and the input state is prepared in the desired sector. In the cost-function-based symmetry preserving strategy, symmetry is enforced by penalties added to the variational objective. In the hybrid symmetry preserving strategy, easy symmetries are built into the circuit and harder ones are imposed through the cost function. For Heisenberg chains, the hybrid construction preserves $w_1 > w_2 > \cdots > w_k > 0$0 in hardware and imposes $w_1 > w_2 > \cdots > w_k > 0$1 through penalties.

The symmetry-preserving circuit family is built from

$w_1 > w_2 > \cdots > w_k > 0$2

and phase gates

$w_1 > w_2 > \cdots > w_k > 0$3

For the isotropic case,

$w_1 > w_2 > \cdots > w_k > 0$4

which implies

$w_1 > w_2 > \cdots > w_k > 0$5

Without phase gates, the ansatz preserves $w_1 > w_2 > \cdots > w_k > 0$6 and $w_1 > w_2 > \cdots > w_k > 0$7; with phase gates, it preserves $w_1 > w_2 > \cdots > w_k > 0$8 but generally breaks full $w_1 > w_2 > \cdots > w_k > 0$9 spin symmetry.

For singlets, the hybrid SSVQE cost is

$\hat f=\sum_s f(s)\,|s\rangle\langle s|.$0

with

$\hat f=\sum_s f(s)\,|s\rangle\langle s|.$1

For triplets, the target sector $\hat f=\sum_s f(s)\,|s\rangle\langle s|.$2 implies $\hat f=\sum_s f(s)\,|s\rangle\langle s|.$3, and the cost becomes

$\hat f=\sum_s f(s)\,|s\rangle\langle s|.$4

with numerical results reported for

$\hat f=\sum_s f(s)\,|s\rangle\langle s|.$5

The same logic extends to other symmetries. For the transverse-field Ising chain,

$\hat f=\sum_s f(s)\,|s\rangle\langle s|.$6

the relevant conserved quantity is

$\hat f=\sum_s f(s)\,|s\rangle\langle s|.$7

and the first excited state is targeted with

$\hat f=\sum_s f(s)\,|s\rangle\langle s|.$8

using $\hat f=\sum_s f(s)\,|s\rangle\langle s|.$9.

The conceptual content is direct: low-energy states are not generic vectors in the full Hilbert space, and excited-state preparation becomes substantially less demanding when the variational family is restricted to the correct invariant subspace. The paper’s strongest claim is that this advantage becomes more pronounced for higher excited states.

3. Sign-Variational Quantum-Neural Hybrid Eigensolver

The 2025 sVQNHE addresses a different bottleneck: efficient learning of nontrivial sign or phase structure in hybrid variational ansätze. Its central ansatz is

$$|\psi_{\theta,\phi}\rangle \propto \hat f_\phi U_\theta|0^n\rangle,$$0

where $$|\psi_{\theta,\phi}\rangle \propto \hat f_\phi U_\theta|0^n\rangle,$$1 is a classical neural-network post-processing operator, $$|\psi_{\theta,\phi}\rangle \propto \hat f_\phi U_\theta|0^n\rangle,$$2 are diagonal quantum layers, and $$|\psi_{\theta,\phi}\rangle \propto \hat f_\phi U_\theta|0^n\rangle,$$3 are shallow non-diagonal quantum layers (Ren et al., 10 Jul 2025).

The defining decomposition is between amplitude and sign or phase. The neural network defines

$$|\psi_{\theta,\phi}\rangle \propto \hat f_\phi U_\theta|0^n\rangle,$$4

with $$|\psi_{\theta,\phi}\rangle \propto \hat f_\phi U_\theta|0^n\rangle,$$5, so the classical module learns only the amplitude distribution. The quantum circuit, especially the diagonal $$|\psi_{\theta,\phi}\rangle \propto \hat f_\phi U_\theta|0^n\rangle,$$6, learns sign or phase structure. At layer $$|\psi_{\theta,\phi}\rangle \propto \hat f_\phi U_\theta|0^n\rangle,$$7,

$$|\psi_{\theta,\phi}\rangle \propto \hat f_\phi U_\theta|0^n\rangle,$$8

Energy evaluation is performed termwise for a Hamiltonian decomposition

$$|\psi_{\theta,\phi}\rangle \propto \hat f_\phi U_\theta|0^n\rangle,$$9

via

$$H_{0} = J \sum_{i=1}^{N-1} \boldsymbol{\sigma}^{i} \cdot \boldsymbol{\sigma}^{i+1},$$0

The quantum sign ansatz uses shallow layers with commuting diagonal gates such as $$H_{0} = J \sum_{i=1}^{N-1} \boldsymbol{\sigma}^{i} \cdot \boldsymbol{\sigma}^{i+1},$$1 and $$H_{0} = J \sum_{i=1}^{N-1} \boldsymbol{\sigma}^{i} \cdot \boldsymbol{\sigma}^{i+1},$$2. The paper states that diagonal gates are natural for encoding phases, that they commute with each other, and that this structure enables simultaneous measurement in one basis. The initial non-diagonal layer is often

$$H_{0} = J \sum_{i=1}^{N-1} \boldsymbol{\sigma}^{i} \cdot \boldsymbol{\sigma}^{i+1},$$3

while later $$H_{0} = J \sum_{i=1}^{N-1} \boldsymbol{\sigma}^{i} \cdot \boldsymbol{\sigma}^{i+1},$$4 may be simple $$H_{0} = J \sum_{i=1}^{N-1} \boldsymbol{\sigma}^{i} \cdot \boldsymbol{\sigma}^{i+1},$$5 layers. The sign ansatz is described as employing $$H_{0} = J \sum_{i=1}^{N-1} \boldsymbol{\sigma}^{i} \cdot \boldsymbol{\sigma}^{i+1},$$6 gates to connect all edges of the corresponding physical model.

A second defining ingredient is gradual transfer. Each new $$H_{0} = J \sum_{i=1}^{N-1} \boldsymbol{\sigma}^{i} \cdot \boldsymbol{\sigma}^{i+1},$$7 is initialized to approximate the previous amplitude model $$H_{0} = J \sum_{i=1}^{N-1} \boldsymbol{\sigma}^{i} \cdot \boldsymbol{\sigma}^{i+1},$$8, either through the global Frobenius objective

$$H_{0} = J \sum_{i=1}^{N-1} \boldsymbol{\sigma}^{i} \cdot \boldsymbol{\sigma}^{i+1},$$9

or through KL alignment on test states,

$$[H_0, S_{tot}^2]=0, \qquad [H_0, S_{\alpha}]=0 \quad (\alpha=x,y,z),$$0

with

$$[H_0, S_{tot}^2]=0, \qquad [H_0, S_{\alpha}]=0 \quad (\alpha=x,y,z),$$1

This implements the paper’s bidirectional feedback loop: the neural network guides the next shallow quantum block, and the improved quantum phase structure feeds back into the hybrid state on which amplitude learning proceeds.

Optimization is layerwise rather than global. The parameters in $$[H_0, S_{tot}^2]=0, \qquad [H_0, S_{\alpha}]=0 \quad (\alpha=x,y,z),$$2 are updated by the parameter-shift rule,

$$[H_0, S_{tot}^2]=0, \qquad [H_0, S_{\alpha}]=0 \quad (\alpha=x,y,z),$$3

and for a parameter $$[H_0, S_{tot}^2]=0, \qquad [H_0, S_{\alpha}]=0 \quad (\alpha=x,y,z),$$4,

$$[H_0, S_{tot}^2]=0, \qquad [H_0, S_{\alpha}]=0 \quad (\alpha=x,y,z),$$5

The architecture is therefore neither a conventional fixed-depth hardware-efficient ansatz nor a purely classical neural variational state. It is a structured hybrid factorization in which amplitudes and signs are assigned to different computational modules.

4. Measurement models, trainability, and relation to VQNHE

The two sVQNHE variants improve different parts of the VQA stack. The 2022 method primarily reduces search-space size; the 2025 method primarily reduces sign-learning burden and measurement cost.

For the 2022 symmetry-enhanced method, the practical resource metric is

$$[H_0, S_{tot}^2]=0, \qquad [H_0, S_{\alpha}]=0 \quad (\alpha=x,y,z),$$6

where $$[H_0, S_{tot}^2]=0, \qquad [H_0, S_{\alpha}]=0 \quad (\alpha=x,y,z),$$7 is the number of circuit parameters and $$[H_0, S_{tot}^2]=0, \qquad [H_0, S_{\alpha}]=0 \quad (\alpha=x,y,z),$$8 the number of optimization iterations. Hardware symmetry preserving avoids symmetry-penalty measurements but can require additional circuit synthesis and state preparation, such as the singlet product state

$$[H_0, S_{tot}^2]=0, \qquad [H_0, S_{\alpha}]=0 \quad (\alpha=x,y,z),$$9

which the paper states costs at least $$S_\alpha=\frac{1}{2}\sum_i \sigma_{\alpha}^i, \qquad S_{tot}^2 = S_x^2 + S_y^2 + S_z^2.$$0 extra CNOTs (Lyu et al., 2022).

For the 2025 sign-VQNHE, the main resource argument is measurement compression enabled by commuting diagonal gates. Standard VQE or VQNHE training is summarized as requiring roughly $$S_\alpha=\frac{1}{2}\sum_i \sigma_{\alpha}^i, \qquad S_{tot}^2 = S_x^2 + S_y^2 + S_z^2.$$1 measurement overhead for gradients, whereas sVQNHE compresses this to $$S_\alpha=\frac{1}{2}\sum_i \sigma_{\alpha}^i, \qquad S_{tot}^2 = S_x^2 + S_y^2 + S_z^2.$$2. Table 1 in the paper states the measurement costs as $$S_\alpha=\frac{1}{2}\sum_i \sigma_{\alpha}^i, \qquad S_{tot}^2 = S_x^2 + S_y^2 + S_z^2.$$3 for VQE, $$S_\alpha=\frac{1}{2}\sum_i \sigma_{\alpha}^i, \qquad S_{tot}^2 = S_x^2 + S_y^2 + S_z^2.$$4 for VQNHE, and $$S_\alpha=\frac{1}{2}\sum_i \sigma_{\alpha}^i, \qquad S_{tot}^2 = S_x^2 + S_y^2 + S_z^2.$$5 for sVQNHE. For Hamiltonians with at most two non-$$S_\alpha=\frac{1}{2}\sum_i \sigma_{\alpha}^i, \qquad S_{tot}^2 = S_x^2 + S_y^2 + S_z^2.$$6 factors per Pauli string, such as the 1D $$S_\alpha=\frac{1}{2}\sum_i \sigma_{\alpha}^i, \qquad S_{tot}^2 = S_x^2 + S_y^2 + S_z^2.$$7-$$S_\alpha=\frac{1}{2}\sum_i \sigma_{\alpha}^i, \qquad S_{tot}^2 = S_x^2 + S_y^2 + S_z^2.$$8 model, the total number of measurements is stated as $$S_\alpha=\frac{1}{2}\sum_i \sigma_{\alpha}^i, \qquad S_{tot}^2 = S_x^2 + S_y^2 + S_z^2.$$9, where $(s,s_z)$0 is the number of Pauli strings in $(s,s_z)$1 (Ren et al., 10 Jul 2025).

The 2025 paper also analyzes sampling instability through

$(s,s_z)$2

with

$(s,s_z)$3

Its key asymptotic claim is

$(s,s_z)$4

so the normalization-induced variance shrinks as more amplitude structure is absorbed into the quantum part.

This line of work inherits the broader quantum-neural viewpoint of VQNHE. In VQNHE, the basic energy is

$(s,s_z)$5

and the paper proves that under depolarizing noise, neural-only retraining yields

$(s,s_z)$6

while joint PQC and neural retraining yields

$(s,s_z)$7

VQNHE++ extends this with a transformed Hamiltonian $(s,s_z)$8 and tri-optimization over quantum, neural, and transformation parameters (Zhang et al., 2021). The 2025 sign-VQNHE is not merely a renaming of VQNHE; it is a specialization in which the neural post-processing is constrained to nonnegative amplitudes and the quantum circuit is explicitly tasked with sign or phase modeling.

5. Benchmarks and reported performance

The empirical literature under the sVQNHE name is heterogeneous because the two algorithms target different tasks.

For the 2022 symmetry-enhanced method, the Heisenberg-chain ground-state benchmark at $(s,s_z)$9 compares a hardware-efficient ansatz to an $[U(\vec{\theta}),Q_a]=0$0-conserving ansatz. With only 5 layers of the $[U(\vec{\theta}),Q_a]=0$1-conserving circuit, the reported fidelity is

$[U(\vec{\theta}),Q_a]=0$2

after about 300 iterations, whereas a hardware-efficient circuit of the same depth reaches only about

$[U(\vec{\theta}),Q_a]=0$3

The hardware-efficient circuit requires at least 15 layers and about 2000 iterations to exceed $[U(\vec{\theta}),Q_a]=0$4 fidelity. The reported classical resource values are

$[U(\vec{\theta}),Q_a]=0$5

for the symmetry-preserving circuit at $[U(\vec{\theta}),Q_a]=0$6, and

$[U(\vec{\theta}),Q_a]=0$7

for the hardware-efficient one (Lyu et al., 2022).

The same paper reports that symmetry-free SSVQE becomes increasingly difficult as the number $[U(\vec{\theta}),Q_a]=0$8 of targeted states grows. For the Heisenberg chain at $[U(\vec{\theta}),Q_a]=0$9, Table I gives the minimum resources required to achieve

$Q_a$0

For $Q_a$1, the values are layers $Q_a$2, CNOT $Q_a$3, $Q_a$4, $Q_a$5. For $Q_a$6, they are layers $Q_a$7, CNOT $Q_a$8, $Q_a$9, $w_1 > w_2 > \cdots > w_k > 0$00. For $w_1 > w_2 > \cdots > w_k > 0$01, they are layers $w_1 > w_2 > \cdots > w_k > 0$02, CNOT $w_1 > w_2 > \cdots > w_k > 0$03, $w_1 > w_2 > \cdots > w_k > 0$04, $w_1 > w_2 > \cdots > w_k > 0$05. The paper states that for $w_1 > w_2 > \cdots > w_k > 0$06, states $w_1 > w_2 > \cdots > w_k > 0$07 to $w_1 > w_2 > \cdots > w_k > 0$08 fail to converge properly even with 25 layers. By contrast, in the hybrid symmetry-preserving setting for $w_1 > w_2 > \cdots > w_k > 0$09, both singlets $w_1 > w_2 > \cdots > w_k > 0$10 and $w_1 > w_2 > \cdots > w_k > 0$11 are reported above 0.95 fidelity after about 500 iterations with 18 layers, and triplets $w_1 > w_2 > \cdots > w_k > 0$12 and $w_1 > w_2 > \cdots > w_k > 0$13 also reach

$w_1 > w_2 > \cdots > w_k > 0$14

with 20 layers (Lyu et al., 2022).

The 2025 sign-VQNHE reports its clearest many-body result on the 6-qubit $w_1 > w_2 > \cdots > w_k > 0$15-$w_1 > w_2 > \cdots > w_k > 0$16 model with $w_1 > w_2 > \cdots > w_k > 0$17 and $w_1 > w_2 > \cdots > w_k > 0$18, which the paper identifies as a regime with a nontrivial sign problem. Relative to a baseline neural network after 2000 optimization steps, sign-NN achieves

$w_1 > w_2 > \cdots > w_k > 0$19

which the paper summarizes as 98.9\% reduction in mean absolute error and 99.6\% suppression of variance. In the same table, hea-NN gives

$w_1 > w_2 > \cdots > w_k > 0$20

and HEA2 gives

$w_1 > w_2 > \cdots > w_k > 0$21

The average optimization steps reported in the supplementary comparison are 132.67 for sVQNHE and 1676.00 for a 2-layer HEA-VQE, with success probability 60\% versus 5\% (Ren et al., 10 Jul 2025).

On a 9-qubit 2D Heisenberg model, the same paper reports

$w_1 > w_2 > \cdots > w_k > 0$22

for sign-NN, versus

$w_1 > w_2 > \cdots > w_k > 0$23

for HEA1 and

$w_1 > w_2 > \cdots > w_k > 0$24

for hea-NN. On sign-problem-free systems, the method remains competitive. For the 9-qubit TFIM, sign-NN gives

$w_1 > w_2 > \cdots > w_k > 0$25

For 9-qubit Ising,

$w_1 > w_2 > \cdots > w_k > 0$26

and for 12-qubit Ising,

$w_1 > w_2 > \cdots > w_k > 0$27

The MaxCut benchmarks emphasize resource efficiency under qubit-compressed encodings. On 45-vertex Erdős–Rényi graphs, the paper reports about

$w_1 > w_2 > \cdots > w_k > 0$28

improvement in solution quality and

$w_1 > w_2 > \cdots > w_k > 0$29

improvement in quantum resource efficiency for parameter set 2. The same section notes that sign-VQE alone shows no clear advantage over brickwork-VQE, so the observed gain is attributed to the full hybrid neural-guided strategy rather than the diagonal sign ansatz by itself (Ren et al., 10 Jul 2025).

6. Limitations, scope, and conceptual significance

The two sVQNHE variants rely on different prior structures, and their limitations follow from that reliance.

For the 2022 symmetry-enhanced method, the paper states that the approach applies only when there is prior knowledge of the relevant symmetries. Hardware symmetry preserving gives the best fidelities and the lowest optimization cost, but it can require sophisticated circuit design and nontrivial initialization. Cost-function-only symmetry preserving is more flexible, especially for nonlocal symmetries such as $w_1 > w_2 > \cdots > w_k > 0$30, but it requires extra measurements of symmetry operators and, in some cases, higher-order expressions such as $w_1 > w_2 > \cdots > w_k > 0$31. The hybrid method is presented as the practical compromise: it captures much of the symmetry advantage while avoiding full symmetry-adapted circuit synthesis (Lyu et al., 2022).

For the 2025 sign-VQNHE, the paper’s scalability claims are supported primarily by numerical experiments rather than full asymptotic proofs. Its effectiveness depends on the assumption that amplitude learning is classically manageable by the neural network, and the gradual-transfer mechanism adds classical optimization overhead. The paper states that real hardware results are not shown; the “real-world simulation” uses depolarizing gate noise and finite-shot observable estimation, with two-qubit gate error 0.005 and single-qubit gate error 0.0013. The method is therefore positioned as scalable and robust, but not as an asymptotically proven quantum speedup (Ren et al., 10 Jul 2025).

Taken together, the two meanings of sVQNHE illustrate a broader trend in variational quantum algorithm design: the deliberate incorporation of problem structure into hybrid ansätze. In the 2022 usage, the relevant structure is symmetry, and the algorithm narrows the accessible Hilbert space to the physically correct sector. In the 2025 usage, the relevant structure is the amplitude-sign decomposition of the wavefunction, and the algorithm assigns those two components to classical and quantum modules respectively. The shared methodological thesis is that shallow NISQ circuits are more effective when they are not asked to learn an undifferentiated full-state representation.