Searcharxiv⌕ Search

arXiv subjects

Stephen S Bullock

Publications and source records attributed to Stephen S Bullock.

2 recordsLinked to original sources

Projecting onto Qubit Irreps of Young Diagrams

Let K be the diagonal subgroup of U(2)^{(x)n}. We may view the one-qubit state-space H_1 as a standard representation of U(2) and the n-qubit state space H_n=(H_1)^{(x) n} as the n-fold tensor product of standard representations. Representation theory then decomposes H_n into irreducible subrepresentations of K parametrized by combinatorial objects known as Young diagrams. We argue that n-1 classically controlled measurement circuits, each a Fredkin-gate interferometer, may be used to form a projection operator onto a random Young diagram irrep within H_n. For H_2, the two irreps happen to be orthogonal and correspond to the symmetric and wedge product. The latter is spanned by ket{Psi^-}, and the standard two-qubit swap interferometer requiring a single Fredkin gate suffices in this case. In the n-qubit case, it is possible to extract many copies of ket{Psi^-}. Thus applying this process using nondestructive Fredkin interferometers allows for the creation of entangled bits (e-bits) using fully mixed states and von Neumann measurements.

quant-ph↗

Note on the Khaneja Glaser Decomposition

Recently, Vatan and Williams utilize a matrix decomposition of SU(2^n) introduced by Khaneja and Glaser to produce CNOT-efficient circuits for arbitrary three-qubit unitary evolutions. In this note, we place the Khaneja Glaser Decomposition (KGD) in context as a SU(2^n)=KAK decomposition by proving that its Cartan involution is type AIII, given n is greater than 2. The standard type AIII involution produces the Cosine-Sine Decomposition (CSD), a well-known decomposition in numerical linear algebra which may be computed using mature, stable algorithms. In the course of our proof that the KGD is type AIII, we further establish the following. Khaneja and Glaser allow for a particular degree of freedom, namely the choice of a commutative algebra a, in their construction. Let SWAP denote a swap between qubits 1 and n. Then for appropriate choice of a, the KGD by (SWAP v SWAP)=k1 a k2 may be recovered from a CSD by v = (SWAP k1 SWAP) (SWAP a SWAP) (SWAP k2 SWAP).

quant-ph↗