arXiv subjects

Gavin K. Brennen

Publications and source records attributed to Gavin K. Brennen.

At least 73 records · Page 4Linked to original sources

arXiv2009

Anyonic Quantum Walks

The one dimensional quantum walk of anyonic systems is presented. The anyonic walker performs braiding operations with stationary anyons of the same type ordered canonically on the line of the walk. Abelian as well as non-Abelian anyons are studied and it is shown that they have very different properties. Abelian anyonic walks demonstrate the expected quadratic quantum speedup. Non-Abelian anyonic walks are much more subtle. The exponential increase of the system's Hilbert space and the particular statistical evolution of non-Abelian anyons give a variety of new behaviors. The position distribution of the walker is related to Jones polynomials, topological invariants of the links created by the anyonic world-lines during the walk. Several examples such as the SU(2) level k and the quantum double models are considered that provide insight to the rich diffusion properties of anyons.

quant-ph↗

arXiv2008

Measurement-based quantum computer in the gapped ground state of a two-body Hamiltonian

We propose a scheme for a ground-code measurement-based quantum computer, which enjoys two major advantages. First, every logical qubit is encoded in the gapped degenerate ground subspace of a spin-1 chain with nearest-neighbor two-body interactions, so that it equips built-in robustness against noise. Second, computation is processed by single-spin measurements along multiple chains dynamically coupled on demand, so as to keep teleporting only logical information into a gap-protected ground state of the residual chains after the interactions with spins to be measured are turned off. We describe implementations using trapped atoms or polar molecules in an optical lattice, where the gap is expected to be as large as 0.2 kHz or 4.8 kHz respectively.

quant-ph↗

arXiv2008

General Depolarized Pure States: Identification and Properties

The Schmidt decomposition is an important tool in the study of quantum systems especially for the quantification of the entanglement of pure states. However, the Schmidt decomposition is only unique for bipartite pure states, and some multipartite pure states. Here a generalized Schmidt decomposition is given for states which are equivalent to depolarized pure states. Experimental methods for the identification of this class of mixed states are provided and some examples are discussed which show the utility of this description. A particularly interesting example provides, for the first time, an interpretation of the number of negative eigenvalues of the density matrix.

quant-ph↗

arXiv2007

Anyonic interferometry and protected memories in atomic spin lattices

Strongly correlated quantum systems can exhibit exotic behavior called topological order which is characterized by non-local correlations that depend on the system topology. Such systems can exhibit remarkable phenomena such as quasi-particles with anyonic statistics and have been proposed as candidates for naturally fault-tolerant quantum computation. Despite these remarkable properties, anyons have never been observed in nature directly. Here we describe how to unambiguously detect and characterize such states in recently proposed spin lattice realizations using ultra-cold atoms or molecules trapped in an optical lattice. We propose an experimentally feasible technique to access non-local degrees of freedom by performing global operations on trapped spins mediated by an optical cavity mode. We show how to reliably read and write topologically protected quantum memory using an atomic or photonic qubit. Furthermore, our technique can be used to probe statistics and dynamics of anyonic excitations.

quant-ph↗

arXiv2007

Why should anyone care about computing with anyons?

In this article we present a pedagogical introduction of the main ideas and recent advances in the area of topological quantum computation. We give an overview of the concept of anyons and their exotic statistics, present various models that exhibit topological behavior, and we establish their relation to quantum computation. Possible directions for the physical realization of topological systems and the detection of anyonic behavior are elaborated.

quant-ph↗

arXiv2007

Theory of Rabi interaction between an infrared-active phonon and cavity-resonant modes

We present the theory of interaction between a polar vibration in a semiconductor and an electromagnetic mode of a surrounding cavity. Tuning the cavity frequency near the transverse optical phonon frequency couples the phonon-induced polarization field within the dielectric and the electromagnetic field in the cavity. Depending on engineering parameters, we predict that this cavity quantum electrodynamic interaction may reach the strong coupling regime. The resonances of the system are in the terahertz spectral region, and while spectroscopic measurements are a possible route for the detection of such a system, we emphasize the possibility of measuring the Rabi oscillation directly in the time domain with femtosecond optical pulses.

