Swap-Test Neuron Overview

• Swap-Test Neuron is a quantum neural primitive that uses ancilla measurement statistics from a SWAP-test circuit to compute fidelity-based activations.
• It has been shown to be mathematically equivalent to a two-layer feedforward network with quadratic activation functions under amplitude encoding.
• Generalized versions with multiple SWAP tests enable higher-order polynomial activations, improving network expressivity while increasing circuit complexity.

Searching arXiv for the cited papers and related SWAP-test neuron work. A Swap-Test Neuron is a quantum-neural primitive in which the output of a neuron is obtained from the ancilla measurement statistics of a SWAP-test circuit comparing an input state with a parameterized weight or label state. In the most direct formulation, the neuron applies the sequence $H$–controlled-SWAP–$H$ to an ancilla coupled to two equally sized registers and returns an output proportional to the overlap fidelity, specifically $\tfrac12(1+|\langle\psi|\phi\rangle|^2)$ for pure states (Nagies et al., 20 Jun 2025). Recent work has clarified that, under amplitude encoding, this construction is mathematically equivalent to a classical two-layer feedforward network with quadratic activation functions, thereby making its expressive power analyzable with classical approximation theory (Nagies et al., 20 Jun 2025). Earlier formulations emphasized the swap-test neuron as a fully quantum building block whose inputs, weights, activations, and gradient-estimation procedures can all be expressed in circuit form (Zhao et al., 2019), while subsequent work extended the motif to multi-class classification using label states without increasing the hardware footprint with the number of classes (Pillay et al., 2023).

1. Circuit-level definition

The single-neuron circuit in the SWAP-test formulation uses three registers: an ancilla qubit initialized in $|0\rangle_a$, a data register holding $|\psi\rangle$, and a weight register holding $|\phi\rangle$ or, in classification settings, a parameterized label state $|\ell_k(\theta_k)\rangle$ (Nagies et al., 20 Jun 2025, Pillay et al., 2023). The gate sequence is the standard SWAP test: apply a Hadamard to the ancilla, perform a controlled-SWAP with the ancilla as control and the two data-bearing registers as targets, apply a second Hadamard to the ancilla, and measure the ancilla in the computational or $Z$-basis (Nagies et al., 20 Jun 2025, Pillay et al., 2023).

For pure states, the ancilla outcome $0$ occurs with probability

$$P(0)=\tfrac12\bigl(1+|\langle\psi|\phi\rangle|^2\bigr),$$

so the neuron output is directly tied to state fidelity (Nagies et al., 20 Jun 2025). In the multi-class classifier formulation, this is written as

$H$0

with the fidelity recovered as $H$1 (Pillay et al., 2023). This measurement rule is the defining operational feature of the swap-test neuron: its activation is not an arbitrarily chosen classical nonlinearity imposed after a linear form, but the interference pattern generated by the SWAP-test circuit.

The controlled-SWAP gate itself acts conditionally on the ancilla state. In the notation of the multi-class SWAP-test classifier, $H$2 maps $H$3 to $H$4, while leaving the state unchanged when the ancilla is $H$5 (Pillay et al., 2023). The corresponding SWAP operator on two $H$6-qubit registers is

$H$7

A distinct, earlier line of work by Zhao et al. used “swap-test neuron” in a broader sense. There the swap test served as a subroutine for obtaining the real and imaginary parts of $H$8, combined with quantum phase estimation and a separate activation circuit implemented by single-qubit rotations (Zhao et al., 2019). That construction is related but not identical to the later fidelity-based neuron whose output is the ancilla-zero probability itself.

2. Amplitude encoding and classical-network equivalence

The most explicit classical interpretation arises when a $H$9-dimensional real vector $\tfrac12(1+|\langle\psi|\phi\rangle|^2)$0 is amplitude-encoded as

$\tfrac12(1+|\langle\psi|\phi\rangle|^2)$1

and the weight vector $\tfrac12(1+|\langle\psi|\phi\rangle|^2)$2 is encoded analogously (Nagies et al., 20 Jun 2025). In that case,

$\tfrac12(1+|\langle\psi|\phi\rangle|^2)$3

which yields

$\tfrac12(1+|\langle\psi|\phi\rangle|^2)$4

The pre-activation is thus a cosine similarity, and the effective nonlinearity is a square, i.e. a quadratic activation (Nagies et al., 20 Jun 2025).

Bias can be incorporated by appending a dummy feature $\tfrac12(1+|\langle\psi|\phi\rangle|^2)$5 and a corresponding weight $\tfrac12(1+|\langle\psi|\phi\rangle|^2)$6, producing

$\tfrac12(1+|\langle\psi|\phi\rangle|^2)$7

This is important because the bare SWAP-test form otherwise lacks an additive offset term in the classical pre-activation (Nagies et al., 20 Jun 2025).

With $\tfrac12(1+|\langle\psi|\phi\rangle|^2)$8 such neurons in a hidden layer, one measures each $\tfrac12(1+|\langle\psi|\phi\rangle|^2)$9 and combines them classically as

$|0\rangle_a$0

