Quantum Computing for Feature Model Analysis: Potentials and Challenges

Research output: Chapter in book/report/conference proceedingConference contributionResearchpeer review

Authors

  • Domenik Eichhorn
  • Tobias Pett
  • Tobias Osborne
  • Ina Schaefer

Research Organisations

External Research Organisations

  • Karlsruhe Institute of Technology (KIT)
View graph of relations

Details

Original languageEnglish
Title of host publication27th ACM International Systems and Software Product Line Conference
Subtitle of host publicationSPLC 2023
EditorsPaolo Arcaini, Maurice H. ter Beek, Gilles Perrouin, Iris Reinhartz-Berger, Miguel R. Luaces, Christa Schwanninger, Shaukat Ali, Mahsa Varshosaz, Angelo Gargantini, Stefania Gnesi, Malte Lochau, Laura Semini, Hironori Washizaki
PublisherAssociation for Computing Machinery (ACM)
Pages1-7
Number of pages7
ISBN (electronic)9798400700910
Publication statusPublished - 28 Aug 2023
Event27th ACM International Systems and Software Product Line Conference, SPLC 2023 - Tokyo, Japan
Duration: 28 Aug 20231 Sept 2023

Publication series

NameACM International Conference Proceeding Series
VolumeA-1

Abstract

Feature modeling is a technique to model the variability of configurable systems. When working with feature models, it is possible to analyze them, for instance, by counting the number of valid configurations, searching feature model anomalies, or creating samples of configurations for testing. Classical feature model analysis techniques are based on solving algorithmic problems such as boolean satisfiability, satisfiability modulo theories, or integer linear programming. Existing analysis approaches provide satisfactory solutions for small and medium-sized problem instances, but scaling issues are observed for large-sized feature models. Quantum computers provide up to superpolynomial speedups for specific algorithmic problems and have the potential to solve those scaling issues. This paper analyzes the algorithmic techniques used in classical product line analysis and identifies potentials and challenges for quantum speedups. Our findings show that quantum algorithms like QAOA and Grover have the potential to speed up SAT and ILP-based feature model analysis techniques, but only after additional improvements in quantum hardware have been made.

Keywords

    feature model analysis, quantum algorithms, quantum computing

ASJC Scopus subject areas

Cite this

Quantum Computing for Feature Model Analysis: Potentials and Challenges. / Eichhorn, Domenik; Pett, Tobias; Osborne, Tobias et al.
27th ACM International Systems and Software Product Line Conference: SPLC 2023. ed. / Paolo Arcaini; Maurice H. ter Beek; Gilles Perrouin; Iris Reinhartz-Berger; Miguel R. Luaces; Christa Schwanninger; Shaukat Ali; Mahsa Varshosaz; Angelo Gargantini; Stefania Gnesi; Malte Lochau; Laura Semini; Hironori Washizaki. Association for Computing Machinery (ACM), 2023. p. 1-7 (ACM International Conference Proceeding Series; Vol. A-1).

Research output: Chapter in book/report/conference proceedingConference contributionResearchpeer review

