Personal tools
You are here: Home Events QUISCO - July 27, IF-4.31/4.33

QUISCO - July 27, IF-4.31/4.33

The next QUISCO meeting will be held on July 27 at the School of Informatics, Room 4.31/4.33. Please find the schedule below.

When Jul 27, 2011
from 09:30 AM to 05:30 PM
Where IF 4.31+4.33, Informatics Forum
Contact Name
Add event to calendar vCal

QUISCO meeting

Edinburgh - School of Informatics


9:30 - 10  Welcoming Coffee

10 - 11 Eleni Diamanti (CNRS - Télécom ParisTech)
Practical quantum coin flipping

11 - 12 Damian Markham (CNRS - Télécom ParisTech)
Entanglement and Flow and what they say about universality and simulateability of Quantum Computation.

12 - 2 Lunch Break

2 - 3:30 Zizhu Wang (CNRS - Télécom ParisTech)
N-party Hardy proofs for symmetric states

3:30 - 4 Simon Gay (University of Glasgow)
A brief introduction to Quantum Formal Methods, Process Calculus, Model-checking

4 - 4:30 Coffee Break

4:30 - 5:30 Miles Padgett(University of Glasgow)

Talks Abstract

Title: Practical quantum coin flipping
Abstract: Coin flipping is a fundamental cryptographic primitive with numerous applications. In this talk we show that quantum coin flipping with security guarantees that are strictly better than in any classical protocol is possible to implement with current technology. In particular, our protocol can tolerate both losses and noise in the communication channel and the detection system, and takes into account common experimental practices such as the use of attenuated laser sources. Under these conditions, we show that a quantum advantage can be achieved for a channel length of up to 21 km. Quantum coin flipping joins in this way quantum key distribution as a powerful and easily implementable application of quantum information processing. Work towards the experimental implementation of this protocol is underway in our lab. In addition to this work, we will also briefly present other experimental activities of the Quantum Information Group in Telecom ParisTech.

Titel: Entanglement and Flow and what they say about universality and
simulateability of Quantum Computation.

Abstract: Flow is a sufficient condition for a graph state to facilitate a unitary computation across it in the measurement based model. We relate this to known and presented entanglement conditions for a graph state to be a universal resource for measurement based quantum computation, and the ability to simulate any computation on it (again in the measurement based model). We then present new conditions based on the Flow structure. We further discuss the relation to similar conditions in the circuit model through a known translation between the two. Joint work with Elham Kashefi.

Title: N-party Hardy proofs for symmetric states

Abstract: Nonlocality tests in quantum mechanics range from expectation value based CHSH test to the all-versus-nothing Mermin test. In between these two extremities lie the almost probability-free Hardy test. In the original Hardy test, the nonlocality manifests as a paradox when some suitably chosen local projective measurements are made on almost any bipartite entangled state. In Hardy's words, the test works because of "a certain lack of symmetry". We extended this result to n-party permutation symmetric states by exploiting both the original symmetry and the remaining symmetry the system has when part of the system has been measured. In addition to the Hardy test, we also have a CH-type inequality that can potentially be violated experimentally. Joint work with Damian Markham.


Document Actions