The availability of certain entangled resource states (catalyst states) can enhance the rate of converting several less entangled states into fewer highly entangled states in a process known as catalytic entanglement concentration (EC). Here, we extend catalytic EC from pure states to mixed states and numerically benchmark it against non-catalytic EC and distillation in the presence of state-preparation errors and operational errors. Furthermore, we analyse the re-usability of catalysts in the presence of such errors. To do this, we introduce a novel recipe for determining the positive-operator valued measurements (POVM) required for EC transformations, which allows for making tradeoffs between the number of communication rounds and the number of auxiliary qubits required. We find that in the presence of low operational errors and depolarising noise, catalytic EC can provide better rates than distillation and non-catalytic EC.

Graph states are a powerful class of entangled states with numerous applications in quantum communication and quantum computation. Local Clifford (LC) operations that map one graph state to another can alter the structure of the corresponding graphs, including changing the number of edges. Here, we tackle the associated edge-minimisation problem: finding graphs with the minimum number of edges in the LC-equivalence class of a given graph. Such graphs are called minimum edge representatives (MER) and are crucial for minimising the resources required to create a graph state. We leverage Bouchet's algebraic formulation of LC-equivalence to encode the edge-minimisation problem as an integer linear program (EDM-ILP). We further propose a simulated annealing (EDM-SA) approach guided by the local clustering coefficient for edge minimisation. We identify new MERs for graph states with up to 16 qubits by combining EDM-SA and EDM-ILP. We extend the ILP to weighted-edge minimisation, where each edge has an associated weight, and prove that this problem is NP-complete. Finally, we employ our tools to minimise the resources required to create all-photonic generalised repeater graph states using fusion operations.

The generation of multiple entangled qubit pairs between distributed nodes is a prerequisite for a future quantum Internet. To achieve a practicable generation rate, standard protocols based on photonic qubits require multiple long-term quantum memories, which remains a significant experimental challenge. In this paper, we propose a novel protocol based on 2m-dimensional time-bin photonic qudits that allows for the simultaneous generation of multiple (m) entangled pairs between two distributed qubit registers and we outline a specific implementation of the protocol based on cavity-mediated spin-photon interactions. By adopting the qudit protocol, the required qubit memory time is independent of the transmission loss between the nodes, in contrast to standard qubit approaches. As such, our protocol can significantly boost the performance of near-term quantum networks.