Quantum-Based Combinatorial Optimization for Optimal Sensor Placement in Civil Structures

Over the last decade, concepts such as industry 4.0 and the Internet of Things (IoT) have contributed to the increase in the availability and affordability of sensing technology. In this context, Structural Health Monitoring (SHM) arises as an especially interesting field to integrate and develop these new sensing capabilities, given the criticality of structural application for human life and the elevated costs of manual monitoring. Due to the scale of structural systems, one of the main challenges when designing a modern monitoring system is the Optimal Sensor Placement (OSP) problem. The OSP problem is combinatorial in nature, making its exact solution infeasible in most practical cases, usually requiring the use of meta-heuristic optimization techniques. While approaches such as genetic algorithms (GA) have been able to produce significant results in many practical case studies, their ability to scale up to more complex structures is still an area of open research. This study proposes a novel quantum-based combinatorial optimization approach to solve the OSP problem approximately, within the context of SHM. For this purpose, a Quadratic Unconstrained Binary Optimization (QUBO) model formulation is developed, taking as a starting point the modal strain energy (MSE) of the structure. The framework is tested using numerical simulations of Warren truss bridges of varying scale. The results obtained using the proposed framework are compared against exhaustive search approaches to verify their performance. More importantly, a detailed discussion of the current limitations of the technology and the future paths of research in the area is presented to the reader.


Introduction
Modern Structural Health Monitoring (SHM) constitutes a powerful framework to detect, locate, and identify damage in a structural system [1].At its core, it is a hybrid technique that makes use of both sensing data and physical models to correctly assess the health state of one or more structural components.While in older structures the sensing technology and data collection systems relied heavily on expert inputs via the execution of manual inspections, the current trend is towards developing intelligent SHM systems that can leverage the increasing affordability and availability of modern sensing technology to remotely monitor a structure.This shift in paradigm serves multiple purposes.First, it increases the safety of the structure's operation, decreasing the exposure of human beings to the dangerous maneuvers required to collect data.Second, it decreases the downtime usually required to perform manual inspections.Finally, it allows expert personnel to continuously monitor the structure, detecting relevant damage indicators early and, therefore, decreasing even further the downtime and costs incurred due to corrective maintenance activity.All these advantages result in a structural system that is more reliable, safe, and cost-efficient to operate.
Examples of the use of intelligent SHM methodologies are abundant in the literature.For example, Meruane et.al. [2] presents how diverse machine learning techniques can be used to identify impacts in aerospace structural components remotely.Feng et al. [3] presents a review on the use of computer vision for SHM of civil infrastructure, ranging from the identification of dynamic response to the detection of damage.Azimi et al. [4] presents a state of the art review on the usage of deep learning techniques for the damage identification and quantification in civil structures.Finally, on a more general note, Bao et al. [5] present a general review on the usage of data-driven approaches for SHM, focusing the discussion on future trends and opportunities.
However, what all these techniques have in common is that they are all mostly data driven.Consequently, they make the underlying assumption that quality information can be retrieved from the structure using an appropriate sensor configuration.This is not a trivial assumption to make.The identification of changes in the dynamic properties of the structure, which are mostly conducive to identifying and locating anomalies and damage, strongly depends on where the information is captured, i.e., where the sensors are located.This situation gives rise to the problem commonly known as the Optimal Sensor Placement (OSP) problem.An OSP problem is usually formulated as a minmax optimization problem.On one hand, the goal is to capture enough information such that the posterior monitoring and diagnosis tasks can be fulfilled with the desired accuracy.On the other hand, due to sensor costs and operational restrictions, this level of captured information should be achieved using the minimum number of sensors possible.The latter restriction is important because when sensors are integrated into a structure, they become another component in the system, requiring their own maintenance schedule and reliability assessment.
In mathematical terms, the OSP problem can be classified as a discrete optimization problem, where the requirement is to find an optimal sensor layout within the structure in accordance with some metric of fitness.Obtaining the exact solution for this class of optimization problems is difficult because they usually present a combinatorial nature: the requirement is often to choose  sensor positions out of  candidate locations in the structure ( >> ).This characteristic makes the number of feasible sensor layouts to rapidly increase with the scale of the structural system.For example, a small structure comprised of 10 candidate locations and a budget of five sensors will have 252 feasible configurations that need to be evaluated, while a medium system composed of 100 candidate locations and a budget of 10 sensors will result in 1.73 × 10 !" possible combinations.This characteristic of the OSP problem renders the obtention of its exact solution an intractable problem in practical situations.
Currently, researchers tackle the OSP problem using a wide variety of solution strategies.Broadly, these algorithms can be divided into two classes: deterministic and stochastic algorithms.The first class corresponds to those algorithms that use deterministic rules to transverse the solution space in search of high-performance configurations.Stochastic algorithms, in change, use stochastic rules to transition between feasible solutions, allowing them to transverse a wider amount of the solution space, and often reach better solutions.Heuristic and meta-heuristic strategies are usually in this category.They have gained considerable popularity over the past decades in the field of OSP due to their relatively high efficiency in the treatment of larger problems.Genetic algorithms [6] and biologybased algorithms [7] are among the most relevant examples of these classes of solution strategy for the OSP problem.
Genetic algorithms work by initially setting a starting population of candidate solutions, which are iteratively combined and evaluated, only preserving for the next iteration those that fulfill a predetermined criterion of fitness.After a certain termination criterion is met, the best solution found is proposed as the near-optimal solution.A varied range of genetic algorithms has been used in the determination of OSP configurations.For example, Yi et.al. [8] proposed an improved genetic algorithm for the determination of sensor placement in a high-rise building in the north of China.More recently, Civera et.al. [9] presented a multi-objective genetic algorithm that takes into account the different damage scenarios that may affect structures, guiding the optimization toward those configurations that can easily detect and identify certain types of failures.Biology-based algorithms are designed to emulate certain aspects of animals, in general the foraging behavior of insects, in the aid of locating high performance solutions.A modification of the well-known ant-colony optimization algorithm [10], widely used in the solution of the traveling salesman problem, was used by Feng et.al. [11] to improve the accuracy of OSP for a transmission tower model, beating traditional genetic algorithms.Sun & Büyüköztürk [12] applied a different algorithm inspired by the social behavior of bees.Their approach is tested using one simulated structural model and two real-world examples.Finally, Gomes & Pereira [13] proposed a modification to the firefly algorithm to perform SHM in the fuselage of commercial airplanes.For a complete review of the algorithms used for solving the OSP problem, the reader is referred to [14].
However, when the scale of the structural system is large, and therefore the number of candidate sensor locations is high, researchers have had to rely on preprocessing techniques or simplifying assumptions over the structural numerical models to reduce the number of locations before solving the optimization problem [14].For example, Sun et al. [12] proposed to solve the OSP problem using the bee colony algorithm by first reducing the size of the original structural model with the Iterated Improved Reduced System (IIRS) technique.With this approach, they are able to tackle the OSP problem in a case study concerning a structural building with 185 degrees of freedom (DOFs) by reducing it first to a smaller system with only 74 DOFs.Blachoswi et al. [15] proposed the use of convex relaxation and model reduction to transform a large OSP instance into a smaller, continuous one.With these two simplifications, they tackle a case study consisting of a transit bridge with 71,804 nodes, which after the model reduction step consists of a total number of candidate locations equal to 3,447.Moreover, Yang et al. [16] proposes the use of a multiobjective optimization approach to connect the selection of nodes in the model reduction stage with the election of optimal DOFs for sensor location.They validated this approach in a numerical case study involving a truss structure connecting two satellite bodies consisting of 117 candidate positions.What all these solution strategies have in common is the utilization of a simplification step over the original structural system, which likely places another penalization over the general accuracy of the solution approach.
Our interest in this paper is to explore a novel category of Quantum Computing algorithms that have the potential to not require these types of model-reduction steps.These techniques are currently divided into two main categories depending on the physical implementation of the quantum hardware in which they are executed.The first category uses Quantum Annealing (QA) [17] to solve quadratic unconstrained binary optimization (QUBO) problems.Based on the Quantum Adiabatic theorem, these algorithms first prepare a quantum system to encode a given optimization problem.Then, they evolve this system towards a lower energy state that represents a near optimum of the original optimization problem [17].In contrast, the second category approximates the behavior of quantum annealing using gate-based quantum computers.In general, gate-based quantum computing is a more flexible hardware implementation than QA and, therefore, it has received more attention from mainstream media and technology companies such as IBM or Google.The main approach for solving combinatorial problems using gate-based quantum computers is through the Quantum Approximation Optimization Algorithm (QAOA) ( [18], [19]), an approximation model of QA that can leverage the recent advances in gate-based quantum hardware.Both categories of quantum optimization solvers have already seen use in practical case studies.For example, Herman et.al. [20] present a survey on quantum computing for its application in finance, with a special emphasis on portfolio optimization techniques using both QA and QAOA.Similarly, Yarkoni et.al. [17] present a review of quantum annealing for industry applications, which includes solutions for scheduling and traffic flow optimization problems.In a closer context to SHM, Speziali et.al. [21] applied QA to find a near-optimal solution for the placement of pressure sensors in a water distribution network (WDN).The proposed approach first models the WDN as a mathematical graph, where the nodes are either tanks or junctions, and the edges are pipes connecting the different parts of the system.The OSP configuration is found by solving the minimum vertex covering problem, ensuring that the number of edges (pipelines) that are not monitored by an adjacent pressure sensor is minimized.
Following the trend of new applications that arise from this new field of research, this paper's main objective is to consider the capabilities and limitations of gate-based quantum optimization for the solution of the OSP problem in civil structures.For this, a novel Quadratic Unconstrained Binary Optimization (QUBO) model based on the Modal Strain Energy (MSE) criteria is proposed and approximately solved using the QOAO algorithm.For this purpose, we resort to a series of numerical experiments performed using quantum computing simulation software, that are ran directly on a desktop computer.Two Warren truss bridges of different scales are used as case studies for these experiments, in order to show how the proposed methodology scales with the size of the structure.This paper constitutes, to the best of the authors' knowledge, the first application of QAOA for the OSP problem in a structural engineering context.This paper makes three primary contributions.First, it aims to present a clear introduction to quantum computing for the civil engineering community, focusing on the relevant subject of sensor placement optimization.Second, using the aforementioned case studies, it aims to present the state of quantum computing optimization for the field, stating its current limitations and outlining future research opportunities.Third, and final, it outlines future research paths that tackle the limitations we have found, to hopefully motivate the community to start exploring the different uses of quantum computing in their respective fields.
The paper is organized as follows.Section 2 presents a brief introduction to the OSP problem, along with the main metric used as the objective function in its solution.Section 3 introduces a self-contained gate-based quantum computing theoretical background, focusing the attention on those aspects that are relevant to the QAOA technique, which is presented in Section 4. Section 5 presents the QUBO model formulation for the OSP problem and relevant implementation details for its application on the QAOA model.Then, Section 6 introduces the two case studies used to compare the proposed approach with exhaustive search solution techniques.Section 7 concludes the paper by critically assessing the current capabilities of quantum-based optimization techniques and outlines future paths of research in the area.Finally, a preprint has previously been published in [22].

