Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2302.02523 · Physical review. B./Physical review. B

Principle of learning sign rules by neural networks in qubit lattice models

Jin Cao, Shijie Hu, Zhiping Yin, Ke Xia

Published Nov 14, 2023• 1 citation
arXivHTMLPDF

Abstract

A neural network is a powerful tool that can uncover hidden laws beyond human intuition. However, it often appears as a black box due to its complicated nonlinear structures. By drawing upon the Gutzwiller mean-field theory, we can showcase a principle of sign rules for ordered states in qubit lattice models. We introduce a shallow feed-forward neural network with a single hidden neuron to present these sign rules. We conduct systematical benchmarks in various models, including the generalized Ising, spin-$1/2$ XY, (frustrated) Heisenberg rings, triangular XY antiferromagnet on a torus, and the Fermi-Hubbard ring at an arbitrary filling. These benchmarks show that all the leading-order sign rule characteristics can be visualized in classical forms, such as pitch angles. Besides, quantum fluctuations can result in an imperfect accuracy rate quantitatively.

DOI
10.1103/physrevb.108.195127

Related papers

Approximating quantum many-body wave functions using artificial neural networks

Zi Cai, Jin-Guo Liu

In this paper, we demonstrate the expressibility of artificial neural networks (ANNs) in quantum many-body physics by showing that a feed-forward neural network with a small number of hidden layers can be trained to approximate with high precision the ground states of some notable quantum many-body systems. We consider the one-dimensional free bosons and fermions, spinless fermions on a square lattice away from half-filling, as well as frustrated quantum magnetism with a rapidly oscillating ground-state characteristic function. In the latter case, an ANN with a standard architecture fails, while that with a slightly modified one successfully learns the frustration-induced complex sign rule in the ground state and approximates the ground states with high precisions. As an example of practical use of our method, we also perform the variational method to explore the ground state of an antiferromagnetic ${J}_{1}\text{\ensuremath{-}}{J}_{2}$ Heisenberg model.

arXiv:1704.05148•Physical review. B./Physical review. B•Jan 9, 2018•225 citations

Neural network evolution strategy for solving quantum sign structures

Ao Chen, Kenny Choo, Nikita Astrakhantsev +1 more

Feed-forward neural networks are a novel class of variational wave functions for correlated many-body quantum systems.Here, we propose a specific neural network ansatz suitable for systems with real-valued wave functions.Its characteristic is to encode the all-important rugged sign structure of a quantum wave function in a convolutional neural network with discrete output.Its training is achieved through an evolutionary algorithm.We test our variational ansatz and training strategy on two spin-1/2 Heisenberg models, one on the two-dimensional square lattice and one on the three-dimensional pyrochlore lattice.In the former, our ansatz converges with high accuracy to the analytically known sign structures of ordered phases.In the latter, where such sign structures are ap r i o r iunknown, we obtain better variational energies than with other neural network states.Our results demonstrate the utility of discrete neural networks to solve quantum many-body problems.

arXiv:2111.06411•Physical Review Research•May 2, 2022•27 citations

Walshness: an intrinsic neural-network representability metric for quantum states

Nisarga Paul, Kehuang Chen, Jessica K. Jiang +2 more

Neural quantum states (NQS) have emerged as powerful representations of quantum states with rapidly expanding applications across quantum many-body physics. Yet our understanding of when neural networks can efficiently represent physical quantum states remains limited, in part due to the nonlinear parameterization of NQS, the intricate sign structure of quantum states, and the sensitive dependence on basis choice. We introduce Walshness, a complexity metric of a quantum state which quantifies whether it admits a compact neural-network representation. We rigorously prove that a general quantum many-body state admits an efficient NQS representation if it has bounded Walshness, and vice versa, for various NQS architectures. We provide an algorithm for finding the optimal basis by minimizing the energy of a corresponding classical spin model. This allows us to empirically improve the learnability of various physical quantum states, including ground states of the transverse-field Ising model and mixed-field toric code, often reducing infidelity by orders of magnitude, and generalizes the basis choice given by the well-known Marshall sign rule in frustrated antiferromagnets. Our results provide an intrinsic complexity metric for quantum states with provable connections to their neural-network representability.

quant-pharXiv:2610.00505•Oct 2, 2026•0 citations

Quantum activation functions for quantum neural networks

Marco Maronese, C. Destri, Enrico Prati

