Name
Abstract | ||
|---|---|---|
Quantum hardware continues to advance, yet finding new quantum algorithms - quantum software - remains a challenge, with classically trained computer programmers having little intuition of how computational tasks may be performed in the quantum realm. As such, the idea of developing automated tools for algorithm development is even more appealing for quantum computing than for classical. Here we develop a robust, multi-objective evolutionary search strategy to design quantum circuits u0027from scratchu0027, by combining and parameterizing a task-generic library of quantum circuit elements. When applied to u0027ab initiou0027 design of quantum circuits for the input/output mapping requirements of the quantum Fourier transform and Groveru0027s search algorithm, it finds textbook circuit designs, along with alternative structures that achieve the same functionality. Exploiting its multi-objective nature, the discovery algorithm can trade off performance measures such as accuracy, circuit width or depth, gate count, or implementability - a crucial requirement for first-generation quantum processors and applications. |
Year | Venue | DocType |
|---|---|---|
2018 | arXiv: Quantum Physics | Journal |
Volume | Citations | PageRank |
abs/1812.04458 | 0 | 0.34 |
References | Authors | |
0 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Václav Potocek | 1 | 0 | 0.34 |
| Alan P. Reynolds | 2 | 157 | 11.57 |
| Alessandro Fedrizzi | 3 | 1 | 0.68 |
| David W. Corne | 4 | 2161 | 152.00 |