BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Drupal iCal API//EN
X-WR-CALNAME:Events items teaser
X-WR-TIMEZONE:America/Toronto
BEGIN:VTIMEZONE
TZID:America/Toronto
X-LIC-LOCATION:America/Toronto
BEGIN:DAYLIGHT
TZNAME:EDT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
DTSTART:20230312T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20221106T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:683afef31eb65
DTSTART;TZID=America/Toronto:20231016T150000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20231016T160000
URL:/institute-for-quantum-computing/events/fully-quant
 um-learning-comparison-unknown-unitary-channels
SUMMARY:Fully-quantum learning: Comparison of unknown unitary channels with
 \nmultiple uses
CLASS:PUBLIC
DESCRIPTION:Summary \n\nIQC COLLOQUIUM - MIO MURAO\, THE UNIVERSITY OF TOKY
 O\n\nQuantum Nano Centre (QNC) Room 0101 200 University Ave West\, Waterlo
 o\nOntario\n\nPlease note start time 3:00 PM\n\nEfficiently learning prope
 rties of unknown quantum objects is a\nfundamental task in quantum mechani
 cs and quantum information. When\nthere are two unknown quantum objects\, 
 and if we want to learn just\nthe relationship between the objects\, a met
 hod to directly compare the\ntwo objects without identifying their descrip
 tions is preferable\,\nespecially when the number of available copies of e
 ach target object\nis limited. In this work\, we investigate the compariso
 n of unknown\nunitary channels with multiple uses of the unitary channels 
 based on\nthe quantum tester formalism.  We obtain the optimal minimum-er
 ror\nstrategy and the optimal unambiguous strategy of unitary comparison o
 f\ntwo unknown d-dimensional unitary channels when the number of uses of\n
 the channels satisfies a certain condition. These optimal strategies\nare 
 implemented by parallel uses of the unitary channels\, even though\nall se
 quential and adaptive strategies implementable by the quantum\ncircuit mod
 el are considered. When the number of the smaller uses of\nthe unitary cha
 nnels is fixed\, the optimal averaged success\nprobability is achieved by 
 a certain number of uses of the other\nchannel. This feature contrasts wit
 h the case of pure-state\ncomparison\, where adding more copies of the unk
 nown pure states always\nimproves the optimal averaged success probability
 . It highlights the\ndifference between corresponding tasks for states and
  channels\, which\nhas been previously shown for quantum discrimination ta
 sks.  \n\nReference: Y. Hashimoto\, A. Soeda and M. Murao\, Comparison of
  unknown\nunitary channels with multiple uses\, arXiv:2208.12519\n 
DTSTAMP:20250531T130659Z
END:VEVENT
END:VCALENDAR