Daniel Fortunato

Daniel Fortunato

Auto-generated profile, based on publicly available information

Daniel Fortunato

Faculty of Engineering of the University of Porto, Rua Dr. Roberto Frias, Porto, Portugal

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
29 July 2022 in IEEE Transactions on Quantum Engineering
Verified
Journal Article
Open access
DFDaniel Fortunato
Daniel Fortunato
JCJose Campos
Jose Campos
RARui Abreu
Rui Abreu
As quantum computing is still in its infancy, there is an inherent lack of knowledge and technology to test a quantum program properly. In the classical realm, mutation testing has been successfully used to evaluate how well a program's test suite detects seeded faults (i.e., mutants). In this article, building on the definition of syntactically equivalent quantum operations, we propose a novel set of mutation operators to generate mutants based on qubit measurements and quantum gates. To ease the adoption of quantum mutation testing, we further propose QMutPy, an extension of the well-known and fully automated open-source mutation tool MutPy. To evaluate QMutPy's performance, we conducted a case study on 24 real quantum programs written in IBM's Qiskit library. Furthermore, we show how better test suite coverage and improvements to test assertions can increase the test suites' mutation score and quality. QMutPy has proven to be an effective quantum mutation tool, providing insight into the current state of quantum tests and how to improve them.

24 October 2024
Verified
Conference Paper
Open access
GDGiordano D'Aloisio
Giordano D'Aloisio
SFSophie Fortz
Sophie Fortz
CHCarol Hanna
Carol Hanna
DFDaniel Fortunato
Daniel Fortunato
ABAvner Bensoussan
Avner Bensoussan
FSFederica Sarro
Federica Sarro
Background: Quantum computing is a rapidly growing new programming paradigm that brings significant changes to the design and implementation of algorithms. Understanding quantum algorithms requires knowledge of physics and mathematics, which can be challenging for software developers. Aims: In this work, we provide a first analysis of how LLMs can support developers’ understanding of quantum code. Method: We empirically analyse and compare the quality of explanations provided by three widely adopted LLMs (Gpt3.5, Llama2, and Tinyllama) using two different human-written prompt styles for seven state-of-the-art quantum algorithms. We also analyse how consistent LLM explanations are over multiple rounds and how LLMs can improve existing descriptions of quantum algorithms. Results: Llama2 provides the highest quality explanations from scratch, while Gpt3.5 emerged as the LLM best suited to improve existing explanations. In addition, we show that adding a small amount of context to the prompt significantly improves the quality of explanations. Finally, we observe how explanations are qualitatively and syntactically consistent over multiple rounds. Conclusions: This work highlights promising results, and opens challenges for future research in the field of LLMs for quantum code explanation. Future work includes refining the methods through prompt optimisation and parsing of quantum code explanations, as well as carrying out a systematic assessment of the quality of explanations.

16 July 2024
Verified
Conference Paper
Open access
DFDaniel Fortunato
Daniel Fortunato
JCJosé Campos
José Campos
RARui Abreu
Rui Abreu
The inherent lack of technologies and knowledge from software developers about the intricacies of quantum physics constitutes a heavy hindrance in the development of correct quantum software. Therefore, quantum computing testing techniques are currently under heavy research. This paper proposes a new testing metric, Gate Branch Coverage. This metric aims to provide insight into the verification process status of quantum programs and enhance the quantum testing process overall. Gate Branch Coverage explores the properties of quantum controlled-type gates, measuring their number of exercised branches during the execution of quantum programs.

10 March 2025 in IEEE Software
Verified
Journal Article
Closed access
BRBruno Rosendo
Bruno Rosendo
DFDaniel Fortunato
Daniel Fortunato
RARui Abreu
Rui Abreu
Transportation significantly impacts urban energy consumption and environmental sustainability, making optimization critical. Quantum computing provides a promising approach to improving transportation systems by tackling vehicle routing problem variations using the quadratic unconstrained binary optimization model.