Waseda University, Tokyo
The workshop, originally scheduled for March 30th-31st, 2020, has been postponed to a date to be determined due to the current coronavirus outbreak
Description
WQP2020 is the second workshop on quantum protocols held in Waseda University, aiming to achieve advances in quantum information and quantum computation by exploring new research dealing with (but not limited to) device independent quantum information processing, self testing, higher order quantum maps, quantum combs, verification of quantum computation, cryptographic protocols, and security criteria.
Invited speakers (in alphabetical order)
| Name | Affiliation | Title of the talk |
|---|---|---|
| Francesco Buscemi | Nagoya University | To be announced |
| Michal Hajdusek | Keio University | To be announced |
| Keiji Matsumoto | National Institute of Informatics, Tokyo | To be announced |
| Mio Murao | The University of Tokyo | To be announced |
| Marco Tulio Quintino | The University of Tokyo |
Reversing Unknown Quantum Transformations: Universal Quantum Circuit for Inverting General Unitary Operations |
| Yuki Takeuchi | NTT Communication Science Laboratories, NTT Corporation |
Several approaches to verify quantum computing devices |
| Rodney Van Meter | Keio University | To be announced |
| Naoki Yamamoto | Keio University | To be announced |
The list of invited speakers is not exhaustive and will be updated as we receive confirmations.
Program
The program is still a work in progress.
The planned duration of each invited talk is 60 minutes, including questions and answers.
Venue
Room 717, Building 14,
Waseda Campus.
Abstracts
Reversing Unknown Quantum Transformations: Universal Quantum Circuit for Inverting General Unitary Operations
Marco Tulio Quintino, The University of Tokyo
Given a quantum gate implementing a d-dimensional unitary operation, without any specific description but d, and permitted to use k times, we present a universal probabilistic heralded quantum circuit that implements the exact inverse, whose failure probability decays exponentially in k. The protocol employs an adaptive strategy, proven necessary for the exponential performance. It requires that k≥d−1, proven necessary for the exact implementation of with quantum circuits. Moreover, even when quantum circuits with indefinite causal order are allowed, k≥d−1 uses are required. We then present a finite set of linear and positive semidefinite constraints characterizing universal unitary inversion protocols and formulate a convex optimization problem whose solution is the maximum success probability for given k and d. The optimal values are computed using semidefinite programing solvers for k≤3 when d=2 and k≤2 for d=3. With this numerical approach we show for the first time that indefinite causal order circuits provide an advantage over causally ordered ones in a task involving multiple uses of the same unitary operation.
Several approaches to verify quantum computing devices
Yuki Takeuchi, NTT Communication Science Laboratories,
NTT Corporation
Verification is a task to check whether a constructed quantum device or a given quantum state is close to an ideal one or not. Due to intensive experimental effort, the size of realizable quantum computing devices becomes so large that cannot be characterized in practical time using the standard quantum tomography. Therefore, alternative efficient verification techniques are strongly desired and are considered to be inevitable for making the size of quantum computing devices larger with keeping their reliability. In this talk, I introduce several approaches for efficiently verifying quantum computing devices. I also discuss classical verifiability of universal quantum computing, i.e., whether a universal quantum computer can be classically verified in polynomial time.
Organizers
and
Please feel free to contact us for any inquiry about the workshop.
Previous workshop
by Source, Fair use.
by Irina Gelbukh – Own work, CC BY-SA 3.0.
Latest update on February 27th, 2020.