Abstract

Neural-network-based algorithms have garnered considerable attention for their ability to learn complex patterns from very-high-dimensional data sets towards classifying complex long-range patterns of entanglement and correlations in many-body quantum systems, and towards processing high-dimensional classical data sets. Small-scale quantum computers are already showing potential gains in learning tasks on large quantum and very large classical data sets. A particularly interesting class of algorithms, the quantum convolutional neural networks (QCNNs) could learn features of a quantum data set by performing a binary classification task on a nontrivial phase of quantum matter. Inspired by this promise, we present a generalization of QCNN, the ``branching quantum convolutional neural network,'' or bQCNN, with substantially higher expressibility. A key feature of bQCNN is that it leverages midcircuit (intermediate) measurement results, realizable on several current quantum devices, obtained in pooling layers to determine which sets of parameters will be used in the subsequent convolutional layers of the circuit. This results in a ``branching'' structure, which allows for a greater number of trainable variational parameters in a given circuit depth. This is of particular use in current-day noisy intermediate-scale quantum devices, where circuit depth is limited by gate noise. We present an overview of the Ansatz structure and scaling and provide evidence of its enhanced expressibility compared with QCNN. Using artificially constructed large data sets of training states as a proof of concept, we demonstrate the existence of training tasks in which bQCNN far outperforms an ordinary QCNN. We provide an explicit example of such a task in the recognition of the transition from a symmetry protected topological to a trivial phase induced by multiple, distinct perturbations. Finally, we present future directions where the classical branching structure and increased density of trainable parameters in bQCNN would be particularly valuable.

Highlights

  • In recent years, the scope and complexity of tasks that classical machine learning can address have grown considerably [1]

  • By comparing the states generated by random quantum convolutional neural networks (QCNNs) and branching” QCNN (bQCNN) circuits with states from the Haar distribution, we show that the bQCNN is more expressive than a QCNN of the same width and depth

  • If errors related to midcircuit measurements are not large, bQCNNs can in principle express a greater range of operations for a given circuit depth compared with standard QCNNs, a point we explore in more detail

Read more

Summary

INTRODUCTION

In this paper, we ask a pertinent and timely question: Can we incorporate midcircuit measurement into variational quantum machine learning (QML) Ansätze in order to take full advantage of the current capabilities of quantum devices, with their limitations on fidelity and circuit depth?. We generalize the structure of QCNNs, heavily using midcircuit measurement capabilities, which gives the circuit a classical branching structure where different midcircuit measurement outcomes dictate which convolutional layers will subsequently be executed The successful experimental demonstration of a (b)QCNN for classification of quantum phases on a quantum device will pave the way for development and implementation of novel hybrid quantum machine learning algorithms, which will likely leverage intermediate measurement capabilities of trapped-ion architectures

Quantum convolutional neural networks
Expressibility of QCNN versus bQCNN
ARTIFICIAL TRAINING TASKS
DETECTING AN SPT PHASE TRANSITION
DISCUSSION AND CONCLUSIONS
OUTLOOK
Circuit structure and implementation
Findings
Genetic algorithm parameter optimization

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.