In quantum circuit design, the question arises how to distribute qubits, used in algorithms, over the various quantum computers, and how to order them within a quantum computer. In order to evaluate these problems, we define the global and local reordering problems for distributed quantum computing. We formalise the mathematical problems and model them as integer linear programming problems, to minimise the number of SWAP gates or the number of interactions between different quantum computers. For global reordering, we analyse the problem for various geometries of networks: completely connected networks, general networks, linear arrays and grid-structured networks. For local reordering, in networks of quantum computers, we also define the mathematical optimisation problem.

A probabilistic model is developed to investigate the crack growth development in welded details of orthotropic bridge decks. Bridge decks may contain many of these vulnerable details and bridge reliability cannot always be guaranteed upon the attainment of a critical crack. Therefore, insight into the crack growth development is crucial in guaranteeing bridge reliability and scheduling efficient maintenance schemes. The probabilistic nature of the crack growth development model and the dependence of this model on many interdependent random variables result in significant uncertainties regarding model outcome. To reduce some of these uncertainties, the probabilistic model is combined with a monitoring system installed on a part of the bridge. In addition, a Bayesian network is used to determine the dependence structure between the different details (monitored and non-monitored) of the bridge. This dependence structure enables us to make more accurate crack growth predictions for all details of the bridge while monitoring only a limited number of those details and updating the remaining uncertainties.