<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>Quantum Software Sizing: Contemporary Interpretations and Approaches</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Hassan SOUBRA</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Ecole Centrale d'Electronique-ECE Lyon</institution>
          ,
          <addr-line>24 rue Salomon Reinach, 69007 Lyon</addr-line>
        </aff>
      </contrib-group>
      <abstract>
        <p>Conventional software sizing approaches initially centered on metrics like lines of code, gradually transitioning to more refined measurements such as function points. However, these approaches could not be directly applicable to quantum software due to the fundamental diferences between classical and quantum computing paradigms. In quantum software sizing, factors such as the number of qubits required, the depth of quantum circuits, the connectivity requirements of qubits, the error rates of quantum gates, and the complexity of the quantum algorithms play crucial roles. Additionally, considerations such as the choice of quantum programming language, quantum hardware platform, and optimization techniques also impact the overall size estimation. This paper provides an overview of quantum software sizing, highlighting initial exploration and classification of sizing measurement concepts of Quantum Software.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;Quantum Software</kwd>
        <kwd>Quantum Software Sizing</kwd>
        <kwd>Quantum Software Engineering</kwd>
        <kwd>Metrics</kwd>
        <kwd>Measurement</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        Within the context of "classical" computers, Software sizing refers to the process of measuring
the size of a software project, which is crucial for various aspects of software development
such as project cost, efort, schedules, and duration [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. Accurate software sizing is essential
for efective project management and decision-making, as it provides valuable information
for software project development [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]. Diferent methods are employed for software sizing
estimation, including lines of code (LOC) and function point analysis (FPA) [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]. The size
estimation process becomes more accurate as the software model evolves and requirements
become clearer [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]. Risks associated with software sizing, especially in dynamic and parallel
processing environments, highlight the importance of precise estimation to avoid negative
consequences and project suspension.
      </p>
      <p>
        The evolution of quantum computers stems from integrating principles of Quantum
Mechanics into computing, enabling the representation of multiple states simultaneously through
Qubits, unlike classical computers that operate on binary logic [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ]. Quantum Computing (QC)
has made significant strides in recent years, ofering exponential speed and scalability by
leveraging quantum phenomena like superposition and entanglement [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ]. Quantum Computers
have shown immense potential in various fields, including Quantum Machine Learning (QML),
where the fusion of quantum and machine learning algorithms has yielded exceptional results.
The transition from classical to quantum computing has paved the way for solving complex
and computationally intractable problems eficiently, marking a significant milestone in the
realm of computing [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ].
      </p>
      <p>Within the realm of quantum computing, the distinction between software and hardware
is nuanced compared to classical computing paradigms. Quantum hardware encompasses the
physical components responsible for implementing quantum operations and storing quantum
information, such as qubits, gates, and registers. Conversely, quantum software comprises
abstract algorithms and instructions crafted to manipulate quantum states for specific
computational or simulation tasks. While conceptually distinct, quantum software and hardware
are intricately interconnected in practice. Quantum software development necessitates careful
consideration of the capabilities and limitations of specific quantum hardware architectures,
with close collaboration between quantum software developers and hardware engineers to
optimize algorithms for the underlying hardware. Conversely, advancements in quantum
hardware often drive progress in quantum software development, emphasizing the symbiotic
relationship between the two domains. This interdependence underscores the unique challenges
and opportunities in the development and deployment of quantum computing technologies.</p>
      <p>In essence, the evolution of quantum computing has ushered in a paradigm shift by integrating
principles of Quantum Mechanics into computing, enabling the representation of multiple
states simultaneously through Qubits, unlike classical computers that operate on binary logic.
Quantum Computing (QC) has witnessed remarkable progress, ofering exponential speed and
scalability by leveraging quantum phenomena like superposition and entanglement.</p>
      <p>This paper explores the nuanced landscape of quantum software sizing, delving into its
contemporary interpretations and approaches within the field of quantum computing. By
examining key metrics, methodologies, and the intricate interplay between quantum hardware
and software, this paper aims to provide insights that contribute to the ongoing dialogue
surrounding quantum software development and optimization. Through a initial analysis of
current practices and emerging trends, this paper seeks to elucidate the challenges, opportunities,
and future directions in the realm of quantum software sizing.</p>
      <p>The rest of this paper is organized as follows: Section 2 ofers an overview of the key principles
underpinning software sizing in the context of "classical" computing. In Section 3, we delve into
the nuances of quantum software sizing, examining its importance and the various factors that
influence it. Building upon this foundation, Section 4 provides current approaches to quantum
software sizing, elucidating the approaches and metrics employed. Furthermore, Section 5
presents our conclusions drawn from the preceding discussions, summarizing key insights and
highlighting avenues for future research in quantum software sizing.</p>
    </sec>
    <sec id="sec-2">
      <title>2. Overview of the Key principles of software sizing</title>
      <p>
        Accurate software sizing principles form the cornerstone of efective project planning and
management, underlining the need for precise estimation of a software project’s size [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]
[
        <xref ref-type="bibr" rid="ref9">9</xref>
        ] [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ]. At the heart of these principles lie two primary metrics: Lines of Code (LOC) and
Function Point Analysis (FPA). Historically, software sizing relied heavily on LOC metrics, which
quantified the size of a software project based on the number of lines of code written. However,
the evolving landscape of software development has highlighted the limitations of LOC metrics,
particularly in capturing the complexity and functionality of modern software systems. In
contrast, Function Point Analysis (FPA) has emerged as a more relevant and comprehensive
measurment for software sizing. FPA measures the functional size of a software application
based on the complexity and functionality of its components, providing a more nuanced and
accurate representation of software size. While both LOC and FPA have their strengths and
weaknesses [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ], the adoption of FPA is increasingly favored due to its ability to capture the
intricacies of modern software systems more efectively.
      </p>
      <p>Efective software sizing estimation is paramount for determining various aspects of software
project development, including project costs, efort, schedules, and duration. The significance
of accurate size estimation is particularly pronounced at the project’s inception when high-level
decisions are made based on initial requirements. However, size estimation poses inherent
challenges and risks, requiring a principled approach rooted in sound theoretical foundations.
Function points, in this regard, emerged as valuable tools for size estimation, ofering benefits
when applied across diferent stages of the software development lifecycle. By utilizing function
points, organizations can derive cost-efective insights into software size, enabling informed
decision-making and resource allocation. Emphasizing a systematic and principled approach
to measuring software size ensures that project planning and management are conducted
with precision and foresight, laying a robust foundation for successful software development
endeavors.</p>
    </sec>
    <sec id="sec-3">
      <title>3. Discussing Quantum software sizing</title>
      <p>Discussing quantum software sizing is highly relevant in the field of quantum computing due
to several key reasons. Firstly, just like in classical computing, measuring the performance of
quantum software is crucial for optimization. Diferent measures and metrics should provide
valuable insights into the eficiency of quantum algorithms and programs. Optimizing these
metrics enables quantum software developers to enhance the speed and accuracy of quantum
computations, thereby advancing the capabilities of quantum computing technology.</p>
      <p>Secondly, efective resource management is essential in quantum computing, given the limited
resources available, such as the number of qubits and the fidelity of quantum gates. Metrics and
measurements aid in eficiently managing these resources by providing an understanding of
the resource requirements of quantum algorithms. This understanding allows researchers to
assess the feasibility of running algorithms on current or near-term quantum hardware, guiding
resource allocation and optimization eforts.</p>
      <p>Moreover, quantum hardware is still inherently prone to errors due to factors such as
decoherence and gate imperfections. Metrics for error rates, fidelity, and error-correction capabilities
are crucial for characterizing and mitigating errors in quantum computations. By measuring
error rates and understanding error patterns, quantum software developers can design
errorcorrection codes and fault-tolerant algorithms, improving the reliability and robustness of
quantum computing systems.</p>
      <p>Furthermore, metrics play a vital role in algorithmic development by facilitating the
comparison of diferent quantum algorithms for the same task and are used to evaluate the efectiveness
of various quantum algorithms, driving innovation and optimization in algorithm design.</p>
      <p>Additionally, the development of standardized metrics and benchmarks is essential for
comparing the performance of diferent quantum software implementations and hardware platforms.
Standardized metrics enable fair comparisons and facilitate the exchange of best practices among
researchers and practitioners in the quantum computing community, fostering collaboration
and progress in the field.</p>
      <p>
        Finally, metrics could play a significant role in tracking progress in quantum computing,
including the demonstration of quantum supremacy [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ]. By defining clear metrics and
measuring progress against them, researchers can track advancements in quantum computing and
set goals for future developments, driving innovation and practical applications of quantum
computing technology.
      </p>
      <p>In the realm of quantum computing, the distinction between software and hardware can be
somewhat blurred compared to classical computing:</p>
      <p>Quantum Hardware: This refers to the physical devices that implement quantum operations
and store quantum information. Quantum hardware includes components such as qubits
(quantum bits), quantum gates, and quantum registers. Examples of quantum hardware include
superconducting qubits, trapped ions, and topological qubits.</p>
      <p>
        Quantum Software: Quantum software consists of algorithms, protocols, and programming
languages designed to run on quantum hardware. This software defines the logic and operations
that manipulate quantum states to perform specific computations or simulations. Quantum
software may include programming languages like Qiskit, Cirq, or Quipper [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ], as well as
algorithms like Grover’s Algorithm or Shor’s Algorithm.
      </p>
      <p>Now, to the question of discernibility:
- At a conceptual level: The concepts of quantum hardware and software are distinct.
Hardware refers to the physical implementation of quantum systems, while software refers to
the abstract algorithms and instructions that manipulate quantum states. Just like in classical
computing, where hardware refers to the physical components and software refers to the
programs that run on them, the same distinction applies in quantum computing.</p>
      <p>- At a practical level: Quantum software often interacts closely with the capabilities and
limitations of quantum hardware. Quantum algorithms and programs need to be optimized
to run eficiently on specific quantum hardware architectures, taking into account factors
such as qubit connectivity, error rates, and gate fidelities. Quantum software developers often
work closely with quantum hardware engineers to ensure that algorithms are tailored to the
capabilities of the underlying hardware.</p>
      <p>- In terms of development and deployment: Quantum software development typically
involves writing code in quantum programming languages, simulating algorithms on classical
computers, and then running them on actual quantum hardware. Quantum hardware, on the
other hand, undergoes physical fabrication and testing in specialized laboratories. While the
processes for developing quantum software and hardware are distinct, they are often intertwined,
with advancements in one area driving progress in the other.</p>
      <p>Given the close interconnection between quantum software and hardware in practice,
although they maintain conceptual distinction, quantum algorithms are specifically crafted to
leverage the functionalities of particular quantum hardware architectures. Consequently,
discussions on Quantum "Software" Sizing Approaches cannot presently be detached from their
intimate association with Quantum hardware.</p>
    </sec>
    <sec id="sec-4">
      <title>4. Current Quantum "Software" Sizing Approaches</title>
      <p>
        Various software sizing approaches in quantum computing include metrics for measuring the
size and structure of quantum software [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ], identifying qubits suitable for circuit resizing, and
combining theoretical views with practical tasks through model-based simulations [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ] [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ].
These approaches aim to evaluate quantum software rigorously and quantitatively, and optimize
circuit execution on limited qubit systems. By utilizing metrics at diferent abstraction levels,
selecting qubits for serial execution, and employing model-based simulations with
gradientbased optimization, these approaches enhance the performance and reliability of quantum
circuits on small hardware, improving the execution of large circuits and minimizing errors.
      </p>
      <sec id="sec-4-1">
        <title>4.1. Quantum Volume</title>
        <p>
          Quantum volume [
          <xref ref-type="bibr" rid="ref17">17</xref>
          ] is a crucial metric in quantum computing that quantifies the number of
usable qubits on a quantum computer. It serves as a comprehensive benchmark for assessing the
performance of quantum computers, considering factors like hardware improvements, software
enhancements, and error mitigation techniques. This metric has been extended to include
various circuit shapes, known as Quantum Volumetric Classes [
          <xref ref-type="bibr" rid="ref18">18</xref>
          ] [
          <xref ref-type="bibr" rid="ref19">19</xref>
          ], to better align with
specific quantum computing applications. The concept of efective quantum volume has been
introduced, which incorporates error mitigation techniques like Digital Zero-Noise
Extrapolation [
          <xref ref-type="bibr" rid="ref20">20</xref>
          ] to enhance the quantum volume of quantum processors, showcasing improvements
over the vendor-measured quantum volume. Understanding quantum volume is essential for
evaluating the capabilities and advancements of quantum computing systems.
        </p>
        <p>While hardware enhancements directly boost quantum volume, software improvements,
particularly in compilers, also play a significant role in increasing this metric. Notably, error
mitigation techniques, a form of indirect compilation, have been shown to efectively enhance
quantum volume without increasing the number of overall samples required . Quantum volume’s
ability to capture both hardware and software advancements makes it a valuable tool for
evaluating quantum computer capabilities and the impact of error correction strategies on
overall performance.</p>
        <p>The key components of quantum volume calculation include factors like qubit number, fidelity,
connectivity, and other crucial quantities for building functional quantum devices. The quantum
volume test aims to provide a single-number metric for assessing a quantum computer’s overall
capability, although a complete understanding of its limitations and operational significance is
still evolving. To enhance the test’s eficacy, researchers have explored design aspects, error
sensitivity, passing criteria, and implications of passing the test on a quantum computer’s
abilities . Additionally, eforts have been made to develop eficient algorithms for estimating
heavy output probabilities under various error models and compiler optimization choices,
predicting performance benchmarks for future quantum systems. This comprehensive approach
to quantum volume calculation is essential for evaluating and advancing quantum computing
technologies.</p>
        <p>
          Noise significantly impacts the accuracy of quantum volume calculations by introducing
errors that afect the reliability of quantum computations. Various types of noise, such as
decoherence, gate errors, readout errors, leakage, and crosstalk, can degrade the quality of
quantum circuits. To address these challenges, researchers have developed classical simulation
algorithms like LOWESA [
          <xref ref-type="bibr" rid="ref21">21</xref>
          ], which estimate expectation values of noisy parameterized
quantum circuits eficiently. Evaluating noise models systematically is crucial for understanding
and predicting the impact of errors on quantum computations. By constructing accurate noise
models and benchmarking them against hardware experiments, researchers aim to mitigate
errors and enhance the accuracy of quantum computing applications.
        </p>
      </sec>
      <sec id="sec-4-2">
        <title>4.2. Error Rates</title>
        <p>
          The most common types of errors in quantum software include Program anomaly bugs,
Configuration bugs, and Data type and structure bugs [
          <xref ref-type="bibr" rid="ref22">22</xref>
          ]. These bugs are often found in components
like the compiler, gate operation, and state preparation components in quantum programming
projects. To detect and measure these errors, it is crucial to conduct empirical studies on bug
reports from quantum software projects, as done in the research. Additionally, identifying and
categorizing bug patterns specific to quantum programming languages, such as Qiskit, can help
in understanding and preventing common mistakes in quantum programs [
          <xref ref-type="bibr" rid="ref23">23</xref>
          ]. Furthermore, a
detailed analysis of real-world bugs in quantum computing platforms can provide insights into
quantum-specific bugs and recurrent bug patterns, aiding developers in avoiding errors and
assisting tool builders in enhancing bug prevention and detection mechanisms.
        </p>
        <p>
          Entanglement errors can significantly impact quantum software performance [
          <xref ref-type="bibr" rid="ref24">24</xref>
          ]. The
entanglement degree in data can have a dual efect on prediction error, depending on the number
of permitted measurements. Quantum error correction (QEC) codes play a vital role in mitigating
detriments induced by noise, preserving entanglement, and enhancing the performance of
quantum protocols even under larger noise amplitudes. Additionally, entanglement analysis in
quantum programs is crucial for understanding quantum behavior and preventing
entanglementinduced errors. Static entanglement analysis methods, like constructing interprocedural control
lfow graphs, help identify entanglement interactions within and between modules, ultimately
improving the reliability and security of quantum programs. These findings underscore the
critical role of managing entanglement errors for optimizing quantum software performance.
        </p>
      </sec>
      <sec id="sec-4-3">
        <title>4.3. Connectivity</title>
        <p>
          The connectivity of qubits within a quantum computer is essential for quantum software sizing.
Better connectivity enables more eficient quantum operations and interactions, afecting the
scalability and complexity of quantum software applications. Qubit connectivity significantly
influences quantum software scalability. Constraints on qubit connectivity, such as those in
superconducting qubits and quantum dots, can lead to challenges in implementing unrestricted
quantum circuits eficiently [
          <xref ref-type="bibr" rid="ref25">25</xref>
          ]. However, innovative approaches like eficient qubit-mapping
methods can mitigate these limitations by redesigning circuits to optimize connectivity, reducing
additional gates and runtime while enhancing circuit stability [
          <xref ref-type="bibr" rid="ref26">26</xref>
          ].
        </p>
        <p>
          Qubit connectivity plays a crucial role in quantum error correction schemes. Diferent error
correction codes, such as the surface code, XZZX code, reduced-connectivity surface code, XYZ
matching code, and Floquet code [
          <xref ref-type="bibr" rid="ref27">27</xref>
          ], exhibit varying advantages in terms of error threshold,
connectivity, and logical qubit encoding, depending on the qubit connectivity. For instance,
the surface code relies on square-grid connectivity, which allows for high error thresholds
and logical qubit storage. Quantum low-density parity-check (LDPC) codes are also impacted
by qubit connectivity, with the graph separator of the connectivity graph influencing code
limitations and the ability to construct good codes. Sparse connectivity in superconducting
quantum computers leads to experimental overheads, which can be mitigated by techniques like
virtual two-qubit gates for error suppression. Therefore, qubit connectivity directly influences
the efectiveness and eficiency of quantum error correction strategies.
        </p>
      </sec>
      <sec id="sec-4-4">
        <title>4.4. Functional Size Measurement</title>
        <p>
          Functional Size Measurement tailored for quantum software. It encompasses data movements
through the introduction of novel data-movement types and quantifies quantum data movements
using COSMIC Functional Points: Q-COSMIC, a technique for measuring the functional size
of quantum software [
          <xref ref-type="bibr" rid="ref28">28</xref>
          ] and a functional size measurement (FSM) procedure for Quantum
Computer Software with functional requirements implemented in Qiskit [
          <xref ref-type="bibr" rid="ref29">29</xref>
          ]. Both approaches
are based on the COSMIC-ISO 19761 delineate the functional user, classical, and quantum
parts of quantum software as separate entities with boundaries, providing a comprehensive
measurement approach.
        </p>
      </sec>
      <sec id="sec-4-5">
        <title>4.5. Basic Quantum Size Metrics</title>
        <p>
          Code Size, Design Size, and Specification Size metrics. Examples of Code Size metrics include
Lines of Code (LOC), while Design Size metrics utilize quantum architectural description
language (qADL) and Quantum Unified Modeling Language (Q-UML) to specify architectures. Basic
Structure metrics such as McCabe’s Complexity Metric and Henry and Kafura’s information
lfow Metric were also considered [
          <xref ref-type="bibr" rid="ref14">14</xref>
          ].
        </p>
      </sec>
      <sec id="sec-4-6">
        <title>4.6. Quantum Circuit Metrics</title>
        <p>
          Quantum circuit metrics are crucial for assessing various aspects of quantum computing. These
metrics help in evaluating the performance, understandability, and applicability of quantum
circuits [
          <xref ref-type="bibr" rid="ref30">30</xref>
          ]. One approach involves designing quantum circuits metrics for Bayesian
optimization with Gaussian processes, which includes a new quantum gates distance to characterize
gates’ actions over quantum states[
          <xref ref-type="bibr" rid="ref31">31</xref>
          ]. Additionally, the concept of Quantum Volumetric
Classes has been introduced to generalize the quantum volume metric, considering diferent
circuit shapes and their scalability with problem sizes [
          <xref ref-type="bibr" rid="ref18">18</xref>
          ]. Furthermore, there is a focus on
developing metrics to determine the successful execution of quantum circuits on gate-based
quantum computers, emphasizing the importance of assessing current quantum computing
capabilities [
          <xref ref-type="bibr" rid="ref32">32</xref>
          ]. Quantum circuit metrics play a crucial role in determining the eficiency
of quantum algorithms. By leveraging families of quantum states that can be prepared with
linear-size and depth circuits, quantum algorithms can achieve high precision initialization,
enabling depth-eficient executions. Metrics-aware quantum algorithms, such as those utilizing
the quantum Fisher information matrix, optimize the distribution of samples between matrix
and vector entries, leading to eficient estimation with fewer circuit repetitions. Techniques
like gate re-ordering in the Quantum Approximate Optimization Algorithm (QAOA) reduce
gate-count and circuit-depth, enhancing noise resilience and execution time. Additionally,
novel approaches like the Projected-Variational Quantum Dynamics (p-VQD) algorithm ofer
eficient global optimization of variational parameters, significantly improving scalability for
large parameterized quantum circuits.
        </p>
      </sec>
      <sec id="sec-4-7">
        <title>4.7. Quality of hybrid code</title>
        <p>
          Evaluating the quality of hybrid code [
          <xref ref-type="bibr" rid="ref33">33</xref>
          ], specifically targeting maintainability, is crucial
as the ability to evolve is one of the pivotal characteristics in the still-developing quantum
software industry. Despite the well-defined nature of quantum algorithms presently in use, the
landscape of quantum technology is rapidly evolving, indicating ongoing advancements in the
coming years. Consequently, quantum software is poised for continuous evolution, adapting to
incorporate the latest innovations and enhancements in quantum technology.
        </p>
        <p>
          Moreover, the current quantum market is fiercely competitive, emphasizing the significance
of developing dependable and eficient quantum software. The ability to do so can dictate
the success or failure of endeavors in this domain. Thus, [
          <xref ref-type="bibr" rid="ref33">33</xref>
          ] aims to introduce the inaugural
maintainability metrics for quantum code, along with a framework for their assessment within
hybrid software environments. Furthermore, it illustrates the practical application of these
metrics by analyzing a prominent quantum algorithm, such as Shor’s algorithm.
        </p>
      </sec>
      <sec id="sec-4-8">
        <title>4.8. Quantum Processing Units- QPU Software related Metrics</title>
        <p>
          Key performance metrics for quantum processing units (QPUs) include the Q-score Max-Clique
metric for comparing diferent quantum computing paradigms [
          <xref ref-type="bibr" rid="ref34">34</xref>
          ], circuit depth, and gate
count for solving NP-complete problems with tailored hardware properties [
          <xref ref-type="bibr" rid="ref35">35</xref>
          ]. Additionally,
metrics like randomized benchmarking and quantum volume are crucial for assessing quantum
platforms, with a recent focus on adapting these metrics for measurement-based quantum
computing (MBQC) processors like photonic devices [
          <xref ref-type="bibr" rid="ref36">36</xref>
          ]. These metrics help in evaluating the
speed, eficiency, and efectiveness of QPUs in performing quantum computations, guiding the
development and optimization of quantum hardware for practical deployment and scalability.
        </p>
        <p>Table 1 summarizes the main Quantum Software Sizing Measurable concepts.</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>5. Conclusion</title>
      <p>In this paper, we have examined the contemporary interpretations and approaches to
quantum software sizing within the rapidly evolving field of quantum computing. Through our
exploration, several key insights have emerged.</p>
      <p>Firstly, we have highlighted the importance of rigorous and quantitative evaluation of
quantum software, considering factors such as quantum volume, qubit connectivity, and error rates.
These metrics and measures provide valuable insights into the eficiency, reliability, and
scalability of quantum computing systems, guiding optimization eforts and resource management
strategies.</p>
      <p>Secondly, our analysis has underscored the critical role of both hardware and software
advancements in enhancing quantum computing capabilities. From improvements in quantum
volume to the development of error mitigation techniques and hybrid code quality evaluation,
advancements in both domains contribute synergistically to the overall performance of quantum
systems.</p>
      <p>Furthermore, our examination of various sizing approaches has revealed the interdisciplinary
nature of quantum software development, requiring collaboration between quantum software
developers, quantum hardware engineers, and researchers across multiple domains. By leveraging
novel data-movement types, advanced circuit metrics, and hybrid code evaluation techniques,
the quantum computing community can drive innovation and progress in quantum software
sizing.</p>
      <p>As we look to the future, it is evident that quantum software sizing will continue to be a
dynamic and evolving area of research. With ongoing advancements in quantum hardware,
software, and algorithms, the landscape of quantum computing will continue to evolve, presenting
new challenges and opportunities for quantum software developers.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>A.</given-names>
            <surname>Sathesh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y. B.</given-names>
            <surname>Hamdan</surname>
          </string-name>
          ,
          <article-title>Analysis of software sizing and project estimation prediction by machine learning classification</article-title>
          ,
          <source>Journal of Ubiquitous Computing and Communication Technologies</source>
          <volume>3</volume>
          (
          <year>2021</year>
          )
          <fpage>303</fpage>
          -
          <lpage>313</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>A. L.</given-names>
            <surname>AL-Saleem</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y. H.</given-names>
            <surname>Asma</surname>
          </string-name>
          <article-title>'a, Software size estimation: A survey (</article-title>
          <year>2022</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>J. T. Mesia</given-names>
            <surname>Dhas</surname>
          </string-name>
          , et al.,
          <article-title>The functional and storage risks associated to the size estimation of parallel computing applications, in: Advances in Parallel Computing Algorithms</article-title>
          , Tools and Paradigms, IOS Press,
          <year>2022</year>
          , pp.
          <fpage>373</fpage>
          -
          <lpage>379</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>M.</given-names>
            <surname>Nasir</surname>
          </string-name>
          ,
          <article-title>A survey of software estimation techniques and project planning practices</article-title>
          ,
          <source>in: Seventh ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD'06)</source>
          , IEEE,
          <year>2006</year>
          , pp.
          <fpage>305</fpage>
          -
          <lpage>310</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>A.</given-names>
            <surname>Abran</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Symons</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Ebert</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Vogelezang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Soubra</surname>
          </string-name>
          ,
          <article-title>Measurement of software size: Contributions of cosmic to estimation improvements</article-title>
          , in: The International Training Symposium, At Marriott Bristol, United Kingdom,
          <year>2016</year>
          , pp.
          <fpage>259</fpage>
          -
          <lpage>267</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>P. B.</given-names>
            <surname>Upama</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. J. H.</given-names>
            <surname>Faruk</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Nazim</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Masum</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Shahriar</surname>
          </string-name>
          , G. Uddin,
          <string-name>
            <given-names>S.</given-names>
            <surname>Barzanjeh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S. I.</given-names>
            <surname>Ahamed</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Rahman</surname>
          </string-name>
          ,
          <article-title>Evolution of quantum computing: A systematic survey on the use of quantum computing tools</article-title>
          ,
          <source>in: 2022 IEEE 46th Annual Computers, Software, and Applications Conference (COMPSAC)</source>
          , IEEE,
          <year>2022</year>
          , pp.
          <fpage>520</fpage>
          -
          <lpage>529</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>R.</given-names>
            <surname>Pandey</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Maurya</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G. D.</given-names>
            <surname>Singh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. S.</given-names>
            <surname>Faiyaz</surname>
          </string-name>
          ,
          <article-title>Evolutionary analysis: Classical bits to quantum qubits, in: Quantum Computing: A Shift from</article-title>
          Bits to Qubits, Springer,
          <year>2023</year>
          , pp.
          <fpage>115</fpage>
          -
          <lpage>129</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <surname>E. G.</surname>
          </string-name>
          <article-title>Ng'ang'a, A survey on software sizing for project estimation (</article-title>
          <year>2015</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>P. M.</given-names>
            <surname>Khan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Beg</surname>
          </string-name>
          ,
          <article-title>Application of sizing estimation techniques for business critical software project management</article-title>
          ,
          <source>arXiv preprint arXiv:1405.6335</source>
          (
          <year>2014</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>F. G.</given-names>
            <surname>Wilkie</surname>
          </string-name>
          ,
          <string-name>
            <given-names>I. R.</given-names>
            <surname>McChesney</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Morrow</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Tuxworth</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Lester</surname>
          </string-name>
          ,
          <article-title>The value of software sizing</article-title>
          ,
          <source>Information and Software Technology</source>
          <volume>53</volume>
          (
          <year>2011</year>
          )
          <fpage>1236</fpage>
          -
          <lpage>1249</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>L. O.</given-names>
            <surname>Ejiogu</surname>
          </string-name>
          ,
          <article-title>Attribute-based model of software size</article-title>
          ,
          <source>in: Software Measurement: Current Trends in Research and Practice</source>
          , Springer,
          <year>1999</year>
          , pp.
          <fpage>81</fpage>
          -
          <lpage>92</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>I.</given-names>
            <surname>Olga</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Vladimir</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Olga</surname>
          </string-name>
          ,
          <string-name>
            <given-names>U.</given-names>
            <surname>Sergey</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Toshio</surname>
          </string-name>
          ,
          <article-title>Quantum supremacy in end-to-end intelligent it. pt. i: Quantum software engineering-quantum gate level applied models simulators</article-title>
          ,
          <source>Systems Analysis in Science and Education</source>
          <volume>1</volume>
          (
          <year>2020</year>
          )
          <fpage>52</fpage>
          -
          <lpage>84</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>A.</given-names>
            <surname>Bai</surname>
          </string-name>
          ,
          <article-title>Report on formal verification in quantum programming (</article-title>
          <year>2023</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>J.</given-names>
            <surname>Zhao</surname>
          </string-name>
          ,
          <article-title>Some size and structure metrics for quantum software</article-title>
          , in: 2021 IEEE/ACM 2nd International Workshop on Quantum Software
          <string-name>
            <surname>Engineering (Q-SE</surname>
            <given-names>)</given-names>
          </string-name>
          , IEEE,
          <year>2021</year>
          , pp.
          <fpage>22</fpage>
          -
          <lpage>27</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>M.</given-names>
            <surname>Sadeghi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Khadirsharbiyani</surname>
          </string-name>
          , M. T. Kandemir, Quantum circuit resizing,
          <source>arXiv preprint arXiv:2301.00720</source>
          (
          <year>2022</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>S.</given-names>
            <surname>Niu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Hashim</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Iancu</surname>
          </string-name>
          , W. A. de Jong, E. Younis,
          <article-title>Powerful quantum circuit resizing with resource eficient synthesis</article-title>
          ,
          <source>arXiv preprint arXiv:2311.13107</source>
          (
          <year>2023</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>K.</given-names>
            <surname>Kechedzhi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Isakov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Mandrà</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Villalonga</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Mi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Boixo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Smelyanskiy</surname>
          </string-name>
          ,
          <article-title>Efective quantum volume, fidelity and computational cost of noisy quantum processing experiments</article-title>
          ,
          <source>Future Generation Computer Systems</source>
          <volume>153</volume>
          (
          <year>2024</year>
          )
          <fpage>431</fpage>
          -
          <lpage>441</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <given-names>K.</given-names>
            <surname>Miller</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Broomfield</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Cox</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Kinast</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Rodenburg</surname>
          </string-name>
          ,
          <article-title>An improved volumetric metric for quantum computers via more representative quantum circuit shapes</article-title>
          ,
          <source>arXiv preprint arXiv:2207.02315</source>
          (
          <year>2022</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <given-names>O.</given-names>
            <surname>Ghoniem</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Elsayed</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Soubra</surname>
          </string-name>
          ,
          <article-title>Quantum gate count analysis</article-title>
          ,
          <source>in: 2023 Eleventh International Conference on Intelligent Computing and Information Systems (ICICIS)</source>
          , IEEE,
          <year>2023</year>
          , pp.
          <fpage>190</fpage>
          -
          <lpage>197</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <given-names>T.</given-names>
            <surname>Giurgica-Tiron</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Hindy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>LaRose</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Mari</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W. J.</given-names>
            <surname>Zeng</surname>
          </string-name>
          ,
          <article-title>Digital zero noise extrapolation for quantum error mitigation</article-title>
          ,
          <source>in: 2020 IEEE International Conference on Quantum Computing and Engineering</source>
          (QCE), IEEE,
          <year>2020</year>
          , pp.
          <fpage>306</fpage>
          -
          <lpage>316</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [21]
          <string-name>
            <given-names>M. S.</given-names>
            <surname>Rudolph</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Fontana</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Holmes</surname>
          </string-name>
          , L. Cincio,
          <article-title>Classical surrogate simulation of quantum systems with lowesa</article-title>
          ,
          <source>arXiv preprint arXiv:2308.09109</source>
          (
          <year>2023</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          [22]
          <string-name>
            <given-names>H.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Khomh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Tidjon</surname>
          </string-name>
          , et al.,
          <article-title>Bug characteristics in quantum software ecosystem</article-title>
          ,
          <source>arXiv preprint arXiv:2204.11965</source>
          (
          <year>2022</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          [23]
          <string-name>
            <given-names>M.</given-names>
            <surname>Paltenghi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Pradel</surname>
          </string-name>
          ,
          <article-title>Bugs in quantum computing platforms: an empirical study</article-title>
          ,
          <source>Proceedings of the ACM on Programming Languages</source>
          <volume>6</volume>
          (
          <year>2022</year>
          )
          <fpage>1</fpage>
          -
          <lpage>27</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          [24]
          <string-name>
            <given-names>T.</given-names>
            <surname>Shang</surname>
          </string-name>
          , J. Liu,
          <article-title>Secure quantum network coding theory</article-title>
          , Springer,
          <year>2020</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          [25]
          <string-name>
            <given-names>R.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Petit</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D. P.</given-names>
            <surname>Franke</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. P.</given-names>
            <surname>Dehollain</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Helsen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Steudtner</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N. K.</given-names>
            <surname>Thomas</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z. R.</given-names>
            <surname>Yoscovits</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K. J.</given-names>
            <surname>Singh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Wehner</surname>
          </string-name>
          , et al.,
          <article-title>A crossbar network for silicon quantum dot qubits</article-title>
          ,
          <source>Science advances 4</source>
          (
          <year>2018</year>
          )
          <article-title>eaar3960</article-title>
          .
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          [26]
          <string-name>
            <surname>C.-Y. Huang</surname>
          </string-name>
          , W.-K. Mak,
          <article-title>Eficient qubit routing using a dynamically-extract-and-route framework</article-title>
          ,
          <source>IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems</source>
          (
          <year>2024</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref27">
        <mixed-citation>
          [27]
          <string-name>
            <given-names>B.</given-names>
            <surname>Hetényi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. R.</given-names>
            <surname>Wootton</surname>
          </string-name>
          ,
          <article-title>Tailoring quantum error correction to spin qubits</article-title>
          ,
          <source>Physical Review A</source>
          <volume>109</volume>
          (
          <year>2024</year>
          )
          <fpage>032433</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref28">
        <mixed-citation>
          [28]
          <string-name>
            <given-names>F.</given-names>
            <surname>Valdes-Souto</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H. G.</given-names>
            <surname>Perez-Gonzalez</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C. A.</given-names>
            <surname>Perez-Delgado</surname>
          </string-name>
          ,
          <article-title>Q-cosmic: Quantum software metrics based on cosmic (iso/iec19761)</article-title>
          ,
          <source>arXiv preprint arXiv:2402.08505</source>
          (
          <year>2024</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref29">
        <mixed-citation>
          [29]
          <string-name>
            <given-names>K.</given-names>
            <surname>Khattab</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Elsayed</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Soubra</surname>
          </string-name>
          ,
          <article-title>Functional size measurement of quantum computers software</article-title>
          ,
          <source>Proceedings of the 31st IWSM-Mensura</source>
          , Izmir, Turkey (
          <year>2022</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref30">
        <mixed-citation>
          [30]
          <string-name>
            <given-names>J. A.</given-names>
            <surname>Cruz-Lemus</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L. A.</given-names>
            <surname>Marcelo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Piattini</surname>
          </string-name>
          ,
          <article-title>Towards a set of metrics for quantum circuits understandability</article-title>
          ,
          <source>in: International Conference on the Quality of Information and Communications Technology</source>
          , Springer,
          <year>2021</year>
          , pp.
          <fpage>239</fpage>
          -
          <lpage>249</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref31">
        <mixed-citation>
          [31]
          <string-name>
            <given-names>T.</given-names>
            <surname>Duong</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S. T.</given-names>
            <surname>Truong</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Pham</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Bach</surname>
          </string-name>
          ,
          <string-name>
            <surname>J.-K. Rhee</surname>
          </string-name>
          ,
          <article-title>Quantum neural architecture search with quantum circuits metric and bayesian optimization</article-title>
          ,
          <source>in: ICML 2022 2nd AI for Science Workshop</source>
          ,
          <year>2022</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref32">
        <mixed-citation>
          [32]
          <string-name>
            <given-names>M.</given-names>
            <surname>Salm</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Barzen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Leymann</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Weder</surname>
          </string-name>
          ,
          <article-title>About a criterion of successfully executing a circuit in the nisq era: what wd 1/ ef really means</article-title>
          ,
          <source>in: Proceedings of the 1st ACM SIGSOFT International Workshop on Architectures and Paradigms for Engineering Quantum Software</source>
          ,
          <year>2020</year>
          , pp.
          <fpage>10</fpage>
          -
          <lpage>13</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref33">
        <mixed-citation>
          [33]
          <string-name>
            <given-names>A.</given-names>
            <surname>Díaz Muñoz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. Rodríguez</given-names>
            <surname>Monje</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. G.</given-names>
            <surname>Piattini Velthuis</surname>
          </string-name>
          ,
          <article-title>Towards a set of metrics for hybrid (quantum/classical) systems maintainability</article-title>
          .,
          <source>JUCS: Journal of Universal Computer Science</source>
          <volume>30</volume>
          (
          <year>2024</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref34">
        <mixed-citation>
          [34]
          <string-name>
            <surname>W. van der Schoot</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Wezeman</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N. M.</given-names>
            <surname>Neumann</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Phillipson</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Kooij</surname>
          </string-name>
          ,
          <article-title>Q-score maxclique: The first quantum metric evaluation on multiple computational paradigms</article-title>
          ,
          <source>arXiv preprint arXiv:2302.00639</source>
          (
          <year>2023</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref35">
        <mixed-citation>
          [35]
          <string-name>
            <given-names>H.</given-names>
            <surname>Safi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Wintersperger</surname>
          </string-name>
          , W. Mauerer,
          <article-title>Influence of hw-sw-co-design on quantum computing scalability</article-title>
          ,
          <source>in: 2023 IEEE International Conference on Quantum Software (QSW)</source>
          , IEEE,
          <year>2023</year>
          , pp.
          <fpage>104</fpage>
          -
          <lpage>115</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref36">
        <mixed-citation>
          [36]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Niu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Shabani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Shapourian</surname>
          </string-name>
          ,
          <article-title>Quantum volume for photonic quantum processors</article-title>
          ,
          <source>Physical Review Letters</source>
          <volume>130</volume>
          (
          <year>2023</year>
          )
          <fpage>110602</fpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>