Author:
Gyongyosi Laszlo,Imre Sandor
Abstract
AbstractThe entangled network structure of the quantum Internet formulates a high complexity routing space that is hard to explore. Scalable routing is a routing method that can determine an optimal routing at particular subnetwork conditions in the quantum Internet to perform a high-performance and low-complexity routing in the entangled structure. Here, we define a method for routing space exploration and scalable routing in the quantum Internet. We prove that scalable routing allows a compact and efficient routing in the entangled networks of the quantum Internet.
Publisher
Springer Science and Business Media LLC
Reference118 articles.
1. Arute, F. et al. Quantum supremacy using a programmable superconducting processor. Nature https://doi.org/10.1038/s41586-019-1666-5 (2019).
2. Preskill, J. Quantum computing in the NISQ era and beyond. Quantum 2, 79 (2018).
3. Harrow, A. W. & Montanaro, A. Quantum computational supremacy. Nature 549, 203–209 (2017).
4. Aaronson, S. & Chen, L. Complexity-theoretic foundations of quantum supremacy experiments. Proceedings of the 32nd Computational Complexity Conference, CCC’17, pp. 22:1–22:67 (2017).
5. Farhi, E., Goldstone & J., Gutmann, S. A quantum approximate optimization algorithm. arXiv:1411.4028v1 (2014).
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献