QAP SP5 Theory Serge Massar Publications for Year 1 – 115+ submitted/published (more than half of QAP output) – 11+ in PRL FOCS STOCS – 1 Review in Progress.

Slides:

Advertisements

Similar presentations

Optimal Space Lower Bounds for All Frequency Moments David Woodruff MIT

Advertisements

Quantum Lower Bounds The Polynomial and Adversary Methods Scott Aaronson September 14, 2001 Prelim Exam Talk.

Scott Aaronson (MIT) Based on joint work with John Watrous (U. Waterloo) BQP PSPACE Quantum Computing With Closed Timelike Curves.

The Average Case Complexity of Counting Distinct Elements David Woodruff IBM Almaden.

Noise-Predictive Turbo Equalization for Partial Response Channels Sharon Aviran, Paul H. Siegel and Jack K. Wolf Department of Electrical and Computer.

Robust device independent randomness amplification with few devices F.G.S.L Brandao 1, R. Ramanathan 2 A. Grudka 3, K. 4, M. 5,P. 6 Horodeccy 1 Department.

QCRYPT 2011, Zurich, September 2011 Lluis Masanes 1, Stefano Pironio 2 and Antonio Acín 1,3 1 ICFO-Institut de Ciencies Fotoniques, Barcelona 2 Université.

Shadow Prices vs. Vickrey Prices in Multipath Routing Parthasarathy Ramanujam, Zongpeng Li and Lisa Higham University of Calgary Presented by Ajay Gopinathan.

Tony Short University of Cambridge (with Sabri Al-Safi – PRA 84, (2011))

Routing and Congestion Problems in General Networks Presented by Jun Zou CAS 744.

Efficient Discrete-Time Simulations of Continuous- Time Quantum Query Algorithms QIP 2009 January 14, 2009 Santa Fe, NM Rolando D. Somma Joint work with.

P LAYING ( QUANTUM ) GAMES WITH OPERATOR SPACES David Pérez-García Universidad Complutense de Madrid Bilbao 8-Oct-2011.

Prof. D. Zhou UT Dallas Analog Circuits Design Automation 1.

On Systems with Limited Communication PhD Thesis Defense Jian Zou May 6, 2004.

On the tightness of Buhrman- Cleve-Wigderson simulation Shengyu Zhang The Chinese University of Hong Kong On the relation between decision tree complexity.

Avraham Ben-Aroya (Tel Aviv University) Oded Regev (Tel Aviv University) Ronald de Wolf (CWI, Amsterdam) A Hypercontractive Inequality for Matrix-Valued.

Quantum Algorithms II Andrew C. Yao Tsinghua University & Chinese U. of Hong Kong.

Xiaohua (Edward) Li1 and E. Paul Ratazzi2

Laurent Itti: CS599 – Computational Architectures in Biological Vision, USC Lecture 7: Coding and Representation 1 Computational Architectures in.

Depth-Bounded Communication Complexity for Distributed Computation Student: Jie-Hong Jiang Mentor: Prof. Robert Brayton EE249 Class Project 12/3/2002.

EECS 598 Fall ’01 Quantum Cryptography Presentation By George Mathew.

International Technology Alliance In Network & Information Sciences International Technology Alliance In Network & Information Sciences 1 Cooperative Wireless.

Subproject 3 Large Scale Optimization Participants CTI, CUNI, MPII, RWTH, TU Wroclaw, UCY, UPB presented by Burkhard Monien (UPB)

Rate-distortion Theory for Secrecy Systems

1 Introduction to Quantum Information Processing QIC 710 / CS 667 / PH 767 / CO 681 / AM 871 Richard Cleve DC 2117 Lecture 16 (2011)

New quantum lower bound method, with applications to direct product theorems Andris Ambainis, U. Waterloo Robert Spalek, CWI, Amsterdam Ronald de Wolf,

Feynman Festival, Olomouc, June 2009 Antonio Acín N. Brunner, N. Gisin, Ll. Masanes, S. Massar, M. Navascués, S. Pironio, V. Scarani Quantum correlations.

Preserving Link Privacy in Social Network Based Systems Prateek Mittal University of California, Berkeley Charalampos Papamanthou.

Paraty, Quantum Information School, August 2007 Antonio Acín ICFO-Institut de Ciències Fotòniques (Barcelona) Quantum Cryptography (III)

