%0 Conference Paper %1 Eichhorn2023 %A Eichhorn, Domenik %A Pett, Tobias %A Osborne, Tobias %A Schaefer, Ina %B Proceedings of the 27th ACM International Systems and Software Product Line Conference - Volume A %C New York, NY, USA %D 2023 %I Association for Computing Machinery %K myown from:tobiasosborne #rank1 %P 1–7 %R 10.1145/3579027.3608971 %T Quantum Computing for Feature Model Analysis: Potentials and Challenges %U https://doi.org/10.1145/3579027.3608971 %V A %X 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. %@ 9798400700910

@inproceedings{Eichhorn2023, 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.}, added-at = {2024-02-06T08:24:09.000+0100}, address = {New York, NY, USA}, author = {Eichhorn, Domenik and Pett, Tobias and Osborne, Tobias and Schaefer, Ina}, biburl = {https://www.bibsonomy.org/bibtex/20a7cb3f494c977ec8e666828e0f3af57/l3s}, booktitle = {Proceedings of the 27th ACM International Systems and Software Product Line Conference - Volume A}, day = 28, doi = {10.1145/3579027.3608971}, interhash = {d9e4e38d7da7e3eb4cccc847da314cbc}, intrahash = {0a7cb3f494c977ec8e666828e0f3af57}, isbn = {9798400700910}, keywords = {myown from:tobiasosborne #rank1}, location = {Tokyo, Japan}, month = {8}, pages = {1–7}, publisher = {Association for Computing Machinery}, series = {SPLC '23}, timestamp = {2024-02-06T08:24:09.000+0100}, title = {Quantum Computing for Feature Model Analysis: Potentials and Challenges}, url = {https://doi.org/10.1145/3579027.3608971}, volume = {A}, year = 2023 }