This is exactly a two-layer feedforward network with quadratic activation $|0\rangle_a$1 and a final linear output (Nagies et al., 20 Jun 2025). The result places the SWAP-test neuron in a direct correspondence with a restricted classical architecture rather than a qualitatively different hypothesis class.

A plausible implication is that the swap-test neuron is best understood not as an opaque quantum primitive but as a physically realized quadratic feature mechanism whose expressive limits can be studied with standard polynomial approximation arguments. That interpretation is stated explicitly in the 2025 analysis of SWAP-test-based QNNs (Nagies et al., 20 Jun 2025).

3. Expressivity and approximation limits

Because the activation induced by the basic SWAP-test neuron is polynomial and specifically quadratic, the corresponding network does not satisfy the usual universal-approximation theorem (Nagies et al., 20 Jun 2025). The principal limitation established in the 2025 study concerns parity.

For the $|0\rangle_a$2-dimensional parity function

$|0\rangle_a$3

it is shown that no choice of weights, biases, or number of neurons $|0\rangle_a$4 can separate the even and odd orthants when $|0\rangle_a$5 (Nagies et al., 20 Jun 2025). The argument uses symmetry of the parity dataset and the quadratic structure of the decision function. A necessary condition for separability leads, after substitution of the network form, to

$|0\rangle_a$6

because

$|0\rangle_a$7

by symmetry (Nagies et al., 20 Jun 2025). Hence the required strict inequality for separability cannot hold.

This impossibility is not merely an optimization failure. It is presented as an analytical non-representability result for the original SWAP-test architecture beyond two dimensions, regardless of network size (Nagies et al., 20 Jun 2025). For $|0\rangle_a$8, by contrast, the condition is non-zero and parity can be learned, which the paper reports as being in agreement with known results (Nagies et al., 20 Jun 2025).

This establishes a common misconception to avoid: poor performance of the original swap-test neuron on hard Boolean tasks such as higher-dimensional parity is not evidence only of barren plateaus, noise, or insufficient training time. In the analyzed amplitude-encoding setting, it is a structural expressivity limitation of the hypothesis class itself (Nagies et al., 20 Jun 2025).

4. Generalized SWAP-test neuron and product layers

To overcome the quadratic limitation, the 2025 work introduces a generalized SWAP-test construction in which each neuron contains $|0\rangle_a$9 factor SWAP tests sharing the same ancilla (Nagies et al., 20 Jun 2025). Operationally, the ancilla controls multiple controlled-SWAP operations, each acting on an input–weight pair. After all controlled-SWAPs, a final Hadamard and ancilla measurement are performed.

For module $|\psi\rangle$0, the resulting measurement probability is

$|\psi\rangle$1

which implements an even-degree polynomial activation of total degree $|\psi\rangle$2 (Nagies et al., 20 Jun 2025). The paper interprets this as effectively implementing classical neural networks with product layers.

Theoretical motivation is given in terms of monomial degree. With $|\psi\rangle$3 factor modules one can produce monomials of degree up to $|\psi\rangle$4 in the input features, and by combining multiple product modules with a final linear layer one can approximate Boolean functions such as parity once $|\psi\rangle$5 is large enough, stated roughly as $|\psi\rangle$6, provided enough modules $|\psi\rangle$7 are used (Nagies et al., 20 Jun 2025). The paper relates this to classical Sigma-Pi-Sigma networks with polynomial activation, which are known to be universal if the polynomial degree is unbounded (Nagies et al., 20 Jun 2025).

This generalized neuron is therefore not a minor engineering variant. It changes the effective algebraic class represented by the model from purely quadratic interactions to higher-order products, with parity serving as the canonical separating example between the original and generalized constructions (Nagies et al., 20 Jun 2025).

5. Training, decision rules, and architectural variants

In the multi-class SWAP-test classifier, one compares the same input state $|\psi\rangle$8 against a collection of label states $|\psi\rangle$9, running the same SWAP-test subcircuit for each class and choosing

$|\phi\rangle$0

equivalently $|\phi\rangle$1 (Pillay et al., 2023). The notable property emphasized in that work is that the number of qubits required, the measurement strategy, and the topology of the circuits used is invariant to the number of classes (Pillay et al., 2023).

That classifier also gives an explicit training prescription. For supervised data $|\phi\rangle$2, the probabilities $|\phi\rangle$3 can be used in a cross-entropy loss

$|\phi\rangle$4

and parameter-shift gradients are available when a trainable angle enters through a single-parameter $|\phi\rangle$5 gate on the label register: $|\phi\rangle$6 All required expectation values are obtained by rerunning the same SWAP-test circuits at shifted parameters (Pillay et al., 2023).

Zhao et al. proposed a more fully quantum feed-forward architecture in which the inner product is estimated by swap-test plus quantum phase estimation, and a dedicated activation map

$|\phi\rangle$7

produces the neuron output state (Zhao et al., 2019). In that model, each layer’s neuron state is

$|\phi\rangle$8

and the overall network is trained by gradient descent on an overlap-based loss (Zhao et al., 2019). This earlier formulation is historically important because it treats both inputs and outputs as quantum states and embeds the entire feed-forward computation into a coherent quantum circuit.

