Quantum Information

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.

In topological quantum computation, a quantum algorithm is performed by braiding and fusion of certain quasi-particles called anyons. Therein, the performed quantum circuit is encoded in the topology of the braid. Thus, small inaccuracies in the world-lines of the braided anyons do not adversely affect the computation. For this reason, topological quantum computation has often been regarded as error-resilient per se, with no need for quantum error-correction. However, newer work [1], [2] shows that even topological computation is plagued with (small) errors. As a consequence, it requires error-correction, too, and in the scaling limit causes a poly-logarithmic overhead similar to systems without topological error-correction. I will discuss Nussinov and Ortiz' recent result [2] that the toric code is not fault-tolerant in a Hamiltonian setting, and outline its potential implications for topological quantum computation in general. [1] Nayak, C., Simon, S. H., Stern, A. et al. Non-Abelian anyons and topological quantum computation. Rev. Mod. Phys. 80, 1083-1159 (2008). [2] Z. Nussinov and G. Ortiz, arXiv:0709.2717 (condmat)

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%.

In recent years, the analysis of boolean functions has arisen as an important theme in theoretical computer science. In this talk I will discuss an extension of the concept of a boolean function to quantum computation. It turns out that many important classical results in the theory of boolean functions have natural quantum analogues. These include property testing of boolean functions; the Goldreich-Levin algorithm for approximately learning boolean functions; and a theorem of Friedgut, Kalai and Naor on the Fourier spectra of boolean functions. The quantum generalisation of this theorem uses a quantum extension of the hypercontractive inequality of Bonami, Gross and Beckner. This talk is based on joint work with Tobias Osborne.

With the aim of proposing feasible, quantum optical realizations of quantum information protocols and minimizing the resource costs in such implementations, we will discuss various, so-called hybrid approaches. These include, for instance, schemes based upon both discrete and continuous quantum variables.

Quantum computation by single-qubit measurements was proposed by Raussendorf and Briegel [PRL 86, 5188] as a potential scheme for implementing quantum computers. It also offers an unusual means of describing unitary transformations. To better understand which measurement-based procedures perform unitary operations, we may consider the following problem: under what circumstances can a measurement-based procedure for a unitary U be found, provided a similar procedure for U which relies on post-selection? In this talk, I describe the so-called \'Measurement Pattern Interpolation\' problem, the intuition behind the solved special cases, and possible applications of a general solution to this problem.

By storing quantum information in the degenerate ground state of a Hamiltonian, it is hoped that it can be made quite robust against noise processes. We will examine this situation, with particular emphasis on the Toric code in 2D, and show how adversarial effects, either perturbations to the Hamiltonian or interactions with an environment, destroy the stored information extremely quickly.