log in  |  register  |  feedback?  |  help  |  web accessibility
Logo
Quantum information about unknown parameters can be compressed unboundedly without loss
David Arvidsson-Shukur - Hitachi/University of Cambridge
Wednesday, July 6, 2022, 11:00 am-12: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

Several tasks in quantum-information processing involve quantum learning. For example, quantum sensing, quantum machine learning and quantum-computer calibration involve learning and estimating unknown parameters from measurements of many copies of a quantum state that depends on those parameters. This type of metrological information is described by the quantum Fisher information matrix, which bounds the average amount of information learnt about the parameters per measurement of the state. In this talk, I will show that the quantum Fisher information about parameters encoded in N copies of the state can be compressed into M copies of a related state, where M << N. I will show that  M/N can be made arbitrarily small, and that the compression can happen without loss of information. I will also demonstrate how to construct filters that perform this unbounded and lossless information compression. Our results are not only theoretically important, but also practically. In several technologies, it is advantageous to compress information in as few states as possible, for example, to avoid detector saturation and/or to reduce post-processing costs. Our filters can reduce arbitrarily the quantum-state intensity on experimental detectors, while retaining all initial information. I will discuss our recent experimental demonstration of this. Finally, I will prove that the ability to distil quantum Fisher information is a non-classical advantage that stems from the negativity of a particular quasiprobability distribution, a quantum extension of a probability distribution.

Join Zoom Meeting

https://umd.zoom.us/j/4111099146

Meeting ID: 411 109 9146

One tap mobile

+12532158782,,4111099146# US (Tacoma)

+13017158592,,4111099146# US (Washington DC)

Dial by your location

        +1 253 215 8782 US (Tacoma)

        +1 301 715 8592 US (Washington DC)

        +1 312 626 6799 US (Chicago)

        +1 346 248 7799 US (Houston)

        +1 669 900 6833 US (San Jose)

        +1 929 436 2866 US (New York)

Meeting ID: 411 109 9146

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

Join by SIP

4111099146@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: 411 109 9146

This talk is organized by Andrea F. Svejda