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.
I will discuss two
generalizations of Kochen-Specker (KS) sets: projective KS sets and generalized
KS sets. We will see that projective KS sets can be used to characterize all
graphs for which the chromatic number is strictly larger than the quantum
chromatic number. Here, the quantum chromatic number is defined via a nonlocal
game based on graph coloring. We will further show that from any graph with
separation between these two quantities, one can construct a classical channel
We discuss the extension of the smooth entropy formalism to arbitrary physical systems with no bound on the number of degrees of freedom, comparing them with already existing notions of entropy for infinite-dimensional systems.
When two independent analog signals, $X$ and $Y$ are added together giving $Z=X+Y$, the entropy of $Z$, $H(Z)$, is not a simple function of the entropies $H(X)$ and $H(Y)$, but rather depends on the details of $X$ and $Y$'s distributions. Nevertheless, the entropy power inequality (EPI), which states that $e^{2H(Z)} \geq e^{2H(X)} + e^{2H(Y)}$, gives a very tight restriction on the entropy of $Z$.
Joint work with Earl Campbell (FU-Berlin) and Hussain Anwar (UCL) Magic state distillation is a key component of some high-threshold schemes for fault-tolerant quantum computation [1], [2]. Proposed by Bravyi and Kitaev [3] (and implicitly by Knill [4]), and improved by Reichardt [4], Magic State Distillation is a method to broaden the vocabulary of a fault-tolerant computational model, from a limited set of gates (e.g.
We study the problem of reconstructing an unknown matrix M, of rank r and dimension d, using O(rd poly log d) Pauli measurements. This has applications to compressed sensing methods for quantum state tomography. We give a solution to this problem based on the restricted isometry property (RIP), which improves on previous results using dual certificates. In particular, we show that almost all sets of O(rd log^6 d) Pauli measurements satisfy the rank-r RIP.
Abstract The magic state model of quantum computation gives a recipe for universal quantum computation using perfect Clifford operations and repeat preparations of a noisy ancilla state. It is an open problem to determine which ancilla states enable universal quantum computation in this model. Here we show that for systems of odd dimension a necessary condition for a state to enable universal quantum computation is that it have negative representation in a particular quasi-probability representation which is a discrete analogue to the Wigner function.
I will first present a theorem based on the Decoupling Theorem of [1] which gives sufficient and necessary conditions for a quantum channel (CPTPM) being such that it yields the same output for almost all possible inputs. This theorem allows us to reproduce and generalize results oft [2,3], in which cornerstones of statistical physics are derived from first principles of quantum mechanics, in a very natural and easy way. Specifically, we express them in a way which allows to apply results about random 2-qubit interactions [4].
We provide a microscopic understanding of the nucleation of topological quantum liquids that arise due to interactions between non-Abelian anyons. With the pairwise anyon interactions typically showing RKKY-type oscillations in sign, but decaying exponentially with distance, we show that the character of the nucleated phase is fully determined by anyon interactions beyond nearest neighbor exchange. We investigate this issue in the context of Kitaev's honeycomb lattice model.
We construct a class of entangled supersymmetric states which is used as a non-local resource in the CHSH game. This class of super entangled states is more non-local then maximally entangled states if the supersymmetric degrees of freedom are accessible to measurement.
Consequently, we show that the winning probability for the CHSH game is greater than cos2(pi/8) corresponding to an expected value greater than Tsirelson's bound.