6
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: found
      • Article: found
      Is Open Access

      Entanglement entropy production in Quantum Neural Networks

      Read this article at

      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Abstract

          Quantum Neural Networks (QNN) are considered a candidate for achieving quantum advantage in the Noisy Intermediate Scale Quantum computer (NISQ) era. Several QNN architectures have been proposed and successfully tested on benchmark datasets for machine learning. However, quantitative studies of the QNN-generated entanglement have been investigated only for up to few qubits. Tensor network methods allow to emulate quantum circuits with a large number of qubits in a wide variety of scenarios. Here, we employ matrix product states to characterize recently studied QNN architectures with random parameters up to fifty qubits showing that their entanglement, measured in terms of entanglement entropy between qubits, tends to that of Haar distributed random states as the depth of the QNN is increased. We certify the randomness of the quantum states also by measuring the expressibility of the circuits, as well as using tools from random matrix theory. We show a universal behavior for the rate at which entanglement is created in any given QNN architecture, and consequently introduce a new measure to characterize the entanglement production in QNNs: the entangling speed. Our results characterise the entanglement properties of quantum neural networks, and provides new evidence of the rate at which these approximate random unitaries.

          Related collections

          Most cited references70

          • Record: found
          • Abstract: found
          • Article: not found

          Deep learning.

          Deep learning allows computational models that are composed of multiple processing layers to learn representations of data with multiple levels of abstraction. These methods have dramatically improved the state-of-the-art in speech recognition, visual object recognition, object detection and many other domains such as drug discovery and genomics. Deep learning discovers intricate structure in large data sets by using the backpropagation algorithm to indicate how a machine should change its internal parameters that are used to compute the representation in each layer from the representation in the previous layer. Deep convolutional nets have brought about breakthroughs in processing images, video, speech and audio, whereas recurrent nets have shone light on sequential data such as text and speech.
            Bookmark
            • Record: found
            • Abstract: not found
            • Article: not found

            ImageNet classification with deep convolutional neural networks

              Bookmark
              • Record: found
              • Abstract: found
              • Article: not found

              Mastering the game of Go with deep neural networks and tree search.

              The game of Go has long been viewed as the most challenging of classic games for artificial intelligence owing to its enormous search space and the difficulty of evaluating board positions and moves. Here we introduce a new approach to computer Go that uses 'value networks' to evaluate board positions and 'policy networks' to select moves. These deep neural networks are trained by a novel combination of supervised learning from human expert games, and reinforcement learning from games of self-play. Without any lookahead search, the neural networks play Go at the level of state-of-the-art Monte Carlo tree search programs that simulate thousands of random games of self-play. We also introduce a new search algorithm that combines Monte Carlo simulation with value and policy networks. Using this search algorithm, our program AlphaGo achieved a 99.8% winning rate against other Go programs, and defeated the human European Go champion by 5 games to 0. This is the first time that a computer program has defeated a human professional player in the full-sized game of Go, a feat previously thought to be at least a decade away.
                Bookmark

                Author and article information

                Journal
                Quantum
                Quantum
                Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften
                2521-327X
                May 31 2023
                May 31 2023
                : 7
                : 1023
                Affiliations
                [1 ]These authors contributed equally to this work
                [2 ]Dipartimento di Fisica e Astronomia "G. Galilei", via Marzolo 8, I-35131, Padova, Italy
                [3 ]INFN, Sezione di Padova, via Marzolo 8, I-35131, Padova, Italy
                [4 ]Dipartimento di Fisica, Università di Pavia, Via Bassi 6, I-27100, Pavia, Italy
                [5 ]INFN Sezione di Pavia, Via Bassi 6, I-27100, Pavia, Italy
                [6 ]Padua Quantum Technologies Research Center, Università degli Studi di Padova
                [7 ]CNR-INO - Largo E. Fermi 6, I-50125, Firenze, Italy
                [8 ]CINECA Quantum Computing Lab,Via Magnanelli, 6/3, 40033 Casalecchio di Reno, Bologna, Italy
                Article
                10.22331/q-2023-05-31-1023
                99205009-e6d2-4a4f-bb11-a22692f8d395
                © 2023

                Free to read

                https://creativecommons.org/licenses/by/4.0/

                History

                Comments

                Comment on this article