Synthesizing quantum circuits via numerical optimization
arXiv:2004.07714 · doi:10.1007/978-3-030-22741-8_1
Abstract
We provide a simple framework for the synthesis of quantum circuits based on a numerical optimization algorithm. This algorithm is used in the context of the trapped-ions technology. We derive theoretical lower bounds for the number of quantum gates required to implement any quantum algorithm. Then we present numerical experiments with random quantum operators where we compute the optimal parameters of the circuits and we illustrate the correctness of the theoretical lower bounds. We finally discuss the scalability of the method with the number of qubits.
14 pages, preprint
References in corpus (11)
- Quantum Computing in the NISQ era and beyond
- Quantum algorithm for solving linear systems of equations
- Efficient classical simulation of slightly entangled quantum computations
- Synthesis of Quantum Logic Circuits
- Quantum-state preparation with universal gate decompositions
- Minimal Universal Two-qubit Quantum Circuits
- Simulation of quantum circuits by low-rank stabilizer decompositions
- Exact synthesis of multiqubit Clifford+T circuits
- Machine learning method for state preparation and gate synthesis on photonic quantum computers
- Compiling quantum algorithms for architectures with multi-qubit gates
- Approximate Quantum Adders with Genetic Algorithms: An IBM Quantum Experience