University of Colorado Denver Department of Mathematical and Statistical Sciences Graduate program in Applied Mathematics Applications Continuous models:

Channel Capacity

Network of Excellence in Internet Science Network of Excellence in Internet Science (EINS) 1 st REVIEW Brussels, 12th April 2013 FP7-ICT

QCCC07, Aschau, October 2007 Miguel Navascués Stefano Pironio Antonio Acín ICFO-Institut de Ciències Fotòniques (Barcelona) Cryptographic properties of.

Experimental generation and characterisation of private states Paweł Horodecki Wydział Fizyki Technicznej i Matematyki Stosowanej, Politechnika Gdańska.

Communication Complexity Rahul Jain Centre for Quantum Technologies and Department of Computer Science National University of Singapore. TexPoint fonts.

Ali Al-Saihati ID# Ghassan Linjawi

1 A Randomized Space-Time Transmission Scheme for Secret-Key Agreement Xiaohua (Edward) Li 1, Mo Chen 1 and E. Paul Ratazzi 2 1 Department of Electrical.

Summary of Distributed Computing Security Yifeng Zou Georgia State University

1 Some Results in Interval Routing Francis C.M. Lau HKU and ITCS Tsinghua December 2, 2007.

DISTRIBUTED CRYPTOSYSTEMS Moti Yung. Distributed Trust-- traditionally  Secret sharing: –Linear sharing over a group (Sum sharing) gives n out of n sharing.

A limit on nonlocality in any world in which communication complexity is not trivial IFT6195 Alain Tapp.

Submissions Stats 119 submissions – Paris ‘09: 113 (deadline after STOC) Prague '06: 87 Aarhus '03: 65 Florence '00: junk submissions 34 papers accepted.

-Arnaud Doucet, Nando de Freitas et al, UAI

Black-box Tomography Valerio Scarani Centre for Quantum Technologies & Dept of Physics National University of Singapore.

A Passive Approach to Sensor Network Localization Rahul Biswas and Sebastian Thrun International Conference on Intelligent Robots and Systems 2004 Presented.

1 Content IP-SECOQC – Consortium, Funding What is Quantum Cryptography? Project Goals / Project Structure Standard Related Issues: –In Quantum Key Distribution.

The Classically Enhanced Father Protocol

Information Complexity: an Overview Rotem Oshman, Princeton CCI Based on work by Braverman, Barak, Chen, Rao, and others Charles River Science of Information.

Recent Progress in Many-Body Theories Barcelona, 20 July 2007 Antonio Acín 1,2 J. Ignacio Cirac 3 Maciej Lewenstein 1,2 1 ICFO-Institut de Ciències Fotòniques.

Optimal Trading of Classical Communication, Quantum Communication, and Entanglement Mark M. Wilde arXiv: ERATO-SORST Min-Hsiu Hsieh 4 th Workshop.

Of 22 10/07/2015UMass: Uncertain Communication1 Communication Amid Uncertainty Madhu Sudan Microsoft Research Based on Juba, S. (STOC 2008, ITCS 2011)

