Optimized exploration of quantum circuits space based on sub-circuits equivalences

Quantum computing a very interesting technology but evolving quantum algorithms is relatively complex. To overcome this obstacle, recently, we have developed an automatic searching approach in which the exploration of the quantum space is modeled as constraints satisfaction problem. In this paper, we propose to optimize our implementation by introducing an interesting constraint based on quantum circuits equivalence. In the scanning process, each instantiation that generates redundant sequences provokes a constraint violation. As a result, the circuit under construction and possible extensions are ignored. Our approach is applied in searching automatically quantum error correction protocols based on code stabilizer. All used mechanisms as well as the results generated by the machine are presented.

Automated summary

This paper presents an automatic searching approach for exploring the quantum space as a constraints satisfaction problem. It introduces a constraint based on quantum circuits equivalence to optimize the implementation. The approach is applied in automatically searching quantum error correction protocols based on code stabilizer, and the generated results and mechanisms are presented.