The workshop on Quantum Information, Computation, and Foundation 2020 (QICF20) will focus on device independent quantum information processing, quantum designs, the geometry of the state space, foundations of quantum theory, quantum communication, quantum computing, quantum computational complexity, quantum cryptography, and other related topics.

Registration form (registration is free)

Name | Affiliation | Title of the talk |
---|---|---|

Antonio Acin | ICFO Barcelona, Spain | To be announced |

Gorjan Alagic | University of Maryland and NIST, U.S.A. | To be announced |

Alessandro Bisio | University of Pavia, Italy | To be announced |

Sarah Brandsen | Duke University, U.S.A. | To be announced |

Francesco Buscemi | Nagoya University, Japan | To be announced |

Anne Broadbent | University of Ottawa, Canada | Quantum encryption schemes for uncloneability and certified deletion |

Andrea Coladangelo | UC Berkeley, U.S.A. | To be announced |

Giacomo Mauro D'Ariano | University of Pavia, Italy | To be announced |

Nilanjana Datta | University of Cambridge, U.K. | To be announced |

Vedran Dunjko | Leiden University, The Netherlands | To be announced |

Jens Eisert | Free University of Berlin, Germany | To be announced |

Alex B. Grilo | CWI and QuSoft, Amsterdam, The Netherlands | To be announced |

Takeshi Koshiba | Waseda University, Japan | To be announced |

Atul Mantri | University of Maryland, U.S.A. | To be announced |

Paolo Perinotti | University of Pavia, Italy | To be announced |

Robert Raussendorf | University of British Columbia, Canada | To be announced |

Valerio Scarani | National University of Singapore | Absolutely entangled sets of states |

Or Sattath | Ben-Gurion University, Israel | To be announced |

Omri Shmueli | Tel Aviv University, Israel | Multi-theorem (Malicious) Designated-Verifier NIZK for QMA |

Anna Szymusiak | Jagiellonian University, Poland | To be announced |

Alessandro Tosini | University of Pavia, Italy | To be announced |

Henry Yuen | University of Toronto, Canada | Quantum Garbled Circuits |

Karol Zyckowski | Jagiellonian University, Poland | To be announced |

Calgary | UTC | CET | Singapore | Japan | Monday 14/09 | Tuesday 15/09 | Wednesday 16/09 | Thursday 17/09 | Friday 18/09 |
---|---|---|---|---|---|---|---|---|---|

: - : | : - : | : - : | : - : | 10:00 - 11:00 | Yuen | Alagic | Raussendorf | Coladangelo | Talk |

: - : | : - : | : - : | : - : | 11:00 - 12:00 | Talk | Mantri | Broadbent | Talk | Talk |

00:00 - 01:00 | 07:00 - 08:00 | 08:00 - 09:00 | 14:00 - 15:00 | 15:00 - 16:00 | Eisert | Grilo | Sattath | Shmueli | Dunjko |

01:00 - 02:00 | 08:00 - 09:00 | 09:00 - 10:00 | 15:00 - 16:00 | 16:00 - 17:00 | Talk | Talk | Talk | Talk | Talk |

02:00 - 03:00 | 09:00 - 10:00 | 10:00 - 11:00 | 16:00 - 17:00 | 17:00 - 18:00 | Talk | Talk | Talk | Talk | Talk |

03:00 - 04:00 | 10:00 - 11:00 | 11:00 - 12:00 | 17:00 - 18:00 | 18:00 - 19:00 | Talk | Talk | Talk | Talk | Talk |

Michele Dall'Arno and Tomoyuki Morimae. Please feel free to contact us for any inquiry about the workshop.

Valerio Scarani, National University of Singapore

The notion of entanglement of quantum states is usually defined with respect to a fixed bipartition. Indeed, a global basis change can always map an entangled state to a separable one. The situation is however different when considering a set of states. We define the notion of an "absolutely entangled set" of quantum states, in which for any possible choice of global basis, at least one of the states in the set is entangled. I'll discuss the physical relevance of the notion and present several examples. Joint work with Pooja Jayachandran, Baichu Yu (NUS), Yu Cai, Jean-Daniel Bancal, Nicolas Brunner (University of Geneva). Reference: https://arxiv.org/abs/2006.07165

Henry Yuen, University of Toronto

Yao's garbled circuits is the central example of a cryptographic primitive known as randomized encodings, in which a function f and input x can be encoded in such a way that only the value f(x) can be recovered, but nothing else about the function f or x can be learned. Garbled circuits (and randomized encodings more generally) have had numerous applications to secure multiparty computation, obfuscation, zero knowledge protocols, parallel cryptography, complexity theory, and more. In this talk I will introduce the notion of quantum randomized encodings, and will present an instantiation with a quantum analogue of Yao's garbled circuits. Time permitting I will discuss applications of quantum garbled circuits/randomized encodings to secure quantum multiparty computation and obfuscation of quantum circuits. Joint work with Zvika Brakerski (https://arxiv.org/abs/2006.01085).

The logo of Kyoto University by Source, Fair use. The logo of the Yukawa Institute for Theoretical Physics.

Latest update on July 13, 2020.