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:1701.04831 · Physical review. B./Physical review. B

Equivalence of restricted Boltzmann machines and tensor network states

Jing Chen, Song Cheng, Haidong Xie, Lei Wang, Tao Xiang

Published Feb 2, 2018• 276 citations
arXivHTMLPDF

Abstract

The restricted Boltzmann machine is a fundamental building block of deep learning. The authors demonstrate its equivalence with tensor network states with explicit mappings, thus drawing a constructive connection between deep learning and quantum physics. On one side, deep learning approaches can be used to study novel states of matter. In return, investigations of tensor network states and their expressibility can be adapted to guide neural network architecture design.

DOI
10.1103/physrevb.97.085104

Related papers

Boltzmann machines as two-dimensional tensor networks

Sujie Li, Feng Ping Pan, Pengfei Zhou +1 more

Restricted Boltzmann machines (RBMs) and deep Boltzmann machines (DBMs) are important models in machine learning, and recently found numerous applications in quantum many-body physics. We show that there are fundamental connections between them and tensor networks. In particular, we demonstrate that any RBM and DBM can be exactly represented as a two-dimensional tensor network. This representation gives characterizations of the expressive power of RBMs and DBMs using entanglement structures of the tensor networks, and also provides an efficient tensor network contraction algorithm for the computing partition function of RBMs and DBMs. Using numerical experiments, we show that the proposed algorithm is more accurate than the state-of-the-art machine learning methods in estimating the partition function of RBMs and DBMs, and have potential applications in training DBMs for general machine learning tasks.

arXiv:2105.04130•Physical review. B./Physical review. B•Aug 27, 2021•17 citations

Quantum Entanglement in Deep Learning Architectures

Yoav Levine, Or Sharir, Nadav Cohen +1 more

Modern deep learning has enabled unprecedented achievements in various domains. Nonetheless, employment of machine learning for wave function representations is focused on more traditional architectures such as restricted Boltzmann machines (RBMs) and fully connected neural networks. In this Letter, we establish that contemporary deep learning architectures, in the form of deep convolutional and recurrent networks, can efficiently represent highly entangled quantum systems. By constructing tensor network equivalents of these architectures, we identify an inherent reuse of information in the network operation as a key trait which distinguishes them from standard tensor network-based representations, and which enhances their entanglement capacity. Our results show that such architectures can support volume-law entanglement scaling, polynomially more efficiently than presently employed RBMs. Thus, beyond a quantification of the entanglement capacity of leading deep learning architectures, our analysis formally motivates a shift of trending neural-network-based wave function representations closer to the state-of-the-art in machine learning.

arXiv:1803.09780•Physical Review Letters•Feb 12, 2019•256 citations

Deep Learning in Quantum Physics

Blázquez García, Raúl

Over the past few years a number of proofs have emerged revealing the many connections between the methods used in quantum-many body physics and those in machine learning. In particular, much attention has been given to tensor networks (TNs) and deep learning architectures which exhibit striking similarities. Finding those similarities has helped us gain a better understanding on why deep learning architectures have so much expressive efficiency. Recently, machine learning techniques have been used to approximate many-body physics problems. Conversely, TNs have been used for machine learning tasks. For example, state-of-the-art research has used one-dimensional TNs to solve image recognition problems with very limited scalability. The scalability problem, however, can be overcomed by using a two-dimensional hierarchical TNs and a training algorithm derived from the multipartite entanglement renormalization ansatz (MERA). Here we give further analysis of the inner structural resemblance between such hierarchical tensor networks (TNs) and pretrained convolutional neural networks (CNNs): this was achieved by analyzing their abstraction power layer by layer.

•Oct 27, 2017•0 citations

Investigating Network Parameters in Neural-Network Quantum States

Yusuke Nomura

Recently, quantum-state representation using artificial neural networks has started to be recognized as a powerful tool. However, due to the black-box nature of machine learning, it is difficult to analyze what machine learns or why it is powerful. Here, by applying one of the simplest neural networks, the restricted Boltzmann machine (RBM), to the ground-state representation of the one-dimensional (1D) transverse-field Ising (TFI) model, we make an attempt to directly analyze the optimized network parameters. In the RBM optimization, a zero-temperature quantum state is mapped onto a finite-temperature classical state of the extended Ising spins that constitute the RBM. We find that the quantum phase transition from the ordered phase to the disordered phase in the 1D TFI model by increasing the transverse field is clearly reflected in the behaviors of the optimized RBM parameters and hence in the finite-temperature phase diagram of the classical RBM Ising system. The present finding of a correspondence between the neural-network parameters and quantum phases suggests that a careful investigation of the neural-network parameters may provide a new route to extracting nontrivial physical insights from the neural-network wave functions.

