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.
In a topological
quantum computer, universality is achieved by braiding and quantum information
is natively protected from small local errors. We address the problem of
compiling single-qubit quantum operations into braid representations for
non-abelian quasiparticles described by the Fibonacci anyon model. We develop a
probabilistically polynomial algorithm that outputs a braid pattern to
approximate a given single-qubit unitary to a desired precision. We also
classify the single-qubit unitaries that can be implemented exactly by a
Transversal
implementations of encoded unitary gates are highly desirable for
fault-tolerant quantum computation. It is known, however, that
transversal gates alone cannot be computationally universal. I will show
that the limitation on universality can be circumvented using only
fault-tolerant error correction, which is already required anyway. This
result applies to ``triorthogonal'' stabilizer codes, which were recently
introduced by Bravyi and Haah for state distillation. I will show that
We introduce two relative entropy quantities called the min- and max-relative
entropies and discuss their properties and operational meanings.
These relative entropies act as parent quantities for tasks such as data compression, information
transmission and entanglement manipulation in one-shot information theory. Moreover, they lead us to define entanglement monotones which have interesting operational interpretations.
Expressions of several information theoretic quantities involve an optimization over auxiliary quantum registers. Entanglement-assisted version of some classical communication problems provides examples of such expressions. Evaluating these expressions requires bounds on the dimension of these auxiliary registers. In the classical case such a bound can usually be obtained based on the
We
show that particle detectors, such as 2-level atoms, in non-inertial motion (or
in gravitational fields) could be used to build quantum gates for the
processing of quantum information. Concretely, we show that through
suitably chosen non-inertial trajectories of the detectors the interaction
Hamiltonian's time dependence can be modulated to yield arbitrary rotations in the
Bloch sphere due to relativistic quantum effects.
Ref. Phys.
Rev. Lett. 110, 160501 (2013)
A recent development in
information theory is the generalisation of quantum Shannon information theory
to the operationally motivated smooth entropy information theory, which
originates in quantum cryptography research. In a series of papers the first
steps have been taken towards creating a statistical mechanics based on smooth
entropy information theory. This approach turns out to allow us to answer
questions one might not have thought were possible in statistical mechanics,
I will discuss a
path-integral representation of continuum tensor networks that extends the
continuous MPS class for 1-D quantum fields to arbitrary spatial dimensions
while encoding desirable symmetries. The physical states can be interpreted as
arising through a continuous measurement process by a lower dimensional virtual
field with Lorentz symmetry. The resultant physical states naturally obey
entropy area laws, with the expectation values of observables determined by the
Entanglement distillation
transforms weakly entangled noisy states into highly entangled states, a
primitive to be used in quantum repeater schemes and other protocols designed
for quantum communication and key distribution. In this work, we present a comprehensive
framework for continuous-variable entanglement distillation schemes that
convert noisy non-Gaussian states into Gaussian ones in many iterations of the
protocol. Instances of these protocols include the recursive Gaussifier
A circuit obfuscator is an algorithm that translates
logic circuits into functionally-equivalent similarly-sized logic circuits that
are hard to understand. While ad hoc obfuscators have been implemented, theoretical
progress has mainly been limited to no-go results. In this work, we propose a
new notion of circuit obfuscation, which we call partial indistinguishability.
We then prove that, in contrast to previous definitions of obfuscation, partial
indistinguishability obfuscation can be achieved by a polynomial-time
Matrix product states and
their continuous analogues are variational classes of states that capture
quantum many-body systems or quantum fields with low entanglement; they are at
the basis of the density-matrix renormalization group method and continuous
variants thereof. In this talk we show that, generically, N-point functions of
arbitrary operators in discrete and continuous translation invariant matrix
product states are completely characterized by the corresponding two- and