Archives: Events

Speaker: Andris Ambainis (Center for Quantum Computer Science, Faculty of Computing, University of Latvia) Abstract Quantum algorithms are useful for a variety of problems in search and optimization. This line of work started with Grover's quantum search algorithm which achieved a quadratic speedup over naive exhaustive search but has now developed far beyond it. In […]

Speaker: Adam Sawicki (CTP PAS) Abstract Approximate t-design are ensembles of unitaries that (approximately) recover Haar averages of polynomials in entries of unitaries up to the order t. As such, they find numerous applications throughout quantum information, including randomized benchmarking , efficient estimation of properties of quantum states, decoupling, information transmission and quantum state discrimination. […]

Speaker: Christian Bertoni (Dahlem Center for Complex Quantum Systems, Freie Universitat Berlin, Germany) Abstract Classical shadows have recently emerged as an efficient method to extract expectation values of observables using randomized measurements. In particular, two schemes have been proven to be able to efficiently perform this task for certain classes of observables: random single-qubit Clifford […]

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 […]

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 […]

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 […]

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 […]

Speaker: Paweł Horodecki (Gdansk)

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 […]

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 […]