Gate complexity using Dynamic Programming

Abstract

The relationship between efficient quantum gate synthesis and control theory has been a topic of interest in the quantum control literature. Motivated by this work, we describe in the present article how the dynamic programming technique from optimal control may be used for the optimal synthesis of quantum circuits. We demonstrate simulation results on an example system on SU(2), to obtain plots related to the gate complexity and sample paths for different logic gates.

References in corpus (5)

• Quantum Computation as Geometry
• Quantum Brachistochrone
• Optimal Control-Based Efficient Synthesis of Building Blocks of Quantum Algorithms Seen in Perspective from Network Complexity towards Time Complexity
• Optimal control, geometry, and quantum computing
• Quantum Control via Geometry: An explicit example

Cited by in corpus (5)

• A reduced complexity numerical method for optimal gate synthesis
• Replacing Quantum Feedback with Open-Loop Control and Quantum Filtering
• Approximation of quantum control correction scheme using deep neural networks
• Experimentally realizable control fields in quantum Lyapunov control
• Numerical Solution of the Dynamic Programming Equation for the Optimal Control of Quantum Spin Systems