Background on Optimal Sensor Placement for Civil Structures
SHM strategies using vibration-based modeling (VBM) rely on the hypothesis that damage can be detected, located, and identified using as a proxy variable the changes in the dynamic properties of different structural components.The dynamic behavior in the linear regime of most structures can be mathematically represented as a system of  #$% differential equations, where  #$% is the number of degrees of freedom in the structure.Equation (1) represents this system in matrix notation.
In equation ( 1), , , and  are the mass, damping, and stiffness matrices of the system, respectively, while  ⃗ () is an arbitrary excitation function.The determination of , , and  is usually dependent on both experimental and physical modeling techniques.The natural frequencies and modal shape vectors of the system can be obtained by solving the eigenvalue problem portrayed in equation (2).
Once solved, the squared natural frequencies and modal shape vectors of the system can be identified as the eigenvalues and eigenvectors, respectively.The modal shape vectors store important information about the dynamic characteristics of the system, as they constitute a linearly independent base from which the movement of the structure can be reconstructed.For this reason, many of the strategies to optimally locate sensors in a structure are focused on capturing a large amount of this modal information.To this extent, a wide variety of objective functions for the OSP problem have been formulated in the literature.A common category of fitness criteria groups those algorithms based on the Fisher Information Matrix (FIM).For example, the Effective Independence (EI) approach, originally proposed by Kammer [23], uses both the FIM and the mode shape matrix to find the sensor locations that maximize the amount of linear independency in the measured modal vectors.
However, the exposition in this paper is centered around the Modal Strain Energy criteria (MSE) [24], as it allows for the interpretation of the OSP problem as a Quadratic Unconstrained Binary Optimization (QUBO) problem, making it suitable for its implementation in quantum-based optimization schemes.The reason for this will become evident in section 5, where the Quantum Approximate Optimization Algorithm (QAOA) is detailed.

Modal Strain Energy (MSE)
An energy-based objective function for the OSP problem can be formulated by maximizing the strain energy captured by the chosen sensor locations.This function is known as the Modal Strain Energy [24] and its mathematical form is depicted in equation (3).
where  )* is the component corresponding to the -th DOF of the i-th modal shape vector and  )+ is the (, ) component of the stiffness matrix.While the MSE metric does not assures that the sensor locations will produce partial modal shape vectors with a lower degree of linear dependence, it has been reported that the modal strain energy is correlated with higher signal-to-noise ratios in the sensor locations ([25]- [27]), favoring the identification of damage in structures affected by perturbations from the environment or the usage of the structure itself.

Background on Gate-Based Quantum Computing
This section presents an introduction to gate-based quantum computing, following a functional approach.First, we introduce what a quantum computer is by briefly describing the three operations it can perform.Then, we explain each one of the operations in great detail, prioritizing a mathematical and computational explanation instead of a physicsbased one.We continue our exposition with a description of the quantum circuit model, a graphical representation of algorithms that a quantum computer can execute.Finally, we close this introduction with a brief discussion about quantum computing simulators, the tool used to run all the results presented in this paper.
A quantum computer is a physical machine designed to perform three main operations: (i) create and store quantum states, (ii) modify those quantum states, (iii) and measure those quantum states to extract classical information.By performing these three operations, a quantum computer is capable of ingesting, processing, and returning information to a user, effectively performing computation.Whether this novel computation paradigm presents advantages over traditional computational paradigms is currently a field of active research.However, there is strong theoretical evidence to suggest that given a quantum computer with enough capacity, quantum computing can produce algorithms that are vastly more efficient in certain tasks than traditional algorithms [28], [29].
In what follows, we describe in detail each of these operations.However, it is necessary to first present a brief explanation of the notation used in quantum computing, since it uses symbols traditionally used in contexts outside of those of SHM and OSP.

