log in  |  register  |  feedback?  |  help  |  web accessibility
Logo
Verification with Minimal Overhead, and Public Verification of Quantum Computation
Dominik Leichtle - Sorbonne University
ATL 3100A and Virtual Via Zoom: https://umd.zoom.us/j/98741240626?pwd=QjhQNkI4WSt5S3Z0Rll2RHpJYjl4UT09 Meeting ID: 987 4124 0626 Passcode: 035986
Tuesday, November 30, 2021, 1:00-2:00 pm Calendar
  • You are subscribed to this talk through .
  • You are watching this talk through .
  • You are subscribed to this talk. (unsubscribe, watch)
  • You are watching this talk. (unwatch, subscribe)
  • You are not subscribed to this talk. (watch, subscribe)
Abstract

With the development of delegated quantum computation, clients will want to ensure confidentiality of their data and algorithms, and the integrity of their computations. In this talk, I present recent work on two directions of research related to blind and verified quantum computing.

While protocols for blind and verifiable quantum computation exist, they suffer from high overheads and from over-sensitivity: When running on noisy devices, imperfections trigger the same detection mechanisms as malicious attacks, resulting in perpetually aborted computations. We introduce the first blind and verifiable protocol for delegating BQP computations to a powerful server with repetitions as the only overhead. It is composable and statistically secure with exponentially low bounds and can tolerate a constant amount of global noise.

Existing protocols for verified quantum computing fall short of resolving conflicts between client and server from a third party’s perspective. In case the client rejects the outcome of a delegated computation on the basis of failed verification, a third party will generally not be able to tell whether the abort of the protocol has been triggered by deviations by the client or by the server. We propose a new cryptographic protocol that provides the same security guarantees as other blind verification protocols, while additionally resolving this conflict.

https://umd.zoom.us/j/98741240626?pwd=QjhQNkI4WSt5S3Z0Rll2RHpJYjl4UT09

Meeting ID: 987 4124 0626

Passcode: 035986

One tap mobile

+19294362866,,98741240626# US (New York)

+13017158592,,98741240626# US (Washington DC)

Dial by your location

        +1 929 436 2866 US (New York)

        +1 301 715 8592 US (Washington DC)

        +1 312 626 6799 US (Chicago)

        +1 669 900 6833 US (San Jose)

        +1 253 215 8782 US (Tacoma)

        +1 346 248 7799 US (Houston)

Meeting ID: 987 4124 0626

Find your local number: https://umd.zoom.us/u/adsUSOKNiq

Join by SIP

98741240626@zoomcrc.com

Join by H.323

162.255.37.11 (US West)

162.255.36.11 (US East)

115.114.131.7 (India Mumbai)

115.114.115.7 (India Hyderabad)

213.19.144.110 (Amsterdam Netherlands)

213.244.140.110 (Germany)

103.122.166.55 (Australia Sydney)

103.122.167.55 (Australia Melbourne)

149.137.40.110 (Singapore)

64.211.144.160 (Brazil)

149.137.68.253 (Mexico)

69.174.57.160 (Canada Toronto)

65.39.152.160 (Canada Vancouver)

207.226.132.110 (Japan Tokyo)

149.137.24.110 (Japan Osaka)

Meeting ID: 987 4124 0626

Passcode: 035986

This talk is organized by Andrea F. Svejda