log in  |  register  |  feedback?  |  help  |  web accessibility
Logo
Limitations of optimization algorithms on noisy quantum devices
Daniel Stilck França - University of Copenhagen
Virtual Via Zoom: https://umd.zoom.us/j/9893676372?pwd=VVNOd2xNZ3FCblk4aFdTMjkzTllvQT09
Wednesday, February 24, 2021, 11:00 am-12:15 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

Recent technological developments have focused the interest of the quantum computing community on investigating how near-term devices could outperform classical computers for practical applications. A central question that remains open is whether their noise can be overcome or it fundamentally restricts any potential quantum advantage. We present a transparent way of comparing classical algorithms to quantum ones running on near-term quantum devices for a large family of problems that include optimization problems and approximations to the ground state energy of Hamiltonians. Our approach is based on the combination of entropic inequalities that determine how fast the quantum computation state converges to the fixed point of the noise model, together with established classical methods of Gibbs state sampling. The approach is extremely versatile and allows for its application to a large variety of problems, noise models and quantum computing architectures. We use our results to provide estimates for a variety of problems and architectures that have been the focus of recent experiments, such as quantum annealers, variational quantum eigensolvers, and quantum approximate optimization. The bounds we obtain indicate that substantial quantum advantages are unlikely for classical optimization unless the current noise rates are decreased by orders of magnitude or the topology of the problem matches that of the device. This is the case even if the number of qubits increases substantially. We reach similar but less stringent conclusions for quantum Hamiltonian problems.

Join Zoom Meeting

https://umd.zoom.us/j/9893676372?pwd=VVNOd2xNZ3FCblk4aFdTMjkzTllvQT09

Meeting ID: 989 367 6372

Passcode: abc123

One tap mobile

+13017158592,,9893676372# US (Washington DC)

+13126266799,,9893676372# US (Chicago)

Dial by your location

        +1 301 715 8592 US (Washington DC)

        +1 312 626 6799 US (Chicago)

        +1 929 436 2866 US (New York)

        +1 253 215 8782 US (Tacoma)

        +1 346 248 7799 US (Houston)

        +1 669 900 6833 US (San Jose)

Meeting ID: 989 367 6372

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

Join by SIP

9893676372@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)

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: 989 367 6372

Passcode: 578842

This talk is organized by Andrea F. Svejda