Correlation Between Two-Qubit Gate Complexity and Noise Robustness in NISQ Implementations of Shor’s Algorithm

AUTOR(I) / AUTHOR(S): Marko Mojsilović , Nikola Davidović

 

Download Full Pdf  

DOI: https://doi.org/10.46793/TIE26.223M

SAŽETAK /ABSTRACT:

In this paper, a simulation-based experimental analysis was conducted to assess the correlation between two-qubit gate complexity and noise robustness across different implementations of Shor’s algorithm. Compiled and generic circuits were implemented using Qiskit Aer simulators with several NISQ noise models, including depolarizing noise, phase damping, amplitude damping, and combined noise scenarios. The experimental evaluation measured the degradation of quantum phase-estimation distributions as the noise scale increased. The results were evaluated using various metrics, including expected-outcome probability, Shannon entropy, Hellinger fidelity, and peak contrast. The experiments compared compiled and generic order-finding circuits, analyzed multiple simulator seed choices, and investigated the impact of increasing quantum depth. The results show that noise robustness correlates more strongly with the number and depth of two-qubit operations than with total circuit depth alone. The generic implementation demonstrated significantly greater robustness against combined noise sources, despite having a larger overall circuit depth.

KLJUČNE REČI / KEYWORDS: 

Shor’s algorithm; Qiskit Aer; NISQ; quantum noise; two-qubit gates

 PROJEKAT / ACKNOWLEDGEMENT:

LITERATURA / REFERENCES:

• Deutsch, D. (1985). Quantum theory, the Church-Turing principle, and the universal quantum computer. Proceedings of the Royal Society of London. A, 400(1818), 97-117. DOI:10.1098/rspa.1985.0070
• Deutsch, D. & Jozsa, R. (1992). Rapid solution of problems by quantum computation. Proceedings of the Royal Society of London. A, 439(1907), 553-558. DOI:10.1098/rspa.1992.0167
• Grover, L. K. (1996). A fast quantum mechanical algorithm for database search. Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing, 212-219. DOI:10.1145/237814.237866
• Shor, P. W. (1997). Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Journal on Computing, 26(5), 1484-1509. DOI:10.1137/S0097539795293172
• Ladd, T. D., Jelezko, F., Laflamme, R., Nakamura, Y., Monroe, C. & O’Brien, J. L. (2010). Quantum computers. Nature, 464, 45-53. DOI:10.1038/nature08812
• Preskill, J. (2018). Quantum computing in the NISQ era and beyond. Quantum, 2, 79. DOI:10.22331/q-2018-08-06-79
• Barenco, A. and others. (1995). Elementary gates for quantum computation. Physical Review A, 52(5), 3457-3467. DOI:10.1103/PhysRevA.52.3457
• DiVincenzo, D. P. (2000). The physical implementation of quantum computation. Fortschritte der Physik, 48(9-11), 771-783. DOI:10.1002/1521-3978(200009)48:9/11<771::AID-PROP771>3.0.CO;2-E
• Temme, K., Bravyi, S. & Gambetta, J. M. (2017). Error mitigation for short-depth quantum circuits. Physical Review Letters, 119(18), 180509. DOI:10.1103/PhysRevLett.119.180509
• Li, Y. & Benjamin, S. C. (2017). Efficient variational quantum simulator incorporating active error minimization. Physical Review X, 7(2),021050. DOI:10.1103/PhysRevX.7.021050
• Li, A., Stein, S., Krishnamoorthy, S. & Ang, J. (2023). QASMBench: A low-level quantum benchmark suite for NISQ evaluation and simulation. ACM Transactions on Quantum Computing, 4(2), 1-26. DOI:10.1145/3550488
• Raussendorf, R. & Harrington, J. (2007). Fault-tolerant quantum computation with high threshold in two dimensions. Physical Review Letters, 98(19), 190504. DOI:10.1103/PhysRevLett.98.190504
• Fowler, A. G., Mariantoni, M., Martinis, J. M. & Cleland, A. N. (2012). Surface codes: Towards practical large-scale quantum computation. Physical Review A, 86(3), 032324. DOI:10.1103/PhysRevA.86.032324
• Abraham, H. and others. (2019). Qiskit: An open-source framework for quantum computing. Zenodo. DOI:10.5281/zenodo.2562110
• Shannon, C. E. (1948). A mathematical theory of communication. Bell System Technical Journal, 27(3), 379-423. DOI:10.1002/j.1538-7305.1948.tb01338.x
• Kullback, S. & Leibler, R. A. (1951). On information and sufficiency. The Annals of Mathematical Statistics, 22(1), 79-86. DOI:10.1214/aoms/1177729694
• Steane, A. M. (1996). Error correcting codes in quantum theory. Physical Review Letters, 77(5), 793-797. DOI:10.1103/PhysRevLett.77.793
• Knill, E. & Laflamme, R. (1997). Theory of quantum error-correcting codes. Physical Review A, 55(2), 900-911. DOI:10.1103/PhysRevA.55.900