Thursday, March 2, 2017

Thursday, March 2, 2017 — 12:00 to 12:00 PM EST

Expected communication cost of distributed quantum tasks

Penghui Yao, University of Maryland, Baltimore

Data compression is a fundamental problem in quantum and classical information theory. A typical version of the problem is that the sender Alice receives a classical or quantum) state from some known ensemble and needs to transmit it to the receiver Bob with average error below some specified bound. We consider the case in which the message can have a variable length and goal is to minimise its expected length. For the classical case, this problem has a well-known solution given by the Huffman coding.

Thursday, March 2, 2017 — 1:30 PM EST

Harnessing quantum systems with long-range interactions

Zhexuan Gong, University of Maryland, College Park

A distinctive feature of atomic, molecular, and optical systems is that interactions between particles are often long-ranged. Together with control techniques from quantum optics, these long-range interacting systems could be harnessed to achieve faster quantum information processing and to simulate novel quantum many-body phenomena. A

S M T W T F S
26
27
28
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
1
  1. 2021 (15)
    1. August (1)
    2. April (1)
    3. March (3)
    4. February (4)
    5. January (6)
  2. 2020 (31)
    1. December (2)
    2. November (5)
    3. October (4)
    4. September (3)
    5. August (2)
    6. June (4)
    7. April (1)
    8. March (3)
    9. February (5)
    10. January (2)
  3. 2019 (139)
  4. 2018 (142)
  5. 2017 (131)
    1. December (11)
    2. November (7)
    3. October (11)
    4. September (13)
    5. August (10)
    6. July (8)
    7. June (12)
    8. May (9)
    9. April (13)
    10. March (13)
    11. February (18)
    12. January (7)
  6. 2016 (88)
  7. 2015 (82)
  8. 2014 (94)
  9. 2013 (91)
  10. 2012 (122)
  11. 2011 (117)
  12. 2010 (41)
  13. 2009 (4)
  14. 2008 (1)
  15. 2005 (1)
  16. 2004 (3)