Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Philosophical Transactions of the Royal Society A Mathematical Physical and Engineering Sciences

Numerical analysis, spectral graph theory, orthogonal polynomials and quantum algorithms

Anastasiia Minenkova, Gamal Mograby, Hanmeng Zhan

Published Oct 9, 2025• 0 citations
Publisher

Abstract

Recent progress in quantum computing shows the need to incorporate many branches of mathematics (graph theory, matrix theory, optimization, theory of orthogonal polynomials and more) into physics, computer science and chemistry. At the 2024 SIAM Quantum Intersections Convening, Bert de Jong (Lawrence Berkeley National Laboratory) gave a talk entitled 'Quantum Science Needs Mathematicians' (Report of the SIAM Quantum Intersections Convening. Integrating Mathematical Scientists into Quantum Research, 7-9 October 2024, Tysons, Virginia (doi:10.11337/25M1741017)), since despite the growing demand for research in these domains, the mathematical sciences community has remained largely disengaged from quantum research, with only a few isolated areas of active involvement. This issue brings together researchers from different areas of mathematics to show the relation between spectral graph theory, the theory of orthogonal polynomials and numerical analysis. This interconnectedness highlights the versatility and importance of these areas of mathematics in the context of quantum computing.This article is part of the theme issue 'Numerical analysis, spectral graph theory, orthogonal polynomials and quantum algorithms'.

DOI
10.1098/rsta.2024.0426

Related papers

Quantum Information and Computation

Sandu Popescu, Noah Linden, Richard Jozsa

Guest Editors During the past two decades, there has emerged the new subject of quantum information and computation which both offers the possibility of powerful new modes of computing and communication and also suggests deep links between the well established disciplines of quantum theory and information theory and computer science. In recent years, the growth of the subject has been explosive, with significant progress in theory and experiment. The area has a highly interdisciplinary character with contributions from physicists, mathematicians and computer scientists in particular. Developments have occurred in diverse areas including quantum algorithms, quantum communication, quantum cryptography, entanglement and nonlocality. This progress has been reflected in contributions to Journal of Physics A: Mathematical and General which traditionally provides a natural home for this area of research. Furthermore, the journal's committment to this field has recently been strengthened by the appointments of Sandu Popescu and Nicolas Gisin to the Editorial Board, and in this special issue we take the opportunity to present a snapshot of the present state of the art.

Journal of Physics A Mathematical and General•Aug 24, 2001•49 citations

Quantum Visual Computing

Johannes Sebastian Mueller-Roemer, Vladislav Golyanik, Tolga Birdal

Quantum computing is emerging as a transformative force in computer science, offering significant advantages in speed and efficiency over classical computing methods. Despite this promise, the practical application of quantum computing to visual computing faces numerous challenges, including the complexity of quantum algorithms and the limitations of current quantum hardware. These challenges underscore the necessity for focused research and collaboration in this interdisciplinary area. This Special Issue of IEEE Computer Graphics and Applications, “Quantum Visual Computing,” aims at drawing attention to these challenges and bringing together pioneering research at the intersection of quantum and visual computing. By fostering dialogue and innovation between these fields, we hope to inspire new solutions and advance the state of the art in both domains.

IEEE Computer Graphics and Applications•Sep 1, 2024•2 citations

Scalable Quantum Computational Science: A Perspective from Block-Encodings and Polynomial Transformations

Kevin J. Joven, Elin Ranjan Das, Joel Bierman +3 more

Significant developments made in quantum hardware and error correction recently have been driving quantum computing towards practical utility. However, gaps remain between abstract quantum algorithmic development and practical applications in computational sciences. In this Perspective article, we propose several properties that scalable quantum computational science methods should possess. We further discuss how block-encodings and polynomial transformations can potentially serve as a unified framework with the desired properties. Recent advancements on these topics are presented including construction and assembly of block-encodings, and various generalizations of quantum signal processing (QSP) algorithms to perform polynomial transformations. The scalability of QSP methods on parallel and distributed quantum architectures is also highlighted. Promising applications in simulation and observable estimation in chemistry, physics, and optimization problems are presented. We hope this Perspective serves as a gentle introduction of state-of-the-art quantum algorithms to the computational science community, and inspires future development on scalable quantum computational science methodologies that bridge theory and practice.

quant-pharXiv:2511.16738•APL Computational Physics•Nov 24, 2025•2 citations

Discrete Quantum Walks on Graphs and Digraphs

Chris D. Godsil, Hanmeng Zhan

