2000 character limit reached
Dynamic Runtime Assertions in Quantum Ternary Systems (2312.15309v1)
Published 23 Dec 2023 in quant-ph and cs.ET
Abstract: With the rapid advancement of quantum computing technology, there is a growing need for new debugging tools for quantum programs. Recent research has highlighted the potential of assertions for debugging quantum programs. In this paper, we investigate assertions in quantum ternary systems, which are more challenging than those in quantum binary systems due to the complexity of ternary logic. We propose quantum ternary circuit designs to assert classical, entanglement, and superposition states, specifically geared toward debugging quantum ternary programs.
- A. De Vos and Y. Van Rentergem, “Multiple-valued reversible logic circuits.” Journal of Multiple-Valued Logic & Soft Computing, vol. 15, 2009.
- A. Muthukrishnan and C. R. Stroud Jr, “Multivalued logic gates for quantum computation,” Physical review A, vol. 62, no. 5, p. 052309, 2000.
- M. H. Khan and M. A. Perkowski, “Quantum ternary parallel adder/subtractor with partially-look-ahead carry,” Journal of Systems Architecture, vol. 53, no. 7, pp. 453–464, 2007.
- K. A. G. R. R. JC and C. Saavedra, “Qutrit quantum computer with trapped ions,” Phys. Rev. A, vol. 67, p. 062313, 2003.
- E. Faghih, M. Taheri, K. Navi, and N. Bagherzadeh, “Efficient realization of quantum balanced ternary reversible multiplier building blocks: A great step towards sustainable computing,” Sustainable Computing: Informatics and Systems, p. 100908, 2023.
- M. Haghparast, R. Wille, and A. T. Monfared, “Towards quantum reversible ternary coded decimal adder,” Quantum Information Processing, vol. 16, pp. 1–25, 2017.
- P. Gokhale, J. M. Baker, C. Duckering, N. C. Brown, K. R. Brown, and F. T. Chong, “Asymptotic improvements to quantum circuits via qutrits,” in Proceedings of the 46th International Symposium on Computer Architecture. ACM, jun 2019.
- Y. Huang and M. Martonosi, “Qdb: from quantum algorithms towards correct quantum programs,” arXiv preprint arXiv:1811.05447, 2018.
- J. Liu, G. T. Byrd, and H. Zhou, “Quantum circuits for dynamic runtime assertions in quantum computation,” in Proceedings of the Twenty-Fifth International Conference on Architectural Support for Programming Languages and Operating Systems, 2020, pp. 1017–1030.
- P. Li, J. Liu, Y. Li, and H. Zhou, “Exploiting quantum assertions for error mitigation and quantum program debugging,” in Proceedings of the 40th IEEE International Conference on Computer Design, 2022.
- M. Mohammadi and M. Eshghi, “On figures of merit in reversible and quantum logic designs,” Quantum Information Processing, vol. 8, pp. 297–318, 2009.
- D. Gottesman, “Fault-tolerant quantum computation with higher-dimensional systems,” in NASA International Conference on Quantum Computing and Quantum Communications. Springer, 1998, pp. 302–313.
- Y. Huang and M. Martonosi, “Statistical assertions for validating patterns and finding bugs in quantum programs,” in Proceedings of the 46th International Symposium on Computer Architecture, 2019, pp. 541–553.
- J. Liu and H. Zhou, “Systematic approaches for precise and approximate quantum state runtime assertion,” in 2021 IEEE International Symposium on High-Performance Computer Architecture (HPCA). IEEE, 2021, pp. 179–193.
- G. Li, L. Zhou, N. Yu, Y. Ding, M. Ying, and Y. Xie, “Projection-based runtime assertions for testing and debugging quantum programs,” Proceedings of the ACM on Programming Languages, vol. 4, no. OOPSLA, pp. 1–29, 2020.
- S. Çorbaci, M. D. Karakaş, and A. Gençten, “Construction of two qutrit entanglement by using magnetic resonance selective pulse sequences,” Journal of Physics: Conference Series, vol. 766, no. 1, p. 012014, oct 2016.