اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدHeisenberg-Weyl algebra revisited: Combinatorics of words and paths
63
0
0.0
(
0
)
تأليف
P. Blasiak
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
The Heisenberg-Weyl algebra, which underlies virtually all physical representations of Quantum Theory, is considered from the combinatorial point of view. We provide a concrete model of the algebra in terms of paths on a lattice with some decomposition rules. We also discuss the rook problem on the associated Ferrers board; this is related to the calculus in the normally ordered basis. From this starting point we explore a combinatorial underpinning of the Heisenberg-Weyl algebra, which offers novel perspectives, methods and applications.
قيم البحث
اقرأ أيضاً
We consider an algebraic formulation of Quantum Theory and develop a combinatorial model of the Heisenberg-Weyl algebra structure. It is shown that by lifting this structure to the richer algebra of graph operator calculus, we gain a simple interpret
ation involving, for example, the natural composition of graphs. This provides a deeper insight into the algebraic structure of Quantum Theory and sheds light on the intrinsic combinatorial underpinning of its abstract formalism.
A relation is established in the present paper between Dicke states in a d-dimensional space and vectors in the representation space of a generalized Weyl-Heisenberg algebra of finite dimension d. This provides a natural way to deal with the separabl
e and entangled states of a system of N = d-1 symmetric qubit states. Using the decomposition property of Dicke states, it is shown that the separable states coincide with the Perelomov coherent states associated with the generalized Weyl-Heisenberg algebra considered in this paper. In the so-called Majorana scheme, the qudit (d-level) states are represented by N points on the Bloch sphere; roughly speaking, it can be said that a qudit (in a d-dimensional space) is describable by a N-qubit vector (in a N-dimensional space). In such a scheme, the permanent of the matrix describing the overlap between the N qubits makes it possible to measure the entanglement between the N qubits forming the qudit. This is confirmed by a Fubini-Study metric analysis. A new parameter, proportional to the permanent and called perma-concurrence, is introduced for characterizing the entanglement of a symmetric qudit arising from N qubits. For d=3 (i.e., N = 2), this parameter constitutes an alternative to the concurrence for two qubits. Other examples are given for d=4 and 5. A connection between Majorana stars and zeros of a Bargmmann function for qudits closes this article.
The notion of emph{string attractor} has recently been introduced in [Prezza, 2017] and studied in [Kempa and Prezza, 2018] to provide a unifying framework for known dictionary-based compressors. A string attractor for a word $w=w[1]w[2]cdots w[n]$ i
s a subset $Gamma$ of the positions ${1,ldots,n}$, such that all distinct factors of $w$ have an occurrence crossing at least one of the elements of $Gamma$. While finding the smallest string attractor for a word is a NP-complete problem, it has been proved in [Kempa and Prezza, 2018] that dictionary compressors can be interpreted as algorithms approximating the smallest string attractor for a given word. In this paper we explore the notion of string attractor from a combinatorial point of view, by focusing on several families of finite words. The results presented in the paper suggest that the notion of string attractor can be used to define new tools to investigate combinatorial properties of the words.
This paper studies combinatorial properties of the complex of planar injective words, a chain complex of modules over the Temperley-Lieb algebra that arose in our work on homological stability. Despite being a linear rather than a discrete object, ou
r chain complex nevertheless exhibits interesting combinatorial properties. We show that the Euler characteristic of this complex is the n-th Fine number. We obtain an alternating sum formula for the representation given by its top-dimensional homology module and, under further restrictions on the ground ring, we decompose this module in terms of certain standard Young tableaux. This trio of results - inspired by results of Reiner and Webb for the complex of injective words - can be viewed as an interpretation of the n-th Fine number as the planar or Dyck path analogue of the number of derangements of n letters. This interpretation has precursors in the literature, but here emerges naturally from considerations in homological stability. Our final result shows a surprising connection between the boundary maps of our complex and the Jacobsthal numbers.
We present a list of formulae useful for Weyl-Heisenberg integral quantizations, with arbitrary weight, of functions or distributions on the plane. Most of these formulae are known, others are original. The list encompasses particular cases like Weyl
-Wigner quantization (constant weight) and coherent states (CS) or Berezin quantization (Gaussian weight). The formulae are given with implicit assumptions on their validity on appropriate space(s) of functions (or distributions). One of the aims of the document is to accompany a work in progress on Weyl-Heisenberg integral quantization of dynamics for the motion of a point particle on the line.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
