Escaping barren plateaus in approximate quantum compiling

Understand

Quantum compilation provides a method to translate quantum algorithms at a high level of abstraction into their implementations as quantum circuits on real hardware.

• One approach to quantum compiling is to design a parameterised circuit and to use techniques from optimisation to find the parameters that minimise the distance between the parameterised circuit and the target circuit of interest.
• While promising, such an approach typically runs into the obstacle of barren plateaus - i.e.
• large regions of parameter space in which the gradient vanishes.