Abstract
AbstractIn near-term quantum computers, the operations are realized by unitary quantum gates. The precise and stable working mechanism of quantum gates is essential for the implementation of any complex quantum computations. Here, we define a method for the unsupervised control of quantum gates in near-term quantum computers. We model a scenario in which a tensor product structure of non-stable quantum gates is not controllable in terms of control theory. We prove that the non-stable quantum gate becomes controllable via a machine learning method if the quantum gates formulate an entangled gate structure.
Publisher
Springer Science and Business Media LLC
Reference131 articles.
1. Preskill, J. Quantum Computing in the NISQ era and beyond. Quantum 2, 79 (2018).
2. Arute, F. et al. Quantum supremacy using a programmable superconducting processor, Nature, Vol 574, https://doi.org/10.1038/s41586-019-1666-5 (2019).
3. Aaronson, S. & Chen, L. Complexity-theoretic foundations of quantum supremacy experiments. Proceedings of the 32nd Computational Complexity Conference, CCC ’17, pages 22:1–22:67 (2017).
4. Harrow, A. W. & Montanaro, A. Quantum Computational Supremacy. Nature 549, 203–209 (2017).
5. Foxen, B. et al. Demonstrating a Continuous Set of Two-qubit Gates for Near-term Quantum Algorithms, arXiv:2001.08343 (2020).
Cited by
15 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献