Approximate exchange-only entangling gates for the three-spin-$1/2$ decoherence-free subsystem

TL;DR

This paper presents a new approximate method for implementing entangling gates in a three-spin decoherence-free subsystem, simplifying the construction of logical qubit operations for quantum computing.

Contribution

It introduces a decoupling strategy to create straightforward approximate entangling gates, including CNOT, with competitive control complexity for fault-tolerant quantum computing.

Findings

Approximate entangling gates can be implemented using the proposed decoupling strategy.

The method allows direct implementation of certain Hamiltonians without physical spin alignment.

Control complexity for fault-tolerant fidelities is competitive with previous approaches.

Abstract

The three-spin-$1/2$ decoherence-free subsystem defines a logical qubit protected from collective noise and supports exchange-only universal gates. Such logical qubits are well-suited for implementation with electrically-defined quantum dots. Exact exchange-only entangling logical gates exist but are challenging to construct and understand. We use a decoupling strategy to obtain straightforward approximate entangling gates. A benefit of the strategy is that if the physical spins are aligned, then it can implement evolution under entangling Hamiltonians. Hamiltonians expressible as linear combinations of logical Pauli products not involving $\sigma_y$ can be implemented directly. Self-inverse gates that are constructible from these Hamiltonians, such as the CNOT, can be implemented without the assumption on the physical spins. We compare the control complexity of implementing CNOT to previous methods and find that the complexity for fault-tolerant fidelities is competitive.

Tables

Table 1. Table 1: Clock cycles, normalized time (such that one unit equals the duration of one swap), entanglement fidelity (Eq. ( 88 )), and leakage (Eq. ( 89 )) for various iterations n 𝑛 n of the spin-independent CNOT approximation given by Eq. ( IV.3 ). The listed values for fidelity and leakage assume a total spin of 1. The values for cycles and time may be compared with that of the fiducial exact solution of DBLP:journals/qic/FongW11 , with 13 clock cycles and a normalized time of 12.3.

$n$	cycles	time	fidelity	leakage
3	39	8.5	0.99136	0.00552
5	63	12.5	0.99888	0.00070
9	111	20.5	0.99989	0.00007

Table 2. Table 2: Clock cycles, normalized time (such that one unit equals the duration of one swap), entanglement fidelity (Eq. ( 88 )), and leakage (Eq. ( 89 )) for various iterations n 𝑛 n of the spin 1 CNOT approximation given by Eq. ( 92 ). The above values for cycles and time may be compared with that of the fiducial exact solution of DBLP:journals/qic/FongW11 , with 13 clock cycles and a normalized time of 12.3.

$n$	cycles	time	fidelity	leakage
2	21	$9.8$	0.99849	0.00067
3	31	$13.8$	0.99970	0.00014
4	41	17.8	0.99990	0.00004

Equations

$$\text{ydiagram}3,\text{ydiagram}2,1,\text{ydiagram}1,1,1$$

$$\text{ytableaushort}123,$$

$$\text{ytableaushort}13,2,\text{ytableaushort}12,3.$$

$$\text{ytableaushort}\uparrow \uparrow \uparrow ,\text{ytableaushort}\uparrow \uparrow \downarrow ,\text{ytableaushort}\uparrow \downarrow \downarrow ,\text{ytableaushort}\downarrow \downarrow \downarrow ,$$

$$\text{ytableaushort}\uparrow \uparrow ,\downarrow ,\text{ytableaushort}\uparrow \downarrow ,\downarrow ,$$

$${\rho }_{\lambda }((ii+1))T=\frac{1}{d_T(i,i+1)}T+\sqrt{1-\frac{1}{d_T(i,i+1{)}^2}}(ii+1)T,$$

$$\mathcal{H}\stackrel{S_3\times SU(2)}{\cong }(V_{\text{ytableausetup}boxsize=0.2em,nocentertableaux\text{ydiagram}3\text{ytableausetup}nosmalltableaux\text{ytableausetup}smalltableaux,nocentertableaux}\otimes U_{\text{ytableausetup}boxsize=0.2em,nocentertableaux\text{ydiagram}3\text{ytableausetup}nosmalltableaux\text{ytableausetup}smalltableaux,nocentertableaux})\oplus (V_{\text{ytableausetup}boxsize=0.2em,nocentertableaux\text{ydiagram}2,1\text{ytableausetup}nosmalltableaux\text{ytableausetup}smalltableaux,nocentertableaux}\otimes U_{\text{ytableausetup}boxsize=0.2em,nocentertableaux\text{ydiagram}2,1\text{ytableausetup}nosmalltableaux\text{ytableausetup}smalltableaux,nocentertableaux}).$$

$$V_{\text{ytableausetup}boxsize=0.2em,nocentertableaux\text{ydiagram}3\text{ytableausetup}nosmalltableaux\text{ytableausetup}smalltableaux,nocentertableaux}\otimes U_{\text{ytableausetup}boxsize=0.2em,nocentertableaux\text{ydiagram}3\text{ytableausetup}nosmalltableaux\text{ytableausetup}smalltableaux,nocentertableaux}$$

$$V_{\text{ytableausetup}boxsize=0.2em,nocentertableaux\text{ydiagram}2,1\text{ytableausetup}nosmalltableaux\text{ytableausetup}smalltableaux,nocentertableaux}\otimes U_{\text{ytableausetup}boxsize=0.2em,nocentertableaux\text{ydiagram}2,1\text{ytableausetup}nosmalltableaux\text{ytableausetup}smalltableaux,nocentertableaux}$$

$$(ij)|b_1\cdots b_i\cdots b_j\cdots b_n⟩=|b_1\cdots b_j\cdots b_i\cdots b_n⟩.$$

$$\text{ytableaushort}13,2\otimes \text{ytableaushort}\uparrow \uparrow ,\downarrow \mapsto$$

$$\text{ytableaushort}13,2\otimes \text{ytableaushort}\uparrow \downarrow ,\downarrow \mapsto$$

$$\text{ytableaushort}12,3\otimes \text{ytableaushort}\uparrow \uparrow ,\downarrow \mapsto$$

$$\text{ytableaushort}12,3\otimes \text{ytableaushort}\uparrow \downarrow ,\downarrow \mapsto$$

