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.
We use a Bayesian approach to optimally solve problems in
noisy binary search. We deal with two variants:
1. Each comparison can be erroneous with some probability 1 - p.
2. At each stage k comparisons can be performed in parallel and
a noisy answer is returned.
Roughly speaking, the more Alice is entangled with Bob, the harder it is for her to send her state to Charlie. In particular, it will be shown that the squashed entanglement, a well known entanglement measure, gives the fastest rate at which a quantum state can be sent between two parties
who share arbitrary side information. Likewise, the entanglement of
We attempt at characterizing the correlations present in the quantum computational model DQC1, introduced by Knill and Laflamme [Phys. Rev. Lett. 81, 5672 (1998)]. The model involves a collection of qubits in the completely mixed state coupled to a single control qubit that has nonzero purity. Although there is little or no entanglement between two parts of this system, it provides an exponential speedup in certain problems. On the contrary, we find that the quantum discord across the most natural split is nonzero for typical instances of the DQC1 ciruit.
A class of operations distinct to entangled states shared between more than two parties is their conversion to entangled states shared between fewer parties. The extent to which these can be achieved in the regime of local operations and classical communication provides an operational characterisation of multiparty states, for example in the \"entanglement of assistance\" and related quantities. I will give a brief overview of this topic and discuss our results showing qualitatively different behaviour when the parties receiving the final state are not chosen beforehand.
We will compare quantum phase estimation from the point of view of quantum computation and quantum metrology. In the simplest cases, the former can be simplified to a sequential (unentangled) protocol, while the latter is parallel (entangled). We show that both protocols can be formally related with circuit identities and that they respond in exactly the same way to decoherence. We present sequential protocols for optimal estimation and frame synchronization in DQC1. Finally, we introduce new estimation protocols based on nonlinear Hamiltonians.
Renner\'s global quantum de Finetti theorem establishes that if the state of a quantum system is invariant under permutations of its systems, then almost all of its subsystems are almost in the same state and independent of each other. Motivated by this result, we show that the most straightforward classical analogue of Renner\'s theorem is false.
Joint work with Matthias Christandl (Cambridge).
The one clean qubit model is a model of quantum computation in which all but one qubit starts in the maximally mixed state. One clean qubit computers are believed to be strictly weaker than standard quantum computers, but still capable of solving some classically intractable problems. I\'ll discuss my recent work in collaboration with Peter Shor which shows that evaluating a certain approximation to the Jones polynomial at a fifth root of unity for the trace closure of a braid is a complete problem for the one clean qubit complexity class.
We give a convenient representation for any map which is covariant with respect to an irreducible representation of SU(2), and use this representation to analyze the evolution of a quantum directional reference frame when it is exploited as a resource for performing quantum operations.
Entanglement plays a fundamental role in quantum information
processing and is regarded as a valuable, fungible resource,
The practical ability to transform (or manipulate) entanglement from one form to another is useful for many applications.
Usually one considers entanglement manipulation of states which are multiple copies of a given bipartite entangled state and requires that the fidelity of the transformation to (or from) multiple copies of
a maximally entangled state approaches unity asymptotically in the
It is known that finite fields with d elements exist only when d is a prime or a prime power.
When the dimension d of a finite dimensional Hilbert space is a prime power, we can associate to each basis state of the Hilbert space an element of a finite or Galois field, and construct a finite group of unitary transformations, the generalised Pauli group or discrete Heisenberg-Weyl group. Its elements can be expressed, in terms of the elements of a Galois field.
This group presents numerous