TY - JOUR
T1 - Using quantum transport networks for classification
T2 - A path toward quantum computing for machine learning
AU - Lorber, Shmuel
AU - Zimron, Oded
AU - Zak, Inbal Lorena
AU - Milo, Anat
AU - Dubi, Yonatan
N1 - Publisher Copyright:
© 2024 American Physical Society.
PY - 2024/7/1
Y1 - 2024/7/1
N2 - Classification, the computational process of categorizing an input into preexisting classes, is now a cornerstone in modern computation in the era of machine learning. Here, we propose an approach for a quantum physical computer; a quantum classifier, based on quantum transport of particles in a trained quantum network. The classifier is based on sending a quantum particle into a network and measuring the exit point of the particle, which serves as a "class"and can be determined by changing the network parameters, differing from standard quantum computers as no gate operations are required to perform the computation. Using this scheme, we demonstrate three examples of classification. In the first, wave functions are classified according to their overlap with predetermined (random) groups. In the second, we classify wave functions according to their level of localization. Both examples use small training sets and achieve over 95% precision and recall. The third classification scheme is a "real-world problem,"concerning classification of catalytic aromatic aldehyde substrates according to their reactivity. Using experimental data, the quantum classifier reaches an average 86% classification accuracy. We show that the quantum classifier outperforms its classical counterpart for these examples and demonstrates clear advantage, especially in the regime of "small data."These results pave the way for a classification scheme that can be implemented as an algorithm and potentially realized experimentally on quantum hardware.
AB - Classification, the computational process of categorizing an input into preexisting classes, is now a cornerstone in modern computation in the era of machine learning. Here, we propose an approach for a quantum physical computer; a quantum classifier, based on quantum transport of particles in a trained quantum network. The classifier is based on sending a quantum particle into a network and measuring the exit point of the particle, which serves as a "class"and can be determined by changing the network parameters, differing from standard quantum computers as no gate operations are required to perform the computation. Using this scheme, we demonstrate three examples of classification. In the first, wave functions are classified according to their overlap with predetermined (random) groups. In the second, we classify wave functions according to their level of localization. Both examples use small training sets and achieve over 95% precision and recall. The third classification scheme is a "real-world problem,"concerning classification of catalytic aromatic aldehyde substrates according to their reactivity. Using experimental data, the quantum classifier reaches an average 86% classification accuracy. We show that the quantum classifier outperforms its classical counterpart for these examples and demonstrates clear advantage, especially in the regime of "small data."These results pave the way for a classification scheme that can be implemented as an algorithm and potentially realized experimentally on quantum hardware.
UR - http://www.scopus.com/inward/record.url?scp=85198901456&partnerID=8YFLogxK
U2 - 10.1103/PhysRevApplied.22.014041
DO - 10.1103/PhysRevApplied.22.014041
M3 - Article
AN - SCOPUS:85198901456
SN - 2331-7019
VL - 22
JO - Physical Review Applied
JF - Physical Review Applied
IS - 1
M1 - 014041
ER -