How to check universality of quantum gates?

How to check universality of quantum gates?

Date: 2022-12-19
Time: 14:15
Location: Quantum Chaos and Quantum Information (Jagiellonian University)
seminar
Speaker: Adam Sawicki (CFT PAN, Warsaw) Abstract Universal quantum gates play a central role in quantum computing. It is well known that in order to construct a universal set of gates for many qudits it is enough to take a universal set for one qudit and extend it by a two-qudit entangling gate. On the […]

Device-independent extraction of min-entropy sources against quantum adversaries using few devices

Date: 2022-12-22
Time: 14:00
Location: ICTQT, room 319
seminar
Speaker: Ravishankar Ramanathan (Hong Kong) Abstract Abstract: It is well known that classical tools do not allow the extraction of randomness from a single random source. On the other hand, quantum theory allows for such extraction even within the device-independent framework. While practically feasible protocols have been proposed for randomness sources that possess a specific […]

General guarantees for randomized benchmarking with random quantum circuits

Date: 2022-12-14
Time: 14:30
Location: Quantum Information and Quantum Computing Working Group
seminar
Speaker: Ingo Roth (Quantum research centre, Technology Innovation Institute, Abu Dhabi, UAE) Abstract Randomized benchmarking protocols have become the prominent tool for assessing the quality of gates on digital quantum computing platforms. In `classical’ variants of randomized benchmarking multi-qubit gates are drawn uniformly from a finite group. The functioning of such schemes can be rigorous […]

Speed limits: from thermodynamics to annealing

Date: 2022-12-14
Time: 16:00
Location: ICTQT, room 319
seminar
Speaker: Luis Pedro Garcia Pintos (Joint Quantum Institute and QuICS, University of Maryland) Abstract I will give an overview of recent bounds on the speed with which observables can evolve in quantum and classical systems. The bounds typically take the form of uncertainty relations that connect the maximum rate of change of an observable to […]

Roman Ingarden Memorial Session 2022

Date: 2022-11-30
Time: 15:30
Location: KCIK
seminar
Details Programme 15.30 – 15:55 Andrzej Jamiołkowski "My memories of Roman Stanisław Ingarden". 16:00 – 16:55 2022 Ingarden Memorial Lecture                         Peter Shor: “The development of quantum error correcting codes" 17:00 – 17:15 coffee break 17:15-17:45 Awarding of Junior KCIK Award for best Bachelor Thesis in quantum Information, talk of the winner 17:45-18:15 Distinguished talk […]

Hybrid Quantum-Classical Codes

Date: 2022-11-28
Time: 14:15
Location: Quantum Chaos and Quantum Information (Jagiellonian University), Meeting id: 896 0129 1160
seminar
Speaker: Andrew Nemec (Duke University, USA) Abstract Hybrid codes simultaneously encode both quantum and classical information together, giving an advantage over coding schemes where the quantum and classical information are transmitted separately. We construct the first known families of hybrid codes that are guaranteed to provide an advantage over quantum codes, as well as also […]

Mutually unbiased measurements

Date: 2022-11-23
Time: 12:30
Location: Center for Theoretical Physics Colloquium
seminar
Speaker: Máté Farkas (ICFO, Barcelona) Abstract Mutually unbiased bases (MUBs) correspond to measurements in quantum theory that are complementary: if a measurement in a basis yields a definite outcome on a given quantum state, then a measurement in a basis unbiased to the first one yields a uniformly random outcome on the same state. Simple […]

Graph Approach to Entanglement Generation in Linear Quantum Networks

Date: 2022-11-23
Time: 14:00
Location: ICTQT, room 317
seminar
Speaker: Seungbeom Chin (ICTQT / Sungkyunkwan University) Abstract We propose a graph method to systematically search for schemes that obtains genuine entanglement in arbitrary N-partite linear quantum networks (LQNs). While the indistinguishability of quantum particles is widely used as a resource for the generation of entanglement, it is challenging to devise a suitable LQN that […]
Skip to content