Quantum machine learning aspires to overcome intractability that currently limits its applicability to practical problems. However, quantum machine learning itself is limited by low effective dimensions achievable in state-of-the-art experiments. Here we demonstrate highly successful classifications of real-life images using photonic qubits, combining a quantum tensor-network representation of hand-written digits and entanglement-based optimization. Specifically, we focus on binary classification for hand-written zeroes and ones, whose features are cast into the tensor-network representation, further reduced by optimization based on entanglement entropy and encoded into two-qubit photonic states. We then demonstrate image classification with a high success rate exceeding 98%, through successive gate operations and projective measurements. Although we work with photons, our approach is amenable to other physical realizations such as nitrogen-vacancy centers, nuclear spins and trapped ions, and our scheme can be scaled to efficient multi-qubit encodings of features in the tensor-product representation, thereby setting the stage for quantum-enhanced multi-class classification.
The ability to control and hence to realize a given number of photons is of major interest from a fundamental point of view, e.g. Bell inequalities, photons bunching. In recent years this interest has grown by the so-called the "Second Quantum Revolution" where such an ability is needed for quantum computers, etc. In this paper, we show that such a realization can not be done by a unitary process. Therefore, a non-unitary interferometer is given to build a full realization of the tensor product space for two photons at two states. Finally, by modifying the previous interferometer, the full ton…
Hybrid quantum-classical algorithms based on variational circuits are a promising approach to quantum machine learning problems for near-term devices, but the selection of the variational ansatz is an open issue. Recently, tensor network-inspired circuits have been proposed as a natural choice for such ansatz. Their employment on binary classification tasks provided encouraging results. However, their effectiveness on more difficult tasks is still unknown. Here, we present numerical experiments on multi-class classifiers based on tree tensor network and multiscale entanglement renormalization …
We present tensor networks for feature extraction and refinement of classifier performance. These networks can be initialised deterministically and have the potential for implementation on near-term intermediate-scale quantum (NISQ) devices. Feature extraction proceeds through a direct combination and compression of images amplitude-encoded over just $\log N_{\text{pixels}}$ qubits. Performance is refined using `Quantum Stacking', a deterministic method that can be applied to the predictions of any classifier regardless of structure, and implemented on NISQ devices using data re-uploading. The…
We propose a restricted class of tensor network state, built from number-state preserving tensors, for supervised learning tasks. This class of tensor network is argued to be a natural choice for classifiers as (i) they map classical data to classical data, and thus preserve the interpretability of data under tensor transformations, (ii) they can be efficiently trained to maximize their scalar product against classical data sets, and (iii) they seem to be as powerful as generic (unrestricted) tensor networks in this task. Our proposal is demonstrated using a variety of benchmark classification…
We describe a quantum-assisted machine learning (QAML) method in which multivariate data is 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, which acts as an unsupervised feature extractor to identify the most relevant quantum states in a data-driven fashion. This unsupervised feature extractor then feeds a supervised linear classifier and encodes the output in a small-dimensional quantum register. In contra…
Recent quantum reconstruction projects demand pure unitary time evolution which seems to contradict the collapse postulate. Inspired by Zurek's environment assisted invariance idea, a natural unitary realization of wavefunction collapse is proposed using Grothendieck group construction for the tensor product commutative monoid.
Purdue University（普渡大学）；Indian Institute of Technology Roorkee（印度理工学院鲁尔基分校）
In recent times, Variational Quantum Circuits (VQC) have been widely adopted to different tasks in machine learning such as Combinatorial Optimization and Supervised Learning. With the growing interest, it is pertinent to study the boundaries of the classical simulation of VQCs to effectively benchmark the algorithms. Classically simulating VQCs can also provide the quantum algorithms with a better initialization reducing the amount of quantum resources needed to train the algorithm. This manuscript proposes an algorithm that compresses the quantum state within a circuit using a tensor ring re…
The realization of topological quantum phases of matter remains a key challenge to condensed matter physics and quantum information science. In this work, we demonstrate that progress in this direction can be made by combining concepts of tensor network theory with Majorana device technology. Considering the topological double semion string-net phase as an example, we exploit the fact that the representation of topological phases by tensor networks can be significantly simpler than their description by lattice Hamiltonians. The building blocks defining the tensor network are tailored to realiz…
Brookhaven National Laboratory（布鲁克海文国家实验室）；National Taiwan University（台湾大学）
One key step in performing quantum machine learning (QML) on noisy intermediate-scale quantum (NISQ) devices is the dimension reduction of the input data prior to their encoding. Traditional principle component analysis (PCA) and neural networks have been used to perform this task; however, the classical and quantum layers are usually trained separately. A framework that allows for a better integration of the two key components is thus highly desirable. Here we introduce a hybrid model combining the quantum-inspired tensor networks (TN) and the variational quantum circuits (VQC) to perform sup…
We introduce a hybrid model combining a quantum-inspired tensor network and a variational quantum circuit to perform supervised learning tasks. This architecture allows for the classical and quantum parts of the model to be trained simultaneously, providing an end-to-end training framework. We show that compared to the principal component analysis, a tensor network based on the matrix product state with low bond dimensions performs better as a feature extractor for the input data of the variational quantum circuit in the binary and ternary classification of MNIST and Fashion-MNIST datasets. Th…
We analyze Weyl algebra of quantum angular momentum system and construct qubit subalgebra out of it. We show that the commutant of this qubit subalgebra is isomorphic to the original algebra and prove the tensor product structure between qubit subalgebra and its commutant. This construction can be iterated to construct arbitrary number of qubit subalgebras from a single quantum system. We show a simple experimental realization of this proposed scheme using orbital angular momentum of single photons. We briefly discuss about construction of qudit subalgbra and generalization to other infinite d…
Thapar Institute of Engineering & Technology（塔帕尔工程技术学院）
In recent years, interest in expressing the success of neural networks to the quantum computing has increased significantly. Tensor network theory has become increasingly popular and widely used to simulate strongly entangled correlated systems. Matrix product state (MPS) is the well-designed class of tensor network states, which plays an important role in processing of quantum information. In this paper, we have shown that matrix product state as one-dimensional array of tensors can be used to classify classical and quantum data. We have performed binary classification of classical machine le…
University of Chinese Academy of Sciences（中国科学院大学）；Tianjin Polytechnic University（天津工业大学）；Capital Normal University（首都师范大学）
Tensor network (TN) has recently triggered extensive interests in developing machine-learning models in quantum many-body Hilbert space. Here we purpose a generative TN classification (GTNC) approach for supervised learning. The strategy is to train the generative TN for each class of the samples to construct the classifiers. The classification is implemented by comparing the distance in the many-body Hilbert space. The numerical experiments by GTNC show impressive performance on the MNIST and Fashion-MNIST dataset. The testing accuracy is competitive to the state-of-the-art convolutional neur…
We build interacting Fock spaces from association schemes and set up quantum walks on the resulting regular graphs (distance-regular and distance-transitive). The construction is valid for growing graphs and the interacting Fock space is well defined asymptotically for the growing graph. To realize the quantum walks defined on the graphs in terms of anyons we switch to the dual view of the association schemes and identify the corresponding modular tensor categories from the Bose-Mesner algebra. Informally, the fusion ring induced by the association scheme and a topological twist can be the bas…
We study the realization of anyon-permuting symmetries of topological phases on the lattice using tensor networks. Working on the virtual level of a projected entangled pair state, we find matrix product operators (MPOs) that realize all unitary topological symmetries for the toric and color codes. These operators act as domain walls that enact the symmetry transformation on anyons as they cross. By considering open boundary conditions for these domain wall MPOs, we show how to introduce symmetry twists and defect lines into the state.
We use the tensor network living on the Bruhat-Tits tree to give a concrete realization of the recently proposed $p$-adic AdS/CFT correspondence (a holographic duality based on the $p$-adic number field $\mathbb{Q}_p$). Instead of assuming the $p$-adic AdS/CFT correspondence, we show how important features of AdS/CFT such as the bulk operator reconstruction and the holographic computation of boundary correlators are automatically implemented in this tensor network.
HQCC: A Hybrid Quantum-Classical Classifier with Adaptive Structure
School of Computer Science and Statistics, Trinity College Dublin（都柏林圣三一学院计算机科学与统计学院）；College of Electrical and Information Engineering, Hunan University（湖南大学电气与信息工程学院）
Institute of Financial Analysis（金融分析研究所）；Université de Neuchâtel（纳沙泰尔大学）；Università degli Studi di Milano（米兰大学）
This paper presents Sparse Tensor Classifier (STC), a supervised classification algorithm for categorical data inspired by the notion of superposition of states in quantum physics. By regarding an observation as a superposition of features, we introduce the concept of wave-particle duality in machine learning and propose a generalized framework that unifies the classical and the quantum probability. We show that STC possesses a wide range of desirable properties not available in most other machine learning methods but it is at the same time exceptionally easy to comprehend and use. Empirical e…
Recent progress in studies of holographic dualities, originally motivated by insights from string theory, has led to a confluence with concepts and techniques from quantum information theory. A particularly successful approach has involved capturing holographic properties by means of tensor networks which not only give rise to physically meaningful correlations of holographic boundary states, but also reproduce and refine features of quantum error correction in holography. This topical review provides an overview over recent successful realizations of such models. It does so by building on an …
