Automating Quantum Algorithms Design

Taking advantage of exponential speedups offered by quantum computers
will require new tools to design and optimize quantum algorithms. Here,
we describe a framework to develop such tools via an automated approach. Our
approach requires minimal input: (i) the task that the quantum algorithm is
supposed to perform and (ii) available resources (e.g., the number of qubits,
the maximal depth of the circuit as well as any circuit constraints that
exists in a target quantum hardware). Given the above, our method returns
the quantum algorithm that fulfills all the requirements or suggests that the
resources are not sufficient to achieve the specified task. In this talk we
will present automatically generated algorithms for (among others) computing
entanglement and simulating real-time evolution of quantum many-body systems.