$$(V_{\lambda }\otimes U_{\lambda })\otimes (V_{\mu }\otimes U_{\mu })\stackrel{S_{|\lambda |}\times S_{|\mu |}\times SU(d)}{\cong }\underset{\begin{array}{c}\nu ⊢|\lambda |+|\mu |\\ \#(\nu )\le d\end{array}}{⨁}{c}_{\mu \lambda }^{\nu }{V}_{\lambda }\otimes V_{\mu }\otimes U_{\nu },$$

$$\underset{\begin{array}{c}\nu ⊢|\lambda |+|\mu |\\ \#(\nu )\le d\end{array}}{⨁}{c}_{\mu \lambda }^{\nu }{V}_{\lambda }\otimes V_{\mu }\otimes U_{\nu }\stackrel{S_{|\lambda |}\times S_{|\mu |}\times SU(d)}{\hookrightarrow }\underset{\begin{array}{c}\nu ⊢|\lambda |+|\mu |\\ \#(\nu )\le d\end{array}}{⨁}{V}_{\nu }\otimes U_{\nu },$$

$$(V_{\text{ytableausetup}boxsize=0.2em,nocentertableaux\text{ydiagram}2,1\text{ytableausetup}nosmalltableaux\text{ytableausetup}smalltableaux,nocentertableaux}\otimes U_{\text{ytableausetup}boxsize=0.2em,nocentertableaux\text{ydiagram}2,1\text{ytableausetup}nosmalltableaux\text{ytableausetup}smalltableaux,nocentertableaux})\otimes (V_{\text{ytableausetup}boxsize=0.2em,nocentertableaux\text{ydiagram}2,1\text{ytableausetup}nosmalltableaux\text{ytableausetup}smalltableaux,nocentertableaux}\otimes U_{\text{ytableausetup}boxsize=0.2em,nocentertableaux\text{ydiagram}2,1\text{ytableausetup}nosmalltableaux\text{ytableausetup}smalltableaux,nocentertableaux})\cong (V_{\text{ytableausetup}boxsize=0.2em,nocentertableaux\text{ydiagram}2,1\text{ytableausetup}nosmalltableaux\text{ytableausetup}smalltableaux,nocentertableaux}\otimes V_{\text{ytableausetup}boxsize=0.2em,nocentertableaux\text{ydiagram}2,1\text{ytableausetup}nosmalltableaux\text{ytableausetup}smalltableaux,nocentertableaux}\otimes U_{\text{ytableausetup}boxsize=0.2em,nocentertableaux\text{ydiagram}3,3\text{ytableausetup}nosmalltableaux\text{ytableausetup}smalltableaux,nocentertableaux})\oplus (V_{\text{ytableausetup}boxsize=0.2em,nocentertableaux\text{ydiagram}2,1\text{ytableausetup}nosmalltableaux\text{ytableausetup}smalltableaux,nocentertableaux}\otimes V_{\text{ytableausetup}boxsize=0.2em,nocentertableaux\text{ydiagram}2,1\text{ytableausetup}nosmalltableaux\text{ytableausetup}smalltableaux,nocentertableaux}\otimes U_{\text{ytableausetup}boxsize=0.2em,nocentertableaux\text{ydiagram}4,2\text{ytableausetup}nosmalltableaux\text{ytableausetup}smalltableaux,nocentertableaux})\hookrightarrow (V_{\text{ytableausetup}boxsize=0.2em,nocentertableaux\text{ydiagram}3,3\text{ytableausetup}nosmalltableaux\text{ytableausetup}smalltableaux,nocentertableaux}\otimes U_{\text{ytableausetup}boxsize=0.2em,nocentertableaux\text{ydiagram}3,3\text{ytableausetup}nosmalltableaux\text{ytableausetup}smalltableaux,nocentertableaux})\oplus (V_{\text{ytableausetup}boxsize=0.2em,nocentertableaux\text{ydiagram}4,2\text{ytableausetup}nosmalltableaux\text{ytableausetup}smalltableaux,nocentertableaux}\otimes U_{\text{ytableausetup}boxsize=0.2em,nocentertableaux\text{ydiagram}4,2\text{ytableausetup}nosmalltableaux\text{ytableausetup}smalltableaux,nocentertableaux})$$

$$V_{\text{ytableausetup}boxsize=0.2em,nocentertableaux\text{ydiagram}2,1\text{ytableausetup}nosmalltableaux\text{ytableausetup}smalltableaux,nocentertableaux}\otimes V_{\text{ytableausetup}boxsize=0.2em,nocentertableaux\text{ydiagram}2,1\text{ytableausetup}nosmalltableaux\text{ytableausetup}smalltableaux,nocentertableaux}$$

$$\text{ytableaushort}\uparrow \uparrow \uparrow ,\downarrow \downarrow \downarrow ,$$

$$\text{ytableaushort}\uparrow \uparrow \downarrow \downarrow ,\downarrow \downarrow ,\text{ytableaushort}\uparrow \uparrow \downarrow \downarrow ,\uparrow \downarrow ,\text{ytableaushort}\uparrow \uparrow \downarrow \downarrow ,\uparrow \uparrow .$$

$$\text{ydiagram}3,3$$

$$\text{ydiagram}4,2$$

$$\text{ydiagram}2,1\otimes \text{ydiagram}2,1\text{ignorespaces}\text{ignorespaces}\text{ignorespaces}\text{ignorespaces}\text{ignorespaces}\text{ignorespaces}\text{ignorespaces}\text{ignorespaces}$$

$$\left\{\text{ytableaushort}13,2\otimes \text{ytableaushort}46,5,\text{ytableaushort}13,2\otimes \text{ytableaushort}45,6,\text{ytableaushort}12,3\otimes \text{ytableaushort}46,5,\text{ytableaushort}12,3\otimes \text{ytableaushort}45,6\right\}$$

$$\text{ytableaushort}13,2\otimes \text{ytableaushort}46,5$$

$$\text{ytableaushort}13,2\otimes \text{ytableaushort}45,6$$

$$\text{ytableaushort}12,3\otimes \text{ytableaushort}46,5$$

$$\text{ytableaushort}12,3\otimes \text{ytableaushort}45,6$$

$$\text{ytableaushort}13,2\otimes \text{ytableaushort}46,5$$

$$\text{ytableaushort}13,2\otimes \text{ytableaushort}45,6$$

$$\text{ytableaushort}12,3\otimes \text{ytableaushort}46,5$$

$$\text{ytableaushort}12,3\otimes \text{ytableaushort}45,6$$

$${\Sigma }_a$$

$${\Sigma }_b$$

$$\mathbb{C}{S}_6\equiv \{a_1{\sigma }_1+\cdots +a_m{\sigma }_m|a_i\in \mathbb{C},{\sigma }_i\in S_6,m\in \mathbb{N}\},$$

$${\rho }_{\text{ytableausetup}boxsize=0.2em,nocentertableaux\text{ydiagram}3,3\text{ytableausetup}nosmalltableaux\text{ytableausetup}boxsize=0.4em,centertableaux}({\Sigma }_a)$$

Full text

\ytableausetup

nosmalltableaux\ytableausetupboxsize=0.4em,centertableaux

I Introduction

Three physical spin-$1/2$ systems support a collective decoherence-free two-level subsystem (the 3DFS) in the four-dimensional subspace with total spin $1/2$, where collective noise is induced by global fields acting with total spin operators along any axis. This motivates the use of the 3DFS as a logical qubit zanardi:qc1999c ; knill:qc1999b . The 3DFS’s observables are spanned by the three Hermitian and unitary operators exchanging two of the physical spins, enabling implementation of logical one-qubit gates. These operators are referred to as swaps when used as unitary gates, and as exchange interactions when used as generators of evolution. This definition of the exchange interaction agrees with the conventional one up to a multiple of the identity. We also identify the swap operators with transpositions in the representation of the symmetric group that acts by permuting the physical spins. The best-known application of the 3DFS is to quantum computing with quantum dots where evolution under the exchange interaction can be more accessible than universal one-quantum-dot evolutions divincenzo:qc2000b . Indeed the requisite control over three quantum dots has been proven feasible by many experimental demonstrations PhysRevB.82.075403 ; Gaudreau ; Hsieh_2012 ; Medford ; Enge1500214 ; Russ_2017 ; 2018arXiv181202693A . The application to quantum dots is further supported by the ability to implement entangling logical gates between two blocks of physical spins carrying 3DFSs with exchange interactions only divincenzo:qc2000b , but these gates require many steps and are often difficult to construct and understand from first principles (with a possible exception being PhysRevA.93.010303 ).

In theory, every logical two-qubit gate is generated by exchange Hamiltonians on the physical spins comprising two 3DFS blocks 2001PhRvA..63d2307K . In practice constructing such gates is challenging, and constructing them to be independent of the total spin of the two blocks even more so. Since each block has spin 1/2, the total spin of the system is either 0 or 1. While the action on each logical qubit of exchange interactions local to each block is independent of the total spin, the action of cross-block exchange interactions is in general spin-dependent. Thus constructing unitaries from cross-block exchange interactions that act on logical qubits independently of the total spin is nontrivial, but essential for entangling gates that are robust under collective noise on the total system.

Much of the work on exchange-only gates has focused on the CNOT gate. The first exchange-only CNOT gate was found numerically by DiVincenzo et al divincenzo:qc2000b . It required a total spin of 1 and was only approximate, albeit very accurate. Subsequently, exact CNOT gates from the same sequence of interactions were found in Hsieh:2003:EUG:974713.974717 and Kawano2005 . A simpler, exact spin-dependent CNOT was later found in shi . A spin-independent, exchange-only CNOT gate was first published by Fong and Wandzura DBLP:journals/qic/FongW11 (although a solution was also claimed, but not given, in divincenzo:qc2000b ). Surprisingly this exact spin-independent solution was simpler, in terms of the number of exchange gates and their analytic coefficients, than that of the original spin-dependent solutions. Since then several other spin-independent, exchange-only CNOT gates have been found setiawan ; zeuch .

The question then arises of how to compare the efficiencies of these various implementations. They each consist of a product of gates, each of which exponentiates a Hamiltonian that depends linearly on exchange interactions. One measure of complexity, then, is to sum the absolute values of the coefficients on the exchange interactions. Taking the absolute value assumes that the exchange interaction can be turned on with either sign (which is permissible PhysRevB.59.2070 ; BAGRAEV20031061 ; 2008PhRvB..77e4517H ; 2009PhRvB..80s5103O ; 2014EL….10547006F ; fbf90b1cbccd41febafd7ae35a2b6e87 ). If the exchange interactions are all performed in series, then this measure is proportional to the total evolution time required for the physical operation. Alternatively, if some exchange interactions are performed in parallel, one could instead sum the largest coefficients for each exponential in the product for the gate, and again this sum is proportional to the total evolution time when operating in parallel mode. By either measure, the Fong and Wandzura construction DBLP:journals/qic/FongW11 is one of the most efficient of the exact, exchange-only CNOT gates, and we use it as a benchmark.

We give an alternative approach that constructs approximate entangling logical gates between two 3DFSs. The strategy is to decouple cross-block exchange interactions by within-block operations that project the cross-block interactions into the computational two-qubit subsystem determined by the two 3DFSs. With the orthogonal complement of the computational subsystem thus decoupled, we proceed to construct two-qubit gates from exchange interactions and further show that a large subset of these gates are spin-independent. This task is facilitated by allowing non-commuting exchange interactions to be performed in parallel, as made possible for example by semiconductor quantum dot technology PhysRevB.93.121410 . We then find that for the spin-independent CNOT gate, an entanglement fidelity better than $0.99$ can be achieved with a total evolution time that is shorter than that of the exact implementations, and slightly shorter still if spin-dependence is allowed.

This paper is organized as follows. In Section II we review the symmetric group and unitary group representation theory needed to derive our results. In particular, we give explicit maps of the computational subsystems into the symmetric group representations that appear. In Section III we describe our procedure for decoupling the computational subsystem for two 3DFSs from its orthogonal, “leakage” space with exchange interactions. In Section IV we apply this method to construct a spin-independent exchange-only CNOT gate, and spin-dependent exchange-only evolutions optimized for total spin $1$. We conclude with a discussion and open problems in Section V.

II Representation Theory

Here we briefly review the relevant representation theory; for more comprehensive discussion of symmetric group representations see fulton1991representation , of unitary group representations see louck2008unitary , and of both applied to quantum information see 2005quant.ph.12255H . The special unitary group of $d\times d$ matrices is denoted by $\mathrm{SU}(d)$, and the symmetric group of permutations of $n$ elements is denoted by $S_{n}$, where we are interested in $n=3$ or $n=6$. Irreducible representations (irreps) of the groups $\mathrm{SU}(d)$ and $S_{n}$ are conveniently labeled by partitions of $n$ in a canonical way that is made clear below. For this purpose it is convenient to introduce the notation $\nu\vdash n$ signifying that $\nu$ is a partition of $n$. We also write $|\nu|$ for the size of $\nu$, so $|\nu|=n$, and $\#(\nu)$ for the number of parts of $\nu$. Now we have that for each $\nu\vdash n$ there is an irrep of $S_{n}$, which we denote by $V_{\nu}$, and for each $\nu\vdash n$ such that $\#(\nu)\leq d$ there is an irrep of $SU(d)$, which we denote by $U_{\nu}$. By convention, each partition can be explicitly denoted by a Young diagram, consisting of a row of cells for each part, arranged in descending order of length, with $n$ cells total. So for $n=3$ the partitions are \ytableausetupnosmalltableaux\ytableausetupsmalltableaux,nocentertableaux

[TABLE]

\ytableausetup

nosmalltableaux\ytableausetupboxsize=0.4em,centertableauxand therefore the irreps of $S_{3}$ are $V_{\ytableausetup{boxsize=0.2em,nocentertableaux}\ydiagram{3}\ytableausetup{nosmalltableaux}\ytableausetup{boxsize=0.4em,centertableaux}}$, $V_{\ytableausetup{boxsize=0.2em,nocentertableaux}\ydiagram{2,1}\ytableausetup{nosmalltableaux}\ytableausetup{boxsize=0.4em,centertableaux}}$, and $V_{\ytableausetup{boxsize=0.2em,nocentertableaux}\ydiagram{1,1,1}\ytableausetup{nosmalltableaux}\ytableausetup{boxsize=0.4em,centertableaux}}$ and the irreps of $SU(2)$ are $U_{\ytableausetup{boxsize=0.2em,nocentertableaux}\ydiagram{3}\ytableausetup{nosmalltableaux}\ytableausetup{boxsize=0.4em,centertableaux}}$ and $U_{\ytableausetup{boxsize=0.2em,nocentertableaux}\ydiagram{2,1}\ytableausetup{nosmalltableaux}\ytableausetup{boxsize=0.4em,centertableaux}}$.

A convenient choice of basis vectors for each irrep of $S_{n}$ is labeled by Young tableaux, defined as follows. A Young tableau is a Young diagram in which every cell is filled in with a number from 1 to $n$, with no repetitions, such that the numbers are increasing along every row from left to right and along every column from top to bottom. So for the Young diagram $\ydiagram{3}$ the only Young tableau is \ytableausetupnosmalltableaux\ytableausetupsmalltableaux,nocentertableaux

[TABLE]

\ytableausetup

nosmalltableaux\ytableausetupboxsize=0.4em,centertableauxand for the Young diagram $\ydiagram{2,1}$ the Young tableaux are: \ytableausetupnosmalltableaux\ytableausetupsmalltableaux,nocentertableaux

[TABLE]

\ytableausetup

nosmalltableaux\ytableausetupboxsize=0.4em,centertableaux

Similarly, a convenient choice of basis vectors for each irrep of $SU(d)$ is labeled by Weyl tableaux (also known as semistandard tableaux), defined as follows. A Weyl tableau is a Young diagram of at most $d$ rows with every cell filled in with a number from 1 to $d$, with repetitions allowed, such that the numbers are nondecreasing along rows from left to right and increasing along columns from top to bottom. To avoid confusion with the Young tableaux, and because we only consider $d=2$, we substitute 1 and 2 in Weyl tableaux by an up arrow and a down arrow, respectively. So for the Young diagram $\ydiagram{3}$ the Weyl tableaux are: \ytableausetupnosmalltableaux\ytableausetupsmalltableaux,nocentertableaux

[TABLE]

\ytableausetup

nosmalltableaux\ytableausetupboxsize=0.4em,centertableauxcorresponding to the four possible spins along the $z$ axis of the spin $3/2$ subsystem of three physical spins. For the Young diagram $\ydiagram{2,1}$ the Weyl tableaux are: \ytableausetupnosmalltableaux\ytableausetupsmalltableaux,nocentertableaux

[TABLE]

\ytableausetup

nosmalltableaux\ytableausetupboxsize=0.4em,centertableauxcorresponding to the two states of the spin $1/2$ subsystem of three physical spins.

To complete our specification of each irrep we need to decide on a convention for how each group element is to act on the basis vectors. Our choice for the symmetric group is Young’s orthogonal form young1977collected , which is particularly well-suited for quantum mechanical applications because it maps permutations to unitary matrices, and therefore maps transpositions to Hermitian matrices. It is defined on the Young tableau basis as follows. Let $T$ be a Young tableau and for $1\leq i,j\leq n$ let $d_{T}(i,j)\equiv(c_{T}(j)-r_{T}(j))-(c_{T}(i)-r_{T}(i))$ where $r_{T}(k)$ and $c_{T}(k)$ respectively denote the row and column containing number $k$. Then denoting the transposition in $S_{n}$ that exchanges $i$ and $j$ by $(ij)$, and its matrix representation on $V_{\lambda}$ by $\rho_{\lambda}((ij))$, we have

[TABLE]

where $(i\ i+1)T$ denotes direct action on $T$ via exchange of the positions of $i$ and $i+1$. Note that $(i\ i+1)T$ results in an invalid tableau (only) when $i$ and $i+1$ are in the same row or column, but then $d_{T}(i,i+1)=\pm 1$ and thus the coefficient of the invalid term vanishes. Since transpositions of the form $(i\ i+1)$ generate $S_{n}$, the above definition is sufficient to determine the representation of every permutation.

Now consider the Hilbert space $\mathcal{H}$ of three physical spin-$1/2$ particles. By Schur-Weyl duality 10.2307/j.ctv3hh48t there is a vector space isomorphism between $\mathcal{H}$ and $(V_{\ytableausetup{boxsize=0.2em,nocentertableaux}\ydiagram{3}\ytableausetup{nosmalltableaux}\ytableausetup{smalltableaux,nocentertableaux}}\otimes U_{\ytableausetup{boxsize=0.2em,nocentertableaux}\ydiagram{3}\ytableausetup{nosmalltableaux}\ytableausetup{smalltableaux,nocentertableaux}})\oplus(V_{\ytableausetup{boxsize=0.2em,nocentertableaux}\ydiagram{2,1}\ytableausetup{nosmalltableaux}\ytableausetup{smalltableaux,nocentertableaux}}\otimes U_{\ytableausetup{boxsize=0.2em,nocentertableaux}\ydiagram{2,1}\ytableausetup{nosmalltableaux}\ytableausetup{smalltableaux,nocentertableaux}})$ that commutes with the action of $S_{3}\times SU(2)$. Such an isomorphism is called an intertwiner with respect to the group $S_{3}\times SU(2)$. We denote the existence of such an intertwiner as follows: \ytableausetupnosmalltableaux\ytableausetupsmalltableaux,nocentertableaux

[TABLE]

\ytableausetup

nosmalltableaux\ytableausetupboxsize=0.4em,centertableauxThe Hilbert space on the right-hand side can further be expressed in terms of tableau basis vectors: \ytableausetupnosmalltableaux\ytableausetupsmalltableaux,nocentertableaux

[TABLE]

. \ytableausetupnosmalltableaux\ytableausetupboxsize=0.4em,centertableaux

The above basis vectors can be related by linear transformation to the conventional product states of the three physical spins, specified in terms of spin basis, by demanding that each swap of the qubits should be consistent with the action of the representation of each transposition on the tableau basis. Here we identify the action of transpositions on the product basis with that of swaps in the obvious way:

[TABLE]

If we further assume the convention that the Weyl tableaux are eigenvectors of the $z$-component of the spin operator, then up to an overall phase factor we find the following correspondence with the two-qubit 3DFS encoding of divincenzo:qc2000b : \ytableausetupnosmalltableaux\ytableausetupsmalltableaux,nocentertableaux

[TABLE]

\ytableausetup

nosmalltableaux\ytableausetupboxsize=0.4em,centertableauxTherefore the Young tableaux can be identified with logical 0 ($0_{L}$) and logical 1 ($1_{L}$) as indicated above. It is now clear in terms of representation theory that the independence of this qubit from collective noise on the spin is due to independence from the action of $SU(2)$.

We now consider entangling two such logical qubits. For the goal of constructing gates, we need to calculate the action of cross-block exchange interactions on these qubits. To that end we make use of the following theorem, adapted from 2005quant.ph.12255H :

Theorem 1**.**

Given irreps $V_{\lambda}$ of $S_{|\lambda|}$ and $V_{\mu}$ of $S_{|\mu|}$ and irreps $U_{\lambda}$ and $U_{\mu}$ of $SU(d)$,

[TABLE]

where the isomorphism is an intertwiner with respect to the indicated group action and $SU(d)$ is assumed to act simultaneously on $U_{\lambda}$ and $U_{\mu}$ on the left hand side. Further, the right hand side is isomorphic to a subspace of the Schur-Weyl sum,

[TABLE]

where the inclusion map is a term-by-term intertwiner with respect to the indicated group action such that each Littlewood-Richardson coefficient $c_{\lambda\mu}^{\nu}$ gives the multiplicity of the image of $V_{\lambda}\otimes V_{\mu}$ on the left hand side in each corresponding $V_{\nu}$ on the right hand side.

For the case of $\lambda=\mu=\ydiagram{2,1}$ and $d=2$, the Littlewood-Richardson coefficients are such that \ytableausetupnosmalltableaux\ytableausetupsmalltableaux,nocentertableaux

[TABLE]

\ytableausetup

nosmalltableaux\ytableausetupboxsize=0.4em,centertableauxwhere both maps are intertwiners with respect to $S_{3}\times S_{3}\times SU(2)$, and term-by-term the inclusion map implies the following two intertwiners: \ytableausetupnosmalltableaux\ytableausetupsmalltableaux,nocentertableaux

[TABLE]

\ytableausetup

nosmalltableaux\ytableausetupboxsize=0.4em,centertableauxThe left hand side encodes our two logical qubits, while its four-dimensional image in the five-dimensional $V_{\ytableausetup{boxsize=0.2em,nocentertableaux}\ydiagram{3,3}\ytableausetup{nosmalltableaux}\ytableausetup{smalltableaux,nocentertableaux}}$ and nine-dimensional $V_{\ytableausetup{boxsize=0.2em,nocentertableaux}\ydiagram{4,2}\ytableausetup{nosmalltableaux}\ytableausetup{smalltableaux,nocentertableaux}}$ is the computational subspace of each. That these intertwiners are with respect to $S_{3}\times S_{3}$ implies that the actions of transpositions local to each block, on the computational subspace, are consistent across irreps. These maps also determine the actions of cross-block transpositions on the computational subspace, albeit in an irrep-dependent manner. This is one of our primary concerns for the remainder of this paper.

Before proceeding it is instructive to consider the $SU(2)$ irreps in order to form a more complete physical interpretation. Observe that the single Weyl basis vector of $U_{\ytableausetup{boxsize=0.2em,nocentertableaux}\ydiagram{3,3}\ytableausetup{nosmalltableaux}\ytableausetup{boxsize=0.4em,centertableaux}}$ is \ytableausetupnosmalltableaux\ytableausetupsmalltableaux,nocentertableaux

[TABLE]

\ytableausetup

nosmalltableaux\ytableausetupboxsize=0.4em,centertableauxand the Weyl basis vectors of $U_{\ytableausetup{boxsize=0.2em,nocentertableaux}\ydiagram{4,2}\ytableausetup{nosmalltableaux}\ytableausetup{boxsize=0.4em,centertableaux}}$ are \ytableausetupnosmalltableaux\ytableausetupsmalltableaux,nocentertableaux

[TABLE]

\ytableausetup

nosmalltableaux\ytableausetupboxsize=0.4em,centertableauxBy our convention, these basis vectors are eigenvectors of the $z$ component of the total spin operator, with eigenvalues 0 (Eq. (20)), and -1, 0, 1 (Eq. (21)) respectively. Therefore diagram $\ydiagram{3,3}$ is associated with states of total spin 0 and diagram $\ydiagram{4,2}$ is associated with states of total spin 1.

Returning to symmetric group irreps, and henceforth overloading Young diagrams to denote symmetric group irreps directly, notice that irrep $\ydiagram{3,3}$ has one extra dimension and irrep $\ydiagram{4,2}$ has five extra dimensions outside of the images of representation $\ydiagram{2,1}\otimes\ydiagram{2,1}$ under the intertwiners of Eqs. (18-19). The extra dimension in irrep $\ydiagram{3,3}$ and one of the extra dimensions in irrep $\ydiagram{4,2}$ each correspond to the image of representation $\ydiagram{3}\otimes\ydiagram{3}$ under the respective intertwiner implied by Theorem 1 for $\lambda=\mu=\ydiagram{3}$, which is associated with states for which each block has total spin $3/2$. The four remaining dimensions of irrep $\ydiagram{4,2}$ correspond to images of representations $\ydiagram{3}\otimes\ydiagram{2,1}$ and $\ydiagram{2,1}\otimes\ydiagram{3}$, which are associated with products of logical qubit states with spin 3/2 states. The multiplicity of each image is one in every case, as determined by the Littlewood-Richardson coefficients, and further clarified by the following vector space isomorphisms: \ytableausetupnosmalltableaux\ytableausetupsmalltableaux,nocentertableaux

[TABLE]

\ytableausetup

nosmalltableaux\ytableausetupboxsize=0.4em,centertableauxThese various maps are illustrated in Fig. 1.

For the purpose of constructing gates we need to specify the intertwiners $\ydiagram{2,1}\otimes\ydiagram{2,1}\hookrightarrow\ydiagram{3,3}$ and $\ydiagram{2,1}\otimes\ydiagram{2,1}\hookrightarrow\ydiagram{4,2}$ explicitly. It suffices to map the Young tableaux basis \ytableausetupnosmalltableaux\ytableausetupsmalltableaux,nocentertableaux

[TABLE]

\ytableausetup

nosmalltableaux\ytableausetupboxsize=0.4em,centertableauxof representation $\ydiagram{2,1}\otimes\ydiagram{2,1}$ into irreps $\ydiagram{3,3}$ and $\ydiagram{4,2}$. The images of each vector in this basis are determined up to overall phase by demanding that the action of $S_{\{123\}}\times S_{\{456\}}$ on it be consistent with the action of $S_{\{123\}}\times S_{\{456\}}$ on the original basis, where $S_{\{ijk\}}$ denotes permutations of $\{i,j,k\}$. We then find that for $\ydiagram{2,1}\otimes\ydiagram{2,1}\hookrightarrow\ydiagram{3,3}$, \ytableausetupnosmalltableaux\ytableausetupsmalltableaux,nocentertableaux

[TABLE]

\ytableausetup

nosmalltableaux\ytableausetupboxsize=0.4em,centertableauxand for $\ydiagram{2,1}\otimes\ydiagram{2,1}\hookrightarrow\ydiagram{4,2}$, \ytableausetupnosmalltableaux\ytableausetupsmalltableaux,nocentertableaux

[TABLE]

\ytableausetup

nosmalltableaux\ytableausetupboxsize=0.4em,centertableauxThe resulting right hand sides give the computational basis in each irrep. Note the above numbering is consistent with the physical qubit “nearest neighbors” and corresponding product state ordering assumed by DiVincenzo et al. divincenzo:qc2000b ; Hsieh:2003:EUG:974713.974717 .

III Decoupling

Each computational basis defined above spans what we call the computational subspace of each irrep, allowing us to further define the computational submatrix of each matrix representation of a permutation as its projection onto the computational subspace. We find that these computational submatrices of representations of transpositions in irreps $\ydiagram{4,2}$ and $\ydiagram{3,3}$ are rich and varied enough that their linear combinations yield most of the computational Pauli basis. Therefore if we were able to evolve according to projections onto the computational subspace using only exchange interactions, we would have a simple way to construct a wide variety of Hamiltonians and gates. In this section we present just such a method, to good approximation. Our strategy is to remove transitions between the computational subspace and its complement with the general decoupling procedure introduced in 1999PhRvL..82.2417V ; 1999PhRvL..83.4888V . Decoupling involves interspersing pulses with evolution so that the resulting effective Hamiltonian preserves the computational subspace while acting as the projection of the original Hamiltonian on this subspace.

For the purpose of evolving under operators projected onto the computational subspace, the symmetric sums of local transpositions prove to be useful:

[TABLE]

It can be easily verified that $\Sigma_{a}$ and $\Sigma_{b}$ each act as zero on the computational subspace, by accordingly exchanging the physical spins of the product states that constitute the computational basis.

For the sake of consistency with our representation theory approach we introduce the group algebra $\mathbb{C}S_{6}$, which we have just used implicitly. This consists of all finite linear combinations of $S_{6}$,

[TABLE]

as for example $\Sigma_{a}$ and $\Sigma_{b}$. The group algebra comes equipped with multiplication, addition, and scalar multiplication in the obvious ways. It is then straightforward to linearly extend Young’s orthogonal representation from $S_{6}$ to $\mathbb{C}S_{6}$, which we assume henceforth. As expected we find $\rho_{\lambda}\left(\Sigma_{a}\right)$ and $\rho_{\lambda}\left(\Sigma_{b}\right)$ are each null on the computational subspace.

The sums $\Sigma_{a}$ and $\Sigma_{b}$ have additional properties that make them well-suited to the task of performing effective projection operations. As they consist of mutually nonoverlapping transpositions, they commute, and therefore their representations can be simultaneously diagonalized. We then have for irrep $\ydiagram{3,3}$,

[TABLE]

and for irrep $\ydiagram{4,2}$,

[TABLE]

where here and henceforth the first four basis vectors of irrep $\ydiagram{3,3}$ are given by the right hand sides of Eqs. (25-28), in that order, the first four basis vectors of irrep $\ydiagram{4,2}$ are given by the right hand sides of Eqs. (29-32), in that order (thus corresponding in both cases to the computational basis $\{\ket{00}_{L},\ket{01}_{L},\ket{10}_{L},\ket{11}_{L}\}$), and the remainder of each basis is such that the following properties hold. The eigenspace of the final 1 in every case is the image of representation $\ydiagram{3}\otimes\ydiagram{3}$, the remaining two-dimensional 1-eigenspace in $\rho_{\ytableausetup{boxsize=0.2em,nocentertableaux}\ydiagram{4,2}\ytableausetup{nosmalltableaux}\ytableausetup{boxsize=0.4em,centertableaux}}(\Sigma_{a})$ is the image of representation $\ydiagram{3}\otimes\ydiagram{2,1}$, and the remaining two-dimensional 1-eigenspace in $\rho_{\ytableausetup{boxsize=0.2em,nocentertableaux}\ydiagram{4,2}\ytableausetup{nosmalltableaux}\ytableausetup{boxsize=0.4em,centertableaux}}(\Sigma_{b})$ is the image of representation $\ydiagram{2,1}\otimes\ydiagram{3}$. So $\Sigma_{a}$ and $\Sigma_{b}$ can be interpreted as projectors onto states that are disallowed by the computational subspace. Furthermore $\Sigma_{a}+\Sigma_{b}\neq 0$ on the complement of the computational subspace in both irreps.

To put these sums to use, we define the following unitaries,

[TABLE]

where $\lambda$ equals partition $\ydiagram{3,3}$ or $\ydiagram{4,2}$. For $\lambda=\ydiagram{3,3}$, and again in the diagonalizing basis (which includes the computational basis),

[TABLE]

and for $\lambda=\ydiagram{4,2}$,

[TABLE]

It follows that, for all $H\in\rho_{\lambda}(\mathbb{C}S_{6})$ and $\lambda=\ydiagram{3,3}$ or $\ydiagram{4,2}$,

[TABLE]

where $D$ denotes a decoupling function which cancels cross terms with the computational subspace. Alternatively we can define

[TABLE]

and obtain in both irreps,

[TABLE]

with the choice of unitaries depending on which is more convenient for the problem at hand.

In terms of projection operators,

[TABLE]

where $\Pi$ projects onto the computational subspace while $\Pi_{{\ytableausetup{boxsize=0.2em,nocentertableaux}\ydiagram{2,1}\ytableausetup{nosmalltableaux}\ytableausetup{smalltableaux,nocentertableaux}}\otimes{\ytableausetup{boxsize=0.2em,nocentertableaux}\ydiagram{3}\ytableausetup{nosmalltableaux}\ytableausetup{smalltableaux,nocentertableaux}}}$, $\Pi_{{\ytableausetup{boxsize=0.2em,nocentertableaux}\ydiagram{3}\ytableausetup{nosmalltableaux}\ytableausetup{smalltableaux,nocentertableaux}}\otimes{\ytableausetup{boxsize=0.2em,nocentertableaux}\ydiagram{2,1}\ytableausetup{nosmalltableaux}\ytableausetup{smalltableaux,nocentertableaux}}}$, and $\Pi_{{\ytableausetup{boxsize=0.2em,nocentertableaux}\ydiagram{3}\ytableausetup{nosmalltableaux}\ytableausetup{smalltableaux,nocentertableaux}}\otimes{\ytableausetup{boxsize=0.2em,nocentertableaux}\ydiagram{3}\ytableausetup{nosmalltableaux}\ytableausetup{smalltableaux,nocentertableaux}}}$ project onto the subspaces comprising the complement of the computational subspace as indicated in Fig. 1 and Eqs. (22-23). Noting that $\rho_{\ytableausetup{boxsize=0.2em,nocentertableaux}\ydiagram{3,3}\ytableausetup{nosmalltableaux}\ytableausetup{smalltableaux,nocentertableaux}}(\mathbb{C}S_{6})\cong M_{5}(\mathbb{C})$, if we let $H=(h_{ij})\in\rho_{\ytableausetup{boxsize=0.2em,nocentertableaux}\ydiagram{3,3}\ytableausetup{nosmalltableaux}\ytableausetup{smalltableaux,nocentertableaux}}(\mathbb{C}S_{6})$ then we obtain

[TABLE]

On the other hand noting that $\rho_{\ytableausetup{boxsize=0.2em,nocentertableaux}\ydiagram{4,2}\ytableausetup{nosmalltableaux}\ytableausetup{smalltableaux,nocentertableaux}}(\mathbb{C}S_{6})\cong M_{9}(\mathbb{C})$, if we let $H=(h_{ij})\in\rho_{\ytableausetup{boxsize=0.2em,nocentertableaux}\ydiagram{4,2}\ytableausetup{nosmalltableaux}\ytableausetup{smalltableaux,nocentertableaux}}(\mathbb{C}S_{6})$ then we obtain

[TABLE]

\ytableausetup

nosmalltableaux\ytableausetupboxsize=0.4em,centertableauxWe now recognize projections onto the four-dimensional computational subspace, the two-dimensional subspaces associated with $\ydiagram{2,1}\otimes\ydiagram{3}$ and $\ydiagram{3}\otimes\ydiagram{2,1}$, and the one-dimensional subspace associated with $\ydiagram{3}\otimes\ydiagram{3}$, as discussed in Section II.

Our task, then, is to express the above projection procedure in terms of physically-realizable, exchange-only operations. Therefore we “Trotterize”, that is approximate

[TABLE]

as a product of unitaries in the form of exponentials depending on linear combinations of exchange interactions, where $\alpha$ is some angle and $\{U_{j}\}_{j=1}^{4}$ is one of $\{1,U_{a},U_{b},U_{a}U_{b}\}$ or $\{1,U,U^{\dagger},U^{2}\}$. Letting $\{A_{j}\}_{j=1}^{k}$ be a set of non-commuting operators we can use for example the zeroth order exponential product expansion,

[TABLE]

or the first order Suzuki-Trotter expansion 10.2307/2033649 ; suzuki1976 ,

[TABLE]

or still higher order approximations. Therefore, noting that

[TABLE]

and using $\{U_{j}\}_{j=1}^{4}=\{U^{2},U,1,U^{\dagger}\}$, we have to zeroth order that

[TABLE]

and to first order that

[TABLE]

where $\delta t=\alpha/4n$.

IV Hamiltonian and gate construction

IV.1 One qubit: Spin-independent Hamiltonians and gates

We now explore which combinations of exchange interactions yield useful computational submatrices. First we review the relationship between local exchange interactions and Pauli matrices. The $X$ and $Z$ Pauli matrices on the first qubit can be constructed from any two local exchange interactions within the first block as follows:

[TABLE]

where the representation $\rho_{\lambda}$ and projector $\Pi$ are understood to operate on each component of each column vector of transpositions. Thus for example the first row of the left-most term implies

[TABLE]

where the projector appears in this equation only for consistency of matrix dimensions across the equal sign (decoupling is not required for single-qubit gates), and by a component of the form $AB$, where $A,B\in\{I,X,Z\}$, we mean a tensor product of the indicated Pauli matrix on the first qubit with the indicated Pauli matrix on the second qubit. Similarly local exchange interactions within the second block yield Eq. (73) but with $(12)$, $(13)$, and $(23)$ replaced by $(45)$, $(46)$, and $(56)$ respectively, and $XI$ and $ZI$ replaced by $IX$ and $IZ$ respectively.

Now we focus on one of the blocks and so momentarily dispense with tensor products with the identity. We can obtain any Hamiltonian of the form $aX+bZ$ from local exchange interactions, up to phase. A Hamiltonian of the form $aX+bY$ can then be obtained by conjugation with $\exp(i\frac{\pi}{4}X)$, which transforms $Z$ to $Y$, and a Hamiltonian of the form $aY+bZ$ can be obtained by conjugation with $\exp(i\frac{\pi}{4}Z)$, which transforms $X$ to $Y$.

More generally, for any single-qubit Hamiltonian $H$ and time $t$ it follows from a Cartan decomposition of $SU(2)$ (a generalized Euler angle decomposition of rotations)  KHANEJA200111 that

[TABLE]

for some $\alpha,\beta,\gamma,\delta\in\mathbb{R}$, which can then be expressed in terms of local exchange interactions by Eq. (73). Thus we can construct any single-qubit gate from local exchange interactions. Such constructions are independent of the choice of irrep ($\ydiagram{3,3}$ or $\ydiagram{4,2}$) since the relevant intertwiners preserve the action of local exchange interactions.

IV.2 Two qubits: Spin-dependent Hamiltonians and spin-independent gates

Constructing exchange-only Hamiltonians for two-qubits is more challenging. From calculations performed in Maple 2016 (see ancillary files spin0_exchange_gates and spin1_exchange_gates) we find:

[TABLE]

where $a_{\lambda}=b_{\lambda}=1$ for $\lambda=\ydiagram{4,2}$ and $a_{\lambda}=-3$ and $b_{\lambda}=-1/5$ for $\lambda=\ydiagram{3,3}$. Thus within each irrep we can construct any linear combination of Pauli Hamiltonians excluding $Y$ by decoupling sums of exchange interactions. As before, combinations of $X$ and $Y$ or $Z$ and $Y$ on one qubit can be obtained by appropriate conjugation with $\exp(i\frac{\pi}{4}(ZI))$, $\exp(i\frac{\pi}{4}(XI))$, $\exp(i\frac{\pi}{4}(IZ))$, or $\exp(i\frac{\pi}{4}(IX))$.

For any two-qubit gate $G$ it follows from a Cartan decomposition of $SU(4)$ that KHANEJA200111

[TABLE]

for some local unitaries $K_{1}$ and $K_{2}$ and real coefficients $\alpha,\beta,\gamma$. The local unitaries can be expressed in terms of $X$ and $Z$ as discussed previously. The remaining exponential can be further decomposed since $XX$, $YY$, and $ZZ$ all commute; for example:

[TABLE]

The above Hamiltonian and gate constructions are irrep-dependent, in general. However, consider an exchange-only Hamiltonian $H$ equal to a combination of the above Pauli terms in the $\ydiagram{4,2}$ irrep that squares to the identity. Then using that $H$ equals the same combination of Pauli terms multiplied by -3 in the $\ydiagram{3,3}$ irrep (neglecting a possible identity term contribution to overall phase) we have by Euler’s formula for matrices that $\exp(i\frac{\pi}{2}H)$ is irrep-independent. For example,

[TABLE]

Similarly the general gate $G$ in Eq. (79) is irrep-independent for coefficients $\alpha,\beta,\gamma\in\{-\pi/2,0,\pi/2\}$. This procedure is used for the CNOT gate in the next section.

IV.3 Spin-independent CNOT

Observe that

[TABLE]

Further, letting

[TABLE]

we immediately obtain from subtraction of the 2nd and 8th rows of Eq. (76) that

[TABLE]

and

[TABLE]

Clearly then

[TABLE]

by the same logic as in the example above (Eq. (IV.2)), albeit with the Hamiltonian $\Pi\rho_{\ytableausetup{boxsize=0.2em,nocentertableaux}\ydiagram{4,2}\ytableausetup{nosmalltableaux}\ytableausetup{boxsize=0.4em,centertableaux}}(N)\Pi$ squaring to a two-dimensional rather than four-dimensional identity. Meanwhile $I-(12)$, being local, acts the same on the computational subspace of both irreps:

[TABLE]

Thus by Eq. (III) the following expression maps to an approximate CNOT on the computational subspace of both irreps,

[TABLE]

where $\delta t=\pi/8n$, and for ease of notation we have dropped the explicit $\rho_{\lambda}$ mapping as well as the decoupled orthogonal projection.

Conveniently, the above Hamiltonian and its Trotterization can be recast as neighboring exchange interactions in planar geometry (Fig. 2), where $(12)$ has been removed from $U$ because it commutes with $N$. (In general if any one local exchange interaction commutes with the Hamiltonian, then since it also commutes with the sum of the remaining local interactions it cancels during conjugation and can thus be removed.) That $(12)$ commutes with $N$ is due to the fact that $N$ is symmetric with respect to qubits 1 and 2 and thus invariant under conjugation with $(12)$. We add that the exact diagram in Fig. 2 may not be physically practical due to the relative distances between qubits 1, 4 and 5, but more practical architectures may be possible.

To evaluate the efficiency of our approximate CNOT we can define a normalized operation time by summing the maximum magnitude of the coefficients on the exchange interactions in each exponential and dividing by $\pi/2$ (the time required for one full swap). This normalized time is proportional to the actual physical time provided the exchange interactions are performed in parallel. Alternatively we can consider the number of clock cycles, as defined in divincenzo:qc2000b , which here equates to the number of exponential factors in Eq. (IV.3) (after consolidating commuting exponents). To assess the quality of our approximate CNOT we can use the entanglement fidelity Nielsen:1996uh ,

[TABLE]

We also calculate the contribution from leakage out of the computational subspace to $1-F$:

[TABLE]

where $G$ is the gate under consideration and CNOT has been extended by identity to the complement of the computational subspace. Then for various iterations $n$ of the approximation above we obtain the values in Table 1, where the fidelity and leakage values assume a total spin of 1, this being the worst case (heuristically because its higher dimensional subsystem has more cross-terms to decouple).

If negative exchange interactions are canceled in the optimal way described in Section V, the normalized time is increased by 1.3 in every case but the fidelities and leakages are unchanged. The above times are comparable to that of one of the most efficient exact solutions DBLP:journals/qic/FongW11 , which has a normalized time of 12.3 (including the local unitaries required for consistency with our computational basis) or 14.8 if negative exchange interactions are canceled.

IV.4 Spin 1 optimized CNOT

Alternatively the qubits can be prepared with a total spin of 1 by the use of magnetic fields divincenzo:qc2000b , in which case spin-independence is not a concern, and the $IX$ term in the above derivation of CNOT can be expressed in terms of local interactions instead of cross-block interactions. In combination with the noncommuting cross-block interactions in the $ZX$ term, this replacement breaks irrep-independence, since the two kinds of interactions transform differently across irreps. However the resulting approximation is made slightly more efficient, as we show below.

Let

[TABLE]

Then for spin 1 we have

[TABLE]

Unlike the previous spin-independent expression, $N_{1}$ commutes with $U_{b}N_{1}U_{b}^{\dagger}$ and similarly $U_{a}N_{1}U_{a}^{\dagger}$ commutes with $U_{a}U_{b}N_{1}U_{b}^{\dagger}U_{a}^{\dagger}$. This simplifies the Suzuki-Trotter approximation for $\exp(i\alpha(N_{1}+U_{a}N_{1}U_{a}^{\dagger}+U_{b}N_{1}U_{b}^{\dagger}+U_{b}U_{a}N_{1}U_{a}^{\dagger}U_{b}^{\dagger}))$ and we find

[TABLE]

where $T\equiv\exp(i\delta tN_{1})$ and $\delta t=\pi/8n$. Again this can be arranged as neighboring exchange interactions in a plane (Fig. 3), where $(12)$ commutes with $N_{1}$ and so can be removed from $U_{a}$.

The smaller truncation error that results from this expression yields the results shown in Table 2.

Again if subtracted exchange interactions are canceled the normalized time is increased by 1.3 in every case.

V Discussion

For the case of two logical qubits encoded on a decoherence-free subsystem of three physical spins each, we have presented an exchange-only method to decouple the resulting computational subspace from leaked states. Using Trotterization we showed how this method can be implemented to any desired fidelity. We then applied this procedure to explicitly construct Pauli Hamiltonians from exchange interactions. Building on this we provided a transparent method to construct two-qubit gates from exchange interactions, including a large family of spin-independent gates. In particular we have shown that an exchange-only CNOT gate can be implemented with a computational speed comparable to or better than previous solutions, with good fidelity, provided the exchange interactions can be performed in parallel. The fidelities for these constructions exceed $0.99$, which is comparable to fidelities demonstrated for one logical qubit in three quantum dots 2018arXiv181202693A , and for two-qubit gates with other quantum devices 2014Natur.508..500B ; gaebler:qc2016a ; PhysRevLett.117.060504 . Fidelities exceeding the conservative requirements for fault-tolerance Preskill:1997ds ; 2010Natur.463..441K ; 2010Natur.464…45L can be achieved with a slow down of about a factor of two.

We note that for quantum dots the negative coefficients on exchange interactions in many of the expressions above would seem to require negative charging energies PhysRevA.57.120 . This is possible by coupling to magnetic fields or other means PhysRevB.59.2070 ; BAGRAEV20031061 ; 2008PhRvB..77e4517H ; 2009PhRvB..80s5103O ; 2014EL….10547006F ; fbf90b1cbccd41febafd7ae35a2b6e87 , but if it proves impractical, the negative coefficients can be removed by various methods. Of course for an exponential of a single negative exchange interaction one may simply add an integer multiple of $2\pi$ to its coefficient.

To address the more general case of multiple negative exchange interactions, we observe that the sum of all transpositions in $S_{6}$ acts as a constant on the irreps,

[TABLE]

where $c_{\ytableausetup{boxsize=0.2em,nocentertableaux}\ydiagram{3,3}\ytableausetup{nosmalltableaux}\ytableausetup{boxsize=0.4em,centertableaux}}=3$ and $c_{\ytableausetup{boxsize=0.2em,nocentertableaux}\ydiagram{4,2}\ytableausetup{nosmalltableaux}\ytableausetup{boxsize=0.4em,centertableaux}}=5$. Therefore adding the sum of all exchange interactions to an exchange-only Hamiltonian, with a coefficient equal to the largest magnitude of the negative coefficients in that Hamiltonian, will cancel that negative coefficient and ensure that all other resulting coefficients are nonnegative. In general this results in an overall phase difference between the spin 0 and spin 1 cases, due to the different constants effectively being added, but our encoding is independent of such a phase. Alternatively for negative local exchange interactions we can add an appropriate multiple of the sum of all local exchange interactions, for one or both blocks as needed, as that sum acts as zero on the computational subspace (Eqs. (36-39)). It follows that for negative cross-block interactions we can add an appropriate multiple of the sum of all cross-block interactions, as that sum acts as $3I$ or $5I$ on the computational subspace depending again on whether the total spin is 0 or 1. To summarize in more physical terms, the sums discussed above commute with the logical two-qubit observables, which are in the group algebra generated by $S_{3}\times S_{3}$, and can therefore be added to the Hamiltonian as needed without changing relevant expectation values.

We end with some open questions for future work. Aside from the Pauli and CNOT gates, it may be of interest to find efficient expressions for other gates and evaluate their efficiencies as we did for CNOT. Regarding CNOT, we sought to minimize the time required for given fidelities, but one might instead seek to minimize the clock cycles or circuit depth. Related to this, it may be of practical interest to approximate our parallel interaction expressions by strictly serial expressions. Finally, our decoupling procedure employed a first order Suzuki-Trotter approximation, which is optimal for the fidelities considered here, but higher order approximations might be advantageous if higher fidelities are desired. Although the first order approximation can achieve any fidelity with sufficiently many iterations, the higher order approximations require fewer iterations and for large enough fidelity they are more efficient.

Acknowledgements.

JRvM wishes to thank M. Ly, K. Mayer, and N. Thiem for helpful discussions. This work includes contributions of the National Institute of Standards and Technology, which are not subject to U.S. copyright. The identification of any product or trade names is for informational purposes and does not imply endorsement or recommendation by the National Institute of Standards and Technology. This work was performed under the financial assistance award 70NANB18H006 from U.S. Department of Commerce, National Institute of Standards and Technology. JRvM also acknowledges the support of the Professional Research Experience Program at the National Institute of Standards and Technology.