Sequencing Universal Quantum Gates for Arbitrary 2-Qubit Computations
2021
With recognition of quantum computer's enormous computational ability, it is of paramount importance to develop fault-tolerant quantum computing systems for their practical use. Recently, it has been shown that fault-tolerant systems can be achieved using a small set of basic quantum operations. This, however, incurs technical difficulties in finding an optimal sequence of basic operations toward a specific target computation and may limit possible quantum computations. In this work, we aim to achieve arbitrary target quantum computations under the restriction of four universal quantum gates of Pauli-X, -Y, -Z and SWAP. We develop two gate-sequence search methods based on the fidelity measure and deep neural networks. We verify the performance of our proposed methods through numerical results comparing total search space and the number of searched nodes.
Keywords:
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
9
References
0
Citations
NaN
KQI