Eichhorn, D, Pett, T, Osborne, T & Schaefer, I 2023, Quantum Computing for Feature Model Analysis: Potentials and Challenges. in P Arcaini, MH ter Beek, G Perrouin, I Reinhartz-Berger, MR Luaces, C Schwanninger, S Ali, M Varshosaz, A Gargantini, S Gnesi, M Lochau, L Semini & H Washizaki (eds), 27th ACM International Systems and Software Product Line Conference: SPLC 2023. ACM International Conference Proceeding Series, vol. A-1, Association for Computing Machinery (ACM), pp. 1-7, 27th ACM International Systems and Software Product Line Conference, SPLC 2023, Tokyo, Japan, 28 Aug 2023. https://doi.org/10.1145/3579027.3608971
Eichhorn, D., Pett, T., Osborne, T., & Schaefer, I. (2023). Quantum Computing for Feature Model Analysis: Potentials and Challenges. In P. Arcaini, M. H. ter Beek, G. Perrouin, I. Reinhartz-Berger, M. R. Luaces, C. Schwanninger, S. Ali, M. Varshosaz, A. Gargantini, S. Gnesi, M. Lochau, L. Semini, & H. Washizaki (Eds.), 27th ACM International Systems and Software Product Line Conference: SPLC 2023 (pp. 1-7). (ACM International Conference Proceeding Series; Vol. A-1). Association for Computing Machinery (ACM). https://doi.org/10.1145/3579027.3608971
Eichhorn D, Pett T, Osborne T, Schaefer I. Quantum Computing for Feature Model Analysis: Potentials and Challenges. In Arcaini P, ter Beek MH, Perrouin G, Reinhartz-Berger I, Luaces MR, Schwanninger C, Ali S, Varshosaz M, Gargantini A, Gnesi S, Lochau M, Semini L, Washizaki H, editors, 27th ACM International Systems and Software Product Line Conference: SPLC 2023. Association for Computing Machinery (ACM). 2023. p. 1-7. (ACM International Conference Proceeding Series). doi: 10.1145/3579027.3608971
Eichhorn, Domenik ; Pett, Tobias ; Osborne, Tobias et al. / Quantum Computing for Feature Model Analysis : Potentials and Challenges. 27th ACM International Systems and Software Product Line Conference: SPLC 2023. editor / Paolo Arcaini ; Maurice H. ter Beek ; Gilles Perrouin ; Iris Reinhartz-Berger ; Miguel R. Luaces ; Christa Schwanninger ; Shaukat Ali ; Mahsa Varshosaz ; Angelo Gargantini ; Stefania Gnesi ; Malte Lochau ; Laura Semini ; Hironori Washizaki. Association for Computing Machinery (ACM), 2023. pp. 1-7 (ACM International Conference Proceeding Series).
Download
@inproceedings{e02aaaeafc694213bc35f99149bfabfa,
title = "Quantum Computing for Feature Model Analysis: Potentials and Challenges",
abstract = "Feature modeling is a technique to model the variability of configurable systems. When working with feature models, it is possible to analyze them, for instance, by counting the number of valid configurations, searching feature model anomalies, or creating samples of configurations for testing. Classical feature model analysis techniques are based on solving algorithmic problems such as boolean satisfiability, satisfiability modulo theories, or integer linear programming. Existing analysis approaches provide satisfactory solutions for small and medium-sized problem instances, but scaling issues are observed for large-sized feature models. Quantum computers provide up to superpolynomial speedups for specific algorithmic problems and have the potential to solve those scaling issues. This paper analyzes the algorithmic techniques used in classical product line analysis and identifies potentials and challenges for quantum speedups. Our findings show that quantum algorithms like QAOA and Grover have the potential to speed up SAT and ILP-based feature model analysis techniques, but only after additional improvements in quantum hardware have been made.",
keywords = "feature model analysis, quantum algorithms, quantum computing",
author = "Domenik Eichhorn and Tobias Pett and Tobias Osborne and Ina Schaefer",
note = "Funding Information: This work has been supported by the German Federal Ministry for Education and Research in the project QuBRA (reference number: 13N16303) and the Baden-W{\"u}rttemberg Ministry of Economic Affairs, Labour and Tourism in the project SEQUOIA End-to-End (reference number: WM3-4332-149/44.). The authors would also like to thank Christoph Seidl for his valuable input to discussions about this work. ; 27th ACM International Systems and Software Product Line Conference, SPLC 2023 ; Conference date: 28-08-2023 Through 01-09-2023",
year = "2023",
month = aug,
day = "28",
doi = "10.1145/3579027.3608971",
language = "English",
series = "ACM International Conference Proceeding Series",
publisher = "Association for Computing Machinery (ACM)",
pages = "1--7",
editor = "Paolo Arcaini and {ter Beek}, {Maurice H.} and Gilles Perrouin and Iris Reinhartz-Berger and Luaces, {Miguel R.} and Christa Schwanninger and Shaukat Ali and Mahsa Varshosaz and Angelo Gargantini and Stefania Gnesi and Malte Lochau and Laura Semini and Hironori Washizaki",
booktitle = "27th ACM International Systems and Software Product Line Conference",
address = "United States",

}