cond-mat.mtrl-sci↗

arXiv2006

Designing spin-1 lattice models using polar molecules

We describe how to design a large class of always on spin-1 interactions between polar molecules trapped in an optical lattice. The spin degrees of freedom correspond to the hyperfine levels of a ro-vibrational ground state molecule. Interactions are induced using a microwave field to mix ground states in one hyperfine manifold with the spin entangled dipole-dipole coupled excited states. Using multiple fields anistropic models in one, two, or three dimensions, can be built with tunable spatial range. An illustrative example in one dimension is the generalized Haldane model, which at a specific parameter has a gapped valence bond solid ground state. The interaction strengths are large compared to decoherence rates and should allow for probing the rich phase structure of strongly correlated systems, including dimerized and gapped phases.

quant-ph↗

arXiv2006

Single qubit gates with a charged quantum dot using minimal resources

We investigate coherent control of a single electron trapped in a semiconductor quantum dot. Control is enabled with a strong laser field detuned with respect to the electron light-hole optical transitions. For a realistic experimental situation, i.e. with a weak magnetic field applied along the growth direction, high fidelity arbitrary rotations of the electron spin are possible using a single laser spatial mode. This makes viabile quantum gates with electron spins in systems with restricted optical resources.

cond-mat.other↗

arXiv2006

Qudit surface codes and gauge theory with finite cyclic groups

Surface codes describe quantum memory stored as a global property of interacting spins on a surface. The state space is fixed by a complete set of quasi-local stabilizer operators and the code dimension depends on the first homology group of the surface complex. These code states can be actively stabilized by measurements or, alternatively, can be prepared by cooling to the ground subspace of a quasi-local spin Hamiltonian. In the case of spin-1/2 (qubit) lattices, such ground states have been proposed as topologically protected memory for qubits. We extend these constructions to lattices or more generally cell complexes with qudits, either of prime level or of level $d^\ell$ for $d$ prime and $\ell \geq 0$, and therefore under tensor decomposition, to arbitrary finite levels. The Hamiltonian describes an exact $\mathbb{Z}_d\cong\mathbb{Z}/d\mathbb{Z}$ gauge theory whose excitations correspond to abelian anyons. We provide protocols for qudit storage and retrieval and propose an interferometric verification of topological order by measuring quasi-particle statistics.

quant-ph↗

arXiv2006

Parallelism for Quantum Computation with Qudits

Robust quantum computation with d-level quantum systems (qudits) poses two requirements: fast, parallel quantum gates and high fidelity two-qudit gates. We first describe how to implement parallel single qudit operations. It is by now well known that any single-qudit unitary can be decomposed into a sequence of Givens rotations on two-dimensional subspaces of the qudit state space. Using a coupling graph to represent physically allowed couplings between pairs of qudit states, we then show that the logical depth of the parallel gate sequence is equal to the height of an associated tree. The implementation of a given unitary can then optimize the tradeoff between gate time and resources used. These ideas are illustrated for qudits encoded in the ground hyperfine states of the atomic alkalies $^{87}$Rb and $^{133}$Cs. Second, we provide a protocol for implementing parallelized non-local two-qudit gates using the assistance of entangled qubit pairs. Because the entangled qubits can be prepared non-deterministically, this offers the possibility of high fidelity two-qudit gates.

quant-ph↗

arXiv2005

Efficient Circuits for Exact-Universal Computations with Qudits

