| 20 |
Improving the reliability of quantum computationFast probabilistic conversion into quantum gate sequences 
|
|---|
Converting a program into a gate sequence is required for performing fault-tolerant quantum computation. The process of this conversion is called compilation. However, to ensure the reliability of the computation, it is usually necessary to increase the gate length, which results in a longer computational time. In this work, we have developed a compilation method that can enhance reliability without increasing the gate length.
We have developed an efficient compiler that probabilistically generates a gate sequence from a list of short gate sequences with an optimal probability distribution that maximizes reliability. Our research has shown that our compiler can achieve the fundamental limit of reliability, both in theory and through numerical simulations. It is imperative to develop a cutting-edge compiler to achieve the full potential of quantum computation, which has the power to revolutionize our society. We believe that our compiler provides a practical foundation for realizing quantum computation.
[1] S. Akibue, G. Kato, S. Tani, “Probabilistic state synthesis based on optimal convex approximation,” npj Quantum Information 10, 3, 2024.
[2] S. Akibue, G. Kato, S. Tani, “Probabilistic unitary synthesis with optimal accuracy,” under review.
Seiseki Akibue
Computing Theory Research Group, Media Information Laboratory