Abstract The field of artificial neural networks is expected to strongly benefit from recent developments of quantum computers. In particular, quantum machine learning, a class of quantum algorithms which exploit qubits for creating trainable neural networks, will provide more power to solve problems such as pattern recognition, clustering and machine learning in general. The building block of feed-forward neural networks consists of one layer of neurons connected to an output neuron that is activated according to an arbitrary activation function. The corresponding learning algorithm goes under the name of Rosenblatt perceptron. Quantum perceptrons with specific activation functions are known, but a general method to realize arbitrary activation functions on a quantum computer is still lacking. Here, we fill this gap with a quantum algorithm which is capable to approximate any analytic activation functions to any given order of its power series. Unlike previous proposals providing irreversible measurement–based and simplified activation functions, here we show how to approximate any analytic function to any required accuracy without the need to measure the states encoding the information. Thanks to the generality of this construction, any feed-forward neural network may acquire the universal approximation properties according to Hornik’s theorem. Our results recast the science of artificial neural networks in the architecture of gate-model quantum computers.

arXiv:2201.03700•Quantum Information Processing•Mar 30, 2022•56 citations

A Quantum Approach to Neural Networks

Prof. Ahlam Ansari, Ashhar Shaikh, Faraz Shaikh +1 more

Artificial neural networks, usually just called neural networks, computing systems indefinitely inspired by the biological neural networks and they are extensive in both research as well as industry. It is critical to design quantum Neural Networks for complete quantum learning tasks. In this project, we suggest a computational neural network model based on principles of quantum mechanics which form a quantum feed-forward neural network proficient in universal quantum computation. This structure takes input from one layer of qubits and drives that input onto another layer of qubits. This layer of qubits evaluates this information and drives on the output to the next layer. Eventually, the path leads to the final layer of qubits. The layers do not have to be of the same breadth, meaning they need not have the same number of qubits as the layer before and/or after it. This assembly is trained on which path to take identical to classical ANN. The intended project can be compiled by the subsequent points provided here: 1. The expert training of the quantum neural network utilizing the fidelity as a cost function, providing both conventional and efficient quantum implementations. 2. Use of methods that enable quick optimization with reduced memory requirements. 3. Benchmarking our proposal for the quantum task of learning an unknown unitary and find extraordinary generality and a remarkable sturdiness to noisy training data.

International Journal of Advanced Research in Science Communication and Technology•May 12, 2021•0 citations

Solving quantum master equations with deep quantum neural networks

Zidu Liu, Luming Duan, Dong-Ling Deng

Deep quantum neural networks may provide a promising way to achieve a quantum learning advantage with noisy intermediate-scale quantum devices. Here, we use deep quantum feed-forward neural networks capable of universal quantum computation to represent the mixed states for open quantum many-body systems and introduce a variational method with quantum derivatives to solve the master equation for dynamics and stationary states. Owning to the special structure of the quantum networks, this approach enjoys a number of notable features, including an efficient quantum analog of the back-propagation algorithm, resource-saving reuse of hidden qubits, general applicability independent of dimensionality and entanglement properties, as well as the convenient implementation of symmetries. As proof-of-principle demonstrations, we apply this approach to both one-dimensional transverse field Ising and two-dimensional ${J}_{1}\text{\ensuremath{-}}{J}_{2}$ models with dissipation, and show that it can efficiently capture their dynamics and stationary states with a desired accuracy.

