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:20220313T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20221106T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69d69bc684041
DTSTART;TZID=America/Toronto:20230126T150000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20230126T160000
URL:https://uwaterloo.ca/institute-for-quantum-computing/events/quantum-maj
 ority-vote
LOCATION:QNC - Quantum Nano Centre 200 University Avenue West 1201 Waterloo
  ON N2L 3G1 Canada
SUMMARY:Quantum majority vote
CLASS:PUBLIC
DESCRIPTION:MATH CS SEMINAR FEATURING MARIS OZOLS\, ASSISTANT PROFESSOR UNI
 VERSITY\nOF AMSTERDAM QUSOFT\n\nMajority vote is a basic method for amplif
 ying correct outcomes that\nis widely used in computer science and beyond.
  While it can amplify\nthe correctness of a quantum device with classical 
 output\, the\nanalogous procedure for quantum output is not known. We intr
 oduce\nquantum majority vote as the following task: given a product state\
 n∣ψ_1⟩⊗⋯⊗∣ψ_n⟩ where each qubit ∣ψ_i⟩ is in one of\nt
 wo orthogonal states ∣ψ⟩ or ∣ψ^⊥⟩\, output the majority\nstate
 . We show that an optimal algorithm for this problem achieves\nworst-case 
 fidelity of 1/2 + Θ(1/n). Under the promise that at least\n2/3 of the inp
 ut qubits are in the majority state\, the fidelity\nincreases to 1 − Θ(
 1/n) and approaches 1 as n increases. ...
DTSTAMP:20260408T181742Z
END:VEVENT
END:VCALENDAR