Empirical Investigation of Quantum Computing Toolchains and Algorithms : Mining Stack Overflow Repository
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866914482093031424 |
|---|---|
| author | Sabzevari, Maryam Tavassoli Khan, Arif Ali |
| author_facet | Sabzevari, Maryam Tavassoli Khan, Arif Ali |
| contents | Quantum computing (QC) is increasingly transitioning toward practical and industrial adoption, highlighting the need to understand how developers engage with quantum technologies. In this study, we analyze 1,404 Stack Overflow posts related to quantum computing topics, including quantum programming, tools, and algorithms, to investigate real-world developer discussions. Using topic modeling and quantitative analysis, we identify the main discussion topics, their popularity, and the tools, programming languages, and quantum algorithms referenced by practitioners. We further assess the difficulty of developer questions using two metrics: (i) the percentage of questions without accepted answers and (ii) the median time required to receive an accepted answer. Our findings reveal seven main topics, with hybrid quantum--classical computing and quantum circuit implementation emerging as the most prevalent. We observe that Qiskit and Q-sharp dominate developer discussions, while Grover's and Shor's algorithms are the most frequently referenced. Moreover, our analysis highlights differences in engagement and difficulty across topics, tools, and algorithms, indicating varying levels of maturity and community support. These findings provide actionable insights for researchers, tool developers, and educators, supporting improvements in usability, documentation, and learning resources in quantum software engineering. To support transparency and reproducibility, the open-source dataset used in this study is publicly available at Zenodo. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2604_15512 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Empirical Investigation of Quantum Computing Toolchains and Algorithms : Mining Stack Overflow Repository Sabzevari, Maryam Tavassoli Khan, Arif Ali Software Engineering Quantum computing (QC) is increasingly transitioning toward practical and industrial adoption, highlighting the need to understand how developers engage with quantum technologies. In this study, we analyze 1,404 Stack Overflow posts related to quantum computing topics, including quantum programming, tools, and algorithms, to investigate real-world developer discussions. Using topic modeling and quantitative analysis, we identify the main discussion topics, their popularity, and the tools, programming languages, and quantum algorithms referenced by practitioners. We further assess the difficulty of developer questions using two metrics: (i) the percentage of questions without accepted answers and (ii) the median time required to receive an accepted answer. Our findings reveal seven main topics, with hybrid quantum--classical computing and quantum circuit implementation emerging as the most prevalent. We observe that Qiskit and Q-sharp dominate developer discussions, while Grover's and Shor's algorithms are the most frequently referenced. Moreover, our analysis highlights differences in engagement and difficulty across topics, tools, and algorithms, indicating varying levels of maturity and community support. These findings provide actionable insights for researchers, tool developers, and educators, supporting improvements in usability, documentation, and learning resources in quantum software engineering. To support transparency and reproducibility, the open-source dataset used in this study is publicly available at Zenodo. |
| title | Empirical Investigation of Quantum Computing Toolchains and Algorithms : Mining Stack Overflow Repository |
| topic | Software Engineering |
| url | https://arxiv.org/abs/2604.15512 |