This series consists of weekly discussion sessions on foundations of quantum Theory and quantum information theory. The sessions start with an informal exposition of an interesting topic, research result or important question in the field. Everyone is strongly encouraged to participate with questions and comments.
A fully general strong converse for channel coding states that when the rate of sending classical information exceeds the capacity of a quantum channel, the probability of correctly decoding goes to zero exponentially in the number of channel uses, even when we allow code states which are entangled across several uses of the channel. Such a statement was previously only known for classical channels and the quantum identity channel.
Quantum random walks have received much interest due to their non-
intuitive dynamics, which may hold a key to radically new quantum
algorithms. What remains a major challenge is a physical realization
that is experimentally viable, readily scalable, and not limited to
specific connectivity criteria. In this seminar, I will present an
implementation scheme for quantum walking on arbitrarily complex
graphs. This scheme is particularly elegant since the walker is not
required to physically step between the nodes; only flipping coins is
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.
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.
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.
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.
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 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.
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?