Of 22 10/30/2015WUSTL: Uncertain Communication1 Communication Amid Uncertainty Madhu Sudan Harvard Based on Juba, S. (STOC 2008, ITCS 2011) Juba, S. (STOC.

Institute for Quantum Computing Raymond Laflamme Director Mike Mosca Deputy Director

Coherent Classical Communication Aram Harrow, MIT Quantum Computing Graduate Research Fellow Objective Objective ApproachStatus Determine.

The Institute for Quantum Computing Why Quantum Information? Improving the capacity of information processing devices: Moore’s law Taking.

Quantum Cryptography Antonio Acín

Quantum Computation Stephen Jordan. Church-Turing Thesis ● Weak Form: Anything we would regard as “computable” can be computed by a Turing machine. ●

Secret keys and random numbers from quantum non locality Serge Massar.

1 Introduction to Quantum Information Processing CS 467 / CS 667 Phys 467 / Phys 767 C&O 481 / C&O 681 Richard Cleve DC 3524 Course.

Information Complexity Lower Bounds

Sampling of min-entropy relative to quantum knowledge Robert König in collaboration with Renato Renner TexPoint fonts used in EMF. Read the TexPoint.

Information primitives and laws of nature Mai 2008 Alain Tapp

Effcient quantum protocols for XOR functions

CV Cryptography Using a Bidirectional Quantum Channel

Approximate Fully Connected Neural Network Generation

Numerical Algorithms Quiz questions

On Parallel and Concurrent Security of HB and HB+

Bayesian Deep Learning on a Quantum Computer

Towards Neuromorphic Complexity Analysis

Presentation transcript:

QAP SP5 Theory Serge Massar Publications for Year 1 – 115+ submitted/published (more than half of QAP output) – 11+ in PRL FOCS STOCS – 1 Review in Progress in Optics – 1 Vulgarisation in La Recherche Meetings –Poincaré Semester (Paris) –QIP Conference (Paris) –QAP&RESQ meeting (Paris) –Quantum Process Estimation Workshop (Budmerice)

QAP SP5 Theory Serge Massar Meetings –Poincaré Semester (Paris) –QIP Conference (Paris) –QAP&RESQ meeting (Paris) –Quantum Process Estimation Workshop (Budmerice) Proposals for next year ?

WP5.1 Algorithms and Complexity new version of the adversary method for quantum lower bounds, use it to prove new quantum direct-product theorems and time-space tradeoffs. (Ambainis, Spalek, de Wolf) Y1: Milestones & Deliverables √ Y2: New Milestones & Deliverables √

WP5.1 Algorithms and Complexity new version of the adversary method for quantum lower bounds, use it to prove new quantum direct-product theorems and time-space tradeoffs. (Ambainis, Spalek, de Wolf) Y1: Milestones & Deliverables √ Y2: New Milestones & Deliverables √

WP5.2 Algorithmic Methods Better understanding of the ability of quantum circuits to withstand noise (Buhrman, Cleve, Laurent, Linden, Schrijver, Unger) Y1: Milestones & Deliverables √ Y2: New Milestones & Deliverables √

WP5.2 Algorithmic Methods Better understanding of the ability of quantum circuits to withstand noise (Buhrman, Cleve, Laurent, Linden, Schrijver, Unger) Y1: Milestones & Deliverables √ Y2: New Milestones & Deliverables √

WP5.3 Protocols for Quantum Commerce Ensemble of work on Quantum Key Distribution (QKD) schemes whose security is ensured by causality, hence independent of the devices Y1: M & D √ Y2: New M & D √

WP5.3 Protocols for Quantum Commerce Ensemble of work on Quantum Key Distribution (QKD) schemes whose security is ensured by causality, hence independent of the devices Y1: M & D √ Y2: New M & D √

WP5.4 Toolbox for quantum multi- user protocols basic building blocks of information theory (negative, prior, partial, and co-mutual information) (M. Horodecki, J. Oppenheim, A. Winter ) The first study (already almost complete) of quantum communication in networks (D. Leung, J. Oppenheim, A. Winter) An ensemble of works on classical simulation of quantum devices

Y1: Milestones & Deliverables NO –D partially achieved –M5.4.1 partially achieved –M5.4.2: Mistery Milestone Find optimal ways of processing established quantum correlations using statistical technique Y2: New Milestones & Deliverables OK

Y1: Milestones & Deliverables NO –D partially achieved –M5.4.1 partially achieved –M5.4.2: Mistery Milestone Find optimal ways of processing established quantum correlations using statistical technique Y2: New Milestones & Deliverables OK

WP5.5 Architectures Towards assessing the ultimate limits of linear optics quantum computing (K. Kieling, D. Gross, J. Eisert) Y1: Milestones & Deliverables √ Y2: New Milestones & Deliverables √

WP5.5 Architectures Towards assessing the ultimate limits of linear optics quantum computing (K. Kieling, D. Gross, J. Eisert) Y1: Milestones & Deliverables √ Y2: New Milestones & Deliverables √

WP5.6 Testing Quantum Systems Optimal method for estimating an unknown density matrix using separable measurements (E. Bagan, M. A. Ballester, R. D. Gill, R. Munoz-Tapia, O. Romero-Isart ) Y1: Milestones & Deliverables √ Y2: New Milestones & Deliverables √

WP5.6 Testing Quantum Systems Optimal method for estimating an unknown density matrix using separable measurements (E. Bagan, M. A. Ballester, R. D. Gill, R. Munoz-Tapia, O. Romero-Isart ) Y1: Milestones & Deliverables √ Y2: New Milestones & Deliverables √

Thanks to Oded Regev, Toni Acin, Konrad Banaszek, Mario Ziman

Thanks to Oded Regev, Toni Acin, Konrad Banaszek, Mario Ziman and