Tree tensor network classifiers for machine learning: from quantum-inspired to quantum-assisted

dc.contributor.authorWall, Michael L.
dc.contributor.authorD'Aguanno, Giuseppe
dc.date.accessioned2021-06-04T20:10:45Z
dc.date.available2021-06-04T20:10:45Z
dc.date.issued2021-10-07
dc.description.abstractWe describe a quantum-assisted machine learning method in which multivariate data are encoded into quantum states in a Hilbert space whose dimension is exponentially large in the length of the data vector. Learning in this space occurs through applying a low-depth quantum circuit with a tree-tensor-network (TTN) topology acting as an unsupervised feature extractor to identify the most relevant quantum states in a data-driven fashion and then applying a supervised linear classifier encoding the class decision in a small-dimensional quantum register. We present tools for making TTN classifiers amenable to implementation on gate-based quantum computing devices, including an embedding map with accuracy similar to the recently defined exponential machines (A. Novikov et al., arXiv:1605.03795) but which produces valid quantum state embeddings of classical data vectors, and the use of manifold-based gradient optimization schemes to produce isometric operations mapping quantum states to a register of qubits defining a class decision. We detail methods for efficiently obtaining one-point and two-point correlation functions of the vectors defining the decision boundary of the quantum model, which can be used for model interpretability, as well as methods for obtaining classification decisions from partial data vectors. Further, we show that the use of isometric tensors can significantly aid in the human interpretability of the correlation functions extracted from the decision weights and may produce models that are less susceptible to adversarial perturbations. Finally, we discuss in detail the problem of compiling classically optimized isometric TTN models into unitary operations to be run on quantum computers and how isometric models requiring postselection on quantum hardware can be used to precondition variational Ansätze for models without postselection. We demonstrate our methodologies in applications utilizing the MNIST database of handwritten digits and a multivariate time-series data set of human activity recognition.en_US
dc.description.sponsorshipWe would like to thank M. Abernathy and G. Quiroz for useful discussions and acknowledge funding from the Internal Research and Development program of the Johns Hopkins University Applied Physics Laboratory.en_US
dc.description.urihttps://journals.aps.org/pra/abstract/10.1103/PhysRevA.104.042408en_US
dc.format.extent23 pagesen_US
dc.genrejournal articlesen_US
dc.identifierdoi:10.13016/m2gpgf-o5xi
dc.identifier.citationWall, Michael L., Giuseppe D'Aguanno. “Tree tensor network classifiers for machine learning: from quantum-inspired to quantum-assisted.” Phys. Rev. A 104 (7 October 2021). doi:https://doi.org/10.1103/PhysRevA.104.042408.en_US
dc.identifier.urihttp://hdl.handle.net/11603/21687
dc.identifier.urihttps://doi.org/10.1103/PhysRevA.104.042408
dc.language.isoen_USen_US
dc.publisherAPS
dc.relation.isAvailableAtThe University of Maryland, Baltimore County (UMBC)
dc.relation.ispartofUMBC Computer Science and Electrical Engineering Department Collection
dc.relation.ispartofUMBC Faculty Collection
dc.rightsThis item is likely protected under Title 17 of the U.S. Copyright Law. Unless on a Creative Commons license, for uses protected by Copyright Law, contact the copyright holder or the author.
dc.titleTree tensor network classifiers for machine learning: from quantum-inspired to quantum-assisteden_US
dc.typeTexten_US
dcterms.creatorhttps://orcid.org/0000-0002-7132-0103

Files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
PhysRevA.104.042408.pdf
Size:
7.97 MB
Format:
Adobe Portable Document Format
Description:

License bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
license.txt
Size:
2.56 KB
Format:
Item-specific license agreed upon to submission
Description: