| dc.contributor.author | Yang, Rui | |
| dc.contributor.author | Bosch, Samuel | |
| dc.contributor.author | Kiani, Bobak | |
| dc.contributor.author | Lloyd, Seth | |
| dc.contributor.author | Lupascu, Adrian | |
| dc.date.accessioned | 2024-03-25T17:40:18Z | |
| dc.date.available | 2024-03-25T17:40:18Z | |
| dc.date.issued | 2023-05-05 | |
| dc.identifier.issn | 2331-7019 | |
| dc.identifier.uri | https://hdl.handle.net/1721.1/153937 | |
| dc.description.abstract | Quantum machine learning has the potential to provide powerful algorithms for artificial intelligence. The pursuit of quantum advantage in quantum machine learning is an active area of research. For current noisy intermediate-scale quantum computers, various quantum-classical hybrid algorithms have been proposed. One such previously proposed hybrid algorithm is a gate-based variational embedding classifier, which is composed of a classical neural network and a parameterized gate-based quantum circuit. We propose a quantum variational embedding classifier based on an analog quantum computer, where control signals vary continuously in time: our particular focus is an implementation using quantum annealers. In our algorithm, the classical data are transformed into the parameters of the time-varying Hamiltonian of the analog quantum computer by a linear transformation. The nonlinearity needed for a nonlinear classification problem is purely provided by the analog quantum computer through the nonlinear dependence of the final quantum state on the control parameters of the Hamiltonian. We perform numerical simulations that demonstrate the effectiveness of our algorithm for performing binary and multiclass classification on linearly inseparable datasets such as concentric circles and MNIST digits. Our classifier can reach accuracy comparable with that of the best classical classifiers. We find that the performance of our classifier can be increased by increasing the number of qubits, until the performance saturates and fluctuates. Moreover, the number of optimization parameters of our classifier scales linearly with the number of qubits. The increase of the number of training parameters when the size of our model increases is therefore not as fast as that of a neural network. Our algorithm presents the possibility of using current quantum annealers for solving practical machine-learning problems, and it could also be useful to explore quantum advantage in quantum machine learning. | en_US |
| dc.language.iso | en | |
| dc.publisher | American Physical Society | en_US |
| dc.relation.isversionof | 10.1103/physrevapplied.19.054023 | en_US |
| dc.rights | Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use. | en_US |
| dc.source | American Physical Society | en_US |
| dc.subject | General Physics and Astronomy | en_US |
| dc.title | Analog Quantum Variational Embedding Classifier | en_US |
| dc.type | Article | en_US |
| dc.identifier.citation | Yang, Rui, Bosch, Samuel, Kiani, Bobak, Lloyd, Seth and Lupascu, Adrian. 2023. "Analog Quantum Variational Embedding Classifier." Physical Review Applied, 19 (5). | |
| dc.contributor.department | Massachusetts Institute of Technology. Department of Mechanical Engineering | |
| dc.relation.journal | Physical Review Applied | en_US |
| dc.eprint.version | Final published version | en_US |
| dc.type.uri | http://purl.org/eprint/type/JournalArticle | en_US |
| eprint.status | http://purl.org/eprint/status/PeerReviewed | en_US |
| dc.date.updated | 2024-03-25T17:34:36Z | |
| dspace.orderedauthors | Yang, R; Bosch, S; Kiani, B; Lloyd, S; Lupascu, A | en_US |
| dspace.date.submission | 2024-03-25T17:34:47Z | |
| mit.journal.volume | 19 | en_US |
| mit.journal.issue | 5 | en_US |
| mit.license | PUBLISHER_POLICY | |
| mit.metadata.status | Authority Work and Publication Information Needed | en_US |