# Sequential minimal optimization for quantum-classical hybrid algorithms

@article{Nakanishi2019SequentialMO,
title={Sequential minimal optimization for quantum-classical hybrid algorithms},
author={Ken Nakanishi and K. Fujii and S. Todo},
journal={arXiv: Quantum Physics},
year={2019}
}
• Published 2019
• Physics, Computer Science
• arXiv: Quantum Physics
We propose a sequential minimal optimization method for quantum-classical hybrid algorithms, which converges faster, is robust against statistical error, and is hyperparameter-free. Specifically, the optimization problem of the parameterized quantum circuits is divided into solvable subproblems by considering only a subset of the parameters. In fact, if we choose a single parameter, the cost function becomes a simple sine curve with period $2\pi$, and hence we can exactly minimize with respect… Expand

#### Figures and Topics from this paper

Multistart Methods for Quantum Approximate optimization
• Computer Science, Physics
• 2019 IEEE High Performance Extreme Computing Conference (HPEC)
• 2019
Variational Quantum Algorithms

#### References

SHOWING 1-10 OF 54 REFERENCES