Neuron Product States in Quantum and Neural Systems

• Neuron Product States (NPS) are a formalism representing wavefunctions as products of neuron-like correlators, capturing long-range correlations in quantum many-body systems.
• They achieve universal approximation via sign-saturating and analytic activation functions, enabling efficient representation of complex quantum states with a controlled number of neurons.
• NPS integrate applications across quantum state representation, reservoir computing, and synthetic quantum-neuromorphic systems, offering new insights for variational algorithms and high-order memory encoding.

Neuron Product States (NPS) are a formal construction appearing in quantum many-body theory, time-series machine learning, and neuromorphic quantum architectures. They denote states or coordinates formed by products of neuron-like factors, where each neuron is a function of weighted sums (or, in some contexts, products) of elementary variables, which can be occupation numbers in Fock space or time-evolved synaptic inputs. The NPS formalism is closely connected to the universal approximation power of neural networks and the capacity of high-order monomial function bases to capture long-range correlations. In quantum settings, NPS provide a conceptually simple, variational class for fermionic wavefunctions in second quantization; in reservoir computing, they realize high-order memory and nonlinear capacity; and in synthetic quantum-neuromorphic systems, multineuron product states play a decisive role in encoding coherent information packets and controlling quantum trajectories.

1. NPS in Quantum Many-Body States: Formal Definition

In second-quantized fermionic systems, NPS are defined on the discrete Fock basis labelled by occupation-number vectors: $\vec n = (n_1, \dots, n_K) \in \{0,1\}^K$ with $K$ spin-orbitals and occupation $n_k$. A general wavefunction is a map: $$\Psi:\{0,1\}^K \longrightarrow \mathbb R\ \text{or}\ \mathbb C$$ The NPS ansatz asserts the amplitude factorizes into products of neuron correlators: $$\boxed{ \Psi_{\rm NPS}(\vec n) = \prod_{\alpha=1}^{N_h} \phi\bigl( b_\alpha + \sum_{k=1}^{K} W_{\alpha k}\,n_k \bigr) }$$ where $N_h$ is the number of neurons, $W_{\alpha k}$ are real weights, $b_\alpha$ are biases, and $\phi$ is an activation function. Alternatively, assuming $\phi(x)$ is nonvanishing,

$K$0

with $K$1.

This construction generalizes restricted Boltzmann machine wavefunctions and is distinct from correlator product states (CPS), as discussed below (Li et al., 7 Nov 2025).

2. Universal Approximation Properties of NPS

A central result is that NPS, with properly chosen neuron activation functions and enough hidden units, can approximate any quantum state on Fock space arbitrarily well. There are two rigorous results:

2.1 Sign-Saturating Activations

If $K$2 is continuous, sign-saturating ($K$3, $K$4), e.g., $K$5, then for any target $K$6 and fixed $K$7, there exists $K$8 and parameters $K$9 achieving

$n_k$0

The constructive proof utilizes hyperplane separation to isolate each bitstring, then products single-neuron factors to match signs and magnitudes.

2.2 Analytic Non-Polynomial Activations

For more general analytic $n_k$1, universality holds if (i) $n_k$2 can take positive and negative values, and (ii) $n_k$3 is not a polynomial of degree $n_k$4. Here, expansion in “spin” variables allows matching multilinear polynomial coefficients recursively; this provides exact control over the Fourier expansion of $n_k$5.

Both proofs guarantee exact universality for $n_k$6; in practical scenarios, much fewer neurons may be sufficient.

3. Comparison: NPS vs. Correlator Product States (CPS)

CPS, or Jastrow/entangled-plaquette states, realize wavefunctions as products of full-rank local correlators over orbital clusters: $n_k$7 where each cluster correlator is a $n_k$8-tensor over $n_k$9 sites.

Contrasts between NPS and CPS:

Feature	NPS	CPS
Rank	Low (single function of global sum)	High (local tensor)
Support	Global (combines all sites)	Local (fixed cluster)
Parameter scaling	$$\Psi:\{0,1\}^K \longrightarrow \mathbb R\ \text{or}\ \mathbb C$$0 (for universality)	$$\Psi:\{0,1\}^K \longrightarrow \mathbb R\ \text{or}\ \mathbb C$$1
Expressivity	Universal with $$\Psi:\{0,1\}^K \longrightarrow \mathbb R\ \text{or}\ \mathbb C$$2 units	Exact for full clusters
Entanglement structure	Many simple long-range correlators	Few but high-rank local

NPS is most efficient when global low-rank structure dominates, CPS when local high-rank entanglement is prevalent (Li et al., 7 Nov 2025).

4. NPS in Reservoir Computing: Product-Unit Architectures

In reservoir computing, notably “Product Reservoir Computing” (Goudarzi et al., 2015), NPS denote reservoir coordinates formed by multiplicative neurons. For a scalar input $$\Psi:\{0,1\}^K \longrightarrow \mathbb R\ \text{or}\ \mathbb C$$3 and vector state $$\Psi:\{0,1\}^K \longrightarrow \mathbb R\ \text{or}\ \mathbb C$$4,

$$\Psi:\{0,1\}^K \longrightarrow \mathbb R\ \text{or}\ \mathbb C$$5

which yields

$$\Psi:\{0,1\}^K \longrightarrow \mathbb R\ \text{or}\ \mathbb C$$6

These product-unit reservoirs encode exponentially many monomials of the input history, i.e. high-order time correlations, realizable as NPS. When combined with a linear readout,

