QP4SE '22: "Asserting the Correctness ..."
Asserting the Correctness of Shor Implementations using Metamorphic Testing
Nuno Costa
, João Paulo Fernandes , and Rui Abreu (University of Porto, Portugal)
Quantum computing is infused with an increased sense of anticipation and excitement. However, several obstacles need to be overcome before quantum computing can be widely adopted. One of these is determining whether or not a quantum program is behaving according to the expectation. There are several tried-and-true methods for identifying program flaws in the traditional world, but it is far from simple to adapt them to the quantum realm. In this paper, we explore Metamorphic Testing as a promising avenue. We explore this avenue on the well-known Shor's Algorithm, and show how it can be used to verify the validity of this testing approach on quantum algorithms.
@InProceedings{QP4SE22p32,
author = {Nuno Costa and João Paulo Fernandes and Rui Abreu},
title = {Asserting the Correctness of Shor Implementations using Metamorphic Testing},
booktitle = {Proc.\ QP4SE},
publisher = {ACM},
pages = {32--36},
doi = {10.1145/3549036.3562062},
year = {2022},
}
Publisher's Version
QP4SE '22: "Embracing Iterations in Quantum ..."
Embracing Iterations in Quantum Software: A Vision
Arif Ali Khan
, Mahdi Fahmideh , Aakash Ahmad, Muhammad Waseem , Mahmood Niazi , Valtteri Lahtinen , and Tommi Mikkonen (University of Oulu, Finland; University of Southern Queensland, Australia; Lancaster University Leipzig, Germany; Wuhan University, China; King Fahd University of Petroleum and Minerals, Saudi Arabia; Quanscient, Finland; University of Jyväskylä, Finland)
In today’s software engineering, iterations, affordable en masse, form an important part of just about any system. However, not all computing resources are cheap to consume. In High-Performance (HPC) and Quantum Computing (QC), executions can consume considerable amounts of energy and time, which is reserved and used even if the very first steps in the process fail. This means that developers must assume a different attitude towards programming, and aim at error-free software before its execution. This is commonly facilitated using simulators, which are commonplace for both HPC and QC. However the fashion developers advance from one tool to another is ad-hoc, with no established software engineering guidelines, and the final step from simulators to HPC/QC is still a leap of faith, comparable to releasing software. In this paper, we propose a vision where developers can iterate in an agile fashion when developing quantum software. The iterations are defined such that when the solution is still vague in the beginning, computations are interactive and provide instant feedback, thus supporting conceptualization of the software and experimenting with new ideas. When the solution becomes more precise, more expensive computations such as quantum algorithm and hyperparameter optimization are executed in batches.
@InProceedings{QP4SE22p11,
author = {Arif Ali Khan and Mahdi Fahmideh and Aakash Ahmad and Muhammad Waseem and Mahmood Niazi and Valtteri Lahtinen and Tommi Mikkonen},
title = {Embracing Iterations in Quantum Software: A Vision},
booktitle = {Proc.\ QP4SE},
publisher = {ACM},
pages = {11--14},
doi = {10.1145/3549036.3562057},
year = {2022},
}
Publisher's Version
QP4SE '22: "Quantum Optimization for Fast ..."
Quantum Optimization for Fast CAN Bus Intrusion Detection
Danilo Caivano
, Mirko De Vincentiis , Federica Nitti , and Anibrata Pal (University of Bari, Italy)
Modern vehicles, nowadays, come loaded with hundreds of different sensors generating a huge amount of data. This data is shared and processed among different Electronic Control Units (ECUs) through an in-vehicle network, such as the CAN bus, to improve the driver’s experience and safety. However, the implementation of new features increases exposure to cyber-attacks. The CAN bus, which is designed to grant reliable communication, has many security weaknesses that might be exploited by an attacker. The need for highly accurate real-time intrusion detection systems (IDSs) for the automotive industry is limited to classical machine learning techniques, which are usually time-consuming and have hardware limitations. In this work, we analyze an optimized and efficient version of a network-based IDS for CAN bus attack detection based on Quantum Annealing. The models were tested on two different CAN bus datasets. The results show that the Quantum Annealing algorithm outperforms a classical classification algorithm in terms of time performance, which is important in the identification of attacks in the automotive sector, and achieves similar results for detection accuracy.
@InProceedings{QP4SE22p15,
author = {Danilo Caivano and Mirko De Vincentiis and Federica Nitti and Anibrata Pal},
title = {Quantum Optimization for Fast CAN Bus Intrusion Detection},
booktitle = {Proc.\ QP4SE},
publisher = {ACM},
pages = {15--18},
doi = {10.1145/3549036.3562058},
year = {2022},
}
Publisher's Version
QP4SE '22: "QAI4ASE: Quantum Artificial ..."
QAI4ASE: Quantum Artificial Intelligence for Automotive Software Engineering
Mirko De Vincentiis
, Fabio Cassano, Alessandro Pagano, and Antonio Piccinno(University of Bari, Italy)
Nowadays, the size and complexity of the automotive development life-cycle increase the possibility of cyber-attacks. In this context, team developers play a primary role in managing cyber security, risk assessment, and all phases of software application development (concept phases, product development, cyber security validation, production, operations, and maintenance). Currently, only generic standards exist and they are difficult to put into operation due to the lack of the required skills and knowledge. Therefore, this paper presents a vision model based on Quantum Artificial Intelligence that supports developers' decisions to integrate concrete design methods in the automotive development life-cycle. Organizations need to develop their process for developing vehicle components that comply with the new automotive standards. We suggest the usage of existing data sources (e.g., existing taxonomies) on Quantum Artificial Intelligence algorithms to suggest the best way, or the correct steps, to follow time by time to achieve user solutions.
@InProceedings{QP4SE22p19,
author = {Mirko De Vincentiis and Fabio Cassano and Alessandro Pagano and Antonio Piccinno},
title = {QAI4ASE: Quantum Artificial Intelligence for Automotive Software Engineering},
booktitle = {Proc.\ QP4SE},
publisher = {ACM},
pages = {19--21},
doi = {10.1145/3549036.3562059},
year = {2022},
}
Publisher's Version
QP4SE '22: "Asserting the Correctness ..."
Asserting the Correctness of Shor Implementations using Metamorphic Testing
Nuno Costa
, João Paulo Fernandes , and Rui Abreu (University of Porto, Portugal)
Quantum computing is infused with an increased sense of anticipation and excitement. However, several obstacles need to be overcome before quantum computing can be widely adopted. One of these is determining whether or not a quantum program is behaving according to the expectation. There are several tried-and-true methods for identifying program flaws in the traditional world, but it is far from simple to adapt them to the quantum realm. In this paper, we explore Metamorphic Testing as a promising avenue. We explore this avenue on the well-known Shor's Algorithm, and show how it can be used to verify the validity of this testing approach on quantum algorithms.
@InProceedings{QP4SE22p32,
author = {Nuno Costa and João Paulo Fernandes and Rui Abreu},
title = {Asserting the Correctness of Shor Implementations using Metamorphic Testing},
booktitle = {Proc.\ QP4SE},
publisher = {ACM},
pages = {32--36},
doi = {10.1145/3549036.3562062},
year = {2022},
}
Publisher's Version
QP4SE '22: "Towards Quantum-Algorithms-as-a-Service ..."
Towards Quantum-Algorithms-as-a-Service
Manuel De Stefano
, Dario Di Nucci , Fabio Palomba , Davide Taibi , and Andrea De Lucia (University of Salerno, Italy; Tampere University of Technology, Finland)
Quantum computing is an emerging field of high interest. Many companies have started to work on developing more powerful and stable quantum computers. However, developers still struggle to master the art of programming with a quantum computer. One of the major challenges faced is the integration of quantum parts of a system with the classical one. This paper proposes a novel development model called Quantum-Algorithms-as-a-Service (QAaaS). This new model aims to allow developers to abstract the quantum components away from the design of the software they are building. The model leverages Software-as-a-Service and Function-as-a-Service to support multiple quantum cloud providers and run their algorithms regardless of the underlying hardware.
@InProceedings{QP4SE22p7,
author = {Manuel De Stefano and Dario Di Nucci and Fabio Palomba and Davide Taibi and Andrea De Lucia},
title = {Towards Quantum-Algorithms-as-a-Service},
booktitle = {Proc.\ QP4SE},
publisher = {ACM},
pages = {7--10},
doi = {10.1145/3549036.3562056},
year = {2022},
}
Publisher's Version
QP4SE '22: "Towards Quantum-Algorithms-as-a-Service ..."
Towards Quantum-Algorithms-as-a-Service
Manuel De Stefano
, Dario Di Nucci , Fabio Palomba , Davide Taibi , and Andrea De Lucia (University of Salerno, Italy; Tampere University of Technology, Finland)
Quantum computing is an emerging field of high interest. Many companies have started to work on developing more powerful and stable quantum computers. However, developers still struggle to master the art of programming with a quantum computer. One of the major challenges faced is the integration of quantum parts of a system with the classical one. This paper proposes a novel development model called Quantum-Algorithms-as-a-Service (QAaaS). This new model aims to allow developers to abstract the quantum components away from the design of the software they are building. The model leverages Software-as-a-Service and Function-as-a-Service to support multiple quantum cloud providers and run their algorithms regardless of the underlying hardware.
@InProceedings{QP4SE22p7,
author = {Manuel De Stefano and Dario Di Nucci and Fabio Palomba and Davide Taibi and Andrea De Lucia},
title = {Towards Quantum-Algorithms-as-a-Service},
booktitle = {Proc.\ QP4SE},
publisher = {ACM},
pages = {7--10},
doi = {10.1145/3549036.3562056},
year = {2022},
}
Publisher's Version
QP4SE '22: "QAI4ASE: Quantum Artificial ..."
QAI4ASE: Quantum Artificial Intelligence for Automotive Software Engineering
Mirko De Vincentiis
, Fabio Cassano, Alessandro Pagano, and Antonio Piccinno(University of Bari, Italy)
Nowadays, the size and complexity of the automotive development life-cycle increase the possibility of cyber-attacks. In this context, team developers play a primary role in managing cyber security, risk assessment, and all phases of software application development (concept phases, product development, cyber security validation, production, operations, and maintenance). Currently, only generic standards exist and they are difficult to put into operation due to the lack of the required skills and knowledge. Therefore, this paper presents a vision model based on Quantum Artificial Intelligence that supports developers' decisions to integrate concrete design methods in the automotive development life-cycle. Organizations need to develop their process for developing vehicle components that comply with the new automotive standards. We suggest the usage of existing data sources (e.g., existing taxonomies) on Quantum Artificial Intelligence algorithms to suggest the best way, or the correct steps, to follow time by time to achieve user solutions.
@InProceedings{QP4SE22p19,
author = {Mirko De Vincentiis and Fabio Cassano and Alessandro Pagano and Antonio Piccinno},
title = {QAI4ASE: Quantum Artificial Intelligence for Automotive Software Engineering},
booktitle = {Proc.\ QP4SE},
publisher = {ACM},
pages = {19--21},
doi = {10.1145/3549036.3562059},
year = {2022},
}
Publisher's Version
QP4SE '22: "Quantum Optimization for Fast ..."
Quantum Optimization for Fast CAN Bus Intrusion Detection
Danilo Caivano
, Mirko De Vincentiis , Federica Nitti , and Anibrata Pal (University of Bari, Italy)
Modern vehicles, nowadays, come loaded with hundreds of different sensors generating a huge amount of data. This data is shared and processed among different Electronic Control Units (ECUs) through an in-vehicle network, such as the CAN bus, to improve the driver’s experience and safety. However, the implementation of new features increases exposure to cyber-attacks. The CAN bus, which is designed to grant reliable communication, has many security weaknesses that might be exploited by an attacker. The need for highly accurate real-time intrusion detection systems (IDSs) for the automotive industry is limited to classical machine learning techniques, which are usually time-consuming and have hardware limitations. In this work, we analyze an optimized and efficient version of a network-based IDS for CAN bus attack detection based on Quantum Annealing. The models were tested on two different CAN bus datasets. The results show that the Quantum Annealing algorithm outperforms a classical classification algorithm in terms of time performance, which is important in the identification of attacks in the automotive sector, and achieves similar results for detection accuracy.
@InProceedings{QP4SE22p15,
author = {Danilo Caivano and Mirko De Vincentiis and Federica Nitti and Anibrata Pal},
title = {Quantum Optimization for Fast CAN Bus Intrusion Detection},
booktitle = {Proc.\ QP4SE},
publisher = {ACM},
pages = {15--18},
doi = {10.1145/3549036.3562058},
year = {2022},
}
Publisher's Version
QP4SE '22: "Towards Quantum-Algorithms-as-a-Service ..."
Towards Quantum-Algorithms-as-a-Service
Manuel De Stefano
, Dario Di Nucci , Fabio Palomba , Davide Taibi , and Andrea De Lucia (University of Salerno, Italy; Tampere University of Technology, Finland)
Quantum computing is an emerging field of high interest. Many companies have started to work on developing more powerful and stable quantum computers. However, developers still struggle to master the art of programming with a quantum computer. One of the major challenges faced is the integration of quantum parts of a system with the classical one. This paper proposes a novel development model called Quantum-Algorithms-as-a-Service (QAaaS). This new model aims to allow developers to abstract the quantum components away from the design of the software they are building. The model leverages Software-as-a-Service and Function-as-a-Service to support multiple quantum cloud providers and run their algorithms regardless of the underlying hardware.
@InProceedings{QP4SE22p7,
author = {Manuel De Stefano and Dario Di Nucci and Fabio Palomba and Davide Taibi and Andrea De Lucia},
title = {Towards Quantum-Algorithms-as-a-Service},
booktitle = {Proc.\ QP4SE},
publisher = {ACM},
pages = {7--10},
doi = {10.1145/3549036.3562056},
year = {2022},
}
Publisher's Version
QP4SE '22: "Embracing Iterations in Quantum ..."
Embracing Iterations in Quantum Software: A Vision
Arif Ali Khan
, Mahdi Fahmideh , Aakash Ahmad, Muhammad Waseem , Mahmood Niazi , Valtteri Lahtinen , and Tommi Mikkonen (University of Oulu, Finland; University of Southern Queensland, Australia; Lancaster University Leipzig, Germany; Wuhan University, China; King Fahd University of Petroleum and Minerals, Saudi Arabia; Quanscient, Finland; University of Jyväskylä, Finland)
In today’s software engineering, iterations, affordable en masse, form an important part of just about any system. However, not all computing resources are cheap to consume. In High-Performance (HPC) and Quantum Computing (QC), executions can consume considerable amounts of energy and time, which is reserved and used even if the very first steps in the process fail. This means that developers must assume a different attitude towards programming, and aim at error-free software before its execution. This is commonly facilitated using simulators, which are commonplace for both HPC and QC. However the fashion developers advance from one tool to another is ad-hoc, with no established software engineering guidelines, and the final step from simulators to HPC/QC is still a leap of faith, comparable to releasing software. In this paper, we propose a vision where developers can iterate in an agile fashion when developing quantum software. The iterations are defined such that when the solution is still vague in the beginning, computations are interactive and provide instant feedback, thus supporting conceptualization of the software and experimenting with new ideas. When the solution becomes more precise, more expensive computations such as quantum algorithm and hyperparameter optimization are executed in batches.
@InProceedings{QP4SE22p11,
author = {Arif Ali Khan and Mahdi Fahmideh and Aakash Ahmad and Muhammad Waseem and Mahmood Niazi and Valtteri Lahtinen and Tommi Mikkonen},
title = {Embracing Iterations in Quantum Software: A Vision},
booktitle = {Proc.\ QP4SE},
publisher = {ACM},
pages = {11--14},
doi = {10.1145/3549036.3562057},
year = {2022},
}
Publisher's Version
QP4SE '22: "Quantum Computing for Software ..."
Quantum Computing for Software Engineering: Prospects
Andriy Miranskyy, Mushahid Khan
, Jean Paul Latyr Faye , and Udson C. Mendes (Ryerson University, Canada; CMC Microsystems, Canada)
Quantum computers (QCs) are maturing. When QCs are powerful enough, they may be able to handle problems in chemistry, physics, and finance that are not classically solvable. However, the applicability of quantum algorithms to speed up Software Engineering (SE) tasks has not been explored. We examine eight groups of quantum algorithms that may accelerate SE tasks across the different phases of SE and sketch potential opportunities and challenges.
@InProceedings{QP4SE22p22,
author = {Andriy Miranskyy and Mushahid Khan and Jean Paul Latyr Faye and Udson C. Mendes},
title = {Quantum Computing for Software Engineering: Prospects},
booktitle = {Proc.\ QP4SE},
publisher = {ACM},
pages = {22--25},
doi = {10.1145/3549036.3562060},
year = {2022},
}
Publisher's Version
QP4SE '22: "Asserting the Correctness ..."
Asserting the Correctness of Shor Implementations using Metamorphic Testing
Nuno Costa
, João Paulo Fernandes , and Rui Abreu (University of Porto, Portugal)
Quantum computing is infused with an increased sense of anticipation and excitement. However, several obstacles need to be overcome before quantum computing can be widely adopted. One of these is determining whether or not a quantum program is behaving according to the expectation. There are several tried-and-true methods for identifying program flaws in the traditional world, but it is far from simple to adapt them to the quantum realm. In this paper, we explore Metamorphic Testing as a promising avenue. We explore this avenue on the well-known Shor's Algorithm, and show how it can be used to verify the validity of this testing approach on quantum algorithms.
@InProceedings{QP4SE22p32,
author = {Nuno Costa and João Paulo Fernandes and Rui Abreu},
title = {Asserting the Correctness of Shor Implementations using Metamorphic Testing},
booktitle = {Proc.\ QP4SE},
publisher = {ACM},
pages = {32--36},
doi = {10.1145/3549036.3562062},
year = {2022},
}
Publisher's Version
QP4SE '22: "Automatic Generation of Test ..."
Automatic Generation of Test Circuits for the Verification of Quantum Deterministic Algorithms
Antonio García de la Barrera Amo
, Manuel A. Serrano , Ignacio García Rodríguez de Guzmán , Macario Polo , and Mario Piattini (University of Castilla-La Mancha, Spain)
Quantum computing will make it possible to exponentially accelerate the performance of a wide range of computational problems, such as cryptography, machine learning or chemical simulation. However, the quantum potential is not only a matter of hardware, but also of software. Therefore, this new paradigm has an impact yet to be explored on software development processes and techniques, and the adaptation of classical software engineering to the new classical/quantum hybrid systems raises a number of important challenges: a new Quantum Software Engineering is therefore needed. Specifically, and focusing on quantum software quality, software verification remains an open research question, as its novelty and complexity make quantum software development a particularly error-prone process. Most current approaches to test-driven verification rely heavily on simulations, which is a problem due to the lack of scalability of simulators running on classical computers. To address this shortcoming, we define the concept of a "Quantum Test Case", and then present a method to test quantum circuits on real machines, without using simulation test functionalities such as amplitude calculation or non-destructive measurement. This is achieved by automatically generating a Quantum Test Case, which wraps the circuit under test and performs the verification. We also present the process to run a set of tests on a circuit with this method, along with an example to illustrate the technique.
@InProceedings{QP4SE22p1,
author = {Antonio García de la Barrera Amo and Manuel A. Serrano and Ignacio García Rodríguez de Guzmán and Macario Polo and Mario Piattini},
title = {Automatic Generation of Test Circuits for the Verification of Quantum Deterministic Algorithms},
booktitle = {Proc.\ QP4SE},
publisher = {ACM},
pages = {1--6},
doi = {10.1145/3549036.3562055},
year = {2022},
}
Publisher's Version
QP4SE '22: "Automatic Generation of Test ..."
Automatic Generation of Test Circuits for the Verification of Quantum Deterministic Algorithms
Antonio García de la Barrera Amo
, Manuel A. Serrano , Ignacio García Rodríguez de Guzmán , Macario Polo , and Mario Piattini (University of Castilla-La Mancha, Spain)
Quantum computing will make it possible to exponentially accelerate the performance of a wide range of computational problems, such as cryptography, machine learning or chemical simulation. However, the quantum potential is not only a matter of hardware, but also of software. Therefore, this new paradigm has an impact yet to be explored on software development processes and techniques, and the adaptation of classical software engineering to the new classical/quantum hybrid systems raises a number of important challenges: a new Quantum Software Engineering is therefore needed. Specifically, and focusing on quantum software quality, software verification remains an open research question, as its novelty and complexity make quantum software development a particularly error-prone process. Most current approaches to test-driven verification rely heavily on simulations, which is a problem due to the lack of scalability of simulators running on classical computers. To address this shortcoming, we define the concept of a "Quantum Test Case", and then present a method to test quantum circuits on real machines, without using simulation test functionalities such as amplitude calculation or non-destructive measurement. This is achieved by automatically generating a Quantum Test Case, which wraps the circuit under test and performs the verification. We also present the process to run a set of tests on a circuit with this method, along with an example to illustrate the technique.
@InProceedings{QP4SE22p1,
author = {Antonio García de la Barrera Amo and Manuel A. Serrano and Ignacio García Rodríguez de Guzmán and Macario Polo and Mario Piattini},
title = {Automatic Generation of Test Circuits for the Verification of Quantum Deterministic Algorithms},
booktitle = {Proc.\ QP4SE},
publisher = {ACM},
pages = {1--6},
doi = {10.1145/3549036.3562055},
year = {2022},
}
Publisher's Version
QP4SE '22: "Embracing Iterations in Quantum ..."
Embracing Iterations in Quantum Software: A Vision
Arif Ali Khan
, Mahdi Fahmideh , Aakash Ahmad, Muhammad Waseem , Mahmood Niazi , Valtteri Lahtinen , and Tommi Mikkonen (University of Oulu, Finland; University of Southern Queensland, Australia; Lancaster University Leipzig, Germany; Wuhan University, China; King Fahd University of Petroleum and Minerals, Saudi Arabia; Quanscient, Finland; University of Jyväskylä, Finland)
In today’s software engineering, iterations, affordable en masse, form an important part of just about any system. However, not all computing resources are cheap to consume. In High-Performance (HPC) and Quantum Computing (QC), executions can consume considerable amounts of energy and time, which is reserved and used even if the very first steps in the process fail. This means that developers must assume a different attitude towards programming, and aim at error-free software before its execution. This is commonly facilitated using simulators, which are commonplace for both HPC and QC. However the fashion developers advance from one tool to another is ad-hoc, with no established software engineering guidelines, and the final step from simulators to HPC/QC is still a leap of faith, comparable to releasing software. In this paper, we propose a vision where developers can iterate in an agile fashion when developing quantum software. The iterations are defined such that when the solution is still vague in the beginning, computations are interactive and provide instant feedback, thus supporting conceptualization of the software and experimenting with new ideas. When the solution becomes more precise, more expensive computations such as quantum algorithm and hyperparameter optimization are executed in batches.
@InProceedings{QP4SE22p11,
author = {Arif Ali Khan and Mahdi Fahmideh and Aakash Ahmad and Muhammad Waseem and Mahmood Niazi and Valtteri Lahtinen and Tommi Mikkonen},
title = {Embracing Iterations in Quantum Software: A Vision},
booktitle = {Proc.\ QP4SE},
publisher = {ACM},
pages = {11--14},
doi = {10.1145/3549036.3562057},
year = {2022},
}
Publisher's Version
QP4SE '22: "Quantum Computing for Software ..."
Quantum Computing for Software Engineering: Prospects
Andriy Miranskyy, Mushahid Khan
, Jean Paul Latyr Faye , and Udson C. Mendes (Ryerson University, Canada; CMC Microsystems, Canada)
Quantum computers (QCs) are maturing. When QCs are powerful enough, they may be able to handle problems in chemistry, physics, and finance that are not classically solvable. However, the applicability of quantum algorithms to speed up Software Engineering (SE) tasks has not been explored. We examine eight groups of quantum algorithms that may accelerate SE tasks across the different phases of SE and sketch potential opportunities and challenges.
@InProceedings{QP4SE22p22,
author = {Andriy Miranskyy and Mushahid Khan and Jean Paul Latyr Faye and Udson C. Mendes},
title = {Quantum Computing for Software Engineering: Prospects},
booktitle = {Proc.\ QP4SE},
publisher = {ACM},
pages = {22--25},
doi = {10.1145/3549036.3562060},
year = {2022},
}
Publisher's Version
QP4SE '22: "Embracing Iterations in Quantum ..."
Embracing Iterations in Quantum Software: A Vision
Arif Ali Khan
, Mahdi Fahmideh , Aakash Ahmad, Muhammad Waseem , Mahmood Niazi , Valtteri Lahtinen , and Tommi Mikkonen (University of Oulu, Finland; University of Southern Queensland, Australia; Lancaster University Leipzig, Germany; Wuhan University, China; King Fahd University of Petroleum and Minerals, Saudi Arabia; Quanscient, Finland; University of Jyväskylä, Finland)
In today’s software engineering, iterations, affordable en masse, form an important part of just about any system. However, not all computing resources are cheap to consume. In High-Performance (HPC) and Quantum Computing (QC), executions can consume considerable amounts of energy and time, which is reserved and used even if the very first steps in the process fail. This means that developers must assume a different attitude towards programming, and aim at error-free software before its execution. This is commonly facilitated using simulators, which are commonplace for both HPC and QC. However the fashion developers advance from one tool to another is ad-hoc, with no established software engineering guidelines, and the final step from simulators to HPC/QC is still a leap of faith, comparable to releasing software. In this paper, we propose a vision where developers can iterate in an agile fashion when developing quantum software. The iterations are defined such that when the solution is still vague in the beginning, computations are interactive and provide instant feedback, thus supporting conceptualization of the software and experimenting with new ideas. When the solution becomes more precise, more expensive computations such as quantum algorithm and hyperparameter optimization are executed in batches.
@InProceedings{QP4SE22p11,
author = {Arif Ali Khan and Mahdi Fahmideh and Aakash Ahmad and Muhammad Waseem and Mahmood Niazi and Valtteri Lahtinen and Tommi Mikkonen},
title = {Embracing Iterations in Quantum Software: A Vision},
booktitle = {Proc.\ QP4SE},
publisher = {ACM},
pages = {11--14},
doi = {10.1145/3549036.3562057},
year = {2022},
}
Publisher's Version
QP4SE '22: "Quantum Computing for Software ..."
Quantum Computing for Software Engineering: Prospects
Andriy Miranskyy, Mushahid Khan
, Jean Paul Latyr Faye , and Udson C. Mendes (Ryerson University, Canada; CMC Microsystems, Canada)
Quantum computers (QCs) are maturing. When QCs are powerful enough, they may be able to handle problems in chemistry, physics, and finance that are not classically solvable. However, the applicability of quantum algorithms to speed up Software Engineering (SE) tasks has not been explored. We examine eight groups of quantum algorithms that may accelerate SE tasks across the different phases of SE and sketch potential opportunities and challenges.
@InProceedings{QP4SE22p22,
author = {Andriy Miranskyy and Mushahid Khan and Jean Paul Latyr Faye and Udson C. Mendes},
title = {Quantum Computing for Software Engineering: Prospects},
booktitle = {Proc.\ QP4SE},
publisher = {ACM},
pages = {22--25},
doi = {10.1145/3549036.3562060},
year = {2022},
}
Publisher's Version
QP4SE '22: "Embracing Iterations in Quantum ..."
Embracing Iterations in Quantum Software: A Vision
Arif Ali Khan
, Mahdi Fahmideh , Aakash Ahmad, Muhammad Waseem , Mahmood Niazi , Valtteri Lahtinen , and Tommi Mikkonen (University of Oulu, Finland; University of Southern Queensland, Australia; Lancaster University Leipzig, Germany; Wuhan University, China; King Fahd University of Petroleum and Minerals, Saudi Arabia; Quanscient, Finland; University of Jyväskylä, Finland)
In today’s software engineering, iterations, affordable en masse, form an important part of just about any system. However, not all computing resources are cheap to consume. In High-Performance (HPC) and Quantum Computing (QC), executions can consume considerable amounts of energy and time, which is reserved and used even if the very first steps in the process fail. This means that developers must assume a different attitude towards programming, and aim at error-free software before its execution. This is commonly facilitated using simulators, which are commonplace for both HPC and QC. However the fashion developers advance from one tool to another is ad-hoc, with no established software engineering guidelines, and the final step from simulators to HPC/QC is still a leap of faith, comparable to releasing software. In this paper, we propose a vision where developers can iterate in an agile fashion when developing quantum software. The iterations are defined such that when the solution is still vague in the beginning, computations are interactive and provide instant feedback, thus supporting conceptualization of the software and experimenting with new ideas. When the solution becomes more precise, more expensive computations such as quantum algorithm and hyperparameter optimization are executed in batches.
@InProceedings{QP4SE22p11,
author = {Arif Ali Khan and Mahdi Fahmideh and Aakash Ahmad and Muhammad Waseem and Mahmood Niazi and Valtteri Lahtinen and Tommi Mikkonen},
title = {Embracing Iterations in Quantum Software: A Vision},
booktitle = {Proc.\ QP4SE},
publisher = {ACM},
pages = {11--14},
doi = {10.1145/3549036.3562057},
year = {2022},
}
Publisher's Version
QP4SE '22: "Quantum Computing for Software ..."
Quantum Computing for Software Engineering: Prospects
Andriy Miranskyy, Mushahid Khan
, Jean Paul Latyr Faye , and Udson C. Mendes (Ryerson University, Canada; CMC Microsystems, Canada)
Quantum computers (QCs) are maturing. When QCs are powerful enough, they may be able to handle problems in chemistry, physics, and finance that are not classically solvable. However, the applicability of quantum algorithms to speed up Software Engineering (SE) tasks has not been explored. We examine eight groups of quantum algorithms that may accelerate SE tasks across the different phases of SE and sketch potential opportunities and challenges.
@InProceedings{QP4SE22p22,
author = {Andriy Miranskyy and Mushahid Khan and Jean Paul Latyr Faye and Udson C. Mendes},
title = {Quantum Computing for Software Engineering: Prospects},
booktitle = {Proc.\ QP4SE},
publisher = {ACM},
pages = {22--25},
doi = {10.1145/3549036.3562060},
year = {2022},
}
Publisher's Version
QP4SE '22: "Using Quantum Computers to ..."
Using Quantum Computers to Speed Up Dynamic Testing of Software
Andriy Miranskyy
(Ryerson University, Canada)
Software under test can be analyzed dynamically, while it is being executed, to find defects. However, as the number and possible values of input parameters increase, the cost of dynamic testing rises.
This paper examines whether quantum computers (QCs) can help speed up the dynamic testing of programs written for classical computers (CCs). To accomplish this, an approach is devised involving the following three steps: (1) converting a classical program to a quantum program; (2) computing the number of inputs causing errors, denoted by K, using a quantum counting algorithm; and (3) obtaining the actual values of these inputs using Grover’s search algorithm.
This approach can accelerate exhaustive and non-exhaustive dynamic testing techniques. On the CC, the computational complexity of these techniques is O(N), where N represents the count of combinations of input parameter values passed to the software under test. In contrast, on the QC, the complexity is O(ε−1 √N/K), where ε is a relative error of measuring K.
The paper illustrates how the approach can be applied and discusses its limitations. Moreover, it provides a toy example executed on a simulator and an actual QC. This paper may be of interest to academics and practitioners as the approach presented in the paper may serve as a starting point for exploring the use of QC for dynamic testing of CC code.
@InProceedings{QP4SE22p26,
author = {Andriy Miranskyy},
title = {Using Quantum Computers to Speed Up Dynamic Testing of Software},
booktitle = {Proc.\ QP4SE},
publisher = {ACM},
pages = {26--31},
doi = {10.1145/3549036.3562061},
year = {2022},
}
Publisher's Version
QP4SE '22: "Embracing Iterations in Quantum ..."
Embracing Iterations in Quantum Software: A Vision
Arif Ali Khan
, Mahdi Fahmideh , Aakash Ahmad, Muhammad Waseem , Mahmood Niazi , Valtteri Lahtinen , and Tommi Mikkonen (University of Oulu, Finland; University of Southern Queensland, Australia; Lancaster University Leipzig, Germany; Wuhan University, China; King Fahd University of Petroleum and Minerals, Saudi Arabia; Quanscient, Finland; University of Jyväskylä, Finland)
In today’s software engineering, iterations, affordable en masse, form an important part of just about any system. However, not all computing resources are cheap to consume. In High-Performance (HPC) and Quantum Computing (QC), executions can consume considerable amounts of energy and time, which is reserved and used even if the very first steps in the process fail. This means that developers must assume a different attitude towards programming, and aim at error-free software before its execution. This is commonly facilitated using simulators, which are commonplace for both HPC and QC. However the fashion developers advance from one tool to another is ad-hoc, with no established software engineering guidelines, and the final step from simulators to HPC/QC is still a leap of faith, comparable to releasing software. In this paper, we propose a vision where developers can iterate in an agile fashion when developing quantum software. The iterations are defined such that when the solution is still vague in the beginning, computations are interactive and provide instant feedback, thus supporting conceptualization of the software and experimenting with new ideas. When the solution becomes more precise, more expensive computations such as quantum algorithm and hyperparameter optimization are executed in batches.
@InProceedings{QP4SE22p11,
author = {Arif Ali Khan and Mahdi Fahmideh and Aakash Ahmad and Muhammad Waseem and Mahmood Niazi and Valtteri Lahtinen and Tommi Mikkonen},
title = {Embracing Iterations in Quantum Software: A Vision},
booktitle = {Proc.\ QP4SE},
publisher = {ACM},
pages = {11--14},
doi = {10.1145/3549036.3562057},
year = {2022},
}
Publisher's Version
QP4SE '22: "Quantum Optimization for Fast ..."
Quantum Optimization for Fast CAN Bus Intrusion Detection
Danilo Caivano
, Mirko De Vincentiis , Federica Nitti , and Anibrata Pal (University of Bari, Italy)
Modern vehicles, nowadays, come loaded with hundreds of different sensors generating a huge amount of data. This data is shared and processed among different Electronic Control Units (ECUs) through an in-vehicle network, such as the CAN bus, to improve the driver’s experience and safety. However, the implementation of new features increases exposure to cyber-attacks. The CAN bus, which is designed to grant reliable communication, has many security weaknesses that might be exploited by an attacker. The need for highly accurate real-time intrusion detection systems (IDSs) for the automotive industry is limited to classical machine learning techniques, which are usually time-consuming and have hardware limitations. In this work, we analyze an optimized and efficient version of a network-based IDS for CAN bus attack detection based on Quantum Annealing. The models were tested on two different CAN bus datasets. The results show that the Quantum Annealing algorithm outperforms a classical classification algorithm in terms of time performance, which is important in the identification of attacks in the automotive sector, and achieves similar results for detection accuracy.
@InProceedings{QP4SE22p15,
author = {Danilo Caivano and Mirko De Vincentiis and Federica Nitti and Anibrata Pal},
title = {Quantum Optimization for Fast CAN Bus Intrusion Detection},
booktitle = {Proc.\ QP4SE},
publisher = {ACM},
pages = {15--18},
doi = {10.1145/3549036.3562058},
year = {2022},
}
Publisher's Version
QP4SE '22: "QAI4ASE: Quantum Artificial ..."
QAI4ASE: Quantum Artificial Intelligence for Automotive Software Engineering
Mirko De Vincentiis
, Fabio Cassano, Alessandro Pagano, and Antonio Piccinno(University of Bari, Italy)
Nowadays, the size and complexity of the automotive development life-cycle increase the possibility of cyber-attacks. In this context, team developers play a primary role in managing cyber security, risk assessment, and all phases of software application development (concept phases, product development, cyber security validation, production, operations, and maintenance). Currently, only generic standards exist and they are difficult to put into operation due to the lack of the required skills and knowledge. Therefore, this paper presents a vision model based on Quantum Artificial Intelligence that supports developers' decisions to integrate concrete design methods in the automotive development life-cycle. Organizations need to develop their process for developing vehicle components that comply with the new automotive standards. We suggest the usage of existing data sources (e.g., existing taxonomies) on Quantum Artificial Intelligence algorithms to suggest the best way, or the correct steps, to follow time by time to achieve user solutions.
@InProceedings{QP4SE22p19,
author = {Mirko De Vincentiis and Fabio Cassano and Alessandro Pagano and Antonio Piccinno},
title = {QAI4ASE: Quantum Artificial Intelligence for Automotive Software Engineering},
booktitle = {Proc.\ QP4SE},
publisher = {ACM},
pages = {19--21},
doi = {10.1145/3549036.3562059},
year = {2022},
}
Publisher's Version
QP4SE '22: "Quantum Optimization for Fast ..."
Quantum Optimization for Fast CAN Bus Intrusion Detection
Danilo Caivano
, Mirko De Vincentiis , Federica Nitti , and Anibrata Pal (University of Bari, Italy)
Modern vehicles, nowadays, come loaded with hundreds of different sensors generating a huge amount of data. This data is shared and processed among different Electronic Control Units (ECUs) through an in-vehicle network, such as the CAN bus, to improve the driver’s experience and safety. However, the implementation of new features increases exposure to cyber-attacks. The CAN bus, which is designed to grant reliable communication, has many security weaknesses that might be exploited by an attacker. The need for highly accurate real-time intrusion detection systems (IDSs) for the automotive industry is limited to classical machine learning techniques, which are usually time-consuming and have hardware limitations. In this work, we analyze an optimized and efficient version of a network-based IDS for CAN bus attack detection based on Quantum Annealing. The models were tested on two different CAN bus datasets. The results show that the Quantum Annealing algorithm outperforms a classical classification algorithm in terms of time performance, which is important in the identification of attacks in the automotive sector, and achieves similar results for detection accuracy.
@InProceedings{QP4SE22p15,
author = {Danilo Caivano and Mirko De Vincentiis and Federica Nitti and Anibrata Pal},
title = {Quantum Optimization for Fast CAN Bus Intrusion Detection},
booktitle = {Proc.\ QP4SE},
publisher = {ACM},
pages = {15--18},
doi = {10.1145/3549036.3562058},
year = {2022},
}
Publisher's Version
QP4SE '22: "Towards Quantum-Algorithms-as-a-Service ..."
Towards Quantum-Algorithms-as-a-Service
Manuel De Stefano
, Dario Di Nucci , Fabio Palomba , Davide Taibi , and Andrea De Lucia (University of Salerno, Italy; Tampere University of Technology, Finland)
Quantum computing is an emerging field of high interest. Many companies have started to work on developing more powerful and stable quantum computers. However, developers still struggle to master the art of programming with a quantum computer. One of the major challenges faced is the integration of quantum parts of a system with the classical one. This paper proposes a novel development model called Quantum-Algorithms-as-a-Service (QAaaS). This new model aims to allow developers to abstract the quantum components away from the design of the software they are building. The model leverages Software-as-a-Service and Function-as-a-Service to support multiple quantum cloud providers and run their algorithms regardless of the underlying hardware.
@InProceedings{QP4SE22p7,
author = {Manuel De Stefano and Dario Di Nucci and Fabio Palomba and Davide Taibi and Andrea De Lucia},
title = {Towards Quantum-Algorithms-as-a-Service},
booktitle = {Proc.\ QP4SE},
publisher = {ACM},
pages = {7--10},
doi = {10.1145/3549036.3562056},
year = {2022},
}
Publisher's Version
QP4SE '22: "Automatic Generation of Test ..."
Automatic Generation of Test Circuits for the Verification of Quantum Deterministic Algorithms
Antonio García de la Barrera Amo
, Manuel A. Serrano , Ignacio García Rodríguez de Guzmán , Macario Polo , and Mario Piattini (University of Castilla-La Mancha, Spain)
Quantum computing will make it possible to exponentially accelerate the performance of a wide range of computational problems, such as cryptography, machine learning or chemical simulation. However, the quantum potential is not only a matter of hardware, but also of software. Therefore, this new paradigm has an impact yet to be explored on software development processes and techniques, and the adaptation of classical software engineering to the new classical/quantum hybrid systems raises a number of important challenges: a new Quantum Software Engineering is therefore needed. Specifically, and focusing on quantum software quality, software verification remains an open research question, as its novelty and complexity make quantum software development a particularly error-prone process. Most current approaches to test-driven verification rely heavily on simulations, which is a problem due to the lack of scalability of simulators running on classical computers. To address this shortcoming, we define the concept of a "Quantum Test Case", and then present a method to test quantum circuits on real machines, without using simulation test functionalities such as amplitude calculation or non-destructive measurement. This is achieved by automatically generating a Quantum Test Case, which wraps the circuit under test and performs the verification. We also present the process to run a set of tests on a circuit with this method, along with an example to illustrate the technique.
@InProceedings{QP4SE22p1,
author = {Antonio García de la Barrera Amo and Manuel A. Serrano and Ignacio García Rodríguez de Guzmán and Macario Polo and Mario Piattini},
title = {Automatic Generation of Test Circuits for the Verification of Quantum Deterministic Algorithms},
booktitle = {Proc.\ QP4SE},
publisher = {ACM},
pages = {1--6},
doi = {10.1145/3549036.3562055},
year = {2022},
}
Publisher's Version
QP4SE '22: "QAI4ASE: Quantum Artificial ..."
QAI4ASE: Quantum Artificial Intelligence for Automotive Software Engineering
Mirko De Vincentiis
, Fabio Cassano, Alessandro Pagano, and Antonio Piccinno(University of Bari, Italy)
Nowadays, the size and complexity of the automotive development life-cycle increase the possibility of cyber-attacks. In this context, team developers play a primary role in managing cyber security, risk assessment, and all phases of software application development (concept phases, product development, cyber security validation, production, operations, and maintenance). Currently, only generic standards exist and they are difficult to put into operation due to the lack of the required skills and knowledge. Therefore, this paper presents a vision model based on Quantum Artificial Intelligence that supports developers' decisions to integrate concrete design methods in the automotive development life-cycle. Organizations need to develop their process for developing vehicle components that comply with the new automotive standards. We suggest the usage of existing data sources (e.g., existing taxonomies) on Quantum Artificial Intelligence algorithms to suggest the best way, or the correct steps, to follow time by time to achieve user solutions.
@InProceedings{QP4SE22p19,
author = {Mirko De Vincentiis and Fabio Cassano and Alessandro Pagano and Antonio Piccinno},
title = {QAI4ASE: Quantum Artificial Intelligence for Automotive Software Engineering},
booktitle = {Proc.\ QP4SE},
publisher = {ACM},
pages = {19--21},
doi = {10.1145/3549036.3562059},
year = {2022},
}
Publisher's Version
QP4SE '22: "Automatic Generation of Test ..."
Automatic Generation of Test Circuits for the Verification of Quantum Deterministic Algorithms
Antonio García de la Barrera Amo
, Manuel A. Serrano , Ignacio García Rodríguez de Guzmán , Macario Polo , and Mario Piattini (University of Castilla-La Mancha, Spain)
Quantum computing will make it possible to exponentially accelerate the performance of a wide range of computational problems, such as cryptography, machine learning or chemical simulation. However, the quantum potential is not only a matter of hardware, but also of software. Therefore, this new paradigm has an impact yet to be explored on software development processes and techniques, and the adaptation of classical software engineering to the new classical/quantum hybrid systems raises a number of important challenges: a new Quantum Software Engineering is therefore needed. Specifically, and focusing on quantum software quality, software verification remains an open research question, as its novelty and complexity make quantum software development a particularly error-prone process. Most current approaches to test-driven verification rely heavily on simulations, which is a problem due to the lack of scalability of simulators running on classical computers. To address this shortcoming, we define the concept of a "Quantum Test Case", and then present a method to test quantum circuits on real machines, without using simulation test functionalities such as amplitude calculation or non-destructive measurement. This is achieved by automatically generating a Quantum Test Case, which wraps the circuit under test and performs the verification. We also present the process to run a set of tests on a circuit with this method, along with an example to illustrate the technique.
@InProceedings{QP4SE22p1,
author = {Antonio García de la Barrera Amo and Manuel A. Serrano and Ignacio García Rodríguez de Guzmán and Macario Polo and Mario Piattini},
title = {Automatic Generation of Test Circuits for the Verification of Quantum Deterministic Algorithms},
booktitle = {Proc.\ QP4SE},
publisher = {ACM},
pages = {1--6},
doi = {10.1145/3549036.3562055},
year = {2022},
}
Publisher's Version
QP4SE '22: "Automatic Generation of Test ..."
Automatic Generation of Test Circuits for the Verification of Quantum Deterministic Algorithms
Antonio García de la Barrera Amo
, Manuel A. Serrano , Ignacio García Rodríguez de Guzmán , Macario Polo , and Mario Piattini (University of Castilla-La Mancha, Spain)
Quantum computing will make it possible to exponentially accelerate the performance of a wide range of computational problems, such as cryptography, machine learning or chemical simulation. However, the quantum potential is not only a matter of hardware, but also of software. Therefore, this new paradigm has an impact yet to be explored on software development processes and techniques, and the adaptation of classical software engineering to the new classical/quantum hybrid systems raises a number of important challenges: a new Quantum Software Engineering is therefore needed. Specifically, and focusing on quantum software quality, software verification remains an open research question, as its novelty and complexity make quantum software development a particularly error-prone process. Most current approaches to test-driven verification rely heavily on simulations, which is a problem due to the lack of scalability of simulators running on classical computers. To address this shortcoming, we define the concept of a "Quantum Test Case", and then present a method to test quantum circuits on real machines, without using simulation test functionalities such as amplitude calculation or non-destructive measurement. This is achieved by automatically generating a Quantum Test Case, which wraps the circuit under test and performs the verification. We also present the process to run a set of tests on a circuit with this method, along with an example to illustrate the technique.
@InProceedings{QP4SE22p1,
author = {Antonio García de la Barrera Amo and Manuel A. Serrano and Ignacio García Rodríguez de Guzmán and Macario Polo and Mario Piattini},
title = {Automatic Generation of Test Circuits for the Verification of Quantum Deterministic Algorithms},
booktitle = {Proc.\ QP4SE},
publisher = {ACM},
pages = {1--6},
doi = {10.1145/3549036.3562055},
year = {2022},
}
Publisher's Version
QP4SE '22: "Towards Quantum-Algorithms-as-a-Service ..."
Towards Quantum-Algorithms-as-a-Service
Manuel De Stefano
, Dario Di Nucci , Fabio Palomba , Davide Taibi , and Andrea De Lucia (University of Salerno, Italy; Tampere University of Technology, Finland)
Quantum computing is an emerging field of high interest. Many companies have started to work on developing more powerful and stable quantum computers. However, developers still struggle to master the art of programming with a quantum computer. One of the major challenges faced is the integration of quantum parts of a system with the classical one. This paper proposes a novel development model called Quantum-Algorithms-as-a-Service (QAaaS). This new model aims to allow developers to abstract the quantum components away from the design of the software they are building. The model leverages Software-as-a-Service and Function-as-a-Service to support multiple quantum cloud providers and run their algorithms regardless of the underlying hardware.
@InProceedings{QP4SE22p7,
author = {Manuel De Stefano and Dario Di Nucci and Fabio Palomba and Davide Taibi and Andrea De Lucia},
title = {Towards Quantum-Algorithms-as-a-Service},
booktitle = {Proc.\ QP4SE},
publisher = {ACM},
pages = {7--10},
doi = {10.1145/3549036.3562056},
year = {2022},
}
Publisher's Version
QP4SE '22: "Embracing Iterations in Quantum ..."
Embracing Iterations in Quantum Software: A Vision
Arif Ali Khan
, Mahdi Fahmideh , Aakash Ahmad, Muhammad Waseem , Mahmood Niazi , Valtteri Lahtinen , and Tommi Mikkonen (University of Oulu, Finland; University of Southern Queensland, Australia; Lancaster University Leipzig, Germany; Wuhan University, China; King Fahd University of Petroleum and Minerals, Saudi Arabia; Quanscient, Finland; University of Jyväskylä, Finland)
In today’s software engineering, iterations, affordable en masse, form an important part of just about any system. However, not all computing resources are cheap to consume. In High-Performance (HPC) and Quantum Computing (QC), executions can consume considerable amounts of energy and time, which is reserved and used even if the very first steps in the process fail. This means that developers must assume a different attitude towards programming, and aim at error-free software before its execution. This is commonly facilitated using simulators, which are commonplace for both HPC and QC. However the fashion developers advance from one tool to another is ad-hoc, with no established software engineering guidelines, and the final step from simulators to HPC/QC is still a leap of faith, comparable to releasing software. In this paper, we propose a vision where developers can iterate in an agile fashion when developing quantum software. The iterations are defined such that when the solution is still vague in the beginning, computations are interactive and provide instant feedback, thus supporting conceptualization of the software and experimenting with new ideas. When the solution becomes more precise, more expensive computations such as quantum algorithm and hyperparameter optimization are executed in batches.
@InProceedings{QP4SE22p11,
author = {Arif Ali Khan and Mahdi Fahmideh and Aakash Ahmad and Muhammad Waseem and Mahmood Niazi and Valtteri Lahtinen and Tommi Mikkonen},
title = {Embracing Iterations in Quantum Software: A Vision},
booktitle = {Proc.\ QP4SE},
publisher = {ACM},
pages = {11--14},
doi = {10.1145/3549036.3562057},
year = {2022},
}
Publisher's Version