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}
}
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
Multistart Methods for Quantum Approximate optimization
An evolving objective function for improved variational quantum optimisation
An Adaptive Optimizer for Measurement-Frugal Variational Algorithms
Hardware-efficient variational quantum algorithms for time evolution
Variational Quantum Algorithms
Problem-specific Entangler Circuits of the VQE Algorithm for Optimization Problems
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 54 REFERENCES
Hybrid Quantum-Classical Approach to Quantum Optimal Control.
A variational eigenvalue solver on a photonic quantum processor
Characterizing quantum supremacy in near-term devices
Quantum Circuit Learning
Supervised learning with quantum-enhanced feature spaces
...
1
2
3
4
5
...