Bra-Ket Notation
Before presenting our introduction to this novel topic, it is necessary to introduce the bra-ket notation, heavily used in quantum computing.For the rest of this article, a complex column vector Ψ DD D⃗ !∈ ℂ 0×! will be represented using the ket notation as |Ψ !⟩.Similarly, a conjugate transpose vector will be denoted using the bra notation as Ψ DD D⃗ ( 3 = ⟨Ψ ( | ∈ ℂ !×0 .The inner product between these two vectors is written according to equation (4): Additionally, the tensor product between two complex vectors |Ψ !⟩ ∈ ℂ 0 $ ×! and |Ψ ( ⟩ ∈ ℂ 0 % ×! can be written in short form using the notation shown in equation (5): The bra-ket notation is extensively used in quantum computing to represent the quantum states and quantum gates.

Creation and Storage of Quantum States: Qubits and Systems of Multiple Qubits
The quantum computer, as a hardware component, is capable of creating and storing a quantum state.A quantum state, in simpler terms, is the state (at a certain moment in time) of a quantum system.Mathematically speaking, this quantum state is represented as a complex vector |Ψ⟩ ∈ ℂ 0×! with unitary norm.The simplest possible quantum state corresponds to the special case  = 2.In this case, the quantum state is commonly known as a qubit, and it represents the minimum unit of information in quantum computing.Equation ( 6) depicts a qubit using the ket notation, as a twodimensional complex vector: where { 4 ,  !} ∈ ℂ.Every qubit |⟩ can be decomposed as |⟩ =  4 |0⟩ +  !|1⟩, where |0⟩ and |1⟩ are the basis vectors, shown in equation ( 7): Because of this decomposition, an arbitrary qubit |⟩ is said to be in a superposition of states |0⟩ and |1⟩, controlled by the complex coefficients  4 and  ! .
A qubit |⟩ can also be represented graphically using the Bloch sphere.In the Bloch sphere, every possible quantum state that a qubit may encode is mapped to a point in the surface of a sphere of unitary radius.For this, the complex coefficients  4 and  ! are first represented in polar form, following equation (8).
However, it can be demonstrated [30] that using the restriction of the Bloch sphere unitary radius, we can reduce this set to only two coefficients, obtaining the qubit representation shown in equation ( 9): where 0 ≤  !≤  and 0 ≤  ( ≤ 2 are interpreted as the polar and azimuthal angles in a unitary sphere.It is straightforward to notice that the poles of the sphere, when  != 0 or  != , represent the basis states |0⟩ or |1⟩, respectively.Figure 1 shows the Bloch sphere representing an arbitrary qubit state.
Figure 1: Bloch sphere representation of a single qubit.The surface of the unitary sphere encodes all the possible quantum states that a qubit may hold.As a result, quantum states can also be completely characterized, up to a global phase, by two real numbers:  ! and  " .
As it will be shown in section 3.3, the Bloch sphere allows for the interpretation of transformation operations over quantum states as rotations around the X, Y, and Z axis.
In a similar fashion to classical computing systems, where independent bits are of little use, single qubit systems are heavily limited in the computations they can carry.For this reason, quantum computers usually joined qubits together to generate useful quantum states.Given two qubits, | !⟩ =  !4 |0⟩ +  !! |1⟩ and | ( ⟩ =  (4 |0⟩ +  (! |1⟩ , their multi-qubit system is described by the outer product presented in equation (10): Equation (10) can also be expressed differently.Reinterpreting  !=  !4  (4 ,  ( =  !4  (! ,  " =  !!  (4 , and  7 =  !!  (! , the vector | ! ( ⟩ can be written as: where the following short notation for the outer product has been used: , and |1⟩ ⊗ |1⟩ = |11⟩.This pattern can be naturally extended to larger systems composed of more than two qubits.In general, an -qubit system will consist of complex coefficients { * } *1! ( ' , given by the elements of the . This manner of constructing quantum states in a quantum computer has the following two crucial implications.First, all practical quantum states in quantum computing will be of dimension  = 2 ' , where  is the number of qubits used (and combined) in the system.Second, and most importantly, there is an exponential scaling between the capacity of the quantum computer, measuring in its number of qubits, and the total number of complex coefficients that it can store.This particularity of quantum computing is the cornerstone of why researchers believe it may hold promise to tackle challenges that remain unresolved for traditional computers.
Another interesting quantum computing property is entanglement.Some quantum states are mathematically and physically valid, but they cannot be written as the Kronecker product of  sub-states.An example of this is the state given in equation (12): To see this, note that the system of equations presented in equation ( 13) does not have a solution.If neither  !4 ,  (4 ,  !! or  (! can be zero following the restriction that  ! and  7 are nonzero, then if follows that  ( and  " should also be nonzero, which would not represent the quantum state depicted in equation (12): States that cannot be written as the Kronecker product of  sub-states, such as the one presented in equation (12), are known as entangled states.On the other hand, quantum states that can be represented as a Kronecker product are known as separable states.Entanglement is a very important quantum computing property, as it allows for the creation of conditional relationships between qubits.For example, if the first qubit in the system depicted in equation ( 12) is found in the |0⟩ state, then it automatically follows that the second qubit must also be in the |0⟩ state (due to the complex coefficient accompanying |01⟩ being zero).How to modify the quantum state of a system, and how to create entangled states in a quantum computer will be reviewed in section 3.3.

Modification of Quantum States: Quantum Gates and Unitary Matrices
Quantum states can be modified through the successive application of quantum gates.Quantum gates are linear maps represented by unitary2 matrices .Once a unitary operation is applied to a quantum state, a new quantum state is obtained.This state evolution is mathematically described in equation ( 14), where we have used  as a variable indexing the steps in the overall transformation that a quantum state may go through in a quantum computer.
Quantum gates are usually divided into single qubit gates and multi-qubit gates, according to the number of qubits they act on.Table 1 shows the most common single qubit gates, along with an interpretation of their effect on the Bloch's sphere.
Rotation by  with respect to the axis formed by the unitary vector with elevation angle @ 7 and null azimuthal angle.
As can be seen in Table 1, some quantum gates are parametric, i.e., they can receive an external parameter in the form of an angle .These gates will be shown to be fundamental to encoding optimization problems into a quantum computer.
Multi-qubit gates are in general used to induce conditional relationships between the states of different qubits.The most used gates that represent these conditional relationships are the controlled-not (CX) gate and Toffoli (CCX) gate, also known as the double controlled-not gate.Both gates are portrayed in Table 2, along with their matrix form.
Table 2: multi-qubit gates and their matrix representation.Matrices dimensions and the number of qubits () are always related by the relationship  ∈ ℂ " !×" ! .
In a similar fashion to qubits being concatenated to form larger quantum states, quantum gates can also be concatenated using the Kronecker product to generate a global unitary operation that conforms with the expression |Ψ A9! ⟩ = |Ψ A ⟩, where |Ψ A9! ⟩and |Ψ A ⟩ are the states before and after the application of the unitary matrix.This concatenation process is better explained through an example.Let us assume that a Hadamard gate, Rotation-Y gate, and CNOT gate are applied over a four-qubit system.This situation is depicted in Figure 2a.The final state before the measurement operation can be computed as |Ψ⟩ = | ! (  "  7 ⟩, with  given by the expression in equation (15).
(a) The system does not require padding as every qubit is modified by the same number of gates.
(b) The system requires padding as qubit | !⟩ is the only affected by a second round of quantum operations.
Figure 2: Quantum gates applied to multi-qubit systems.(a) shows a possible combination where single gates are applied to certain qubits, while a multi-qubit gate is applied to the sub-system composed by | $ ⟩ and | % ⟩.(b) shows how padding with identity gates is used to complete the system of gates.
Figure 2b portrays a slightly different scenario, in which a Rotation-X gate has been applied over qubit | !⟩ after the initial Hadamard gate.For this case, the final quantum state before the measurement operation can be computed as |Ψ⟩ =  (  !| ! (  "  7 ⟩, where  ! is given by equation (15) and  ( is formed by padding the missing gates in qubits  ( ,  " and  7 with identity gates, resulting in the expression shown in equation (16): Padding with identity gates is necessary for  ( to be an element in ℂ !B×!B making the expression |Ψ⟩ =  (  !| ! (  "  7 ⟩,valid from a matrix multiplication perspective.Expanding this example to the general case of an -qubit system, any operation over a quantum state can be understood as the application of  independent unitary operations { * } * C where each  * ∈ ℂ ( ' ×( ' .Furthermore, the total operation is the result of multiplying the unitary operations, according to . This process of consolidation of unitary operations is shown graphically in Figure 3.The dependance between the number of qubits that a system contains and the size of the matrices it can encode hints at the main advantage that quantum computing has over traditional computing.As an example, a quantum computer with 50 qubits can encode a unitary matrix U ∈ ℂ ( (& ×( (& , which contains more than 1.267 × 10 "4 complexvalued entries.Assuming that each entry is stored using 16 bytes, storing this matrix in a traditional computer would require roughly 2 × 10 !B petabytes 3 of information.This amount of storage, and more importantly, the processing capabilities to operate such an exorbitantly large matrix is several orders of magnitude bigger than what is traditionally available to researchers and practitioners nowadays.As such, we can think of quantum computing as a technology that can enable algorithms based on complex-linear algebra that require the operation of extremely large constituents.

Measurement Operations Over the Quantum State
So far, we have reviewed how a quantum computer creates and stores a quantum state through the combination of basic units of information called qubits, and how these quantum states can be modified through the application of unitary matrices known as quantum gates.Now, we turn our attention to how information can be read out from the quantum computer.
Notably, quantum states cannot be observed directly.In other words, it is impossible to know exactly, and at the same time, the value of all the complex coefficients that compose the quantum state.This restriction is fundamental to quantum mechanics, and it cannot be overruled.However, what can be done is to perform a physical operation over the quantum state known as "measurement".In mathematical terms, the result of this operation performed over |Ψ⟩ ∈ ℂ ( ' will be one its basis vectors | * ⟩,  ∈ {1, … , 2 ' }, in accordance with the probability distribution described in equation (17).
where  * is the i-th complex coefficient in the quantum state.In other words, the probability of obtaining a certain basis vector as a result of the measurement operation is completely controlled by the squared norm of the corresponding complex coefficient.Three important conclusions can be derived from equation (17).First, we can see that this presents a physics-based justification for the norm of all quantum states to be unitary: it is a necessary condition for the measurement probability distribution to be valid.Second, if we repeatedly construct and measure the quantum state, we can estimate the values of the squared norm of its entries; however, we will never be able to estimate the values of the original complex coefficients.Finally, and most importantly, a quantum state can be understood as an "object" encoding a categorical probability distribution over a space of 2 ' elements.Moreover, the process of applying quantum gates to modify the quantum state can be interpreted as transforming this probability distribution.
3 A petabyte is equal to 1,000,000 gigabytes.
As the quantum gates are unitary, and unitary matrices preserve the norm of the vector upon which they are applied, we are always assured that the resulting probability distribution will be a valid one.
Before continuing exploring what are the implications of this probabilistic interpretation of quantum computing, let us review some brief examples to clarify this measurement operation.Starting from the simplest possible case, equation (18) show the probability distribution corresponding to a single qubit Extending the probability distribution presented in equation ( 18), measurement operations over two-qubits systems are presented in equation (19): More generally, a measurement operation is described as a Hermitian4 matrix  E ∈ ℂ ( ' ×( ' .In this context, the sub-index  = 1,2, … 2 ' denotes one of the possible basis vectors of the system.That is, the measurement operation will measure the probability of obtaining one specific outcome.This probability, (| E ⟩) is given by equation (20): where |Ψ⟩ is the quantum state just before the measurement operation is applied.While a variety of measurement operators exist, this overview will be focused on projective measurements.These types of operators are formed by performing the outer product between two vectors basis vectors.

𝑝(|𝑒
Projective measurement operations extend naturally to multi-qubit systems, where the Hermitian matrices are also formed by applying an outer product operation between basis vectors.For example, in a three-qubit system, a possible measurement operation is  |4!4⟩ = |010⟩⟨010|.This operation is used to measure the probability of obtaining as a final deterministic state the bitstring 010, or in physical terms, to find the first, second, and third qubits in the states 0, 1, and 0, respectively. Another important measurement operation is to compute the expectation of a quantum state with respect to certain Hermitian operator  H .This expectation is given by the expression presented in equation (24).As it will be shown in section 4.2, this operation is fundamental for computing the expected cost associated with the solution obtained from a combinatorial optimization algorithm.
The stochastic nature of the qubits (and in consequence, of quantum systems) is one of the key differences when compared to the deterministic behavior of classical bits.The use of complex coefficients to encode probability distributions allows the use of interference between quantum states.If probabilities were to be defined as real numbers, then such probabilities would only increase when added.Following the setting presented in quantum computing, as probability amplitudes are added, they can interfere with each other, effectively resulting in a lower overall probability for a particular outcome after taking the squared norm of the result.A physical interpretation of the inference property can be found in the way waves can interfere between them, amplifying or nullifying the resultant amplitude.Interference represents one of the pillars of gate-based quantum computing, where a set of pre-defined operations are applied to a quantum system to increase the likelihood of certain states that represent the solution for a computation problem.

Quantum Circuit Model
The framework presented in this section characterizes a quantum computer as a machine that creates, modifies, and measures quantum states.This process is done through the combination of different qubits to generate an exponentially larger quantum state, and the successive applications of unitary matrices to this quantum state.Quantum programming, or the act to "program" a quantum computer, can be summarized as selecting which gates to apply to the initial quantum state, and if any of those gates are parametric, which parameters do we enforce.This definition generates a quantum algorithm, which is no other thing than a simple set of instructions describing which gates, in which order, and with which parameters to apply over the initial quantum state.The initial quantum state of a quantum computer is traditionally initialized in the basal state |00 … 0⟩, or |0⟩ ⊗' for brevity.This gives all quantum algorithms the same starting point and standardizes their application.
The quantum algorithm can be graphically represented in a schematic known as quantum circuit.Figure 4 (center) depicts a diagram of a quantum circuit acting over  qubits.The gates are represented by blocks that are applied over one or more qubits.At the end, we always include a measurement operation, describing that the quantum state is meant to be estimated through the process described in section 3.4.In terms of hardware, the current landscape of quantum computing is known as the Noisy Intermediate-Scale Quantum era (NISQ) [32].NISQ hardware is characterized by having small to medium computing capacities (measured in the number of qubits available) and very limited error-correction capabilities.The practical effect of the latter is that the result of the estimation of the square norm of the entries of the quantum states are highly contaminated by noise in current quantum computers.In this context, the most used framework for researching quantum computing is using a quantum simulator.A quantum simulator is a specialized piece of software that runs on a traditional computer and simulates exactly, and without measurement errors, the process that occurs inside a quantum computer.That way, researchers can test quantum algorithms and obtain the same results that they would obtain on an error-corrected quantum computer, which is still in its early development stages.For this paper, all the results we will show are computed using a quantum simulator, the detailed specifications of which are fully stated in section 6.
While using a quantum simulator has clear advantages over current quantum hardware, and in many cases, it is the only approach to test quantum algorithms, it is not without its limitations.First, the traditional computer running the quantum simulator needs to store and operate the unitary matrices, which scale exponentially with the number of qubits.Because of this, simulating anything over 20 qubits requires High Performance Computing capabilities, even with efficient algorithms for matrix multiplication.Second, since the results of a quantum simulation are executing in a traditional computer, performance comparison are made difficult since time is no longer a valid option for metrics.

Quantum Approximate Optimization Algorithm for Combinatorial Optimization
A Combinatorial Optimization Problem (COP) is formulated as finding the optimal element among a discrete collection in accordance with a certain criterion of performance.A special class of COPs are binary optimization problems, where the candidate solutions are binary vectors, and the performance criterion is a mathematical function that takes the candidate solutions as inputs and returns a numerical score as the output.The OSP problem can be formulated as a binary optimization problem by considering { ⃗ * } *1! ( * !"# to be the set of candidate sensor configurations, represented as binary-valued vectors.If for given candidate configuration  ⃗ * , the position  is equal to 1 ( *, = 1), then a sensor should be placed in degree of freedom .
In general, the solution space of binary COPs is prohibitively large due to the number of possible combinations that can be formed.For this reason, an exhaustive search approach is usually infeasible for large-scale structures.In addition, given the discrete nature of the solution space, binary COPs cannot, in principle, be solved using gradientbased optimization techniques, such as Stochastic Gradient Descent.Because of this, solution methodologies for binary COPs often are designed as heuristics or meta-heuristics: algorithms that do not guarantee the discovery of an optimal solution, but that attempt to find a near-optimal solution in a reasonable computational time.In this context, one of the most promising applications of quantum computing is as a meta-heuristic approach to solve binary COPs.The motivation for this is based on two aspects.First, as seen in section 3.5, repeatedly measuring a quantum system naturally results in a probability distribution over set of binary vectors.Additionally, this probability distribution can be modified by applying quantum gates.Consequently, finding the solution of a binary COP can be understood, in quantum computing terms, as finding a quantum circuit which when executed, assigns a high probability to the vector representing the optimal solution.Second, a quantum computer is at its core a physical system and, therefore, it can naturally evolve toward a lower energy state in the search for equilibrium.If a 1-to-1 mapping between the energy levels of the quantum system and the objective function value of each feasible solution can be established, then a relationship between solving the optimization problem and obtaining a lower energy state for the quantum system can be formulated.In what follows, the theoretical principles behind quantum-enhanced optimization are presented.

Quantum Time Evolution
The core concept behind quantum-enhanced optimization methods is the quantum adiabatic theorem.This theorem states that if a quantum system A is first prepared in one of its ground energy states and then transformed into quantum system B, then the final state will correspond to a ground energy state B if and only if the transition AàB was performed slow enough [33], [34].Mathematically, this transition is given by equation (25), where () is a smooth transition function that fulfills ( = 0) = 0 and ( = ) = 1, and  H and  K are Hermitian matrices known as Hamiltonians, representing the energy levels of quantum systems: In equation (25), () represent the Hamiltonian of the combined quantum system at time .The way in which a quantum state changes |Ψ()⟩ through time depends on its energy (i.e., its Hamiltonian and is given by the Schrödinger equation, presented in equation (26): The solution of Schrödinger equation is shown in equation (27).Note how the transformation of a quantum state from 0 to  is controlled by a matrix exponential operator.
This matrix exponential operator is a unitary operator, and as such is commonly referred to as (0, ).The composition property of time-evolution operators in quantum mechanics dictates that if  !<  ( , then performing an evolution (0,  ( ) is equivalent as performing two disjoint and successive evolutions (0,  ! ) and ( !,  ( ).Using this property, equation ( 27) can be rewritten as: where the application order of the unitary operators does matter (i.e., they are not commutative) and Δ = /.Each of the unitary operators  , are given by the expression presented in equation ( 29): If Δ is sufficiently small (or equivalently,  is sufficiently high), then () can be considered as a constant in each interval and therefore the integral can be approximated according to equation (30): Replacing () by the expression given in equation ( 25) provides the final form for the operator  , : Equation ( 31) can be further divided using the properties of the exponential function only when the matrices  H and  K commute.Regrettably, that is not generally the case and therefore it is necessary to use the Lie-Trotter-Suzuki decomposition formula [35], which states that exp(( !+  ( )) can be approximated by exp( !) exp( ( ) + ( ( ).Ignoring higher order terms, equation ( 31) can be approximated by: Finally, the evolution of the quantum state |Ψ()⟩ from  = 0 to  =  can be expressed by equation (33): Equation ( 33) condenses the approach used by quantum computing to solve COPs.Let us suppose that |Ψ(0)⟩ is defined as a ground energy level of the Hamiltonian  H , and that  K is a Hamiltonian encoding the optimization problem of interest.Then, if the transformation between  H and  K is performed in multiple steps, i.e.,  ≫ 1, or equivalently Δ ≪ 1, then state |Ψ()⟩ should represent a state that when measured will sample more frequently solutions vectors with a higher performance in terms of their objective value.Furthermore, the matrix exponentiation of a Hermitian matrix is a unitary matrix, and as such, can be recognized as a valid quantum gate.This allows us to rewrite equation (33) as: where  , = Δ‹1 − (Δ)OE and  , = Δ(Δ) are sets of parameters for the unitary operations.
However, it is still necessary to overcome two relevant challenges to fully realize an approach to solve a combinatorial optimization problem in a quantum computer: (i) how can we inform the quantum algorithm of the optimization problem?In other words, how can we encode the objective function of the optimization problem into a Hamiltonian matrix  K ?(ii) how can we represent the evolution of Hamiltonian  H and  K as a series of basic quantum gates in a gate-based quantum computer architecture.The following sections explain how to tackle these two challenges.

Hamiltonian Encoding of QUBO Problems
The objective is to encode a combinatorial optimization problem into a quantum system by mapping it to its total energy level (Hamiltonian).In the remainder of this subsection, the discussion will be limited to quadratic unconstraint binary optimization (QUBO) problems.Section 4.4 will detail how to incorporate constraints within the context of quantum computing optimization.The canonical form of QUBO problems applied to the OSP context is shown in equation (35): where  !∈ ℝ ( * !"# × ℝ ( * !"# ,  ( ∈ ℝ ( * !"# × ℝ ( * !"# , and  ⃗ is a vector representing a bitstring of size 2 0 !"# .
According to Farhi et.al [19], the Hamiltonian operator  encoding the QUBO problem should fulfill the following condition: given a measured quantum state of the form |⟩ = [0 0 0 0 … 1 … 0 0] D ∈ ℝ ( * !"# , where the 1 is located at position , the result of computing the expectation of a Hamiltonian matrix  under this state should be equal to the original cost function evaluated at the corresponding candidate sensor configuration  ⃗.It is important to note that |⟩ is a representation of  ⃗, but they are not equal.While |⟩ is a ket vector of 2 0 !"# dimensions that only contains one entry equal to one,  ⃗ is a feasible solution vector of the original QUBO, and therefore is a vector of dimension  #$% that may contain any number of 1s and 0s among its entries.The relationship between  ⃗ and |⟩ is bijective and given by: where  * is the i-th element of the vector  ⃗ and the ⊗ operator represents the Kronecker product.Take as an example the decision variable vector  ⃗ = [1 1] D .Its corresponding ket vector is |1⟩ ⊗ |1⟩ = [0 0 0 1] D .According to equation (24), the expectation of Hamiltonian matrix  given the state |⟩ is given by the expression presented in equation (37): From equation ( 37) is clear that  should be a diagonal operator containing in its diagonal the corresponding value of the cost function for each possible bitstring of length  #$% .As this matrix directly encodes the cost function of the optimization problem, it corresponds to the previous definition of  K .Figure 5 presents a graphical depiction of  K .However, directly constructing  K for a given relevant QUBO problem is in general infeasible.First, its size increases exponentially with the number of decision variables in the original problem.Second, an explicit construction involves computing the cost function for every possible solution vector, an approach that is equivalent to solving the QUBO problem by exhaustive search.Consequently,  K needs to be modeled implicitly.For this, Hadfield [36] proposed a series of rules to translate terms from a QUBO problem into the corresponding Hamiltonian form using varied combinations of Pauli-Z gates.The rules used in this paper are summarized in Table 3.

Linear Term
Multiplication of two binary terms, For example, the Hamiltonian corresponding to the two-variable cost function ( !,  ( ) =  ! !+  (  ( is given by equation (38).If the function is modified with a quadratic term, ( !,  ( ) =  !(  ! ( +  ! !+  (  ( , the new Hamiltonian (according to Table 3) will be: From equation (39), it is easy to note that the only state where the term  !( is included into the cost function is the state |⟩ = [0 0 0 1] D , which correspond to  ⃗ = [ ! ( ] D = [1 1], as expected.A special case for the quadratic term is  *  * , which is equivalent to  * given that all variables are binary. From the examples shown above, it is clear that the encoding of a cost function into a Hamiltonian following the rules presented in Table 3 is a linear operation.With this, a grouping strategy can be followed to implicitly represent any QUBO problem as a sum of three distinct types of Hamiltonians multiplied by real coefficients, according to equation (40): where ,  , , and  ,X are real constants.This approach is valid for any QUBO problem, independent of the size or number of cross-relationships between the variables.

Quantum Optimization Approximation Algorithm
The QAOA approach, originally proposed by Farhi et.al. [19], provides the practical implementation of equation ( 34) for a gate-based quantum computer.First, let us recall from section 4.1 that the evolution from the Hamiltonian  H towards the Hamiltonian  K can be approximated by the successive application of the parametric unitary matrices  M $ and  M % .Following the adiabatic theorem, the idea is to choose  H such that a ground energy state (eigenvector corresponding to the lower eigenvalue of the Hamiltonian matrix) is easily defined and prepared in a quantum circuit.For this, Farhi et.al. proposes the use of the following Hamiltonian: where  : , =  ⊗  ⊗ …  : … ⊗  and  : is a Pauli-X operator located in the -th position while the rest of the operators are identity gates.As expected, the operator  H ∈ ℝ ( * !"# × ℝ ( * !"# .The reasons for using this Hamiltonian are three-fold.First, a ground energy state can be easily generated by initializing an  #$% -qubit system in the |0⟩ ⊗0 !"# state and then apply a Hadamard gate to each qubit of the system.Second, a Hamiltonian of this form will automatically not commute with the cost Hamiltonian  K , a condition necessary for the QAOA algorithm to prevent it from becoming trapped in low-quality minima.Third, this Hamiltonian can be easily transformed into a unitary operation  by performing matrix exponentiation.Given that the Pauli-X operator commutes with itself, it is possible to separate the exponentiation without using the Lie-Trotter-Suzuki decomposition formula, and write: Replacing this expression in equation (42), it is possible to obtain: It can be proved that the expression  &*Y 2 Q 3 represents a unitary matrix corresponding to a Rotation-X quantum gate, according to equation (44).
Equation ( 43) and Equation (44) show that the unitary operation corresponding to the Hamiltonian  H can be represented in a quantum circuit by applying to each qubit a Rotation-X gate controlled by an angle 2 , = 2Δ‹1 − (Δ)OE.This circuit implementation is depicted in Figure 6.The process of mapping the Hamiltonian  K into a unitary operation  M -is similar.Combining equations (33) and (40), it follows that: It can be demonstrated that every term in  K commutes with each other and, therefore, equation ( 45) can be rewritten as: The first term in equation ( 46) can be disregarded given that it is a constant overall phase and therefore it is canceled during the normalization process of the quantum state.As a result, the unitary operation  M -consists of two types of terms: single and double Pauli-Z operators.Following a similar approach to that used in the mapping of  H , the Pauli-Z Hamiltonian results in a Rotation-Z when mapped into a quantum circuit.In a similar fashion, the double Pauli-Z operator results in a combination of CNOT and Rotation-Z gates.These mappings are shown in Figure 7.As a summary, equation (34) represents a gate-based quantum computing approximation of the quantum adiabatic theorem.In this approximation, the quantum evolution from a base Hamiltonian  H to a cost Hamiltonian  K is executed by successively applying the unitary operations  M , and  M -to a ground energy state of  H .This is the basis of the QAOA used to solve QUBO problems.While in the quantum adiabatic theorem both the parameters  , and  , directly depend on the function (), the original version of the QAOA algorithm does not model this dependence due to the function (), and the final evolution time  being unknown.As such, the QAOA performs a classical optimization loop over the full set of 2 parameters  , and  , to optimize the objective function.A clear disadvantage of this approach is the large number of parameters that need to be optimized, adding complexity to the optimization landscape.As a solution, Brandhofer et.al [37] proposed to harness the monotonically increasing nature of () to Q as monotonically decreasing and increasing sets, respectively 5 .For this,  , and  , are modeled as: This linear approach has two advantages.First, the optimization can be performed over only the set ª [ ,  \ « independently of the value of , which greatly simplifies the optimization process.Second, the physical meaning of  and , given by the quantum adiabatic theorem, is respected.As such, this approach is used in all experiments shown in this paper.
Finally, the parameter , described in section 4.1 as the number of intervals in which the timespan [0, ] is discretized, can be interpreted as a measure of how exact the approximation will be with respect to the original quantum adiabatic algorithm.As a result, it is expected to obtain higher performance solutions (closer to the optimum) as  increases.
QAOA is a hybrid algorithm in the sense that it still requires a classical counterpart to optimize the parameter set ª [ ,  \ «.If the circuit is formed and measured multiple times, a set of feasible solutions will be obtained.These solutions can then be classically evaluated to obtain a metric for the performance obtained by using certain values of ª [ ,  \ «.Finally, a classical optimization scheme can be used to tune these parameters to converge towards an optimum.While the final measurement of a quantum circuit will contain a certain degree of stochasticity, as the cost Hamiltonian guides the search of a lower energy state, it is expected that the measurement process will assign larger and larger probabilities to those solutions close to the optimum.
A nice interpretation of the QAOA technique is to understand it as a black box that transform an optimization problem defined over a discrete domain into one that is defined over a continuous set of variables ª [ ,  \ «.As such, it opens the door to a wider variety of classical optimization approaches, such as Stochastic Gradient Descent (SGD).A diagram of the quantum circuit for the QAOA algorithm is shown in Figure 8.
The previous sections described how gate-based quantum computing can be utilized to solve quadratic unconstrained binary optimization (QUBO) problems.However, many practical problems require the modeling of constraints on their decision variables.For this paper, the exposition will be limited to linear equality constraints on the number of sensors, as this is the most common type of constraint found in OSP literature.Equation (49) shows a linear equality constrains, whose parameters are contained in the diagonal matrix  " ∈ ℝ 0 !"# × ℝ 0 !"# : Currently, there are two main approaches to incorporating these types of constraints into the QAOA framework.The first approach is to add the linear constraint as a penalization term of the form ( "  ⃗ −  ] ) ( into the objective function.The parameter  controls how much a deviation with respect to the constrain is penalized.If finely tuned, the optimization algorithm will naturally avoid unfeasible solutions due to their high cost.A natural advantage of this approach is that the penalization term is also a quadratic function and, therefore, can be naturally incorporated and encoded into a quantum circuit using the techniques reviewed in section 4.2.However, this approach incorporates into the algorithm the complexity of finding the correct value for the hyperparameter .The second approach offers a solution for this problem under the condition that the matrix  " = .Under this consideration, the literature proposes for the Hamiltonian  H , presented in section 4.3, to be changed for a "XY" Hamiltonian [37],  :; , shown in equation (50): where  is a set containing all the pairs of the form {(1,2), (1,3), (1,4), … ( #$% − 1,  #$% )}, without repeating indices.As expected, the terms in  :; commute with each other and therefore its associated unitary operation can be written as [37]: When an XY Hamiltonian is used instead of the Traditional Hamiltonian  H presented in section 4.3, the initial state needs to change to fulfill the requirement of being a ground state of  :; .The new initial state is known as a Dicke state > ' 6 0 !"# ", and its formulation is shown in equation ( 52), as described in [37]: This initial state assigns equal probabilities to all those states that contain exactly  ] entries equal to one.The XY Hamiltonian  :; will then perform a "swapping" operation between two qubits at a time (changing a pair of qubits from 0 to 1 and from 1 to 0), keeping the number of qubits finally measured as 1 constant and therefore exclusively exploring solutions that are feasible under the constrain . This approach to tackling linear constraints has the advantage of not adding the  hyperparameter to the model.However, it is less flexible since it can only deal with constraints of the form shown in equation ( 49).Additionally, the generation of the Dicke state and the implementation of the XY Hamiltonian  :; require more quantum gates than the Traditional Hamiltonian  H described in section 4.3.Both approaches will be tested in the numerical case studies presented in this paper.
5 Proposed Framework for OSP using QAOA.
As mentioned in section 2, the QAOA-based framework to find near-optimal sensor configurations in civil structures uses the Modal Strain Energy (MSE) as an objective function [22].The reason for this is the quadratic form of the MSE function, which makes it ideal for its translation as a QUBO instance.Since the QAOA is a combinatorial optimization solver, the MSE is modified to include binary variables that represent the selection of sensor positions.Equation ( 53) presents the modified version of the MSE, where the dependency on the set of selected sensor positions  (as shown in equation ( 3)) is dropped in favor of the binary variables  ) and  + : As the term > )*  )+  +, > is completely determined by the dynamic properties of the structure, equation (53) represents a quadratic objective function dependent on the set of binary variables ª !, … ,  0 !"# «.
For this paper, we limit ourselves to only considering equality constraints, i.e., we have a budged of  ] sensors to install in the structure.This constraint is presented in equation ( 54): Consequently, the optimization problem that is going to be solved using the QAOA approach is described in equation ( 55).
When the equality constraint is introduced using a Traditional Hamiltonian  H , the objective function is modified with the corresponding penalization term, as shown in equation ( 56).
The proposed framework to solve equation (55) or equation (56) using the QAOA approach is listed below as an eight-step process: 1. Create a FEM model of the structure to obtain the stiffness and mass matrices.2. Solve the eigenvalue and eigenvector problem posed by equation ( 2) to obtain the modal shape matrix .

Use equation (53) to compute the coefficients
for each of the terms  )  + of the QUBO objective function using the MSE criteria.Recall from section 4 that  )  ) =  ) since  ) is a binary variable.4. Apply the relevant constraints to the problem.In particular, the proposed framework considers that the number of sensors that can be placed on the structure is equal to  ] .As such, a restriction of the type =  ] must be introduced via either a penalization term or the use of the XY mixer Hamiltonian, following the processes explained in section 4.4. 5. Using the mapping strategies described in section 4.3, generate the circuit corresponding to  &*[ 0 M -and  &*\ 0 M , or  &*\ 0 M 35 , depending on the penalization strategy chosen in step 4. Repeat this structure  times ( ∈ {1, … , }) and finalize with a measurement operation.6.The generated quantum circuit is executed and measured  a times.During each measurement, a binary vector  ⃗ representing a solution for the optimization problem is obtained.Using the objective function, the cost of each of these solution vectors is computed and averaged.7. A classical optimizer is used in conjunction with the average cost to tune the parameters ª [ ,  \ « towards a local optimum.The quantum circuit is treated as a black box function for this process, i.e., cost = ( [ ,  \ ).
8. Steps 6 and 7 are repeated until a stop criterion is reached (either a metric of performance, a maximum number of iterations or any other criteria particular to the classical optimizer used).
Once the parameters ª [ ,  \ « have been successfully tuned, a final set of quantum circuit measurement are executed to estimate the discrete probability distribution over the space of feasible solutions.The main objective of this paper is to assess how well this probability distribution can represent the solution of the original COP problem.
Finally, it is important to assess the number of gates required by this proposed approach to map an optimization problem into a gate-based quantum computer as a function of the structure's complexity and desired degree of accuracy.For this analysis, we will assume the worst-case scenario, which is a matrix  and  such that all the pairs  )  + have a non-zero coefficient in the objective function.While this is seldom to occur in practice, given that real matrices  and  usually contain zero entries, it allows us to study the upper limit in the number of gates as the size of structure increases.Under the aforementioned conditions, and assuming that the total number of degrees of freedom is  #$% , equation (53) indicates that the maximum number of unique and independent pairs  )  + with  ≠  in the objective function is given by ( #$% ( −  #$% )/2 while  #$% terms are of the form  )  ) .Therefore, the objective function will have ( #$% ( −  #$% )/2 quadratic terms and  #$% linear terms 6 .The extra terms added to the objective function due to an equality linear constraint using the penalization term technique can be factorized into these terms, and thus do not produce extra gates in the quantum circuit.As discussed in section 4.2, each quadratic term in  K will require three gates7 , while each linear term will only require one.As such, the size of the unitary operation  M -is at ( /2 −  #$% /2 gates.On the other hand, the number of gates generated by to  H will depend linearly on the number of variables.Therefore, the size of the overall quantum circuit is controlled by the cost Hamiltonian encoding and is quadratic on  #$% .Figure 9 shows how the number of quantum gates scale with the number of degrees of freedom in the structure for different values of .

Experimental Validation
This section presents results regarding the application of the proposed framework to two case studies of varying size.However, before delving into the case studies description and the results obtained by the QAOA approach, it is necessary to list a set of experimental considerations taken into account for the execution of the quantum circuits.

Determination of the penalization parameter 𝛼
Experimentally, we found that the QAOA performed better when the objective values are in the range comprehended between ~1 and ~10, approximately.For this purpose, we divided each one of the QUBO terms in the objective function by a constant corresponding to the total modal strain energy contained in the structure.By doing this, we are effectively normalizing the problem to obtain values in the aforementioned range.This modification of the objective function has the following advantages: (i) it preserves the ranking of solutions, which is fundamental since we do not want to alter the optimization problem, just to normalize it, (ii) it only requires to know the value of the total modal strain energy contained in the structure (assuming sensors at all degrees of freedom), which is easily computable by a simple matrix multiplication operation concerning the stiffness and modal matrices and does not require any type of optimization procedure, and (iii) since the problem is already normalized, we can define  = 1 and still have a well-scaled penalization term, in which all the feasible solutions have higher objective values than the non-feasible ones.With this approach, we avoid the cumbersome process of defining the parameter , which usually requires extensive testing and is problem dependent.

Performance measurement
For reporting purposes, the raw value of the MSE achieved by the solutions obtained with the QAOA approach does not give a clear indication of how good or bad the solutions are.To overcome this challenge, we will follow the approach described by Brandhofer et al. [37]and defined a normalized performance metric, , shown in equation ( 57) where  *, is the j-th component of the candidate solution  ⃗ * , and  Cb= and  C*' are the highest and lowest modal strain energy that can be obtained using a feasible configuration, respectively.In equation (57) a performance of  = 0 is automatically assigned to all infeasible solutions.On the other hand, the case  = 1 will corresponds to the optimal solution.Note that in a practical OSP problem, this normalization performance metric would be impossible to compute, since it requires knowledge of global maximum and minimum solution.However, the case studies presented in this paper are designed to be small enough that an extensive-search solution is possible in a couple of minutes, hence allowing for the normalized performance to be computed.
As explained in section 3.4, the output of QAOA's quantum circuit is a quantum state that can be interpreted as a discrete probability distribution over the space of feasible and non-feasible solutions,  cH$H ( ⃗ * ).Using equation (57), we can give a performance metric for how well this distribution assigns probability to optimal solutions by computing: where a weighted normalized performance is computed using as weights the probability values assigns to each possible feasible and non-feasible solution.

Computational and Optimization considerations
Due to the general unavailability of quantum hardware at the moment of writing this paper, all the results presented in this section were obtained using a quantum simulator program, which is a piece of code that can be executed in a traditional computer to simulate the behavior of a quantum computer.This places important limitations on the size of structures that can be analyzed.In particular, since each qubit in the quantum computer represents a degree of freedom in the structure, we are limited to analyze structures of ~20 degrees of freedom.The reason for this limitation is the exponential nature of quantum states with respect to the number of qubits.As mentioned in section 3.3, unitary matrices reach a size of 2 ' × 2 ' , where  is the number of qubits in the system.As a consequence, the analysis of a structure with 20 candidate locations for sensors will require the execution of operation concerning matrices with 2 (4 × 2 (4 = 1.099 × 10 !( elements, which is already at the limit of what a desktop computer can handle comfortably for experimentation purposes.
The quantum simulator used was PennyLane 0.33.1 [38], executed as a Python 3.10.8library in a computer with 128 GB of RAM, and an AMD Ryzen Threadripper PRO 3955WX 16-Cores processor.For the classical optimization loop, we have used the ADAM optimizer [39] to found optimal values for ª [ ,  \ «.The optimization termination criteria were the same for all experiments and correspond to finalize the optimization cycle if 500 iterations have been achieved or if the objective function has not been improved above a certain tolerance in three consecutive iterations.As a tolerance for improvement, we used  = 10 &7 .

Case studies description
We have chosen to test the QAOA proposed methodology on the same system at different scales to better compare how does the algorithm performs as the size of the structure increases.Consequently, the approach proposed in section 5 will be experimentally tested on Warren truss bridges of five (WT5) and 11 nodes (WT11), depicted in Figure 10 The stiffness matrix and mass matrices for both structures are computed using a finite element approach, employing truss elements and equivalent lump masses at the nodes.After the supported degrees of freedom are released from the structures, the candidate locations to place sensors (corresponding to the non-supported degrees of freedom) are reduced to six for WT5 and 18 for WT11.Additionally, the modal mass participation factors assuming a uniform excitation vector in the horizontal and vertical directions were computed to select a set of target modes for both structures.For the results used in this paper, we selected a set of the most significant modes such that they contributed 95% of the total effective mass.Following this approach, the target modes selected for WT5 are mode 1, mode 2 and mode 5, while for WT11 mode 1 through mode 4.
As mentioned before, these structures are small enough that their optimal sensor configuration can be computed using an exhaustive search approach.Table 4 lists the total number of possible sensor configurations for both structures.

WT5 WT11
Total number of sensor configurations

Experimental results
As mentioned in section 4, the QAOA approach can be understood as a black-box function that changes the original discrete optimization problem into a continuous optimization problem dependent on the parameter set ª [ ,  \ « through equations ( 47) and (48).We start this section by exploring what are the characteristics of the normalized performance function produced by the QAOA algorithm.For this, Figure 11 (a) and (b) show the normalized performance landscape obtained in both case studies, respectively.To produce these plots, we have varied the number of circuit repetitions (rows) and the Hamiltonian used as a mixer (columns).The color bar range indicates normalized performances, which varies from 0 to 1.In the title of each plot, we have noted the maximum normalized performance achieved in each particular case.It is important to note that these are not optimization results, but the landscapes of the normalized performance function obtained by just varying the parameters  \ and  [ from 0 to 2.In Figure 11(a), which corresponds to the WT5 case study, several notable observations emerge.Firstly, it is evident that higher values of parameter , corresponding to the number of QAOA circuit repetitions, strongly correlate with the highest normalized performance achieved.Secondly, when considering an equivalent number of circuit repetitions, the XY mixer Hamiltonian consistently outperforms the Traditional Hamiltonian in terms of normalized performance.This outcome aligns with our initial expectations, as the XY mixer Hamiltonian inherently incorporates the equality constrain related to the number of sensors to be placed in the structure, thereby constraining the search space accessible to the QAOA.On the other hand, the Traditional mixer Hamiltonian uses a penalization approach to enforce this constraint, which while effective, it does not reduce the search space available to QAOA.Additionally, while for the most part the Traditional Hamiltonian landscapes lack a discernible structure, the XY Hamiltonian exhibits a distinctive horizontal "stripped" pattern.This behavior suggests that the concentration of higher performance levels occurs at specific values of  \ with a relatively lower influence of the parameter  [ .This observation provides valuable insights into the functionality of the XY Hamiltonian.It's important to recall that  \ is associated with the mixer Hamiltonian, dictating the states explored during the quantum optimization process.Conversely,  [ is linked to the cost Hamiltonian, determining the states which will be assigned a higher probability based on their superior normalized performance.Considering these roles, it is logical that for a smaller structurewhere there are only 15 feasible candidate locations that the XY Hamiltonian will explore-the selection of which states to explore domain the overall normalized performance evaluation.
In the context of the case study concerning WT11, as depicted in Figure 11(b), several key observations emerge.First and foremost, unlike the WT5 case study, there is no evident improvement in performance with an increase in the number of circuit repetitions, .This difference in behavior hints at a possible shortcoming with the linearized approach to define the parameter set ª , ,  , « ,1! Q from the set ª \ ,  [ «, where for larger structures it may be necessary to explore non-linear dependances.On a different note, the XY Hamiltonian continues to be the preferable approach in terms of normalized performance when compared against Traditional Hamiltonian.The observed difference in normalized performance between both Hamiltonians enforces our intuition that reducing the available solution space by structurally integrating the existing constraints into the QAOA circuit is conducive to better overall performance.
In general terms, the landscapes produced by the QAOA in the WT11 can be classified as "barren plateaus" [40] given the lack of clear maxima or minima locations.This uniformity hints at an increased level of difficulty in pinpointing global optimal points, probably due to the use of a linear approach to compute the parameter set ª , ,  , « ,1! Q in a larger and more complex case study.Despite this difficulty, a subtle stripped pattern can still be observed for the  :; mixer Hamiltonian, reinforcing our intuition with respect to the different roles that  \ and  [ play in the optimization of the QAOA circuit.In stark contrast, the Traditional Hamiltonian loses all identifiable patterns, explaining the poorer results obtained.Now we turn our attention to the results obtained when the parameters ª \ ,  [ « are optimized.For this, we initialized the ADAM optimizer with the best points identified in the respective heatmap plots.These favorable initial conditions are employed to evaluate the potential effectiveness of the QAOA approach.The optimization cycle uses the considerations outlined in section 6.1.3.Through our experimentation with the ADAM optimizer, we've observed that an increase in the number of optimization cycles typically does not correspond to a subsequent increase in final performance.This behavior can be attributed to the optimization process often converging to a local optimum point within approximately 100 iterations.Subsequent iterations tend to refine the parameters towards points that provide only marginal improvements to the solution.
To ensure robustness, each optimization run was repeated five times, and the standard deviation was represented as error bars to provide insights into the stability of the outcomes.Figure 12 illustrates the normalized performance attained after this optimization process for both case studies.This approach not only allows for a detailed examination of the optimized results but also provides a measure of the variability in performance achieved through repeated optimization runs.In the context of the WT5 case study, as depicted in Figure 12 (a), the normalized performance exhibits a clear increase with a higher number of circuit repetitions.This outcome aligns with expectations stemming from the utilization of the Quantum Adiabatic Theorem in the QAOA derivation, where the parameter  represents the granularity for the discretization of the total adiabatic time.Analyzing the choice of Hamiltonian for the mixing operation, it is evident that the XY mixer consistently outperforms the Traditional Hamiltonian across all cases.This result is in accordance with our expectations, as the XY Hamiltonian's capacity to constrain the search space to feasible solutions should inherently result in significant advantages in terms of performance.Notably, for the highest number of circuit repetitions tested ( = 64) mixer Hamiltonian achieve a very high normalized performance, indicating that the QAOA is capable of identifying optimal sensor configurations for the WT5 case study structure.
Examining the results for the WT11 case study, illustrated in Figure 12 (b), we can observe that the Traditional mixer Hamiltonian exhibits an irregular performance as the value of  increases.The XY mixer Hamiltonian exhibits a similar, though more consistent, trend.The normalized performance remains largely constant, with a notable increase observed only in the most extreme case of  = 64.The fact that performance does not clearly improve as the values of  increases for the WT11 case study can be interpreted as evidence that, for larger structures, the linear process used to define the parameter set ª , ,  , « ,1! Q from ª \ ,  [ « may not be sufficiently flexible.It is essential to consider that, despite the lower final overall performances in comparison to the smaller case study WT5, the larger structure of WT11 introduces a significantly expanded search space.Matter of fact, as shown in Table 4, the size of the feasible space of WT11 is roughly 200 times larger than the space of WT5.Consequently, normalized performances ranging between 40%-50% still imply a noteworthy capacity of the algorithm to produce high quality solutions.
A significant drawback of the proposed quantum-based approach is highlighted by the capability of QAOA, particularly when utilizing the Traditional Hamiltonian ( H ), to yield infeasible solutions with a non-null probability.However, as the number of circuit repetitions  increases and the algorithm refines its performance, we should expect, at least in theory, a diminish in the probability of sampling a non-feasible solution.Ideally, the probability of sampling an infeasible solution should tend towards zero.
Figure 13 provides a visual representation of the probability of sampling an infeasible solution for both case studies, exclusively focusing on the Traditional mixer Hamiltonian case, since when the XY mixer Hamiltonian is used, this probability is by definition zero, as non-feasible states are not explored.The analysis of Figure 13 shows that, for the WT5 case study, the probability of sampling an infeasible solution effectively tends toward zero as the number of circuit repetitions increases.Matter of fact, for the case  = 64, case study WT5 reaches a probability of sampling infeasible solutions of less than 1%.However, for the WT11 case study, while there is an overall decreasing trend, this is irregular, with a peak in  = 4.This result holds considerable significance, since it underscores the fact that for larger case studies, a linear approach for defining the QAOA parameter set may not be a conducive to improved performance.Finally, we are interested in the probability of sampling the optimal solution for each particular case study.But before delving into the results, it's crucial to emphasize that a low probability of sampling the optimal solution does not necessarily imply poor model performance.To illustrate this point, consider a hypothetical scenario where a QAOA circuit can sample the optimal solution with only a 2% probability.While this might initially seem inadequate for certain optimization purposes, a closer examination reveals its practical efficacy.In a real-world scenario, this quantum circuit could retrieve the optimal solution, on average, after just 50 executions.Given the computational efficiency of individual circuit executions and the rapid evaluation of the MSE objective function, we can envision a situation where we execute the quantum circuit 500 times, retrieving 500 candidate vectors, and retain the highestperforming solution.In this context, we would have a high degree of confidence that the highest performing solution is in fact, the optimal solution.Consequently, it is not imperative for a model to provide an extremely high probability of sampling the optimal solution to be deemed suitable.What matters more is the model's ability to sample the optimal solution with a non-negligible probability, which is not trivial when the size of the feasible space may contain an enormous number of elements.
Examining Figure 14 for the WT5 case study, we can observe that the probability of sampling the optimal solution increases with the number of circuit repetitions, peaking at 42.7% for the XY Hamiltonian for the case  = 16.
However, for  = 64, an unexpected decrease in performance occurs for both mixing Hamiltonians, deviating from the anticipated improvement predicted by the QAOA theory.One potential explanation for this unexpected trend lies again in the linear dependence of QAOA parameters ª , ,  , « ,1! Q on the optimization parameter set ª \ ,  [ «.It is possible that at higher numbers of circuit repetitions, more flexible dependencies are required to continue improving the results, even for relatively small case studies.
Nevertheless, despite the fluctuations, it is noteworthy that for all cases except  = 1, the probability of sampling the optimal solution remains non-negligible.This clearly indicates the potential of QAOA as an algorithm for finding optimal solutions, especially when multiple circuit repetitions are employed.The bar-plot corresponding to the second case study, WT11, was excluded from the previous analysis due to a null probability of sampling the optimal solution for all numbers of circuit repetitions and both mixing Hamiltonians.However, achieving exactly the optimal solution is an extremely uncommon property among heuristic and metaheuristic algorithms.Most of them are design to return a solution that is close enough to the optimum.To explore the effectiveness of the solutions found by the QAOA approach in the more complex case study, WT11, we relax the condition from requiring the algorithm to sample the optimal solution to only requiring it to sample one of the top 10% best feasible solutions.The results regarding this relaxation are presented in Figure 15.This adjusted analysis provides a more nuanced understanding of the algorithm's performance, allowing for an exploration of its ability to generate solutions that, while not necessarily optimal, rank among the top-performing solutions within the feasible solution space.The results from Figure 15 reveal that the probability of sampling one of the top 10% feasible solutions is consistently higher for the XY mixer Hamiltonian, an anticipated result, given its ability to reduce the search space to only solutions that are feasible.The maximum probability achieved in this relaxed condition is 37.2% (for the case  = 64 with the XY mixing Hamiltonian).This result demonstrates the QAOA's capability to discover top-performing solutions, even for a relatively complex structure like the WT11 case study.
To conclude this analysis, we would like to draw attention to the results obtained with the traditional Hamiltonian,  H .For the best-performing case,  = 16, the probability of sampling a top 10% performing solution is approximately 15%.This raises concerns about whether this Hamiltonian is indeed finding high-performing solutions or merely getting trapped in a local minimum that assign an almost uniform probability to all feasible solutions, with just a modest higher probability weight to near-optimal solutions.In other words, whether the optimization cycle is primarily employed to avoid sampling non-feasible solutions rather than to identify truly superior solutions.To explore this assumption further, Figure 16 (a) and (b) show the results corresponding to the cases in which we want to sample the top 20% and top 50% feasible solutions, respectively.As suspected, the observed pattern for the Traditional mixer ( H ) persists: the best result achieved are relatively close to the thresholds of 25% and 50% in each case.In contrast, for the XY mixer, the probability of sampling the top 25% or top 50% consistently surpasses these thresholds, for all values of .This pattern suggests that the model utilizing the XY mixer is proficient at assigning a higher probability to solutions that are closer to the optimum, rather than generating a rather uniform probability distribution over the feasible solution space.This discovery holds significant implications, indicating the incapability, at least within the tested levels of circuit repetitions, of the traditional mixer to consistently find optimal solutions.It underscores the importance of incorporating the optimization constraints in a structured manner through the mixer Hamiltonian, as exemplified by the XY mixer.

Concluding Remarks, Challenges and Future Opportunities.
This paper presented a comprehensive introduction to gate-based quantum computing and quantum-based combinatorial optimization within a structural health monitoring context.For this, a novel framework that uses the Quantum Approximate Optimization Algorithm (QAOA) to solve the optimal sensor placement (OSP) task was proposed to the reader.The framework tackles the OSP task by converting the Mean Strain Energy (MSE) metric into a Quadratic Unconstrained Binary Optimization (QUBO) problem that can be easily encoded into the Hamiltonian of a quantum system and then minimized using the quantum adiabatic theorem.The proposed methodology was applied to numerical models of Warren truss bridges of varying size.The optimization landscape produced by the QAOA was analyzed by performing a search process over the parameter space.The landscape results indicated that the proposed approach is able to generate high quality solutions to the OSP combinatorial problem, especially when the accuracy of the QAOA technique is increased by augmented the size of the associated quantum circuit.Results related to the optimization procedure reveal a similar trend: near-optimal solutions can be discovered by the proposed approach, especially when the optimization constraints relationships are included into the quantum circuit via the mixer Hamiltonian.This is evidenced by the generalized higher results obtained by this approach when compared against the Traditional Hamiltonian that relies on a penalization approach for constraint incorporation.
The results shown in this paper mark a first step towards the study and exploration of current state of the art quantum-based optimization techniques in structural engineering applications.Additionally, the results obtained in this paper highlight challenges that quantum optimization approaches need to overcome to become a suitable alternative to current classical techniques for the OSP problem.In what follows, we describe these challenges and outline possible paths of research to addressed them.
First, the results shows that the QAOA obtains high performant solutions when using a high number of circuit repetitions, especially for the smallest case study.However, more circuit repetitions also imply an increase in the number of gates required to execute the quantum circuit, which imposes limitations in the practical realization of the QAOA approach.For this paper, we avoid any inconveniences related to measurement noise by using a quantum computer simulator.Nevertheless, when using real quantum hardware, experimental results report a maximum of ~5 before the quantum state is completely overcome by noise.While an algorithmic solution to noise measurement seems like a less promising path to follow, this issue could be minimized by exploring different optimization strategies that require a smaller number of circuit repetitions to achieve high performing results.
In a similar context as the first challenge, a high number of circuit repetitions also implies the use of a higher number of parameters { * } *1! Q and { * } *1! Q , which make the optimization process more challenging in practice.For this, the exploitation of physical restrains of the transition function (), particularly its monotonically increasing nature, presents a potential pathway to increase the number of circuit repetitions while simultaneously maintaining the optimization problem tractable with a relatively low number of parameters.A linear parameterization strategy was explored in this paper to this very end.However, we observed a clear shortcoming to this technique, especially in the results regarding the largest case study, denoted as WT11.For this, it results crucial for the implementation of the QAOA approach in structures of practical relevance the exploration of different transition functions, ideally non-linear ones, in order to increase the flexibility of the algorithm.
As a third challenge, we can identify the incorporation of constraints from the original optimization problem into the quantum circuit.The findings shown in this paper clearly indicate that improved results are obtained by incorporating the equality constrains using a XY Hamiltonian versus using a penalization approach.This is likely due to the reduction in the search space introduced to the model by the former, as compared to the latter.While the incorporation of equality constrains are already successfully incorporated using this framework, it is still unknown how to incorporate alternative constraints, such as inequality constrains or logic relationships between decision variables that commonly appear in similar contexts.Particularly important are constraints that prevent a phenomenon known as "sensor clustering" in the structure, where optimal configurations tend to group the sensors in certain parts of the structure.From a practical point of view, this is not desired as it prevents practitioners from analyzing all locations in the structural system, and therefore suitable constraints should be incorporated to prevent this clustering phenomena.To tackle these challenges, further research into alternative mixer Hamiltonians should take place, as this option avoids the incorporation of additional penalization hyperparameters into the model.Finally, while the use of the ADAM optimizer in this paper shows promising results, enhanced results could be obtained using optimization routines specifically designed for the QAOA algorithm, that possibly exploit the physical constraints imposed by the Quantum Adiabatic Algorithm.In this case, a constrained optimization forming a particular ordering in the sets { * } *1! Q and { * } *1! Q seems like an attractive area for future development in the area.
It is worth noting that the aforementioned research paths share a common attribute -they can be explored using a quantum simulator environment, without requiring the availability of a quantum computer.Therefore, they can be tackled in parallel to the development of quantum-capable hardware.As a final comment, we want to remark that the aforementioned challenges are independent to the fact that a quantum computer simulator was used to produce the results presented in this paper.Prior literature in the area commonly suggests that the performance of quantum algorithm will be improved once quantum-capable hardware becomes available at a large scale.We disagree with this notion.Improved results should not be expected by simply exchanging the quantum simulator environment for an execution process on quantum hardware.Indeed, a quantum computing simulation framework assumes an ideal, noisefree quantum computer and, therefore, measurement noise is not considered.This represents ideal execution conditions that are not likely to be achieved in the immediate future.As such, the challenges encountered in quantum computing algorithms nowadays should not be thought of as challenges produced by the lack of quantum hardware, but challenges related to the algorithms themselves.Consequently, we firmly believe that addressing these "algorithmic" challenges by early testing of quantum approaches in different disciplines, including Structural Health Monitoring, is just as critical as the development of large-scale, noise-free quantum hardware for the wide-spread adoption of quantum computing algorithms in practical engineering settings.

Figure 3 :
Figure 3: Consolidation of quantum operations.It is always possible to express the application of  gates over an -qubit system as one unitary operation by the usage of padding with unitary gates and the Kronecker product.

Figure 4 :
Figure4: Quantum circuit model.To the left is the initial quantum state probability distribution.At the center, a series of single and multi-qubit gates are applied to the quantum states to transform it.Finally, to the right, the final quantum state's probability distribution is shown.The final objective of quantum computing is to enhance the probabilities of obtaining those basis states that represent the solution to a certain task encoded in the quantum circuit.

Figure 5 :
Figure 5: Cost Hamiltonian diagonal structure.As the optimization problem is identified as a QUBO problem, for  &'( decision variables the total number of possible candidate configurations is 2 ) "#$ .

Figure 7 :
Figure 7: Quantum circuit mapping for Hamiltonian  " .(Left) Single Pauli-Z operators, representing linear variables in the objective function, are mapped into a single Rotation-Z gate.(Right) Double Pauli-Z operators, representing quadratic terms in the objective function, are mapped into a structure composed of two CNOT gates with a single Rotation-Z gate in between.

Figure 9 :
Figure 9: Number of quantum gates required to map the OSP problem for a structure of  &'( degrees of freedom, using multiple levels of repetitions in the QAOA algorithm.
(a) and Figure 10(b), respectively.The non-supported degrees of freedom are noted in each figure.All truss elements in both structures have the following properties: cross-sectional area of  = 1.43 × 10 &(  ( , Young's modulus  = 200 , density  = 7850 Xd C 7 and length  = 2.

Figure 10 :
Figure 10: Structures considered in the case studies.

Figure 11 :
Figure 11: Optimization landscape for the (a) WT5 case study and (b) WT11 case study.In each case, the left column presents results obtained using a Traditional Hamiltonian mixer ( , ), while the second column presents results obtained using a XY Hamiltonian mixer  -. .Rows indicates different values for the number of circuit repetitions, .Finally, the title of each subplot reveals the maximum normalized performance achieved in each case.

Figure 12 :
Figure12: Normalized performance achieved for both case studies using the Traditional mixer Hamiltonian ( , , in blue) and the XY mixer Hamiltonian ( -. , in orange) for varied number of circuit repetitions, .

Figure 13 :
Figure13: Probability of obtaining infeasible solutions for both case studies using the Traditional mixer Hamiltonian  , .As a reminder, infeasible configurations are those that contain a number of sensors different than two for WT5, or different than 4 for WT11.

Figure 14 :
Figure 14: Probability of sampling the optimal solution for the first case study, WT5.

Figure 15 :
Figure 15: Probability of sampling the top 10% best feasible solutions for the second case study, WT11.

Figure 16 :
Figure 16: Probability of sampling (a) the top 25% and (b) top 50% best feasible solutions for the second case study, WT11.

Table 1 :
Single qubit gates and their matrix representation.An interpretation of the gates' effects on the Bloch's sphere is also included for the reader's convenience.

Table 5
lists the 5 feasible candidate sensor configurations with the highest normalized performance for each structure, following equation (57).

Table 4 :
Total number of sensor configurations and number of feasible sensor configurations for both case studies presented in this paper.

Table 5 :
top 5 optimal solutions obtained by performing an exhaustive search approach for both case studies.