Automated Synthesis of Quantum Algorithms via Classical Numerical Techniques

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

arXiv comment17 pages, 9 figures

References in corpus (13)

• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Elementary gates for quantum computation
• Distance measures to compare real and ideal quantum processes
• Quantum Circuits for Isometries
• Quantum computing with Qiskit
• Quantum singular value decomposition of non-sparse low-rank matrices
• Approaching the theoretical limit in quantum gate decomposition
• Efficient decomposition of unitary matrices in quantum circuit compilers
• Practical Sparse Matrices in C++ with Hybrid Storage and Template-Based Expression Optimisation
• Reducing 2-QuBit Gate Count for ZX-Calculus based Quantum Circuit Optimization
• Numerical analysis of quantum circuits for state preparation and unitary operator synthesis
• Quantum circuit synthesis using Householder transformations
• Efficient Assessment of Process Fidelity