Insights on Quantum Software Functional Size Measurement: Key Concepts, Challenges and Motivations
Bibliographic record
Abstract
The rapid evolution of quantum computing has led to growing interest in the development of systematic approaches to assess and manage quantum software. Among these, functional size measurement (FSM) offers a promising pathway for establishing metrics that can support project estimation, benchmarking, and quality assessment. This paper provides an overview of emerging efforts in quantum software functional size measurement with a focus on key concepts, challenges, and motivations. First, we examine the foundational principles of quantum computing in relation to the existing FSM methods, identifying both compatibilities and unique constraints. Building on this, we discuss the challenges that arise when applying FSM to quantum software, including the hardware-coupled nature of functionality, evolving semantics of data and measurement abstractions, gaps in tooling and standardization, and evolving role of FSM across the Noisy Intermediate-Scale Quantum (NISQ) and future faulttolerant eras. We then outline community-driven initiatives, such as the COSMIC Quantum Software Taskforce and the Fall 2024 Workshop, which highlight the increasing demand for structured measurement practices. By articulating these issues, this paper aims to present initial research efforts for quantum software functional size measurement and stimulate further exploration of measurement approaches that are both theoretically grounded and practically applicable in quantum software engineering.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.012 | 0.032 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.004 | 0.003 |
| Science and technology studies | 0.002 | 0.019 |
| Scholarly communication | 0.006 | 0.020 |
| Open science | 0.003 | 0.006 |
| Research integrity | 0.003 | 0.007 |
| Insufficient payload (model declined to judge) | 0.003 | 0.001 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".