quantum neuron construction

This work proposes a systematic approach to transform classical neurons into fundamental building blocks for quantum machine learning, enabling the learning of unknown observables from labeled quantum data. The method models a neuron as a composition of an energy function and an activation function, mapping the energy component to a quantum Hamiltonian via canonical quantization and quantizing the activation function through matrix functional calculus to yield a measurable activation observable. A hybrid quantum-classical training algorithm is then constructed by integrating Hadamard tests, Hamiltonian simulation, and single-copy power methods. As the first framework to systematically apply canonical quantization to neuron modeling, it offers strong theoretical grounding and scalability. Numerical experiments demonstrate that the resulting quantum neuron exhibits superior expressivity over its classical counterpart on representative tasks, highlighting its potential for quantum function approximation.

This work addresses the problem of efficiently approximating multi-qubit unitary matrices with quantum circuits. We propose a scalable, Lie-group-theoretic parametrization framework. Methodologically, we replace the conventional Pauli-string basis with a recursively defined block basis as generators; employ the exponential map combined with structured parameterized quantum circuits to achieve compact unitary representations; and introduce a linear-scale recursive construction scheme—where an (n+1)-qubit unitary circuit is built incrementally from an n-qubit circuit by adding only a constant number of CNOT and single-qubit gates. Our approach achieves O(n) depth and width scaling, markedly enhancing scalability, training efficiency, and hardware compatibility. The resulting framework provides a novel paradigm for large-scale quantum algorithm compilation and quantum neural network design.

Quantum neural networks (QNNs) do not exhibit Gaussian process behavior under random initialization, impeding a unified theoretical characterization of their training dynamics and generalization. Method: We establish a unified analytical framework for QNN loss landscapes, leveraging random matrix theory and quantum circuit algebra to derive exact analytical distributions of gradients and local minima. Contribution/Results: First, we prove that QNN initialization follows a Wishart process—not a Gaussian process—and rigorously characterize the necessary and sufficient conditions for convergence to the Gaussian limit. Second, we introduce a physically measurable trainability criterion centered on “degrees of freedom,” quantitatively linking architectural algebraic properties to optimization hardness. Third, we unify and extend the barren plateau phenomenon, yielding experimentally verifiable theoretical guidance and practical design metrics for QNNs.

This study addresses the compatibility between trainability and non-dequantizability in variational quantum machine learning (VQML), challenging the common misconception that these properties are mutually exclusive. We first formalize both concepts from a machine learning operational perspective. Theoretically, we prove their strict coexistence under two conditions: (i) non-degenerate gradient information and (ii) high-dimensional entanglement expressivity of the quantum kernel. Methodologically, we propose a “variational-degree”-graded parametrized quantum circuit (PQC) design paradigm, unifying hardware-efficient ansätze with information-geometric principles. Experimentally, we validate multiple models simultaneously achieving trainability and non-dequantizability across diverse tasks. Our work establishes the first universal compatibility criterion for VQML, providing a theoretically rigorous yet engineering-practical design framework for scalable, quantum-advantageous learning models.

Training binary neural networks (BNNs) is notoriously difficult, and joint hyperparameter and architecture search incurs prohibitive computational cost. Method: This paper proposes a quantum hypernetwork framework that— for the first time—unifies optimization of BNN weights, hyperparameters, and network architecture within quantum superposition states. It employs variational quantum circuits for end-to-end quantum machine learning, integrating quantum superposition encoding with measurement-driven optimization, and validates the approach via classical simulation. Contribution/Results: A critical finding is the existence of an optimal quantum circuit depth that significantly boosts the sampling probability of high-performance BNN configurations. Experiments on a 2D Gaussian dataset and a simplified MNIST task demonstrate the paradigm’s efficacy: it discovers high-performing binary models with substantially lower computational overhead than conventional combinatorial search, achieving both efficiency and high success probability. This work establishes a novel quantum-enhanced paradigm for lightweight BNN design.

This work proposes a regularized quantization-based approach to construct quantum neurons by rigorously mapping classical activation functions to quantum observables acting on parameterized Hamiltonians. In the commuting case, the method exactly recovers classical neurons and, for the first time, provides quantum counterparts of widely used activations such as ReLU and GeLU, whose associated decision problems are proven to be BQP-complete. A trainable hybrid quantum-classical algorithm is devised by integrating Hamiltonian simulation, Hadamard tests, and continuous-variable quantization. Numerical experiments demonstrate that the proposed quantum Hamiltonian neurons can learn functions beyond the representational capacity of classical neurons, exhibiting a provable computational advantage that cannot be efficiently simulated classically.

This work investigates the efficient representation and optimization of stochastic neural networks on gate-model quantum computers. By systematically mapping stochastic neurons to quantum circuits, the authors construct a variety of quantum neural network architectures, including fully connected networks, Hopfield networks, restricted Boltzmann machines, autoencoders, and convolutional neural networks. These models are trained using a combination of the Kiefer–Wolfowitz algorithm and simulated annealing. Notably, the proposed quantum networks are innovatively employed as oracles within Grover’s search algorithm, yielding the first Grover-based quantum generative AI model. The study demonstrates the feasibility and effectiveness of this approach for quantum generative tasks, establishing a novel pathway toward quantum-enhanced generative modeling.

Evaluating the practical utility of hybrid quantum neural networks remains challenging due to their architectural diversity, lack of standardized benchmarks, and varying hardware assumptions. This work presents the first systematic synthesis of the field’s theoretical foundations, prevailing architectures, training strategies, and hardware-aware implementation approaches, integrating perspectives from both classical and quantum machine learning to map the current research landscape and future trajectories. Findings indicate that such models demonstrate promising potential in specific tasks by achieving competitive performance with substantially fewer trainable parameters; however, they have yet to establish a clear advantage on large-scale problems. By offering a coherent framework and identifying key research directions, this study underscores the innovative value of hybrid quantum neural networks in parameter-efficient learning and specialized applications.

This study systematically evaluates the practical contribution of quantum components—such as encoding strategies, entanglement structures, and circuit depth—to the performance of hybrid quantum-classical neural networks. Through controlled experiments on multimodal real-world datasets, including medical signals and two- and three-dimensional images, the work provides the first quantitative analysis of the role played by quantum modules within the overall architecture. The results demonstrate that, in most configurations, incorporating quantum components actually degrades model performance, with parity to purely classical models achieved only under optimal settings. These findings challenge prevailing optimistic assumptions about near-term quantum advantage and offer empirical grounding and cautious guidance for the practical design of hybrid quantum-classical systems.