Quantum Information

Black holes are regions of space with gravity so strong that nothing can escape from them, not even light. This isn't science fiction - there's even a gigantic black hole at the center of our galaxy. It's hard to imagine a more effective way to irrevocably erase and destroy a computer's hard drive than to drop it into a nice big black hole. But is the information on that drive really gone forever? Paradoxically, there's a good chance that not only does the information come back, it comes back in the blink of an eye. This surprise return of the information is based on the same principles that might someday make reliable quantum computers a reality. In fact, engineers are already exploiting these principles to help distribute software and stream video over the internet. And that's where the tornadoes come in...

We study the entanglement dynamics and relaxation properties of a system of two interacting qubits in the two cases (I) two independent bosonic baths and (II) one common bath, at temperature $T$. The entanglement dynamics is studied in terms of the concurrence C(t) between the two spins and of the von Neumann entropy S(t) with respect to the bath, as a function of time. We prove that the system does thermalize. In the case (II) of a single bath, the existence of a decoherence-free (DFS) subspace makes entanglement dynamics very rich. We show that when the system is initially in a state with a component in the DFS the relaxation time is surprisingly long, showing the existence of semi-decoherence free subspaces. The equilibrium state in this case is not the Gibbs state. The entanglement dynamics for the single bath case is also studied as a function of temperature, coupling strength with the environment and strength of tunneling coupling. The case of the mixed state is finally shown and discussed.

In topological quantum computation the geometric details of a particle trajectory become irrelevant; only the topology matters. This is one reason for the inherent fault tolerance of topological quantum computation. I will speak about a model in which this idea is taken one step further. Even the topology is irrelevant. The computation is determined solely by the permutation of the particles. Unlike topological quantum computation, which requires anyons confined to two dimensions, permutational quantum computations can in principle be performed by permuting a set of ordinary spin-1/2 particles with definite total angular momentum in three dimensions. The resulting model of computation appears to be intermediate in power between classical computation (P) and standard quantum computation (BQP). The model may be equivalently defined in terms of spin networks, which are an important concept in loop quantum gravity.

Suppose we are given two probability distributions on some N-element set. How many samples do we need to test whether the two distributions are close or far from each other in the L_1 norm? This problem known as Statistical Difference has been extensively studied during the last years in the field of property testing. I will describe quantum algorithms for Statistical Difference problem that provide a polynomial speed up in terms of the query complexity compared to the known classical lower bounds. Specifically, I will assume that each distribution can be generated by querying an oracle function on a random uniformly distributed input string. It will be shown that testing whether distributions are orthogonal requires approximately N^{1/2} queries classically and approximately N^{1/3} queries quantumly. Testing whether distributions are close requires approximately N^{2/3} queries classically and O(N^{1/2}) queries quantumly. This is a joint work with Aram Harrow (University of Bristol) and Avinatan Hassidim (The Hebrew University).

Recent results have shown that quantum computers can approximate the value of a tensor network efficiently. These results have initiated a search for tensor networks which contract to computationally interesting quantities. Topological Lattice Field Theories (TLFTs) are one source of such networks; when defined appropriately, networks arising from TLFTs contract to give topological invariants. In this elementary talk, we will define and classify TLFTs which lead to invariants of surfaces, and sketch out the corresponding quantum algorithm. Our exposition will be targetted at a general mathematically-inclined audience; no previous knowledge of field theories is required.

We introduce a two-body quantum Hamiltonian model of spin-1/2 on a 2D spatial lattice with exact topological degeneracy in all coupling regimes. There exists a gapped phase in which the low-energy sector reproduces an effective color code model. High energy excitations fall into three families of anyonic fermions that turn out to be strongly interacting. The model exhibits a Z_2xZ_2 gauge group symmetry and string-net integrals of motion, which are related to the existence of topological charges that are invisible to moving high-energy fermions.

Quantum operations are known to be the most general state transformations that can be applied to parts of compound systems compatibly with the probabilistic structure of quantum mechanics. What about the most general transformations of quantum operations? It turns out that any such general transformation can be realized by a quantum network with an open slot in which the input operation can be inserted, thus programming the resulting circuit. Moreover, one can recursively iterate this construction, generating an infinite hierarchy of admissible transformations and proving their realization within the circuit model of quantum mechanics. These results provide the basis of a new method to optimize quantum networks for information processing tasks, including e.g. gate estimation, discrimination, programming, and cloning. As examples of application, I will present here the optimal quantum networks for estimation of group transformations, for the alignment of reference frames with multiple communication rounds, and for universal cloning of unitary transformations.

A quantum channel models a physical process which adds noise to a quantum system by interacting with the environment. Protecting quantum systems from such noise can be viewed as an extension of the classical communication problem introduced by Shannon sixty years ago. A fundamental quantity of interest is the quantum capacity of a given channel. It measures the amount of quantum information that can be transmitted with vanishing error, in the limit of many independent transmissions over that channel. In this talk, I will show that certain pairs of channels, each with a capacity of zero, can have a strictly positive capacity when used together. This unveils a rich structure in the theory of quantum communication that is absent from Shannon\'s classical theory. This is joint work with Graeme Smith (IBM) which was published in the Sept. 26 issue of Science.

We present a method which can be used to convert certain single photon sources, such as quantum dots, into devices capable of emitting large strings of photonic cluster states in a controlled and pulsed “on demand” manner. Such sources greatly alleviate the resources required to achieve linear optical quantum computation. Standard spin errors, such as dephasing, are shown to affect only 1 or 2 of the emitted photons at a time. This allows for the use of standard fault tolerance techniques, and shows that the machine gun can be fired for arbitrarily long times. Using realistic parameters for current semiconductor quantum dot sources, we conclude high entangled-photon emission rates are achievable, with Pauli-error rates less than 0.2%.