The note conjectures a polynomial-time recursive method for computing arbitrary local projections on 2D square-lattice cluster states, but the core 2D recursion is not proved and the numerical evidence is too small to confirm polynomial scaling.
Measurement-based quantum convolutional neural network for deep learning
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
Recently, quantum convolutional neural networks (QCNNs) are proposed, harnessing the power of quantum computing for faster training compared to the classical counterparts. However, this framework for deep learning also relies on multiple processing layers to capture the representation of data, which necessitates precise dynamical control. Given the current stage of quantum computing, achieving this level of control at a large scale remains challenging. Here, we propose an alternate approach to implementing QCNNs by utilizing cluster states. The training process of the method involves tuning the projection basis of each qubit in cluster states, rather than adjusting the parameters of layers of operators in deep quantum circuits. Hence, the whole system is easier to stabilize by avoiding the complex controls. Leveraging techniques in measurement-based quantum computing, we present an exact cluster state solution to general QCNNs. Followingly, we provide numerical evidence that both quantum and classical data can be learned by measuring cluster states, and a faster convergence of the method is observed. The cluster states we consider in our learning examples are merely square-lattice cluster states, whose implementation at large scale have been reported recently. It indicates that our method has the potential for realizing the advance of quantum deep learning for practical uses.
citation-role summary
citation-polarity summary
fields
quant-ph 1years
2025 1verdicts
REJECT 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
One Polynomial Strategy for Computing Local Projections on Square-Lattice Cluster States
The note conjectures a polynomial-time recursive method for computing arbitrary local projections on 2D square-lattice cluster states, but the core 2D recursion is not proved and the numerical evidence is too small to confirm polynomial scaling.