Neural network operations and Susuki–Trotter evolution of neural network states
Open accessThe DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.
Abstract
It was recently proposed to leverage the representational power of artificial neural networks, in particular Restricted Boltzmann Machines, in order to model complex quantum states of many-body systems [G. Carleo and M. Troyer, Science 355(6325) (2017) 602.]. States represented in this way, called Neural Network States (NNSs), were shown to display interesting properties like the ability to efficiently capture long-range quantum correlations. However, identifying an optimal neural network representation of a given state might be challenging, and so far this problem has been addressed with stöchastic optimization techniques. In this work, we explore a different direction. We study how the action of elementary quantum operations modifies NNSs. We parametrize a family of many body quantum operations that can be directly applied to states represented by Unrestricted Boltzmann Machines, by just adding hidden nodes and updating the network parameters. We show that this parametrization contains a set of universal quantum gates, from which it follows that the state prepared by any quantum circuit can be expressed as a Neural Network State with a number of hidden nodes that grows linearly with the number of elementary operations in the circuit. This is a powerful representation theorem (which was recently obtained with different methods) but that is not directly useful, since there is no general and efficient way to extract information from this unrestricted description of quantum states. To circumvent this problem, we propose a step-wise procedure based on the projection of Unrestricted quantum states to Restricted quantum states. In turn, two approximate methods to perform this projection are discussed. In this way, we show that it is in principle possible to approximately optimize or evolve Neural Network States without relying on stochastic methods such as Variational Monte Carlo, which are computationally expensive.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The check wasn’t confident either way, so it gives no verdict — never disputed.
In the citing paper
“In parallel with previous methods for simulating time-independent Hamiltonians 188 yielding near-optimal cost scaling, techniques for simulating time-dependent Hamiltonians using Dyson series 199 have also been recently proposed, with scaling matching the time-independent case 188 .”
From Quantum Chemistry in the Age of Quantum Computing (2019) · cites this paper as [199]
Experimental — accuracy not yet measured
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Entanglement in Quantum Critical Phenomena
Vidal, G., Latorre, J. I., Rico, E., & Kitaev, A. (2003) · Physical Review Letters · doi:10.1103/physrevlett.90.227902 · Cited by 2,793 · cited 1×
“[5] Guifre Vidal, José Ignacio Latorre, Enrique Rico, and Alexei Kitaev.”
BackgroundOrús, R. (2014) · Annals of Physics · doi:10.1016/j.aop.2014.06.013 · Cited by 2,255 · cited 1×
“A prominent example along this line is given by the Matrix Product States (MPSs)[2] (1).”
BackgroundSolving the quantum many-body problem with artificial neural networks
Carleo, G., & Troyer, M. (2017) · Science · doi:10.1126/science.aag2302 · Cited by 2,215 · cited 13×
“So far, NNSs were mainly employed as a variational Ansatz, either to minimize the energy of a model Hamiltonian, to evolve a state over time, or for quantum state tomography[13, 14, 16, 18].”
BackgroundMethodResultInfluentialSrednicki, M. (1993) · Physical Review Letters · doi:10.1103/physrevlett.71.666 · Cited by 1,858
On the computational complexity of Ising spin glass models
Barahona, F. (1982) · Journal of Physics A: Mathematical and General · doi:10.1088/0305-4470/15/10/028 · Cited by 1,306 · cited 1×
“Without restricting in some way the matrix X, this is at least as hard as computing the partition function of an arbitrary classical Ising system (which is intractable[25]).”
MethodComputational Complexity and Fundamental Limitations to Fermionic Quantum Monte Carlo Simulations
Troyer, M., & Wiese, U.-J. (2005) · Physical Review Letters · doi:10.1103/physrevlett.94.170201 · Cited by 1,246 · cited 3×
“Otherwise the numerical ‘sign problem’ will hamper the accurate estimation of Ψ(s, t)[21, 24].”
BackgroundRepresentational Power of Restricted Boltzmann Machines and Deep Belief Networks
Le Roux, N., & Bengio, Y. (2008) · Neural Computation · doi:10.1162/neco.2008.04-07-510 · Cited by 821
Sign problem in the numerical simulation of many-electron systems
Loh, E. Y., Gubernatis, J. E., Scalettar, R. T., White, S. R., Scalapino, D. J., & Sugar, R. L. (1990) · Physical Review B · doi:10.1103/physrevb.41.9301 · Cited by 801 · cited 3×
“Otherwise the numerical ‘sign problem’ will hamper the accurate estimation of Ψ(s, t)[21, 24].”
BackgroundSachdev, S. (2007) · Handbook of Magnetism and Advanced Magnetic Materials · doi:10.1002/9780470022184.hmm108 · Cited by 681
Violation of the Entropic Area Law for Fermions
Wolf, M. M. (2006) · Physical Review Letters · doi:10.1103/physrevlett.96.010404 · Cited by 475 · cited 1×
“This is also a limitation for MPSs, since they are then not sufficient to efficiently capture the rich physics close to quantum critical points, where the gap typically closes and the quantum correlations no longer obey an area law[8, 9].”
Background
Research works printed but not linked: 2
- Deng D.-L., 2017, Phys. Rev. X, 7, 021021
- Glasser I., 2018, Phys. Rev. X, 8, 011006
Cited by
Quantum Chemistry in the Age of Quantum Computing
Cao, Y., Romero, J., Olson, J. P., Degroote, M., Johnson, P. D., Kieferová, M., Kivlichan, I. D., Menke, T., Peropadre, B., Sawaya, N. P. D., et al. (2019) · Chemical Reviews · doi:10.1021/acs.chemrev.8b00803 · Cited by 1,560
Quantum Chemistry in the Age of Quantum Computing
Cao, Y., Romero, J., Olson, J., Degroote, M., Johnson, P., Kieferová, M., Kivlichan, I., Menke, T., Peropadre, B., Sawaya, N., et al. (n.d.) · OPUS - Open Publications of UTS Scholars (University of Technology Sydney) · Cited by 1,265
Variational Quantum Monte Carlo Method with a Neural-Network Ansatz for Open Quantum Systems
Nagy, A., & Savona, V. (2019) · Physical Review Letters · doi:10.1103/physrevlett.122.250501 · Cited by 227
Constructing exact representations of quantum many-body systems with deep neural networks
Carleo, G., Nomura, Y., & Imada, M. (2018) · Nature Communications · doi:10.1038/s41467-018-07520-3 · Cited by 154
Constructing exact representations of quantum many-body systems with deep neural networks
Carleo, G., Nomura, Y., & Imada, M. (2018) · RePEc: Research Papers in Economics · doi:10.3929/ethz-b-000313237 · Cited by 133
Metadata
- Authors
- Freitas, N., Morigi, G., & Dunjko, V.
- Affiliations
- Saarland University (DE)
- Max Planck Institute of Quantum Optics (DE)
- Corresponding author
- Freitas, Nahuel
- Venue
- International Journal of Quantum Information
- Publisher
- World Scientific Pub Co Pte Lt
- Published
- 2018-12
- Volume
- 16
- Issue
- 08
- Pages
- 1840008
- ISSN
- 0219-7499 (ISSN-L)
- 1793-6918
- OpenAlex
- W2792066543
- Cited by
- 17
- References
- 22
- Citations by year
- 2025: 1 · 2023: 2 · 2022: 1 · 2021: 2 · 2020: 3 · 2019: 6 · 2018: 2
- FWCI
- 1.82
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Locations
- International Journal of Quantum Information (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- MPG.PuRe (Max Planck Society) (submittedVersion, other-oa)
- arXiv (Cornell University)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum many-body systems
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Mechanics and Applications
- Keywords
- restricted Boltzmann machine, quantum state representation, quantum circuit simulation, quantum gates, quantum state projection, quantum state evolution, variational quantum algorithms, quantum many-body systems
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Neural network operations and Susuki–Trotter evolution of neural network states. https://app.cochat.ai/papers/10.1142/s0219749918400087
- The paper
- Freitas, N., Morigi, G., & Dunjko, V. (2018). Neural network operations and Susuki–Trotter evolution of neural network states. International Journal of Quantum Information. https://doi.org/10.1142/s0219749918400087
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.