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 should like to show how particular mathematical properties can limit our metaphysical choices, by discussing old and new theorems within the statistical-model framework of Mielnik, Foulis & Randall, and Holevo, and what these theorems have to say about possible metaphysical models of quantum mechanics.
The \\\"frequency comb\\\" defined by the eigenmodes of an optical resonator is a naturally large set of exquisitely well defined quantum systems, such as in the broadband mode-locked lasers which have redefined time/frequency metrology and ultra precise measurements in recent years. High coherence can therefore be expected in the quantum version of the frequency comb, in which nonlinear interactions couple different cavity modes, as can be modeled by different forms of graph states.
We construct a simple translationally invariant, nearest-neighbor Hamiltonian on a chain of 10-dimensional qudits that makes it possible to realize universal quantum computing without any external control during the computational process, requiring only initial product state preparation. Both the quantum circuit and its input are encoded in an initial canonical basis state of the qudit chain. The computational process is then carried out by the autonomous Hamiltonian time evolution.
The renormalization group (RG) is one of the conceptual pillars of statistical mechanics and quantum field theory, and a key theoretical element in the modern formulation of critical phenomena and phase transitions. RG transformations are also the basis of numerical approaches to the study of low energy properties and emergent phenomena in quantum many-body systems. In this colloquium I will introduce the notion of \\\"entanglement renormalization\\\" and use it to define a coarse-graining transformation for quantum systems on a lattice [G.Vidal, Phys. Rev. Lett.
In this talk, we will investigate the distinguishability of quantum operations from both discrete and continuous point of view. In the discrete case, the main topic is how we can identify quantum measurement apparatuses by considering the patterns of measurement outcomes. In the continuous case, we will focus on the efficiency of parameter estimation of quantum operations. We will discuss several methods that can achieve Heisenberg Limit and prove in some other cases the impossibility of breaking the Standard Quantum Limit.
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.
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.