Classical and quantum structures in computation
<p>Quantum mechanics exhibits many counter-intuitive features, which challenge our classical understanding of the world. This makes the theory simultaneously difficult to grasp, and a source of great potential for new technologies.</p> <p>We study various characteristics of classi...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Thesis |
| Language: | English |
| Published: |
2018
|
| _version_ | 1797110469804163072 |
|---|---|
| author | Wester Hansen, L |
| author2 | Abramsky, S |
| author_facet | Abramsky, S Wester Hansen, L |
| author_sort | Wester Hansen, L |
| collection | OXFORD |
| description | <p>Quantum mechanics exhibits many counter-intuitive features, which challenge our classical understanding of the world. This makes the theory simultaneously difficult to grasp, and a source of great potential for new technologies.</p>
<p>We study various characteristics of classical and quantum mechanics and their respective roles in computation. This is interesting from a philosophical perspective, as it brings us a small step closer to understanding the nature of quantum mechanics. Furthermore, it leads us to discover scenarios where quantum resources provide a genuine advantage over classical resources, as well as more intuitive ways to model quantum protocols.</p>
<p>Firstly, we explore the concept of quantum contextuality, which distinguishes uniquely-quantum experimental outcomes from outcomes that can be realised classically. In pursuit of a universal theory of contextuality, we unify two abstract frameworks: the sheaf-theoretic approach to contextuality by Abramsky and Brandenburger and the equivalence-based approach by Spekkens.</p>
<p>We apply the sheaf-theoretic formalism to the field of communication complexity. We derive a bound on the success probability of a communication complexity protocol, based on the amount of contextuality present in its quantum resource. We provide a set of necessary conditions for distributed functions that allow a contextual advantage.</p>
<p>Secondly, we consider a family of bicategorical models to describe the interaction of classical and quantum information in quantum protocols. We prove that this family is symmetric monoidal, and therefore suitable for describing compound and parallel protocols. This family serves as a mathematical foundation for the planar language for quantum protocols by Vi- cary. Important examples of this family are the bicategories 2Hilb and 2Vect. Additionally, we introduce the structure 2[CP∗[FHilb]], which contains a symmetric monoidal bicategory of mixed states and completely positive maps. This allows a unified description of quantum teleportation and classical encryption in a single 2-category, as well as a universal security proof applicable simultaneously to both scenarios.</p>
<p>As part of the process, we develop extensive categorical machinery for constructing symmetric monoidal structures of bicategories, pseudo functors, pseudo transformations and modifications. We consider a method of constructing symmetric monoidal bicategories from symmetric monoidal double categories. We show that this method can be generalised to a functor from the locally cubical bicategory of monoidal double categories to the locally cubical bicategory of monoidal bicategories.</p> |
| first_indexed | 2024-03-07T07:55:17Z |
| format | Thesis |
| id | oxford-uuid:f098fd5b-441c-4032-8e2c-9efab9016275 |
| institution | University of Oxford |
| language | English |
| last_indexed | 2024-03-07T07:55:17Z |
| publishDate | 2018 |
| record_format | dspace |
| spelling | oxford-uuid:f098fd5b-441c-4032-8e2c-9efab90162752023-08-10T08:37:54ZClassical and quantum structures in computationThesishttp://purl.org/coar/resource_type/c_db06uuid:f098fd5b-441c-4032-8e2c-9efab9016275EnglishHyrax Deposit2018Wester Hansen, LAbramsky, SVicary, J<p>Quantum mechanics exhibits many counter-intuitive features, which challenge our classical understanding of the world. This makes the theory simultaneously difficult to grasp, and a source of great potential for new technologies.</p> <p>We study various characteristics of classical and quantum mechanics and their respective roles in computation. This is interesting from a philosophical perspective, as it brings us a small step closer to understanding the nature of quantum mechanics. Furthermore, it leads us to discover scenarios where quantum resources provide a genuine advantage over classical resources, as well as more intuitive ways to model quantum protocols.</p> <p>Firstly, we explore the concept of quantum contextuality, which distinguishes uniquely-quantum experimental outcomes from outcomes that can be realised classically. In pursuit of a universal theory of contextuality, we unify two abstract frameworks: the sheaf-theoretic approach to contextuality by Abramsky and Brandenburger and the equivalence-based approach by Spekkens.</p> <p>We apply the sheaf-theoretic formalism to the field of communication complexity. We derive a bound on the success probability of a communication complexity protocol, based on the amount of contextuality present in its quantum resource. We provide a set of necessary conditions for distributed functions that allow a contextual advantage.</p> <p>Secondly, we consider a family of bicategorical models to describe the interaction of classical and quantum information in quantum protocols. We prove that this family is symmetric monoidal, and therefore suitable for describing compound and parallel protocols. This family serves as a mathematical foundation for the planar language for quantum protocols by Vi- cary. Important examples of this family are the bicategories 2Hilb and 2Vect. Additionally, we introduce the structure 2[CP∗[FHilb]], which contains a symmetric monoidal bicategory of mixed states and completely positive maps. This allows a unified description of quantum teleportation and classical encryption in a single 2-category, as well as a universal security proof applicable simultaneously to both scenarios.</p> <p>As part of the process, we develop extensive categorical machinery for constructing symmetric monoidal structures of bicategories, pseudo functors, pseudo transformations and modifications. We consider a method of constructing symmetric monoidal bicategories from symmetric monoidal double categories. We show that this method can be generalised to a functor from the locally cubical bicategory of monoidal double categories to the locally cubical bicategory of monoidal bicategories.</p> |
| spellingShingle | Wester Hansen, L Classical and quantum structures in computation |
| title | Classical and quantum structures in computation |
| title_full | Classical and quantum structures in computation |
| title_fullStr | Classical and quantum structures in computation |
| title_full_unstemmed | Classical and quantum structures in computation |
| title_short | Classical and quantum structures in computation |
| title_sort | classical and quantum structures in computation |
| work_keys_str_mv | AT westerhansenl classicalandquantumstructuresincomputation |