Lirandë Pira
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Lirandë Pira has a total of 29 co-authors. Here are the top co-authors by number of shared publications:
- Patrick Rebentrost
Centre for Quantum Technologies, National University of Singapore, Singapore, Singapore
5 shared publications Daniel Peace
School of Mathematics and Physics University of Queensland Brisbane Queensland Australia
2 shared publicationsJacquiline Romero
School of Mathematics and Physics University of Queensland Brisbane Queensland Australia
2 shared publicationsNayanthara Prathap
Centre for Quantum Technologies National University of Singapore Singapore Singapore
2 shared publications- Airin Antony
School of Mathematics and Physics University of Queensland Australia
1 shared publication - Airin Antony
School of Mathematics and Physics University of Queensland Brisbane Queensland Australia
1 shared publication
Latest Publications
- Open Access
- 14 May 2026
- Published by Wiley in Advanced Photonics Research
- Vol. 7 (5) , e202500284
Advancing Photonic Inverse Design with Interpretable Machine Learning
Photonic chip design has in recent years seen significant advancements with the adoption of inverse design methodologies largelyenabled by the increasing computational efficiency of electromagnetic solvers. However, the often black‐box nature of this optimization method presents new challenges in understanding their outputs, particularly in the case of topological inverse design implementations. This challenge is prevalent in machine learning–based optimization methods, which can suffer from the same lack of transparency. To this end, interpretability techniques address the opacity of optimization models. In this work, we apply interpretability techniques from machine learning, with the aim of gaining understanding of inverse design optimization used in designing photonic components, for the specific case of a two‐mode (de)multiplexer. We base our methodology on the widely used interpretability technique known as local interpretable model‐agnostic explanations, or LIME. As a result, LIME‐informed insights point us to more effective initial conditions, directly improving device performance. This demonstrates that interpretability methods can do more than explain models—they can actively guide and enhance the inverse‐designed photonic components. Our results demonstrate the ability of interpretable techniques to reveal underlying patterns in the inverse design process, leading to the development of better‐performing components.
- 14 May 2026
- Published by Wiley in Advanced Photonics Research
- Vol. 7 (5) , e202500284
Open AccessAdvancing Photonic Inverse Design with Interpretable Machine Learning
Photonic chip design has in recent years seen significant advancements with the adoption of inverse design methodologies largelyenabled by the increasing computational efficiency of electromagnetic solvers. However, the often black‐box nature of this optimization method presents new challenges in understanding their outputs, particularly in the case of topological inverse design implementations. This challenge is prevalent in machine learning–based optimization methods, which can suffer from the same lack of transparency. To this end, interpretability techniques address the opacity of optimization models. In this work, we apply interpretability techniques from machine learning, with the aim of gaining understanding of inverse design optimization used in designing photonic components, for the specific case of a two‐mode (de)multiplexer. We base our methodology on the widely used interpretability technique known as local interpretable model‐agnostic explanations, or LIME. As a result, LIME‐informed insights point us to more effective initial conditions, directly improving device performance. This demonstrates that interpretability methods can do more than explain models—they can actively guide and enhance the inverse‐designed photonic components. Our results demonstrate the ability of interpretable techniques to reveal underlying patterns in the inverse design process, leading to the development of better‐performing components.
- 1 April 2026
- Published by Springer Nature
- p. 1-19
Fundamentals of Quantum Machine Learning and Robustness
- 1 April 2026
- Published by Springer Nature
- p. 1-19
Fundamentals of Quantum Machine Learning and Robustness
- Top Cited PapersOpen Access
- 11 March 2026
- Published by Springer Nature in npj Quantum Information
- Vol. 12 (1)
QKAN: quantum Kolmogorov-Arnold networks with applications in machine learning and multivariate state preparation
We introduce quantum Kolmogorov-Arnold networks (QKAN), a quantum algorithmic framework inspired by the recently proposed Kolmogorov-Arnold Networks (KAN). QKAN inherits the compositional structure of KAN and is based on block-encodings, constructed recursively from a single layer using quantum singular value transformation. We demonstrate the algorithmic utility of QKAN in two applications. First, we introduce and analyze QKAN as a quantum learning model, treating the eigenvalues of block-encoded matrices as neurons and applying parametrized activation functions on the edges of the network. We show that QKAN is a wide-and-shallow neural architecture, where shallow depth is compensated by exponentially wide layers whenever efficient block-encodings of inputs are available. We further discuss how to parametrize and train QKAN using parametrized quantum circuits and quantum linear algebra subroutines. Second, we demonstrate that QKAN can serve as a multivariate quantum state-preparation protocol for functions with shallow compositional structure. We demonstrate this by efficiently preparing a multivariate Gaussian quantum state using a two-layer QKAN. Looking forward, we anticipate that QKAN’s compositional and modular design will enable new applications in quantum machine learning and quantum state preparation.
- 11 March 2026
- Published by Springer Nature in npj Quantum Information
- Vol. 12 (1)
Top Cited PapersOpen AccessQKAN: quantum Kolmogorov-Arnold networks with applications in machine learning and multivariate state preparation
We introduce quantum Kolmogorov-Arnold networks (QKAN), a quantum algorithmic framework inspired by the recently proposed Kolmogorov-Arnold Networks (KAN). QKAN inherits the compositional structure of KAN and is based on block-encodings, constructed recursively from a single layer using quantum singular value transformation. We demonstrate the algorithmic utility of QKAN in two applications. First, we introduce and analyze QKAN as a quantum learning model, treating the eigenvalues of block-encoded matrices as neurons and applying parametrized activation functions on the edges of the network. We show that QKAN is a wide-and-shallow neural architecture, where shallow depth is compensated by exponentially wide layers whenever efficient block-encodings of inputs are available. We further discuss how to parametrize and train QKAN using parametrized quantum circuits and quantum linear algebra subroutines. Second, we demonstrate that QKAN can serve as a multivariate quantum state-preparation protocol for functions with shallow compositional structure. We demonstrate this by efficiently preparing a multivariate Gaussian quantum state using a two-layer QKAN. Looking forward, we anticipate that QKAN’s compositional and modular design will enable new applications in quantum machine learning and quantum state preparation.
- Open Access
Fundamentals of Quantum Machine Learning and Robustness
Quantum machine learning (QML) sits at the intersection of quantum computing and classical machine learning, offering the prospect of new computational paradigms and advantages for processing complex data. This chapter introduces the fundamentals of QML for readers from both communities, establishing a shared conceptual foundation. We connect the worst-case, adversarial perspective from theoretical computer science with the physical principles of quantum systems, highlighting how superposition, entanglement, and measurement collapse influence learning and robustness. Special attention is given to adversarial robustness, understood as the ability of QML models to resist inputs designed to cause failure. We motivate the study of QML in adversarial settings, outlining distinctions between classical and quantum data and computations when the adversary is a core element. This chapter serves as a starting point to adversarial and robust quantum machine learning in subsequent chapters.
Open AccessFundamentals of Quantum Machine Learning and Robustness
Quantum machine learning (QML) sits at the intersection of quantum computing and classical machine learning, offering the prospect of new computational paradigms and advantages for processing complex data. This chapter introduces the fundamentals of QML for readers from both communities, establishing a shared conceptual foundation. We connect the worst-case, adversarial perspective from theoretical computer science with the physical principles of quantum systems, highlighting how superposition, entanglement, and measurement collapse influence learning and robustness. Special attention is given to adversarial robustness, understood as the ability of QML models to resist inputs designed to cause failure. We motivate the study of QML in adversarial settings, outlining distinctions between classical and quantum data and computations when the adversary is a core element. This chapter serves as a starting point to adversarial and robust quantum machine learning in subsequent chapters.
- 17 February 2026
- Published by American Physical Society (APS) in Physical Review A
- Vol. 113 (2)
Expressivity limits in quantum walk-based optimization
- 17 February 2026
- Published by American Physical Society (APS) in Physical Review A
- Vol. 113 (2)
Expressivity limits in quantum walk-based optimization
- Top Cited Papers
- 8 January 2026
- Published by American Physical Society (APS) in Reviews of Modern Physics
- Vol. 98 (2)
Quantum Linear System Solvers: A Survey of Algorithms and Applications
- 8 January 2026
- Published by American Physical Society (APS) in Reviews of Modern Physics
- Vol. 98 (2)
Top Cited PapersQuantum Linear System Solvers: A Survey of Algorithms and Applications
- 9 September 2025
- Published by American Physical Society (APS) in Physical Review A
- Vol. 112 (3)
Subuniversal variational circuits for combinatorial optimization problems
- 9 September 2025
- Published by American Physical Society (APS) in Physical Review A
- Vol. 112 (3)
Subuniversal variational circuits for combinatorial optimization problems
- Open Access
Quantum Learning with Tunable Loss Functions
Learning from quantum data presents new challenges to the paradigm of learning from data. This typically entails the use of quantum learning models to learn quantum processes that come with enough subtleties to modify the theoretical learning frameworks. This new intersection warrants new frameworks for complexity measures, including those on quantum sample complexity and generalization bounds. Empirical risk minimization (ERM) serves as the foundational framework for evaluating learning models in general. The diversity of learning problems leads to the development of advanced learning strategies such as tilted empirical risk minimization (TERM). Theoretical aspects of quantum learning under a quantum ERM framework are presented in [PRX Quantum 5, 020367 (2024)]. In this work, we propose a definition for TERM suitable to be employed when learning quantum processes, which gives rise to quantum TERM (QTERM). We show that QTERM can be viewed as a competitive alternative to implicit and explicit regularization strategies for quantum process learning. This work contributes to the existing literature on quantum and classical learning theory threefold. First, we prove QTERM learnability by deriving upper bounds on QTERM's sample complexity. Second, we establish new PAC generalization bounds on classical TERM. Third, we present QTERM agnostic learning guarantees for quantum hypothesis selection. These results contribute to the broader literature of complexity bounds on the feasibility of learning quantum processes, as well as methods for improving generalization in quantum learning.
Open AccessQuantum Learning with Tunable Loss Functions
Learning from quantum data presents new challenges to the paradigm of learning from data. This typically entails the use of quantum learning models to learn quantum processes that come with enough subtleties to modify the theoretical learning frameworks. This new intersection warrants new frameworks for complexity measures, including those on quantum sample complexity and generalization bounds. Empirical risk minimization (ERM) serves as the foundational framework for evaluating learning models in general. The diversity of learning problems leads to the development of advanced learning strategies such as tilted empirical risk minimization (TERM). Theoretical aspects of quantum learning under a quantum ERM framework are presented in [PRX Quantum 5, 020367 (2024)]. In this work, we propose a definition for TERM suitable to be employed when learning quantum processes, which gives rise to quantum TERM (QTERM). We show that QTERM can be viewed as a competitive alternative to implicit and explicit regularization strategies for quantum process learning. This work contributes to the existing literature on quantum and classical learning theory threefold. First, we prove QTERM learnability by deriving upper bounds on QTERM's sample complexity. Second, we establish new PAC generalization bounds on classical TERM. Third, we present QTERM agnostic learning guarantees for quantum hypothesis selection. These results contribute to the broader literature of complexity bounds on the feasibility of learning quantum processes, as well as methods for improving generalization in quantum learning.
- Open Access
Degree-Optimized Cumulative Polynomial Kolmogorov-Arnold Networks
We introduce cumulative polynomial Kolmogorov-Arnold networks (CP-KAN), a neural architecture combining Chebyshev polynomial basis functions and quadratic unconstrained binary optimization (QUBO). Our primary contribution involves reformulating the degree selection problem as a QUBO task, reducing the complexity from $O(D^N)$ to a single optimization step per layer. This approach enables efficient degree selection across neurons while maintaining computational tractability. The architecture performs well in regression tasks with limited data, showing good robustness to input scales and natural regularization properties from its polynomial basis. Additionally, theoretical analysis establishes connections between CP-KAN's performance and properties of financial time series. Our empirical validation across multiple domains demonstrates competitive performance compared to several traditional architectures tested, especially in scenarios where data efficiency and numerical stability are important. Our implementation, including strategies for managing computational overhead in larger networks is available in Ref.~\citep{cpkan_implementation}.Open AccessDegree-Optimized Cumulative Polynomial Kolmogorov-Arnold Networks
We introduce cumulative polynomial Kolmogorov-Arnold networks (CP-KAN), a neural architecture combining Chebyshev polynomial basis functions and quadratic unconstrained binary optimization (QUBO). Our primary contribution involves reformulating the degree selection problem as a QUBO task, reducing the complexity from $O(D^N)$ to a single optimization step per layer. This approach enables efficient degree selection across neurons while maintaining computational tractability. The architecture performs well in regression tasks with limited data, showing good robustness to input scales and natural regularization properties from its polynomial basis. Additionally, theoretical analysis establishes connections between CP-KAN's performance and properties of financial time series. Our empirical validation across multiple domains demonstrates competitive performance compared to several traditional architectures tested, especially in scenarios where data efficiency and numerical stability are important. Our implementation, including strategies for managing computational overhead in larger networks is available in Ref.~\citep{cpkan_implementation}. - Open Access
Enhanced Photonic Chip Design via Interpretable Machine Learning Techniques
Photonic chip design has seen significant advancements with the adoption of inverse design methodologies, offering flexibility and efficiency in optimizing device performance. However, the black-box nature of the optimization approaches, such as those used in inverse design in order to minimize a loss function or maximize coupling efficiency, poses challenges in understanding the outputs. This challenge is prevalent in machine learning-based optimization methods, which can suffer from the same lack of transparency. To this end, interpretability techniques address the opacity of optimization models. In this work, we apply interpretability techniques from machine learning, with the aim of gaining understanding of inverse design optimization used in designing photonic components, specifically two-mode multiplexers. We base our methodology on the widespread interpretability technique known as local interpretable model-agnostic explanations, or LIME. As a result, LIME-informed insights point us to more effective initial conditions, directly improving device performance. This demonstrates that interpretability methods can do more than explain models -- they can actively guide and enhance the inverse-designed photonic components. Our results demonstrate the ability of interpretable techniques to reveal underlying patterns in the inverse design process, leading to the development of better-performing components.
Open AccessEnhanced Photonic Chip Design via Interpretable Machine Learning Techniques
Photonic chip design has seen significant advancements with the adoption of inverse design methodologies, offering flexibility and efficiency in optimizing device performance. However, the black-box nature of the optimization approaches, such as those used in inverse design in order to minimize a loss function or maximize coupling efficiency, poses challenges in understanding the outputs. This challenge is prevalent in machine learning-based optimization methods, which can suffer from the same lack of transparency. To this end, interpretability techniques address the opacity of optimization models. In this work, we apply interpretability techniques from machine learning, with the aim of gaining understanding of inverse design optimization used in designing photonic components, specifically two-mode multiplexers. We base our methodology on the widespread interpretability technique known as local interpretable model-agnostic explanations, or LIME. As a result, LIME-informed insights point us to more effective initial conditions, directly improving device performance. This demonstrates that interpretability methods can do more than explain models -- they can actively guide and enhance the inverse-designed photonic components. Our results demonstrate the ability of interpretable techniques to reveal underlying patterns in the inverse design process, leading to the development of better-performing components.