Download presentation

Presentation is loading. Please wait.

Published byMalachi Durrance Modified over 2 years ago

1
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)

2
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 ?

3
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 √

4
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 √

5
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 √

6
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 √

7
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 √

8
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 √

9
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

10
Y1: Milestones & Deliverables NO –D.5.4.1 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

11
Y1: Milestones & Deliverables NO –D.5.4.1 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

12
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 √

13
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 √

14
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 √

15
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 √

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

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

Similar presentations

OK

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

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

© 2017 SlidePlayer.com Inc.

All rights reserved.

Ads by Google

Ppt on glorious past of india Ppt on advancement in science and technology Ppt on 10 sikh gurus sikhism Ppt on mirror link Ppt on world war 1 Ppt on simple distillation and fractional distillation Ppt on pay per click Ppt on magnets and electromagnets Ppt on suspension type insulators definition Ppt on tata trucks new