Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1510.06649

Operator Algebras in Quantum Computation

Mathys Rennela

Published Oct 22, 2015• 8 citations
arXivHTMLPDF

Abstract

In this master thesis, I discuss how the theory of operator algebras, also called operator theory, can be applied in quantum computer science.
DOI
10.48550/arxiv.1510.06649

Related papers

Applications of abelian algebraic structures in quantum computation

Kevin C. Zatloukal

Thesis: Ph. D., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2016.

•Jan 1, 2016•0 citations

Introduction to Special Issue: Operator Algebras and Quantum Information Theory

Yasuyuki Kawahigashi, David Pérez García, Mary Beth Ruskai

Journal of Mathematical Physics•Jan 1, 2016•0 citations

Identical emitters, collective effects and dissipation in quantum optics

Michael Gegg

In this thesis a formalism for indistinguishable multi-level quantum emitters in quantum master equations is developed. The complexity of the approach scales only polynomially in the number of quantum emitters. Complexity here means the number of coupled equations or rather the dimension of the Liouville space. This approach opens new possibilities for calculating open quantum systems. The method is implemented in the PsiQuaSP library, which allows to setup and solve arbitrary master equations, in particular master equations with the reduced polyno-mial scaling. The introduced tools are utilized to study subradiance in the open Dicke model and various cQED lasers. One of the main current research goals in quantum optics and quantum information science is the generation and stabilization of quantum coherence between distinct quantum systems. These systems can for instance be photons or quantum emitters, qubits. From a theoretical stance the difficulty with these systems is that their complexity scales in general exponentially with the system size, like the number of quantum emitters. The reduced scaling of the formalism introduced in this thesis stems from the permutation symmetry of the indistinguishable emitters. The method is derived in the context of Lindblad quantum master equations. Lindblad quantum master equations for many identical multi-level systems have been used to study funda- mental quantum optical systems, such as lasing and laser like action, various phase transitions, optical bistability, cooperative resonance fluorescence, entanglement, quantum light generation, quantum to classical transitions, super- and subradiance etc. In most of these cases the single emitter, the many emitter and the weak correlation limit can be satisfactorily treated with existing techniques, such as direct integration, phase space methods or cluster expansion. However these techniques are not well suited for the few emitter case with strong correlations. The theory developed in this thesis allows to study all these systems for moderate numbers of quantum emitters and arbitrary correlation strengths, thus filling the gap left open by conventional methods. Even though the theory is developed around Lindblad quantum master equations it is not limited to this case – the requirement of indistinguishability is used to construct symmetrized Liouville space basis states and operators which can also be used to construct other master equations. In this thesis the general methodology for the polynomial scaling of the many emitter master equation is derived by two different approaches. Generalized permutation symmetric Liouville space states and operators are introduced that allow for the construction of arbitrary master equations and observables. These Liouville space states and operators are translated into a graphical representation that greatly facilitates their usage. This representation is found to have a close connection to Lie algebras as well as graph theory. The whole method is implemented in a general and modular way in a C++ library called PsiQuaSP, which allows to simulate arbitrary master equations based on a number state representation. The design of the library heavily relies on the introduced graphical representation, which greatly facilitates the setup of a simulation. The treatment of non-identical systems with PsiQuaSP is illustrated and further techniques for complexity reduction and computational speedup are discussed. These tools are applied to the two main cases of cQED lasers/spasers and super-, subradiance. In the latter case a new type of phase transition in the open Dicke model is predicted that leads to a deterministic generation of subradiant steady state coherences, with applications in quantum information science. Furthermore the interaction of quantum dots with the dissipative modes at metal interfaces is investigated in order to explain experimental findings.

•Jan 1, 2017•4 citations

Operator Algebra Methods in Physics

Huzihiro Araki

The significance of operator algebra methods in quantum physics is reviewed for theoretical physicists by examples in application to quantum field theory and quantum statistical mechanics.

CRC Press eBooks•Nov 27, 2020•0 citations

The Semantics of Effects: Centrality, Quantum Control and Reversible Recursion

Louis Lemonnier

This thesis revolves around an area of computer science called "semantics". We work with operational semantics, equational theories, and denotational semantics. The first contribution of this thesis is a study of the commutativity of effects through the prism of monads. Monads are the generalisation of algebraic structures such as monoids, which have a notion of centre: the centre of a monoid is made of elements which commute with all others. We provide the necessary and sufficient conditions for a monad to have a centre. We also detail the semantics of a language with effects that carry information on which effects are central. Moreover, we provide a strong link between its equational theories and its denotational semantics. The second focus of the thesis is quantum computing, seen as a reversible effect. Physically permissible quantum operations are all reversible, except measurement; however, measurement can be deferred at the end of the computation, allowing us to focus on the reversible part first. We define a simply-typed reversible programming language performing quantum operations called "unitaries". A denotational semantics and an equational theory adapted to the language are presented, and we prove that the former is complete. Furthermore, we study recursion in reversible programming, providing adequate operational and denotational semantics to a Turing-complete, reversible, functional programming language. The denotational semantics uses the dcpo enrichment of rig join inverse categories. This mathematical account of higher-order reasoning on reversible computing does not directly generalise to its quantum counterpart. In the conclusion, we detail the limitations and possible future for higher-order quantum control through guarded recursion.