arXiv:2202.01704•Journal of the Physical Society of Japan•Apr 18, 2022•6 citations

Bridging Many-Body Quantum Physics and Deep Learning via Tensor Networks

Yoav Levine, Or Sharir, Nadav Cohen +1 more

In this chapter, we describe a tensor network (TN) based common language established between machine learning and many-body physics, which allows for bidirectional contributions. By showing that many-body wave functions are structurally equivalent to mappings of convolutional and recurrent networks, we bring forth quantum entanglement measures as natural quantifiers of dependencies modeled by such networks. Accordingly, we propose a novel entanglement-based deep learning design scheme that sheds light on the success of popular architectural choices made by deep learning practitioners and suggests new practical prescriptions. In the other direction, we construct TNs corresponding to deep recurrent and convolutional networks. This allows us to theoretically demonstrate that these architectures are powerful enough to represent highly entangled quantum systems polynomially more efficiently than previously employed architectures. We thus provide theoretical motivation to shift neural-network-based wave function representations closer to state-of-the-art deep learning architectures.

Cambridge University Press eBooks•Nov 29, 2022•6 citations

Quantum machine learning

Jonathan Allcock, Shengyu Zhang

Quantum machine learning is at the crossroads of two of the most exciting current areas of research: quantum computing and classical machine learning. Although the field is still in its infancy, the body of literature is already large enough to warrant several review articles [1–3]. This short survey focuses on a selection of significant recent results on the subtopic of quantum neural networks, an area that hopes to build on the enormous impact that classical neural networks have had. In particular, we concentrate on quantum generalizations of popular neural-network concepts such as Boltzmann machines, generative adversarial networks and autoencoders, as well as applications of classical neural networks to quantum information and vice versa. Examples of Boltzmann machines. In a fully connected Boltzmann machine, connections exist between all visible and hidden neurons. In a restricted Boltzmann machine (RBM), there are no connections between neurons of the same type. A deep Boltzmann machine (DBM) consists of adding one or more additional layers of hidden neurons to an RBM, with no connections between neurons in the same layer. The energy-based nature of BMs gives a natural framework for considering quantum generalizations of their behavior. The BM energy function is equivalent to the Hamiltonian of a simple Ising model and one might hope that more general Hamiltonians allowed by quantum mechanics could explain certain data sets better than classically. Amin et al. [4] adopt this approach, and take the so-called transverse field Ising Hamiltonian as the energy function. This increased generality brings certain difficulties, however, as the transverse field term makes training the quantum Boltzmann machine (QBM) non-trivial. Although the general scaling and performance of QBMs is not yet well understood, for certain small-size examples the authors observe that their QBMs can learn data distributions better than classical BMs. Kieferova and Wiebe [5] extend the formalism of Amin et al. and consider more general Hamiltonians that, unlike the transverse Ising model, are not in general believed to be classically efficiently simulatable. Furthermore, they propose new methods for training that allow for parameters corresponding to quantum terms to be learned. Finally, their QBM enables a form of quantum-state tomography that can learn non-classical data, and also generate copies of the reconstructed state. Again, small-scale numerical evidence suggests that their proposals may provide an advantage over classical BMs, although their tendency to overfit data must be investigated further. The practical value of BMs, either classical or quantum, relies in part on the ease with which they are trained. This in turn depends on sampling efficiently from the Boltzmann distribution. Classically this can be done approximately only for the special case of restricted Boltzmann machines (RBM), i.e. where connections are between visible and hidden units, and no connections exist between neurons of the same type. Wiebe et al. [6] propose two quantum algorithms for Boltzmann sampling, based on starting from a state corresponding to the product distribution that is closest to the target Boltzmann distribution. While small-scale numerical studies are encouraging, true bounds on the running time of their algorithms rely on a problem-dependent parameter κ, the scaling of which is hard to estimate. The hope remains though that empirically their algorithms work well in practice, even for multi-layer and fully connected BMs. The expressive power of BMs for compactly representing complicated probability distributions has led to another line of investigation, namely their use for representing quantum many-body wave functions. The authors apply this technique to two prototypical spin models and achieve high accuracy in both ground-state estimation and dynamical evolution, improving on existing state-of-the-art techniques. Their results indicate that RBM states can capture complex many-body correlations in an efficient manner—evidence reinforced by the work of Deng et al. [8], who show that certain topological quantum states in one, two and three dimensions can be represented by RBM states with a number of parameters only linear in the system size. In a subsequent study, however, Gao and Duan [9] prove that although RBM states can indeed represent many highly entangled states, their expressive power is limited in that they cannot represent arbitrary states generated by polynomial-sized quantum circuits, nor those that are the ground states of k-local Hamiltonians with polynomial-sized energy gaps, unless the polynomial hierarchy from computational complexity theory collapses. On the other hand, they show that these two important classes of states can be efficiently represented by a deep Boltzmann machine of three layers. Intriguingly though, another paper by Deng et al. [10] gives an analytic construction of a family of RBM states with a number of parameters linear in the system size that exhibits maximal volume-law entanglement, and that cannot be represented efficiently by either matrix product states (MPS) or tensor-network (TN) states. This shows that the expressive power of even efficiently parametrized RBM states is not limited by entanglement in the same way that other popular compact representations are. This gives the hope that RBM states may prove a valuable tool in understanding entangled quantum systems intractable by traditional methods. Levine et al. [11] establish another connection between the many-body wave function and neural networks, this time in the form of convolutional arithmetic circuits (ConvAC), a variant of the popular convolutional neural networks in widespread use today. By proving a one-to-one equivalence between a ConvAC circuit and TN quantum states, the authors are able to use tools from quantum information theory to analyze the entanglement present in the corresponding TN, and quantify the neural network's ability to model complex correlations between its inputs. This in turn can be used to obtain bounds on the expressivity of a given ConvAC architecture and be of practical use in choosing network parameters tailored to the data. While ConvAC are not widely used in practice, the authors empirically validate that the insights gained can be applied successfully to more common convolutional neural-network designs. Generative adversarial networks (GAN) are machine-learning algorithms in which two players—a generator and a discriminator—compete against each another. The generator's goal is to create and send fake data samples to the discriminator and maximize the probability that the discriminator erroneously believes that the sample comes from some true data distribution. The discriminator attempts to discern real from fake data as best as possible. Under reasonable assumptions the game converges to a point where the discriminator is unable to discriminate with probability greater than 1/2 (i.e. no better than random guessing), and the generator in fact has learned to generate data from the true distribution. Lloyd and Weedbrook [12] consider the natural extension in which one or both of the generator and discriminator are equipped with quantum information processors. When the data to be learned are a quantum state and both parties have quantum processors, the authors show that the unique end point of the adversarial game also coincides with the generator producing a quantum state corresponding to the true data statistics, and the discriminator unable to discern true from false data better than random guessing. They further argue that a different outcome may hold when the true samples are produced by the measurement of some quantum state, and the generator is purely classical. The concept of quantum supremacy is based on the assumption that there exist probability distributions accessible to a quantum computer that no classical computer can efficiently sample from. If the true data correspond to one of these distributions, then no classical generator can efficiently generate fake data reproducing the true statistics and, in principle, the discriminator can successfully discriminate true from fake data. However, whether the discriminator can efficiently find the measurements required to do so is unclear. Quantum-computing techniques have also found applications in autoencoders—neural networks where a larger number of input and output neurons are connected via a smaller number of intermediary latent neurons. The goal is to tune the weights of the network so that a training set of classical bit strings can be approximately recovered after being passed through the autoencoder. Romero et al. [13] consider instead a training set of quantum states, and ask whether a quantum circuit with a similar bottleneck structure can compress and approximately recover the data. The circuits that they consider consist of gates chosen from some set of parametrized unitary operations, and arranged in some fixed order. The parameters are then optimized classically so that the circuit best predicts the training-set labels. The authors demonstrate the validity of this approach by showing that ground states of the Hubbard model and certain molecules can indeed be compressed and recovered by such circuits. However, in general, the performance of such quantum autoencoders will be highly dependent on the kind of programmable circuit on which they are based, and at present there does not seem to be a structured way of determining this. Quantum neural networks are still in their infancy and, while the above works are important steps towards bridging our understanding between classical neural networks and quantum computing, many questions remain unanswered. If the expressivity of Boltzmann machine states is not restricted by entanglement in the same way that MPS and tensor-network states are, what is the best way of understanding their limitations? How can physicists use the correspondence between ConvAC and TN to their advantage in finding efficient, expressive representations of many-body wave functions? Can classical data distributions be learned more efficiently by quantum GAN than classical GAN? Whatever the outcome of these and many other related questions, this promises to be an exciting and active area of research in the years to come.