Discrete quantum walks are quantum analogues of classical random walks. They are an important tool in quantum computing and a number of algorithms can be viewed as discrete quantum walks, in particular Grover's search algorithm. These walks are constructed on an underlying graph, and so there is a relation between properties of walks and properties of the graph. This book studies the mathematical problems that arise from this connection, and the different classes of walks that arise. Written at a level suitable for graduate students in mathematics, the only prerequisites are linear algebra and basic graph theory; no prior knowledge of physics is required. The text serves as an introduction to this important and rapidly developing area for mathematicians and as a detailed reference for computer scientists and physicists working on quantum information theory.

Cambridge University Press eBooks•Dec 23, 2022•11 citations

QUANTUM ARTIFICIAL INTELLIGENCE: A SURVEY OF RECENT ADVANCES AND FUTURE CHALLENGES IN COMBINING QUANTUM COMPUTING AND MACHINE LEARNING

Deepak N A

Quantum Artificial Intelligence has been considered as one of transformative interdisciplinary areas that have joined quantum calculation with machine learning and optimization. The paper is a survey of the recent development in QAI and a detailed case study of the Quantum Approximate Optimization Algorithm, its mathematical formulation, operator-based modeling, and utility in practical application to combinatorial optimization. Based on the background principles of the Hilbert space theory, Hermitian operators and variational quantum circuits, the paper examines the process of encoding a classical optimization problem in a quantum Hamiltonian and the effects of circuit depth, parameterization, and graph structure on the algorithms. An example of Max-Cut case study shows how the algorithm performs on regular graph, irregular graph and weighted graph cases, showing good approximation even at small depths, and showing convergence behavior as outlined in theory. The comparative perspectives in regards to existing models of QAI further outline the advantages of QAOA with regard to interpretability and operator design, and also outline the constraints associated with noise sensitivity, measurement load, and hardware scalability. The way QAOA is related to spectral methods, variational theory, and discrete optimization are discussed as giving theoretical implications of QAOA to applied mathematics. The research finds that QAOA is a bright future of practical, yet mathematically rich, quantum computation in the near-term. The development in the future depends on the interdisciplinary cooperation, noise-resistant circuit engineering, and the development of quantum hardware to achieve the full potential of QAI in both science and engineering uses.

International Journal of Apllied Mathematics•Nov 2, 2025•0 citations

Mathematical Methods in Quantum Chemistry

Quantum chemistry focuses on modelling and simulating the behaviour of molecular systems using the fundamental principles of quantum mechanics. However, the underlying equations, such as the Schrödinger equation for computing the ground state of $N$ electrons, which is a partial differential equation defined on $\mathbb{R}^{3N}$, suffer from the curse of dimensionality. As a result, simulating even moderately sized molecules demands advanced techniques in analysis, approximation and reduced-order modelling for overcoming the naive computational complexity. In this workshop, the rapidly growing mathematical community working in the field together with several quantum chemists and physicists were gathered to discuss recent advances in areas such as (1) the mathematical and numerical analysis of standard models used in the field, including Density Functional Theory, Coupled Cluster, and the Density Matrix Renormalization Group (2) the development of efficient numerical methods, relying e.g. on the development of error bounds and (3) the opportunities of recent data-driven methods towards the approximation of wavefunctions or density matrices.

