Author:
Gyongyosi Laszlo,Imre Sandor
Abstract
AbstractQuantum computers utilize the fundamentals of quantum mechanics to solve computational problems more efficiently than traditional computers. Gate-model quantum computers are fundamental to implement near-term quantum computer architectures and quantum devices. Here, a quantum algorithm is defined for the circuit depth reduction of gate-model quantum computers. The proposed solution evaluates the reduced time complexity equivalent of a reference quantum circuit. We prove the complexity of the quantum algorithm and the achievable reduction in circuit depth. The method provides a tractable solution to reduce the time complexity and physical layer costs of quantum computers.
Publisher
Springer Science and Business Media LLC
Reference105 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. 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, pages 22:1-22:67, (2017).
5. IBM. A new way of thinking: The IBM quantum experience, http://www.research.ibm.com/quantum (2017).
Cited by
28 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献