National Science Review•Nov 29, 2018•51 citations
The restricted Boltzmann machine is a fundamental building block of deep learning. The authors demonstrate its equivalence with tensor network states with explicit mappings, thus drawing a constructive connection between deep learning and quantum physics. On one side, deep learning approaches can be used to study novel states of matter. In return, investigations of tensor network states and their expressibility can be adapted to guide neural network architecture design.
Restricted Boltzmann machines (RBMs) and deep Boltzmann machines (DBMs) are important models in machine learning, and recently found numerous applications in quantum many-body physics. We show that there are fundamental connections between them and tensor networks. In particular, we demonstrate that any RBM and DBM can be exactly represented as a two-dimensional tensor network. This representation gives characterizations of the expressive power of RBMs and DBMs using entanglement structures of the tensor networks, and also provides an efficient tensor network contraction algorithm for the computing partition function of RBMs and DBMs. Using numerical experiments, we show that the proposed algorithm is more accurate than the state-of-the-art machine learning methods in estimating the partition function of RBMs and DBMs, and have potential applications in training DBMs for general machine learning tasks.
Modern deep learning has enabled unprecedented achievements in various domains. Nonetheless, employment of machine learning for wave function representations is focused on more traditional architectures such as restricted Boltzmann machines (RBMs) and fully connected neural networks. In this Letter, we establish that contemporary deep learning architectures, in the form of deep convolutional and recurrent networks, can efficiently represent highly entangled quantum systems. By constructing tensor network equivalents of these architectures, we identify an inherent reuse of information in the network operation as a key trait which distinguishes them from standard tensor network-based representations, and which enhances their entanglement capacity. Our results show that such architectures can support volume-law entanglement scaling, polynomially more efficiently than presently employed RBMs. Thus, beyond a quantification of the entanglement capacity of leading deep learning architectures, our analysis formally motivates a shift of trending neural-network-based wave function representations closer to the state-of-the-art in machine learning.
Over the past few years a number of proofs have emerged revealing the many connections between the methods used in quantum-many body physics and those in machine learning. In particular, much attention has been given to tensor networks (TNs) and deep learning architectures which exhibit striking similarities. Finding those similarities has helped us gain a better understanding on why deep learning architectures have so much expressive efficiency. Recently, machine learning techniques have been used to approximate many-body physics problems. Conversely, TNs have been used for machine learning tasks. For example, state-of-the-art research has used one-dimensional TNs to solve image recognition problems with very limited scalability. The scalability problem, however, can be overcomed by using a two-dimensional hierarchical TNs and a training algorithm derived from the multipartite entanglement renormalization ansatz (MERA). Here we give further analysis of the inner structural resemblance between such hierarchical tensor networks (TNs) and pretrained convolutional neural networks (CNNs): this was achieved by analyzing their abstraction power layer by layer.
Recently, quantum-state representation using artificial neural networks has started to be recognized as a powerful tool. However, due to the black-box nature of machine learning, it is difficult to analyze what machine learns or why it is powerful. Here, by applying one of the simplest neural networks, the restricted Boltzmann machine (RBM), to the ground-state representation of the one-dimensional (1D) transverse-field Ising (TFI) model, we make an attempt to directly analyze the optimized network parameters. In the RBM optimization, a zero-temperature quantum state is mapped onto a finite-temperature classical state of the extended Ising spins that constitute the RBM. We find that the quantum phase transition from the ordered phase to the disordered phase in the 1D TFI model by increasing the transverse field is clearly reflected in the behaviors of the optimized RBM parameters and hence in the finite-temperature phase diagram of the classical RBM Ising system. The present finding of a correspondence between the neural-network parameters and quantum phases suggests that a careful investigation of the neural-network parameters may provide a new route to extracting nontrivial physical insights from the neural-network wave functions.
In this chapter, we describe a tensor network (TN) based common language established between machine learning and many-body physics, which allows for bidirectional contributions. By showing that many-body wave functions are structurally equivalent to mappings of convolutional and recurrent networks, we bring forth quantum entanglement measures as natural quantifiers of dependencies modeled by such networks. Accordingly, we propose a novel entanglement-based deep learning design scheme that sheds light on the success of popular architectural choices made by deep learning practitioners and suggests new practical prescriptions. In the other direction, we construct TNs corresponding to deep recurrent and convolutional networks. This allows us to theoretically demonstrate that these architectures are powerful enough to represent highly entangled quantum systems polynomially more efficiently than previously employed architectures. We thus provide theoretical motivation to shift neural-network-based wave function representations closer to state-of-the-art deep learning architectures.
Quantum machine learning is at the crossroads of two of the most exciting current areas of research: quantum computing and classical machine learning. Although the field is still in its infancy, the body of literature is already large enough to warrant several review articles [1–3]. This short survey focuses on a selection of significant recent results on the subtopic of quantum neural networks, an area that hopes to build on the enormous impact that classical neural networks have had. In particular, we concentrate on quantum generalizations of popular neural-network concepts such as Boltzmann machines, generative adversarial networks and autoencoders, as well as applications of classical neural networks to quantum information and vice versa. Examples of Boltzmann machines. In a fully connected Boltzmann machine, connections exist between all visible and hidden neurons. In a restricted Boltzmann machine (RBM), there are no connections between neurons of the same type. A deep Boltzmann machine (DBM) consists of adding one or more additional layers of hidden neurons to an RBM, with no connections between neurons in the same layer. The energy-based nature of BMs gives a natural framework for considering quantum generalizations of their behavior. The BM energy function is equivalent to the Hamiltonian of a simple Ising model and one might hope that more general Hamiltonians allowed by quantum mechanics could explain certain data sets better than classically. Amin et al. [4] adopt this approach, and take the so-called transverse field Ising Hamiltonian as the energy function. This increased generality brings certain difficulties, however, as the transverse field term makes training the quantum Boltzmann machine (QBM) non-trivial. Although the general scaling and performance of QBMs is not yet well understood, for certain small-size examples the authors observe that their QBMs can learn data distributions better than classical BMs. Kieferova and Wiebe [5] extend the formalism of Amin et al. and consider more general Hamiltonians that, unlike the transverse Ising model, are not in general believed to be classically efficiently simulatable. Furthermore, they propose new methods for training that allow for parameters corresponding to quantum terms to be learned. Finally, their QBM enables a form of quantum-state tomography that can learn non-classical data, and also generate copies of the reconstructed state. Again, small-scale numerical evidence suggests that their proposals may provide an advantage over classical BMs, although their tendency to overfit data must be investigated further. The practical value of BMs, either classical or quantum, relies in part on the ease with which they are trained. This in turn depends on sampling efficiently from the Boltzmann distribution. Classically this can be done approximately only for the special case of restricted Boltzmann machines (RBM), i.e. where connections are between visible and hidden units, and no connections exist between neurons of the same type. Wiebe et al. [6] propose two quantum algorithms for Boltzmann sampling, based on starting from a state corresponding to the product distribution that is closest to the target Boltzmann distribution. While small-scale numerical studies are encouraging, true bounds on the running time of their algorithms rely on a problem-dependent parameter κ, the scaling of which is hard to estimate. The hope remains though that empirically their algorithms work well in practice, even for multi-layer and fully connected BMs. The expressive power of BMs for compactly representing complicated probability distributions has led to another line of investigation, namely their use for representing quantum many-body wave functions. The authors apply this technique to two prototypical spin models and achieve high accuracy in both ground-state estimation and dynamical evolution, improving on existing state-of-the-art techniques. Their results indicate that RBM states can capture complex many-body correlations in an efficient manner—evidence reinforced by the work of Deng et al. [8], who show that certain topological quantum states in one, two and three dimensions can be represented by RBM states with a number of parameters only linear in the system size. In a subsequent study, however, Gao and Duan [9] prove that although RBM states can indeed represent many highly entangled states, their expressive power is limited in that they cannot represent arbitrary states generated by polynomial-sized quantum circuits, nor those that are the ground states of k-local Hamiltonians with polynomial-sized energy gaps, unless the polynomial hierarchy from computational complexity theory collapses. On the other hand, they show that these two important classes of states can be efficiently represented by a deep Boltzmann machine of three layers. Intriguingly though, another paper by Deng et al. [10] gives an analytic construction of a family of RBM states with a number of parameters linear in the system size that exhibits maximal volume-law entanglement, and that cannot be represented efficiently by either matrix product states (MPS) or tensor-network (TN) states. This shows that the expressive power of even efficiently parametrized RBM states is not limited by entanglement in the same way that other popular compact representations are. This gives the hope that RBM states may prove a valuable tool in understanding entangled quantum systems intractable by traditional methods. Levine et al. [11] establish another connection between the many-body wave function and neural networks, this time in the form of convolutional arithmetic circuits (ConvAC), a variant of the popular convolutional neural networks in widespread use today. By proving a one-to-one equivalence between a ConvAC circuit and TN quantum states, the authors are able to use tools from quantum information theory to analyze the entanglement present in the corresponding TN, and quantify the neural network's ability to model complex correlations between its inputs. This in turn can be used to obtain bounds on the expressivity of a given ConvAC architecture and be of practical use in choosing network parameters tailored to the data. While ConvAC are not widely used in practice, the authors empirically validate that the insights gained can be applied successfully to more common convolutional neural-network designs. Generative adversarial networks (GAN) are machine-learning algorithms in which two players—a generator and a discriminator—compete against each another. The generator's goal is to create and send fake data samples to the discriminator and maximize the probability that the discriminator erroneously believes that the sample comes from some true data distribution. The discriminator attempts to discern real from fake data as best as possible. Under reasonable assumptions the game converges to a point where the discriminator is unable to discriminate with probability greater than 1/2 (i.e. no better than random guessing), and the generator in fact has learned to generate data from the true distribution. Lloyd and Weedbrook [12] consider the natural extension in which one or both of the generator and discriminator are equipped with quantum information processors. When the data to be learned are a quantum state and both parties have quantum processors, the authors show that the unique end point of the adversarial game also coincides with the generator producing a quantum state corresponding to the true data statistics, and the discriminator unable to discern true from false data better than random guessing. They further argue that a different outcome may hold when the true samples are produced by the measurement of some quantum state, and the generator is purely classical. The concept of quantum supremacy is based on the assumption that there exist probability distributions accessible to a quantum computer that no classical computer can efficiently sample from. If the true data correspond to one of these distributions, then no classical generator can efficiently generate fake data reproducing the true statistics and, in principle, the discriminator can successfully discriminate true from fake data. However, whether the discriminator can efficiently find the measurements required to do so is unclear. Quantum-computing techniques have also found applications in autoencoders—neural networks where a larger number of input and output neurons are connected via a smaller number of intermediary latent neurons. The goal is to tune the weights of the network so that a training set of classical bit strings can be approximately recovered after being passed through the autoencoder. Romero et al. [13] consider instead a training set of quantum states, and ask whether a quantum circuit with a similar bottleneck structure can compress and approximately recover the data. The circuits that they consider consist of gates chosen from some set of parametrized unitary operations, and arranged in some fixed order. The parameters are then optimized classically so that the circuit best predicts the training-set labels. The authors demonstrate the validity of this approach by showing that ground states of the Hubbard model and certain molecules can indeed be compressed and recovered by such circuits. However, in general, the performance of such quantum autoencoders will be highly dependent on the kind of programmable circuit on which they are based, and at present there does not seem to be a structured way of determining this. Quantum neural networks are still in their infancy and, while the above works are important steps towards bridging our understanding between classical neural networks and quantum computing, many questions remain unanswered. If the expressivity of Boltzmann machine states is not restricted by entanglement in the same way that MPS and tensor-network states are, what is the best way of understanding their limitations? How can physicists use the correspondence between ConvAC and TN to their advantage in finding efficient, expressive representations of many-body wave functions? Can classical data distributions be learned more efficiently by quantum GAN than classical GAN? Whatever the outcome of these and many other related questions, this promises to be an exciting and active area of research in the years to come.