This paper concerns the efficient implementation of quantum circuits for qudits. We show that controlled two-qudit gates can be implemented without ancillas and prove that the gate library containing arbitrary local unitaries and one two-qudit gate, CINC, is exact-universal. A recent paper (PRL 94 230502) describes quantum circuits for qudits which require O(d^n) two-qudit gates for state synthesis and O(d^{2n}) two-qudit gates for unitary synthesis, matching the respective lower bound complexities. In this work, we present the state synthesis circuit in much greater detail and prove that it is correct. Also, the (n-2)/(d-2) ancillas required in the original algorithm may be removed without changing the asymptotics. Further, we present a new algorithm for unitary synthesis, inspired by the QR matrix decomposition, which is also asymptotically optimal.

quant-ph↗

arXiv2004

Time Reversal and n-qubit Canonical Decompositions

For n an even number of qubits and v a unitary evolution, a matrix decomposition v=k1 a k2 of the unitary group is explicitly computable and allows for study of the dynamics of the concurrence entanglement monotone. The side factors k1 and k2 of this Concurrence Canonical Decomposition (CCD) are concurrence symmetries, so the dynamics reduce to consideration of the a factor. In this work, we provide an explicit numerical algorithm computing v=k1 a k2 for n odd. Further, in the odd case we lift the monotone to a two-argument function, allowing for a theory of concurrence dynamics in odd qubits. The generalization may also be studied using the CCD, leading again to maximal concurrence capacity for most unitaries. The key technique is to consider the spin-flip as a time reversal symmetry operator in Wigner's axiomatization; the original CCD derivation may be restated entirely in terms of this time reversal. En route, we observe a Kramers' nondegeneracy: the existence of a nondegenerate eigenstate of any time reversal symmetric n-qubit Hamiltonian demands (i) n even and (ii) maximal concurrence of said eigenstate. We provide examples of how to apply this work to study the kinematics and dynamics of entanglement in spin chain Hamiltonians.

quant-ph↗

arXiv2004

Asymptotically Optimal Quantum Circuits for d-level Systems

As a qubit is a two-level quantum system whose state space is spanned by |0>, |1>, so a qudit is a d-level quantum system whose state space is spanned by |0>,...,|d-1>. Quantum computation has stimulated much recent interest in algorithms factoring unitary evolutions of an n-qubit state space into component two-particle unitary evolutions. In the absence of symmetry, Shende, Markov and Bullock use Sard's theorem to prove that at least C 4^n two-qubit unitary evolutions are required, while Vartiainen, Moettoenen, and Salomaa (VMS) use the QR matrix factorization and Gray codes in an optimal order construction involving two-particle evolutions. In this work, we note that Sard's theorem demands C d^{2n} two-qudit unitary evolutions to construct a generic (symmetry-less) n-qudit evolution. However, the VMS result applied to virtual-qubits only recovers optimal order in the case that d is a power of two. We further construct a QR decomposition for d-multi-level quantum logics, proving a sharp asymptotic of Theta(d^{2n}) two-qudit gates and thus closing the complexity question for all d-level systems (d finite.) Gray codes are not required, and the optimal Theta(d^{2n}) asymptotic also applies to gate libraries where two-qudit interactions are restricted by a choice of certain architectures.

quant-ph↗

arXiv2004

Stability of global entanglement in thermal states of spin chains

We investigate the entanglement properties of a one dimensional chain of spin qubits coupled via nearest neighbor interactions. The entanglement measure used is the n-concurrence, which is distinct from other measures on spin chains such as bipartite entanglement in that it can quantify "global" entanglement across the spin chain. Specifically, it computes the overlap of a quantum state with its time-reversed state. As such this measure is well suited to study ground states of spin chain Hamiltonians that are intrinsically time reversal symmetric. We study the robustness of n-concurrence of ground states when the interaction is subject to a time reversal antisymmetric magnetic field perturbation. The n-concurrence in the ground state of the isotropic XX model is computed and it is shown that there is a critical magnetic field strength at which the entanglement experiences a jump discontinuity from the maximum value to zero. The n-concurrence for thermal mixed states is derived and a threshold temperature is computed below which the system has non zero entanglement.

