The third and last chapter deals with realizing all the 2-qubit permutation gates, some of which are entangling gates (like the CNOT gate). The chapter also relies on other published protocols which are not part of this paper.
Chapter 1From ancilla to quantum gate Note This chapter grew out of many inspiring discussions with Michael Freedman and is the first stone in a series of two chapters leading to the production of irrational phase gates in the Kauffman-Jones version of SU (2) Chern-Simons theory at level 4.
AbstractWe provide a way to turn an ancilla into a gate for specific ancillas in the Kauffman-Jones version of SU (2) Chern-Simons theory at level 4. We deal with both the qubit 1221 and the qutrit 2222. Together with ancilla preparations, our protocols are later used to make irrational phase gates, leading to universal single qubit and qutrit gates.
MOTIVATION OF THE WORK5 interferometry, see [4], [5], [6]. For basic facts about recoupling theory, we refer the reader to [13], except the theory which we use is unitary. In particular we deal with unitary theta symbols and unitary 6j-symbols (see [21] and Appendix of [14]). The value of the Kauffman constant is, using the same notations as in [13],The main four moves which we use throughout the paper are summarized below.• The "F -move"The brackets are called unitary 6j-symbols.• The "R-move"• The "theta move"
NoteThe author thanks Michael Freedman for providing these thrilling problems, for guiding her with endless generosity in time and encouragements and for communicating his own excitement during the pursuit of this research.
AbstractIn Chapter 1, it is shown with respect to two different anyonic systems, the same as those considered in this paper, how to fuse an ancilla into the input in order to form a gate. In each case, the ancilla must satisfy to some adequate amplitude ratios properties. In the present chapter, we show how to prepare such ancillas, leading to infinite order phase gates. We obtain universal 1-qubit and 1-qutrit gates. Together with [16] and [17] in which are respectively shown how to make a 2-qubit and a 2-qutrit entangling gate, we get qubit and qutrit gate sets that are universal for quantum computation.