$$\Psi:\{0,1\}^K \longrightarrow \mathbb R\ \text{or}\ \mathbb C$$7

arbitrary nonlinear functionals can be approximated.

Product reservoirs match or surpass standard tanh-ESNs for nonlinear memory retention and prediction benchmarks (Mackey-Glass, Lorenz), and are analytically tractable due to linear dynamics in the log-domain.

5. NPS in Synthetic Quantum-Neuromorphic Networks

In synthetic neuron networks with memristive qubit architectures (Nayfeh et al., 22 Jul 2025), “Neuron Product States” refer to joint product states of several neuron-qubits, each with Hamiltonian: $$\Psi:\{0,1\}^K \longrightarrow \mathbb R\ \text{or}\ \mathbb C$$8 Product states across multiple neurons: $$\Psi:\{0,1\}^K \longrightarrow \mathbb R\ \text{or}\ \mathbb C$$9 are generated by initializing each qubit to the ground state ($$\boxed{ \Psi_{\rm NPS}(\vec n) = \prod_{\alpha=1}^{N_h} \phi\bigl( b_\alpha + \sum_{k=1}^{K} W_{\alpha k}\,n_k \bigr) }$$0), with coupling bias set to zero. Burst-mode spikes control rotations and entanglement by varying the coupling strengths ($$\boxed{ \Psi_{\rm NPS}(\vec n) = \prod_{\alpha=1}^{N_h} \phi\bigl( b_\alpha + \sum_{k=1}^{K} W_{\alpha k}\,n_k \bigr) }$$1). Sufficiently weak coupling maintains separable product states for non-Markovian memory timescales, quantified by purity and entanglement negativity.

Algorithmic protocols include calibrated burst initialization, selective rotations, controlled entangling gates via bias adjustment, readout via membrane conductance, and coherence/entanglement measurement for packet generation. Table-I logic maps entanglement and non-Markovianity to packet routing and decision outcomes.

6. Computational and Representational Considerations

Universality proofs for NPS, as with feedforward NNs and neural-network backflow (NNBF), necessitate exponential scaling in the number of hidden units ($$\boxed{ \Psi_{\rm NPS}(\vec n) = \prod_{\alpha=1}^{N_h} \phi\bigl( b_\alpha + \sum_{k=1}^{K} W_{\alpha k}\,n_k \bigr) }$$2). Each neuron requires $$\boxed{ \Psi_{\rm NPS}(\vec n) = \prod_{\alpha=1}^{N_h} \phi\bigl( b_\alpha + \sum_{k=1}^{K} W_{\alpha k}\,n_k \bigr) }$$3 parameters; thus, total complexity for exact universality is $$\boxed{ \Psi_{\rm NPS}(\vec n) = \prod_{\alpha=1}^{N_h} \phi\bigl( b_\alpha + \sum_{k=1}^{K} W_{\alpha k}\,n_k \bigr) }$$4. In realistic systems, substantial dimensional reduction is expected via physical or structural priors; typical applications deploy $$\boxed{ \Psi_{\rm NPS}(\vec n) = \prod_{\alpha=1}^{N_h} \phi\bigl( b_\alpha + \sum_{k=1}^{K} W_{\alpha k}\,n_k \bigr) }$$5.

Comparatively, CPS with fixed local cluster size $$\boxed{ \Psi_{\rm NPS}(\vec n) = \prod_{\alpha=1}^{N_h} \phi\bigl( b_\alpha + \sum_{k=1}^{K} W_{\alpha k}\,n_k \bigr) }$$6 scales as $$\boxed{ \Psi_{\rm NPS}(\vec n) = \prod_{\alpha=1}^{N_h} \phi\bigl( b_\alpha + \sum_{k=1}^{K} W_{\alpha k}\,n_k \bigr) }$$7, and is efficient for area-law entanglement. FNN and NNBF require similar exponential resources for formal universality; in practice, the target wavefunction $$\boxed{ \Psi_{\rm NPS}(\vec n) = \prod_{\alpha=1}^{N_h} \phi\bigl( b_\alpha + \sum_{k=1}^{K} W_{\alpha k}\,n_k \bigr) }$$8 should exhibit compressibility for scalable deployment.

In product reservoir computing, simulations proceed via the $$\boxed{ \Psi_{\rm NPS}(\vec n) = \prod_{\alpha=1}^{N_h} \phi\bigl( b_\alpha + \sum_{k=1}^{K} W_{\alpha k}\,n_k \bigr) }$$9 transformation and matrix algebra, affording analytic tractability and efficient memory/capacity calculations. For synthetic quantum networks, separability and memory retention hinge critically on maintaining weak coupling and tuning burst-mode spikes.

7. Connections to Universal Neural Network Quantum States

The theoretical framework underlying NPS closely mirrors universal approximation theorems in classical and quantum neural networks. Rigorous proofs leverage hyperplane separation, multilinear expansions, and analytic control of activation functions. For FNN: $N_h$0 and for NNBF: $N_h$1 both achieve universality for $N_h$2 with appropriate activation tailoring.

The “sanity check” established by these results demonstrates that NPS, FNN, NNBF, and CPS all saturate the representational capacity of the many-body Hilbert space for exponential resources, but offer fundamentally distinct architectures for correlation generation and entanglement control.

---

Neuron Product States unify product-form neuron correlations in quantum, classical, and neuromorphic architectures, establishing a versatile platform for universal representation, high-order memory, and controlled quantum dynamics. The formal and computational properties have direct implications for variational quantum algorithms, reservoir computing, and quantum information packet processing.