Automated Synthesis of Quantum Algorithms via Classical Numerical Techniques
math.NA, cs.NA, quant-ph
Submitted: 2024-08-27
Updated: 2024-08-27
Comments: 17 pages, 9 figures
Journal ref: ACM Transactions on Quantum Computing, Vol. 6, No. 4, Article 28 (2025)
DOI: 10.1145/3757068
License: http://creativecommons.org/licenses/by-nc-nd/4.0/
The gist: We apply numerical optimization and linear algebra algorithms for classical computers to the problem of automatically synthesizing algorithms for quantum computers.
Terminology
Abstract
We apply numerical optimization and linear algebra algorithms for classical computers to the problem of automatically synthesizing algorithms for quantum computers. Using our framework, we apply several common techniques from these classical domains and numerically examine their suitability for and performance on this problem. Our methods are evaluated on single-qubit systems as well as on larger systems. While the first part of our proposed method outputs a single unitary matrix representing the composite effects of a quantum circuit or algorithm, we use existing tools - and assess the performance of these - to factor such a matrix into a product of elementary quantum gates. This enables our pipeline to be truly end-to-end: starting from desired input/output examples, our code ultimately results in a quantum circuit diagram. We release our code to the research community (upon acceptance).
Sources
- The Solovay-Kitaev algorithm
- Genetic Algorithms and Quantum Computation
- Quantum computing with Qiskit
- Efficient quantum gate decomposition via adaptive circuit compression
- Decomposition of Matrix Product States into Shallow Quantum Circuits
- A Rudimentary Quantum Compiler(2cnd Ed.)
- An Introduction to Cartan's KAK Decomposition for QC Programmers
Related papers
- Do physics-informed neural networks (PINNs) need to be deep? Shallow PINNs using the Levenberg-Marquardt algorithm
- A Neural-preconditioned Poisson Solver for Mixed Dirichlet and Neumann Boundary Conditions
- Advanced Linear Algebra with Applications - Part I (Numerical linear algebra for PDEs, machine learning, and data assimilation)
- Operator learning meets inverse problems: A probabilistic perspective
- Second-order consistency for learning chaotic dynamics via randomized Jacobian matching
- Windowed thinning and query complexity for the bouncy particle and Zigzag samplers