Analog quantum variational embedding classifier
arXiv:2211.02748 · doi:10.1103/PhysRevApplied.19.054023
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 (NISQ) 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. In our algorithm, the classical data is 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 performed numerical simulations that demonstrate the effectiveness of our algorithm for performing binary and multi-class classification on linearly inseparable datasets such as concentric circles and MNIST digits. Our classifier can reach accuracy comparable with the best classical classifiers. We find 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 number of training parameters when the size increases is therefore not as fast as that of 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.
References in corpus (17)
- Supplementary information for "Quantum supremacy using a programmable superconducting processor"
- Quantum Machine Learning
- Quantum Mechanics helps in searching for a needle in a haystack
- Variational Quantum Algorithms
- Surface codes: Towards practical large-scale quantum computation
- Supervised learning with quantum enhanced feature spaces
- Quantum support vector machine for big data classification
- Kernel methods in machine learning
- Quantum principal component analysis
- Strong quantum computational advantage using a superconducting quantum processor
- Quantum generative adversarial learning
- Perspectives of quantum annealing: Methods and implementations
- Exponential suppression of bit or phase flip errors with repetitive error correction
- Chopped random-basis quantum optimization
- One decade of quantum optimal control in the chopped random basis
- Recent advances for quantum classifiers
- Adiabatic Quantum Kitchen Sinks for Learning Kernels Using Randomized Features