A plausible synthesis is that “swap-test neuron” now denotes a family of related constructions rather than a single canonical circuit. The family includes fidelity-readout neurons, multi-class label-state classifiers, and more elaborate swap-test-plus-QPE neurons (Nagies et al., 20 Jun 2025, Pillay et al., 2023, Zhao et al., 2019).

6. Empirical results, resources, and hardware behavior

The 2025 expressivity study reports that the standard network with $|\phi\rangle$9 already achieves high accuracy/F$|\ell_k(\theta_k)\rangle$0 on most real-world tasks across 21 UCI sets, IJCNN1, and MNIST, with slight improvements for $|\ell_k(\theta_k)\rangle$1 only on more complex cases such as IJCNN1 (Nagies et al., 20 Jun 2025). On spiral tasks, the reported pattern is that for $|\ell_k(\theta_k)\rangle$2-spiral instances with 1–3 turns in 2D, $|\ell_k(\theta_k)\rangle$3 suffices for one turn, while $|\ell_k(\theta_k)\rangle$4 and $|\ell_k(\theta_k)\rangle$5 are needed for 2–3 turns (Nagies et al., 20 Jun 2025). For synthetic parity datasets with $|\ell_k(\theta_k)\rangle$6, using 1000 training samples per orthant and 20% held out for test, the generalized architecture achieves perfect or near-perfect accuracy up to $|\ell_k(\theta_k)\rangle$7 provided $|\ell_k(\theta_k)\rangle$8 and $|\ell_k(\theta_k)\rangle$9 is sufficiently large (Nagies et al., 20 Jun 2025).

The same paper also reports a hardware experiment on IBM ibm_torino using a pre-trained $Z$0 parity network with $Z$1 (Nagies et al., 20 Jun 2025). The transpiled SWAP-test product module had approximately 277 gates per module and depth approximately 144. On the Aer simulator with 8192 shots, the network reached 95% accuracy, whereas the real QPU run with 8192 shots achieved 84% accuracy (Nagies et al., 20 Jun 2025). These figures show that the generalized architecture is not confined to a purely theoretical or noiseless-simulation setting, although the circuit overhead is substantial.

The multi-class classifier paper gives complementary resource estimates for the simpler fidelity-readout neuron. A single neuron comparing two $Z$2-qubit states uses $Z$3 qubits: one ancilla, $Z$4 data qubits, and $Z$5 label qubits (Pillay et al., 2023). The ancilla Hadamards contribute depth $Z$6, while a decomposed controlled-SWAP on $Z$7 qubits has depth $Z$8 (Pillay et al., 2023). Because the label register can be reused or time-multiplexed, the peak hardware footprint is independent of the number of classes $Z$9 (Pillay et al., 2023).

That work also analyzes a specific robustness property: under a single-qubit depolarizing channel on the label register just before measurement,

$0$0

the ancilla-zero probability transforms as

$0$1

so fidelities are uniformly rescaled,

$0$2

and the $0$3 decision rule is unaffected (Pillay et al., 2023). This is a narrowly defined robustness statement, but it provides a concrete example of how the classifier’s decision rule can be insensitive to uniform fidelity scaling.

7. Position within quantum neural network research

The swap-test neuron occupies a distinctive position within QNN research because it offers an unusually transparent bridge between quantum circuits and classical network theory. The 2025 analysis makes that bridge explicit by proving equivalence to a classical two-layer network with quadratic activation under amplitude encoding, then using that equivalence to diagnose non-universality and parity failure (Nagies et al., 20 Jun 2025). In that sense, the swap-test neuron is a case study in how classical task analysis can guide the redesign of QNN architectures.

The concept also spans several research agendas. In Zhao et al., the swap test is embedded in a broader fully quantum feed-forward framework with quantum-state inputs, quantum-state weights, quantum activations, and quantum gradient estimation (Zhao et al., 2019). In the multi-class classifier, the same basic overlap-estimation mechanism becomes a label-state classifier whose circuit topology and qubit count do not grow with the number of classes (Pillay et al., 2023). In the 2025 work, the key issue is expressivity under amplitude encoding and how product-layer generalizations alter representational power (Nagies et al., 20 Jun 2025).

A common misconception is that any architecture called a “swap-test neuron” inherits the same approximation properties. The available literature does not support that simplification. The original fidelity-readout neuron with a single SWAP test corresponds to a quadratic classical model under the stated encoding assumptions (Nagies et al., 20 Jun 2025), whereas generalized product-layer versions realize higher even-degree polynomial activations (Nagies et al., 20 Jun 2025), and the earlier QPE-based architecture computes a different form of neuron update altogether (Zhao et al., 2019). The term therefore denotes a circuit motif centered on overlap estimation, not a single universally expressive neural primitive.

Taken together, the literature presents the swap-test neuron as a technically precise and analytically tractable quantum-neural building block. Its strengths lie in explicit circuit realizability, direct access to fidelity-based decision statistics, and clear correspondence with classical models; its limitations lie in the restricted expressivity of the basic quadratic form and the circuit complexity required to overcome that restriction (Nagies et al., 20 Jun 2025, Pillay et al., 2023, Zhao et al., 2019).