Performance of quantum network applications utilising multiple contemporaneous quantum resources

We study the performance of contemporaneous quantum resource establishment between two distant nodes which are components of a near-term quantum network, enabling the two parties to attempt bipartite entanglement generation in a sequential manner. Each resource is created using the successfully generated entangled pairs and is subject to a lifetime limit, known as a cut-off, which triggers resource expiration -- possibly on both sides of the link -- causing a reset of the corresponding qubits. To carry out the execution of certain distributed quantum applications, the parties must be able to generate all quantum resources within the time window specified by this cut-off on qubit storage. For both a finite and infinite window cut-off, we utilise methodology from sequential window problems and scan statistics literature to obtain solutions for the first and second moments of the waiting time. We then go further to obtain the fidelity distribution of the resulting quantum states, which encapsulates information about their ages. As an application of these results, we demonstrate how they can be used to study sufficient parameter regimes for carrying out Verifiable Blind Quantum Computation in the presence of imperfect entangled links and memory decoherence. We present a method that, in the presence of an arbitrary function capturing the trade-off between the rate and fidelity of an entangled link, finds the optimal choice for the window size which minimises the expected time taken to carry out one component round of the protocol. In this way, we connect parameters corresponding to the underlying network architecture to the performance of the VBQC application.