•Jan 1, 2025•0 citations
Recent progress in quantum computing shows the need to incorporate many branches of mathematics (graph theory, matrix theory, optimization, theory of orthogonal polynomials and more) into physics, computer science and chemistry. At the 2024 SIAM Quantum Intersections Convening, Bert de Jong (Lawrence Berkeley National Laboratory) gave a talk entitled 'Quantum Science Needs Mathematicians' (Report of the SIAM Quantum Intersections Convening. Integrating Mathematical Scientists into Quantum Research, 7-9 October 2024, Tysons, Virginia (doi:10.11337/25M1741017)), since despite the growing demand for research in these domains, the mathematical sciences community has remained largely disengaged from quantum research, with only a few isolated areas of active involvement. This issue brings together researchers from different areas of mathematics to show the relation between spectral graph theory, the theory of orthogonal polynomials and numerical analysis. This interconnectedness highlights the versatility and importance of these areas of mathematics in the context of quantum computing.This article is part of the theme issue 'Numerical analysis, spectral graph theory, orthogonal polynomials and quantum algorithms'.
Guest Editors During the past two decades, there has emerged the new subject of quantum information and computation which both offers the possibility of powerful new modes of computing and communication and also suggests deep links between the well established disciplines of quantum theory and information theory and computer science. In recent years, the growth of the subject has been explosive, with significant progress in theory and experiment. The area has a highly interdisciplinary character with contributions from physicists, mathematicians and computer scientists in particular. Developments have occurred in diverse areas including quantum algorithms, quantum communication, quantum cryptography, entanglement and nonlocality. This progress has been reflected in contributions to Journal of Physics A: Mathematical and General which traditionally provides a natural home for this area of research. Furthermore, the journal's committment to this field has recently been strengthened by the appointments of Sandu Popescu and Nicolas Gisin to the Editorial Board, and in this special issue we take the opportunity to present a snapshot of the present state of the art.
Quantum computing is emerging as a transformative force in computer science, offering significant advantages in speed and efficiency over classical computing methods. Despite this promise, the practical application of quantum computing to visual computing faces numerous challenges, including the complexity of quantum algorithms and the limitations of current quantum hardware. These challenges underscore the necessity for focused research and collaboration in this interdisciplinary area. This Special Issue of IEEE Computer Graphics and Applications, “Quantum Visual Computing,” aims at drawing attention to these challenges and bringing together pioneering research at the intersection of quantum and visual computing. By fostering dialogue and innovation between these fields, we hope to inspire new solutions and advance the state of the art in both domains.
Significant developments made in quantum hardware and error correction recently have been driving quantum computing towards practical utility. However, gaps remain between abstract quantum algorithmic development and practical applications in computational sciences. In this Perspective article, we propose several properties that scalable quantum computational science methods should possess. We further discuss how block-encodings and polynomial transformations can potentially serve as a unified framework with the desired properties. Recent advancements on these topics are presented including construction and assembly of block-encodings, and various generalizations of quantum signal processing (QSP) algorithms to perform polynomial transformations. The scalability of QSP methods on parallel and distributed quantum architectures is also highlighted. Promising applications in simulation and observable estimation in chemistry, physics, and optimization problems are presented. We hope this Perspective serves as a gentle introduction of state-of-the-art quantum algorithms to the computational science community, and inspires future development on scalable quantum computational science methodologies that bridge theory and practice.
Discrete quantum walks are quantum analogues of classical random walks. They are an important tool in quantum computing and a number of algorithms can be viewed as discrete quantum walks, in particular Grover's search algorithm. These walks are constructed on an underlying graph, and so there is a relation between properties of walks and properties of the graph. This book studies the mathematical problems that arise from this connection, and the different classes of walks that arise. Written at a level suitable for graduate students in mathematics, the only prerequisites are linear algebra and basic graph theory; no prior knowledge of physics is required. The text serves as an introduction to this important and rapidly developing area for mathematicians and as a detailed reference for computer scientists and physicists working on quantum information theory.
Quantum Artificial Intelligence has been considered as one of transformative interdisciplinary areas that have joined quantum calculation with machine learning and optimization. The paper is a survey of the recent development in QAI and a detailed case study of the Quantum Approximate Optimization Algorithm, its mathematical formulation, operator-based modeling, and utility in practical application to combinatorial optimization. Based on the background principles of the Hilbert space theory, Hermitian operators and variational quantum circuits, the paper examines the process of encoding a classical optimization problem in a quantum Hamiltonian and the effects of circuit depth, parameterization, and graph structure on the algorithms. An example of Max-Cut case study shows how the algorithm performs on regular graph, irregular graph and weighted graph cases, showing good approximation even at small depths, and showing convergence behavior as outlined in theory. The comparative perspectives in regards to existing models of QAI further outline the advantages of QAOA with regard to interpretability and operator design, and also outline the constraints associated with noise sensitivity, measurement load, and hardware scalability. The way QAOA is related to spectral methods, variational theory, and discrete optimization are discussed as giving theoretical implications of QAOA to applied mathematics. The research finds that QAOA is a bright future of practical, yet mathematically rich, quantum computation in the near-term. The development in the future depends on the interdisciplinary cooperation, noise-resistant circuit engineering, and the development of quantum hardware to achieve the full potential of QAI in both science and engineering uses.
Quantum chemistry focuses on modelling and simulating the behaviour of molecular systems using the fundamental principles of quantum mechanics. However, the underlying equations, such as the Schrödinger equation for computing the ground state of NNN electrons, which is a partial differential equation defined on R3N\mathbb{R}^{3N}R3N, suffer from the curse of dimensionality. As a result, simulating even moderately sized molecules demands advanced techniques in analysis, approximation and reduced-order modelling for overcoming the naive computational complexity. In this workshop, the rapidly growing mathematical community working in the field together with several quantum chemists and physicists were gathered to discuss recent advances in areas such as (1) the mathematical and numerical analysis of standard models used in the field, including Density Functional Theory, Coupled Cluster, and the Density Matrix Renormalization Group (2) the development of efficient numerical methods, relying e.g. on the development of error bounds and (3) the opportunities of recent data-driven methods towards the approximation of wavefunctions or density matrices.