Luise Prielinger

Luise Prielinger

Auto-generated profile, based on publicly available information

Luise Prielinger

QuTech, Delft University of Technology, Delft, The Netherlands

Research Focus & Metrics

Academic Career Length

3Years (2024-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
14 January 2025 in ACM Transactions on Quantum Computing
Verified
Journal Article
Open access
PEPau Escofet
Pau Escofet
AOAnabel Ovide
Anabel Ovide
MBMedina Bandic
Medina Bandic
LPLuise Prielinger
Luise Prielinger
HSHans van Someren
Hans van Someren
CACarmen G. Almudéver
Carmen G. Almudéver
Quantum computing represents a paradigm shift in computation, offering the potential to solve complex problems intractable for classical computers. Although current quantum processors already consist of a few hundred qubits, their scalability remains a significant challenge. Modular quantum computing architectures have emerged as a promising approach to scale up quantum computing systems. This article delves into the critical aspects of distributed multi-core quantum computing, focusing on quantum circuit mapping, a fundamental task to successfully execute quantum algorithms across cores while minimizing inter-core communications. We derive the theoretical bounds on the number of non-local communications needed for random quantum circuits and introduce the Hungarian Qubit Assignment (HQA) algorithm, a multi-core mapping algorithm designed to optimize qubit assignments to cores with the aim of reducing inter-core communications. Our exhaustive evaluation of HQA against state-of-the-art circuit mapping algorithms for modular architectures reveals a 4.9× and 1.6× improvement in terms of execution time and non-local communications, respectively, compared to the best-performing algorithm. HQA emerges as a very promising scalable approach for mapping quantum circuits into multi-core architectures, positioning it as a valuable tool for harnessing the potential of quantum computing at scale.

31 May 2025 in npj Quantum Information
Verified
Journal Article
Open access
PDF file
LPLuise Prielinger
Luise Prielinger
ÁIÁlvaro G. Iñesta
Álvaro G. Iñesta
GVGayane Vardoyan
Gayane Vardoyan
When physical architectures become too complex for analytical study, numerical simulation proves essential to investigate quantum network behavior. Although highly informative, these simulations involve intricate numerical functions without known analytical forms, making traditional optimization techniques that assume continuity, differentiability, or convexity inapplicable. We introduce a more efficient computational framework that employs machine learning models as surrogates for the objective function. We demonstrate the effectiveness of our approach by applying it to three well-known optimization problems in quantum networking: allocating quantum memory across multiple nodes, tuning an experimental parameter in every physical link of a quantum entanglement switch, and finding effective protocol configurations in a large asymmetric quantum network. Our algorithm consistently outperforms Simulated Annealing and Bayesian optimization within the allotted time, improving results by up to 29% and 28%, respectively. Our framework will thus allow for more comprehensive quantum network studies, integrating surrogate-assisted optimization with existing quantum network simulators.

1 January 2026 in IEEE Journal on Selected Areas in Communications
Verified
Journal Article
Closed access
LPLuise Prielinger
Luise Prielinger
KGKenneth Goodenough
Kenneth Goodenough
GAGuus Avis
Guus Avis
SKStefan Krastanov
Stefan Krastanov
DTDon Towsley
Don Towsley
GVGayane Vardoyan
Gayane Vardoyan

25 March 2024 in arXiv
Verified
Preprint
Open access
PDF file
PEPau Escofet
Pau Escofet
AOAnabel Ovide
Anabel Ovide
MBMedina Bandic
Medina Bandic
LPLuise Prielinger
Luise Prielinger
HSHans van Someren
Hans van Someren
CACarmen G. Almudever
Carmen G. Almudever
Quantum computing represents a paradigm shift in computation, offering the potential to solve complex problems intractable for classical computers. Although current quantum processors already consist of a few hundred of qubits, their scalability remains a significant challenge. Modular quantum computing architectures have emerged as a promising approach to scale up quantum computing systems. This paper delves into the critical aspects of distributed multi-core quantum computing, focusing on quantum circuit mapping, a fundamental task to successfully execute quantum algorithms across cores while minimizing inter-core communications. We derive the theoretical bounds on the number of non-local communications needed for random quantum circuits and introduce the Hungarian Qubit Assignment (HQA) algorithm, a multi-core mapping algorithm designed to optimize qubit assignments to cores with the aim of reducing inter-core communications. Our exhaustive evaluation of HQA against state-of-the-art circuit mapping algorithms for modular architectures reveals a $4.9\times$ and $1.6\times$ improvement in terms of execution time and non-local communications, respectively, compared to the best performing algorithm. HQA emerges as a very promising scalable approach for mapping quantum circuits into multi-core architectures, positioning it as a valuable tool for harnessing the potential of quantum computing at scale.

24 July 2024 in arXiv
Verified
Preprint
Open access
PDF file
LPLuise Prielinger
Luise Prielinger
ÁIÁlvaro G. Iñesta
Álvaro G. Iñesta
GVGayane Vardoyan
Gayane Vardoyan
We propose an optimization algorithm to improve the design and performance of quantum communication networks. When physical architectures become too complex for analytical methods, numerical simulation becomes essential to study quantum network behavior. Although highly informative, these simulations involve complex numerical functions without known analytical forms, making traditional optimization techniques that assume continuity, differentiability, or convexity inapplicable. Additionally, quantum network simulations are computationally demanding, rendering global approaches like Simulated Annealing or genetic algorithms, which require extensive function evaluations, impractical. We introduce a more efficient optimization workflow using machine learning models, which serve as surrogates for a given objective function. We demonstrate the effectiveness of our approach by applying it to three well-known optimization problems in quantum networking: quantum memory allocation for multiple network nodes, tuning an experimental parameter in all physical links of a quantum entanglement switch, and finding efficient protocol settings within a large asymmetric quantum network. The solutions found by our algorithm consistently outperform those obtained with our baseline approaches -- Simulated Annealing and Bayesian optimization -- in the allotted time limit by up to 18\% and 20\%, respectively. Our framework thus allows for more comprehensive quantum network studies, integrating surrogate-assisted optimization with existing quantum network simulators.

20 August 2025 in arXiv
Verified
Preprint
Open access
PDF file
LPLuise Prielinger
Luise Prielinger
KGKenneth Goodenough
Kenneth Goodenough
GAGuus Avis
Guus Avis
SKStefan Krastanov
Stefan Krastanov
DTDon Towsley
Don Towsley
GVGayane Vardoyan
Gayane Vardoyan
We introduce multipartite entanglement distribution protocols that use a quantum switch to deliver stabilizer states to a number of remote end users. As in existing schemes, the first step in our protocols involves Bell pair generation between the switch and each end user. However, unlike existing schemes that wait for all Bell pairs to be established before distributing the desired state -- for example, via a projective measurement -- our approach stores only a minimal subset of Bell pairs while processing every subsequent Bell pair immediately. In doing so, our protocols reduce the average Bell pair storage time compared to existing schemes, resulting in less cumulative noise as a direct consequence. On the theoretical side, our protocol design is grounded in the structure of vertex covers in graph states up to local complementation. Through a comprehensive numerical evaluation, we compare the fidelities of delivered states with those of a baseline scheme, for state sizes up to n = 50 qubits. Simulations also show that our protocols can achieve the critical fidelity threshold of 1/2 for multipartite entanglement in a wider range of depolarization rates and success probabilities of Bell-pair generation. Overall, our protocols always achieve an equal or higher fidelity of the distributed state, and can reduce infidelity by up to 45%.