Show simple item record

dc.contributor.authorYang, Rui
dc.contributor.authorBosch, Samuel
dc.contributor.authorKiani, Bobak
dc.contributor.authorLloyd, Seth
dc.contributor.authorLupascu, Adrian
dc.date.accessioned2024-03-25T17:40:18Z
dc.date.available2024-03-25T17:40:18Z
dc.date.issued2023-05-05
dc.identifier.issn2331-7019
dc.identifier.urihttps://hdl.handle.net/1721.1/153937
dc.description.abstractQuantum 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.isoen
dc.publisherAmerican Physical Societyen_US
dc.relation.isversionof10.1103/physrevapplied.19.054023en_US
dc.rightsArticle 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.sourceAmerican Physical Societyen_US
dc.subjectGeneral Physics and Astronomyen_US
dc.titleAnalog Quantum Variational Embedding Classifieren_US
dc.typeArticleen_US
dc.identifier.citationYang, Rui, Bosch, Samuel, Kiani, Bobak, Lloyd, Seth and Lupascu, Adrian. 2023. "Analog Quantum Variational Embedding Classifier." Physical Review Applied, 19 (5).
dc.contributor.departmentMassachusetts Institute of Technology. Department of Mechanical Engineering
dc.relation.journalPhysical Review Applieden_US
dc.eprint.versionFinal published versionen_US
dc.type.urihttp://purl.org/eprint/type/JournalArticleen_US
eprint.statushttp://purl.org/eprint/status/PeerRevieweden_US
dc.date.updated2024-03-25T17:34:36Z
dspace.orderedauthorsYang, R; Bosch, S; Kiani, B; Lloyd, S; Lupascu, Aen_US
dspace.date.submission2024-03-25T17:34:47Z
mit.journal.volume19en_US
mit.journal.issue5en_US
mit.licensePUBLISHER_POLICY
mit.metadata.statusAuthority Work and Publication Information Neededen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record