quant-ph↗

arXiv2004

Criteria for Exact Qudit Universality

We describe criteria for implementation of quantum computation in qudits. A qudit is a d-dimensional system whose Hilbert space is spanned by states |0>, |1>,... |d-1>. An important earlier work of Mathukrishnan and Stroud [1] describes how to exactly simulate an arbitrary unitary on multiple qudits using a 2d-1 parameter family of single qudit and two qudit gates. Their technique is based on the spectral decomposition of unitaries. Here we generalize this argument to show that exact universality follows given a discrete set of single qudit Hamiltonians and one two-qudit Hamiltonian. The technique is related to the QR-matrix decomposition of numerical linear algebra. We consider a generic physical system in which the single qudit Hamiltonians are a small collection of H_{jk}^x=\hbarΩ(|k> k iff H_{jk}^{x,y} are allowed Hamiltonians. One qudit exact universality follows iff this graph is connected, and complete universality results if the two-qudit Hamiltonian H=-\hbarΩ|d-1,d-1><d-1,d-1| is also allowed. We discuss implementation in the eight dimensional ground electronic states of ^{87}Rb and construct an optimal gate sequence using Raman laser pulses.

quant-ph↗

arXiv2004

Canonical Decompositions of n-qubit Quantum Computations and Concurrence

The two-qubit canonical decomposition SU(4) = [SU(2) \otimes SU(2)] Delta [SU(2) \otimes SU(2)] writes any two-qubit quantum computation as a composition of a local unitary, a relative phasing of Bell states, and a second local unitary. Using Lie theory, we generalize this to an n-qubit decomposition, the concurrence canonical decomposition (C.C.D.) SU(2^n)=KAK. The group K fixes a bilinear form related to the concurrence, and in particular any computation in K preserves the tangle | |^2 for n even. Thus, the C.C.D. shows that any n-qubit quantum computation is a composition of a computation preserving this n-tangle, a computation in A which applies relative phases to a set of GHZ states, and a second computation which preserves it. As an application, we study the extent to which a large, random unitary may change concurrence. The result states that for a randomly chosen a in A within SU(2^{2p}), the probability that a carries a state of tangle 0 to a state of maximum tangle approaches 1 as the even number of qubits approaches infinity. Any v=k_1 a k_2 for such an a \in A has the same property. Finally, although | |^2 vanishes identically when the number of qubits is odd, we show that a more complicated C.C.D. still exists in which K is a symplectic group.

quant-ph↗

arXiv2003

Scalable register initialization for quantum computing in an optical lattice

The Mott insulator state created by loading an atomic Bose-Einstein condensate (BEC) into an optical lattice may be used as a means to prepare a register of atomic qubits in a quantum computer. Such architecture requires a lattice commensurately filled with atoms, which corresponds to the insulator state only in the limit of zero inter-well tunneling. We show that a lattice with spatial inhomogeneity created by a quadratic magnetic trapping potential can be used to isolate a subspace in the center which is impervious to hole-hoping. Components of the wavefunction with more than one atom in any well can be projected out by selective measurement on a molecular photo-associative transition. Maintaining the molecular coupling induces a quantum Zeno effect that can sustain a commensurately filled register for the duration of a quantum computation.

quant-ph↗

arXiv2003

An observable measure of entanglement for pure states of multi-qubit systems

Recently, Meyer and Wallach [D.A. Meyer and N.R. Wallach (2002), J. of Math. Phys., 43, pp. 4273] proposed a measure of multi-qubit entanglement that is a function on pure states. We find that this function can be interpreted as a physical quantity related to the average purity of the constituent qubits and show how it can be observed in an efficient manner without the need for full quantum state tomography. A possible realization is described for measuring the entanglement of a chain of atomic qubits trapped in a 3D optical lattice.

quant-ph↗