arXiv:2406.07216•Jun 5, 2024•0 citations

Semantics for a Quantum Programming Language by Operator Algebras

Kenta Cho

New Generation Computing•Mar 1, 2016•12 citations
In this thesis a formalism for indistinguishable multi-level quantum emitters in quantum master equations is developed. The complexity of the approach scales only polynomially in the number of quantum emitters. Complexity here means the number of coupled equations or rather the dimension of the Liouville space. This approach opens new possibilities for calculating open quantum systems. The method is implemented in the PsiQuaSP library, which allows to setup and solve arbitrary master equations, in particular master equations with the reduced polyno-mial scaling. The introduced tools are utilized to study subradiance in the open Dicke model and various cQED lasers. One of the main current research goals in quantum optics and quantum information science is the generation and stabilization of quantum coherence between distinct quantum systems. These systems can for instance be photons or quantum emitters, qubits. From a theoretical stance the difficulty with these systems is that their complexity scales in general exponentially with the system size, like the number of quantum emitters. The reduced scaling of the formalism introduced in this thesis stems from the permutation symmetry of the indistinguishable emitters. The method is derived in the context of Lindblad quantum master equations. Lindblad quantum master equations for many identical multi-level systems have been used to study funda- mental quantum optical systems, such as lasing and laser like action, various phase transitions, optical bistability, cooperative resonance fluorescence, entanglement, quantum light generation, quantum to classical transitions, super- and subradiance etc. In most of these cases the single emitter, the many emitter and the weak correlation limit can be satisfactorily treated with existing techniques, such as direct integration, phase space methods or cluster expansion. However these techniques are not well suited for the few emitter case with strong correlations. The theory developed in this thesis allows to study all these systems for moderate numbers of quantum emitters and arbitrary correlation strengths, thus filling the gap left open by conventional methods. Even though the theory is developed around Lindblad quantum master equations it is not limited to this case – the requirement of indistinguishability is used to construct symmetrized Liouville space basis states and operators which can also be used to construct other master equations. In this thesis the general methodology for the polynomial scaling of the many emitter master equation is derived by two different approaches. Generalized permutation symmetric Liouville space states and operators are introduced that allow for the construction of arbitrary master equations and observables. These Liouville space states and operators are translated into a graphical representation that greatly facilitates their usage. This representation is found to have a close connection to Lie algebras as well as graph theory. The whole method is implemented in a general and modular way in a C++ library called PsiQuaSP, which allows to simulate arbitrary master equations based on a number state representation. The design of the library heavily relies on the introduced graphical representation, which greatly facilitates the setup of a simulation. The treatment of non-identical systems with PsiQuaSP is illustrated and further techniques for complexity reduction and computational speedup are discussed. These tools are applied to the two main cases of cQED lasers/spasers and super-, subradiance. In the latter case a new type of phase transition in the open Dicke model is predicted that leads to a deterministic generation of subradiant steady state coherences, with applications in quantum information science. Furthermore the interaction of quantum dots with the dissipative modes at metal interfaces is investigated in order to explain experimental findings.
This thesis revolves around an area of computer science called "semantics". We work with operational semantics, equational theories, and denotational semantics. The first contribution of this thesis is a study of the commutativity of effects through the prism of monads. Monads are the generalisation of algebraic structures such as monoids, which have a notion of centre: the centre of a monoid is made of elements which commute with all others. We provide the necessary and sufficient conditions for a monad to have a centre. We also detail the semantics of a language with effects that carry information on which effects are central. Moreover, we provide a strong link between its equational theories and its denotational semantics. The second focus of the thesis is quantum computing, seen as a reversible effect. Physically permissible quantum operations are all reversible, except measurement; however, measurement can be deferred at the end of the computation, allowing us to focus on the reversible part first. We define a simply-typed reversible programming language performing quantum operations called "unitaries". A denotational semantics and an equational theory adapted to the language are presented, and we prove that the former is complete. Furthermore, we study recursion in reversible programming, providing adequate operational and denotational semantics to a Turing-complete, reversible, functional programming language. The denotational semantics uses the dcpo enrichment of rig join inverse categories. This mathematical account of higher-order reasoning on reversible computing does not directly generalise to its quantum counterpart. In the conclusion, we detail the limitations and possible future for higher-order quantum control through guarded recursion.