PRPatrick Rebentrost

Patrick Rebentrost

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Patrick Rebentrost has a total of 75 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Top Cited Papers
    Open Access

    QKAN: quantum Kolmogorov-Arnold networks with applications in machine learning and multivariate state preparation

    by Petr Ivashkov, Po-Wei Huang, Kelvin Koor, Lirandë Pira, Patrick Rebentrost

    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

    by Lirandë Pira, Patrick Rebentrost

    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 Access

    Quantum Box-Muller Transform

    by Dinh-Long Vu, Hitomi Mori, Patrick Rebentrost

    The Box-Muller transform is a widely used method to generate Gaussian samples from uniform samples. Quantum amplitude encoding methods encode the multi-variate normal distribution in the amplitudes of a quantum state. This work presents the Quantum Box-Muller transform which creates a superposition of binary-encoded grid points representing the multi-variate normal distribution. The gate complexity of our method depends on quantum arithmetic operations and, using a specific set of known implementations, the complexity is quadratic in the number of qubits. We apply our method to Monte-Carlo integration, in particular to the estimation of the expectation value of a function of Gaussian random variables. Our method implies that the state preparation circuit used multiple times in amplitude estimation requires only quantum arithmetic circuits for the grid points and the function, in addition to a single controlled rotation. We show how to provide the expectation value estimate with an error that is exponentially small in the number of qubits, similar to the amplitude-encoding setting with error-free encoding.

  • Open Access

    Classical combinations of quantum states for solving banded circulant linear systems

    by Po-Wei Huang, Xiufan Li, Kelvin Koor, Patrick Rebentrost

    Solving linear systems is of great importance in numerous fields. Proposed quantum algorithms for preparing solutions for linear systems include the HHL algorithm with subsequent refinements and variational methods. Circulant linear systems appear in many physics-related differential equations. An interesting case is banded circulant linear systems whose non-zero terms are within distance K of the main diagonal. For these systems, we propose an approach based on the classical combination of quantum states (CQS) method relying on convex optimization against the available analytical solution. From decompositions into cyclic permutations, the solution can be approximately represented by a classical combination of a polynomial number of quantum states. We validate our methods using classical simulations as well as execution on an IBM quantum computer. While in the setting of this paper, efficient classical algorithms are available, our results demonstrate the potential applicability of the CQS method for solving physics problems such as heat transfer.

  • Open Access

    Efficient Identification of Permutation Symmetries in Many-Body Hamiltonians via Graph Theory

    by Saumya Shah, Patrick Rebentrost

    The computational cost of simulating quantum many-body systems can often be reduced by taking advantage of physical symmetries. While methods exist for specific symmetry classes, a general algorithm to find the full permutation symmetry group of an arbitrary Pauli Hamiltonian is notably lacking. This paper introduces a new method that identifies this symmetry group by establishing an isomorphism between the Hamiltonian's permutation symmetry group and the automorphism group of a coloured bipartite graph constructed from the Hamiltonian. We formally prove this isomorphism and show that for physical Hamiltonians with bounded locality and interaction degree, the resulting graph has a bounded degree, reducing the computational problem of finding the automorphism group to polynomial time. The algorithm's validity is empirically confirmed on various physical models with known symmetries. We further show that the problem of deciding whether two Hamiltonians are permutation-equivalent is polynomial-time reducible to the graph isomorphism problem using our graph representation. This work provides a general, structurally exact tool for algorithmic symmetry finding, enabling the scalable application of these symmetries to Hamiltonian simulation problems.

  • Open Access

    Artificial intelligence for representing and characterizing quantum systems

    by Yuxuan Du, Yan Zhu, Yuan-Hang Zhang, Min-Hsiu Hsieh, Patrick Rebentrost, Weibo Gao, Ya-Dong Wu, Jens Eisert, Giulio Chiribella, Dacheng Tao, et al.

    Efficient characterization of large-scale quantum systems, especially those produced by quantum analog simulators and megaquop quantum computers, poses a central challenge in quantum science due to the exponential scaling of the Hilbert space with respect to system size. Recent advances in artificial intelligence (AI), with its aptitude for high-dimensional pattern recognition and function approximation, have emerged as a powerful tool to address this challenge. A growing body of research has leveraged AI to represent and characterize scalable quantum systems, spanning from theoretical foundations to experimental realizations. Depending on how prior knowledge and learning architectures are incorporated, the integration of AI into quantum system characterization can be categorized into three synergistic paradigms: machine learning, and, in particular, deep learning and language models. This review discusses how each of these AI paradigms contributes to two core tasks in quantum systems characterization: quantum property prediction and the construction of surrogates for quantum states. These tasks underlie diverse applications, from quantum certification and benchmarking to the enhancement of quantum algorithms and the understanding of strongly correlated phases of matter. Key challenges and open questions are also discussed, together with future prospects at the interface of AI and quantum science.

  • Open Access

    Quantum Learning with Tunable Loss Functions

    by Yixian Qiu, Lirandë Pira, Patrick Rebentrost

    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

    Low-depth amplitude estimation without really trying

    by Dinh-Long Vu, Bin Cheng, Patrick Rebentrost

    Standard quantum amplitude estimation algorithms provide quadratic speedup to Monte-Carlo simulations but require a circuit depth that scales as inverse of the estimation error. In view of the shallow depth in near-term devices, the precision achieved by these algorithms would be low. In this paper we bypass this limitation by performing the classical Monte-Carlo method on the quantum algorithm itself, achieving a higher than classical precision using low-depth circuits. We require the quantum algorithm to be weakly biased in order to avoid error accumulation during this process. Our method is parallel and can be as weakly biased as the constituent algorithm in some cases.


  • Open Access

    Degree-Optimized Cumulative Polynomial Kolmogorov-Arnold Networks

    by Mathew Vanherreweghe, Lirandë Pira, Patrick Rebentrost

    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}.