A hybrid quantum-classical classifier based on branching multi-scale entanglement renormalization ansatz

• URL: http://arxiv.org/abs/2303.07906v1
• Date: Tue, 14 Mar 2023 13:46:45 GMT
• Title: A hybrid quantum-classical classifier based on branching multi-scale entanglement renormalization ansatz
• Authors: Yan-Yan Hou, Jian Li, Xiu-Bo Chen, Chong-Qiang Ye
• Abstract summary: This paper proposes a quantum semi-supervised classifier based on label propagation. Considering the difficulty of graph construction, we develop a variational quantum label propagation (VQLP) method. In this method, a locally parameterized quantum circuit is created to reduce the parameters required in the optimization.
• Score: 5.548873288570182
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Label propagation is an essential semi-supervised learning method based on graphs, which has a broad spectrum of applications in pattern recognition and data mining. This paper proposes a quantum semi-supervised classifier based on label propagation. Considering the difficulty of graph construction, we develop a variational quantum label propagation (VQLP) method. In this method, a locally parameterized quantum circuit is created to reduce the parameters required in the optimization. Furthermore, we design a quantum semi-supervised binary classifier based on hybrid Bell and $Z$ bases measurement, which has shallower circuit depth and is more suitable for implementation on near-term quantum devices. We demonstrate the performance of the quantum semi-supervised classifier on the Iris data set, and the simulation results show that the quantum semi-supervised classifier has higher classification accuracy than the swap test classifier. This work opens a new path to quantum machine learning based on graphs.

Related papers

• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Supervised binary classification of small-scale digits images with a trapped-ion quantum processor [56.089799129458875]
  We show that a quantum processor can correctly solve the basic classification task considered. With the increase of the capabilities quantum processors, they can become a useful tool for machine learning.
  arXiv  Detail & Related papers  (2024-06-17T18:20:51Z)
• MORE: Measurement and Correlation Based Variational Quantum Circuit for Multi-classification [10.969833959443495]
  MORE stands for measurement and correlation based variational quantum multi-classifier. We implement MORE using the Qiskit Python library and evaluate it through extensive experiments on both noise-free and noisy quantum systems.
  arXiv  Detail & Related papers  (2023-07-21T19:33:10Z)
• Majorization-based benchmark of the complexity of quantum processors [105.54048699217668]
  We numerically simulate and characterize the operation of various quantum processors. We identify and assess quantum complexity by comparing the performance of each device against benchmark lines. We find that the majorization-based benchmark holds as long as the circuits' output states have, on average, high purity.
  arXiv  Detail & Related papers  (2023-04-10T23:01:10Z)
• Ensemble-learning variational shallow-circuit quantum classifiers [4.104704267247209]
  We propose two ensemble-learning classification methods, namely bootstrap aggregating and adaptive boosting. The protocols have been exemplified for classical handwriting digits as well as quantum phase discrimination of a symmetry-protected topological Hamiltonian.
  arXiv  Detail & Related papers  (2023-01-30T07:26:35Z)
• Variational Quantum Approximate Support Vector Machine With Inference Transfer [0.8057006406834467]
  A kernel-based quantum machine learning technique for hyperlinear classification of complex data is presented. A support vector machine can be realized inherently and explicitly on quantum circuits. The accuracy of iris data classification reached 98.8%.
  arXiv  Detail & Related papers  (2022-06-29T09:56:59Z)
• Quantum algorithm for neural network enhanced multi-class parallel classification [0.3314882635954752]
  The proposed algorithm has a higher classification accuracy, faster convergence and higher expression ability. For a classification task of $L$-class, the analysis shows that the space and time complexity of the quantum circuit are $O(L*logL)$ and $O(logL)$, respectively.
  arXiv  Detail & Related papers  (2022-03-08T14:06:13Z)
• Multi-class quantum classifiers with tensor network circuits for quantum phase recognition [0.0]
  Network-inspired circuits have been proposed as a natural choice for variational quantum eigensolver circuits. We present numerical experiments on multi-class entanglements based on tree tensor network and multiscale renormalization ansatz circuits.
  arXiv  Detail & Related papers  (2021-10-15T21:55:13Z)
• Cluster-Promoting Quantization with Bit-Drop for Minimizing Network Quantization Loss [61.26793005355441]
  Cluster-Promoting Quantization (CPQ) finds the optimal quantization grids for neural networks. DropBits is a new bit-drop technique that revises the standard dropout regularization to randomly drop bits instead of neurons. We experimentally validate our method on various benchmark datasets and network architectures.
  arXiv  Detail & Related papers  (2021-09-05T15:15:07Z)
• Facial Expression Recognition on a Quantum Computer [68.8204255655161]
  We show a possible solution to facial expression recognition using a quantum machine learning approach. We define a quantum circuit that manipulates the graphs adjacency matrices encoded into the amplitudes of some appropriately defined quantum states.
  arXiv  Detail & Related papers  (2021-02-09T13:48:00Z)
• QUANTIFY: A framework for resource analysis and design verification of quantum circuits [69.43216268165402]
  QUANTIFY is an open-source framework for the quantitative analysis of quantum circuits. It is based on Google Cirq and is developed with Clifford+T circuits in mind. For benchmarking purposes QUANTIFY includes quantum memory and quantum arithmetic circuits.
  arXiv  Detail & Related papers  (2020-07-21T15:36:25Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.