Download

TY - GEN

T1 - Quantum Computing for Feature Model Analysis

T2 - 27th ACM International Systems and Software Product Line Conference, SPLC 2023

AU - Eichhorn, Domenik

AU - Pett, Tobias

AU - Osborne, Tobias

AU - Schaefer, Ina

N1 - Funding Information: This work has been supported by the German Federal Ministry for Education and Research in the project QuBRA (reference number: 13N16303) and the Baden-Württemberg Ministry of Economic Affairs, Labour and Tourism in the project SEQUOIA End-to-End (reference number: WM3-4332-149/44.). The authors would also like to thank Christoph Seidl for his valuable input to discussions about this work.

PY - 2023/8/28

Y1 - 2023/8/28

N2 - Feature modeling is a technique to model the variability of configurable systems. When working with feature models, it is possible to analyze them, for instance, by counting the number of valid configurations, searching feature model anomalies, or creating samples of configurations for testing. Classical feature model analysis techniques are based on solving algorithmic problems such as boolean satisfiability, satisfiability modulo theories, or integer linear programming. Existing analysis approaches provide satisfactory solutions for small and medium-sized problem instances, but scaling issues are observed for large-sized feature models. Quantum computers provide up to superpolynomial speedups for specific algorithmic problems and have the potential to solve those scaling issues. This paper analyzes the algorithmic techniques used in classical product line analysis and identifies potentials and challenges for quantum speedups. Our findings show that quantum algorithms like QAOA and Grover have the potential to speed up SAT and ILP-based feature model analysis techniques, but only after additional improvements in quantum hardware have been made.

AB - Feature modeling is a technique to model the variability of configurable systems. When working with feature models, it is possible to analyze them, for instance, by counting the number of valid configurations, searching feature model anomalies, or creating samples of configurations for testing. Classical feature model analysis techniques are based on solving algorithmic problems such as boolean satisfiability, satisfiability modulo theories, or integer linear programming. Existing analysis approaches provide satisfactory solutions for small and medium-sized problem instances, but scaling issues are observed for large-sized feature models. Quantum computers provide up to superpolynomial speedups for specific algorithmic problems and have the potential to solve those scaling issues. This paper analyzes the algorithmic techniques used in classical product line analysis and identifies potentials and challenges for quantum speedups. Our findings show that quantum algorithms like QAOA and Grover have the potential to speed up SAT and ILP-based feature model analysis techniques, but only after additional improvements in quantum hardware have been made.

KW - feature model analysis

KW - quantum algorithms

KW - quantum computing

UR - http://www.scopus.com/inward/record.url?scp=85175991500&partnerID=8YFLogxK

U2 - 10.1145/3579027.3608971

DO - 10.1145/3579027.3608971

M3 - Conference contribution

AN - SCOPUS:85175991500

T3 - ACM International Conference Proceeding Series

SP - 1

EP - 7

BT - 27th ACM International Systems and Software Product Line Conference

A2 - Arcaini, Paolo

A2 - ter Beek, Maurice H.

A2 - Perrouin, Gilles

A2 - Reinhartz-Berger, Iris

A2 - Luaces, Miguel R.

A2 - Schwanninger, Christa

A2 - Ali, Shaukat

A2 - Varshosaz, Mahsa

A2 - Gargantini, Angelo

A2 - Gnesi, Stefania

A2 - Lochau, Malte

A2 - Semini, Laura

A2 - Washizaki, Hironori

PB - Association for Computing Machinery (ACM)

Y2 - 28 August 2023 through 1 September 2023

ER -