arXiv:2008.05488•Physical Review Research•Feb 9, 2022•32 citations
A neural network is a powerful tool that can uncover hidden laws beyond human intuition. However, it often appears as a black box due to its complicated nonlinear structures. By drawing upon the Gutzwiller mean-field theory, we can showcase a principle of sign rules for ordered states in qubit lattice models. We introduce a shallow feed-forward neural network with a single hidden neuron to present these sign rules. We conduct systematical benchmarks in various models, including the generalized Ising, spin-1/21/21/2 XY, (frustrated) Heisenberg rings, triangular XY antiferromagnet on a torus, and the Fermi-Hubbard ring at an arbitrary filling. These benchmarks show that all the leading-order sign rule characteristics can be visualized in classical forms, such as pitch angles. Besides, quantum fluctuations can result in an imperfect accuracy rate quantitatively.
In this paper, we demonstrate the expressibility of artificial neural networks (ANNs) in quantum many-body physics by showing that a feed-forward neural network with a small number of hidden layers can be trained to approximate with high precision the ground states of some notable quantum many-body systems. We consider the one-dimensional free bosons and fermions, spinless fermions on a square lattice away from half-filling, as well as frustrated quantum magnetism with a rapidly oscillating ground-state characteristic function. In the latter case, an ANN with a standard architecture fails, while that with a slightly modified one successfully learns the frustration-induced complex sign rule in the ground state and approximates the ground states with high precisions. As an example of practical use of our method, we also perform the variational method to explore the ground state of an antiferromagnetic ${J}_{1}\text{\ensuremath{-}}{J}_{2}$ Heisenberg model.
Feed-forward neural networks are a novel class of variational wave functions for correlated many-body quantum systems.Here, we propose a specific neural network ansatz suitable for systems with real-valued wave functions.Its characteristic is to encode the all-important rugged sign structure of a quantum wave function in a convolutional neural network with discrete output.Its training is achieved through an evolutionary algorithm.We test our variational ansatz and training strategy on two spin-1/2 Heisenberg models, one on the two-dimensional square lattice and one on the three-dimensional pyrochlore lattice.In the former, our ansatz converges with high accuracy to the analytically known sign structures of ordered phases.In the latter, where such sign structures are ap r i o r iunknown, we obtain better variational energies than with other neural network states.Our results demonstrate the utility of discrete neural networks to solve quantum many-body problems.
Neural quantum states (NQS) have emerged as powerful representations of quantum states with rapidly expanding applications across quantum many-body physics. Yet our understanding of when neural networks can efficiently represent physical quantum states remains limited, in part due to the nonlinear parameterization of NQS, the intricate sign structure of quantum states, and the sensitive dependence on basis choice. We introduce Walshness, a complexity metric of a quantum state which quantifies whether it admits a compact neural-network representation. We rigorously prove that a general quantum many-body state admits an efficient NQS representation if it has bounded Walshness, and vice versa, for various NQS architectures. We provide an algorithm for finding the optimal basis by minimizing the energy of a corresponding classical spin model. This allows us to empirically improve the learnability of various physical quantum states, including ground states of the transverse-field Ising model and mixed-field toric code, often reducing infidelity by orders of magnitude, and generalizes the basis choice given by the well-known Marshall sign rule in frustrated antiferromagnets. Our results provide an intrinsic complexity metric for quantum states with provable connections to their neural-network representability.
Abstract The field of artificial neural networks is expected to strongly benefit from recent developments of quantum computers. In particular, quantum machine learning, a class of quantum algorithms which exploit qubits for creating trainable neural networks, will provide more power to solve problems such as pattern recognition, clustering and machine learning in general. The building block of feed-forward neural networks consists of one layer of neurons connected to an output neuron that is activated according to an arbitrary activation function. The corresponding learning algorithm goes under the name of Rosenblatt perceptron. Quantum perceptrons with specific activation functions are known, but a general method to realize arbitrary activation functions on a quantum computer is still lacking. Here, we fill this gap with a quantum algorithm which is capable to approximate any analytic activation functions to any given order of its power series. Unlike previous proposals providing irreversible measurement–based and simplified activation functions, here we show how to approximate any analytic function to any required accuracy without the need to measure the states encoding the information. Thanks to the generality of this construction, any feed-forward neural network may acquire the universal approximation properties according to Hornik’s theorem. Our results recast the science of artificial neural networks in the architecture of gate-model quantum computers.
Artificial neural networks, usually just called neural networks, computing systems indefinitely inspired by the biological neural networks and they are extensive in both research as well as industry. It is critical to design quantum Neural Networks for complete quantum learning tasks. In this project, we suggest a computational neural network model based on principles of quantum mechanics which form a quantum feed-forward neural network proficient in universal quantum computation. This structure takes input from one layer of qubits and drives that input onto another layer of qubits. This layer of qubits evaluates this information and drives on the output to the next layer. Eventually, the path leads to the final layer of qubits. The layers do not have to be of the same breadth, meaning they need not have the same number of qubits as the layer before and/or after it. This assembly is trained on which path to take identical to classical ANN. The intended project can be compiled by the subsequent points provided here: 1. The expert training of the quantum neural network utilizing the fidelity as a cost function, providing both conventional and efficient quantum implementations. 2. Use of methods that enable quick optimization with reduced memory requirements. 3. Benchmarking our proposal for the quantum task of learning an unknown unitary and find extraordinary generality and a remarkable sturdiness to noisy training data.
Deep quantum neural networks may provide a promising way to achieve a quantum learning advantage with noisy intermediate-scale quantum devices. Here, we use deep quantum feed-forward neural networks capable of universal quantum computation to represent the mixed states for open quantum many-body systems and introduce a variational method with quantum derivatives to solve the master equation for dynamics and stationary states. Owning to the special structure of the quantum networks, this approach enjoys a number of notable features, including an efficient quantum analog of the back-propagation algorithm, resource-saving reuse of hidden qubits, general applicability independent of dimensionality and entanglement properties, as well as the convenient implementation of symmetries. As proof-of-principle demonstrations, we apply this approach to both one-dimensional transverse field Ising and two-dimensional ${J}_{1}\text{\ensuremath{-}}{J}_{2}$ models with dissipation, and show that it can efficiently capture their dynamics and stationary states with a desired accuracy.