December 2023 - ITP-quantumseminare

Tomorrow's QIT Seminar at 14:00pm in HIT E 41.1
by Ladina Hausmann 18 Dec '23

18 Dec '23

Hi all, Tomorrow Liuhang Ye will tell us about his thesis "Towards Understanding Quantum Causal Structures in Quantum Spacetimes". See below for the abstract. The talk will take place at 2pm in HIT E 41.1 Best, Ladina *** Title: Towards Understanding Quantum Causal Structures in Quantum Spacetimes Abstract: In general relativity, causality is deterministically governed by Einstein’s field equations. When matter is subjected to quantum mechanics, the anticipation arises that spacetime itself adopts a quantum nature, giving rise to novel causal structures. In this thesis, we compare different notions of causality and explore causal structures in the context of a specific information processing protocol — the quantum switch. We propose an operational definition of events that is applicable in beyond-classical-spacetime scenarios. Finally, we present two propositions concerning the fine-graining of the quantum switch in classical spacetimes and quantum spacetimes, respectively.

1 0

Tomorrow's QIT Seminar at 14:00pm in HIT E 41.1
by Ladina Hausmann 11 Dec '23

11 Dec '23

Hi all, Tomorrow Valette Orane will tell us about their master thesis "Exploring the viability of cellular automaton decoders for the surface code". See below for the abstract. The talk will take place at 2pm in HIT E 41.1 Best, Ladina *** Title: Exploring the viability of cellular automaton decoders for the surface code Abstract: Quantum error correction has become indispensable in ensuring the protection of quantum information from noise and enabling fault-tolerant quantum computing. The Surface code is a quantum error-correcting code designed such that error-corrected qubits can be built in a two-dimensional architecture and only requiring local connectivity. Together with its high tolerance to quantum noise, the Surface Code currently stands as the most promising candidate for implementing error correction in quantum computing devices. In any error-correcting scheme, an integral component of the process is the decoding algorithms. They are tasked with producing accurate estimates of the errors from measured syndrome data so that these errors can subsequently be corrected. Such decoding algorithms need to be very fast but this speed requirement introduces a challenging tradeoff, where the complexity is only improved at the expense of accuracy and vice-versa. Interesting contestants for fast decoders are cellular automaton decoders. Because of their simplicity and how they reduce the decoding problem to simple local update rules, they exhibit reduced complexity. This reduced complexity however comes at the price of an accuracy that is lower than more complex algorithms, especially for codes like Surface codes without periodic boundaries. In this thesis, by building on previous projects of the group, we aim to investigate the viability of the cellular automaton decoder for the Surface Code, by experimenting with different ways of optimizing the algorithm for the Surface code with boundaries.

1 0

Tomorrow's QIT Seminar at 14:00pm in HIT E 41.1
by Ladina Hausmann 05 Dec '23

05 Dec '23

Hi all, Tomorrow Valette Orane will tell us about their master thesis "Exploring the viability of cellular automaton decoders for the surface code". See below for the abstract. The talk will take place at 2pm in HIT E 41.1. Best, Ladina *** Title: Exploring the viability of cellular automaton decoders for the surface code Abstract: Quantum error correction has become indispensable in ensuring the protection of quantum information from noise and enabling fault-tolerant quantum computing. The Surface code is a quantum error-correcting code designed such that error-corrected qubits can be built in a two-dimensional architecture and only requiring local connectivity. Together with its high tolerance to quantum noise, the Surface Code currently stands as the most promising candidate for implementing error correction in quantum computing devices. In any error-correcting scheme, an integral component of the process is the decoding algorithms. They are tasked with producing accurate estimates of the errors from measured syndrome data so that these errors can subsequently be corrected. Such decoding algorithms need to be very fast but this speed requirement introduces a challenging tradeoff, where the complexity is only improved at the expense of accuracy and vice-versa. Interesting contestants for fast decoders are cellular automaton decoders. Because of their simplicity and how they reduce the decoding problem to simple local update rules, they exhibit reduced complexity. This reduced complexity however comes at the price of an accuracy that is lower than more complex algorithms, especially for codes like Surface codes without periodic boundaries. In this thesis, by building on previous projects of the group, we aim to investigate the viability of the cellular automaton decoder for the Surface Code, by experimenting with different ways of optimizing the algorithm for the Surface code with boundaries.

1 1