International Electronic Conference on Applied Sciences (ASEC)

Spatiotemporal Graph Imaging Associated with Multilevel Atomic Excitations †

Abu Mohamed Alhasan

Published Nov 11, 2020• 0 citations

Abstract

In this paper, we establish a graph imaging technique to manifest local stabilization within atomic systems of multiple levels. Specifically, we address the interrelation between local stabilization and image entropy. As an example, we consider the mutual interaction of two pair of pulses propagating in a double-Λ configuration. Thus, we have two different sets of two pulses that share the same shape and phase, initially. The first (second) set belongs to lower (upper) -Λ subsystems, respectively. The configuration of two pair of pulses is considered as a dynamical graph model with four nodes. The dynamic transition matrix describes the connectivity matrix in the static graph model. It is to be emphasized that the graph and its image have the same transition matrix. In particular, the graph model exposes the stabilization in terms of the singular-value decomposition of energies for the transition matrix, that is, irrespectively of the structure of the transition matrix. The image model of the graph displays the details of the matrix structure in terms of row and column probabilities. Therefore, it enables one to study conditional probabilities and mutual information inherent in the network of the graph. Furthermore, the graph imaging provides the main row/column contribution to the transition matrix in terms of image entropy. Our results show that image entropy exposes spatial dependence, which is irrelevant to graph entropy.

DOI: 10.3390/asec2020-07886

Related papers

Graph Entropy Associated with Multilevel Atomic Excitation

Abu Mohamed Alhasan

A graph-model is presented to describe multilevel atomic structure. As an example, we take the double Λ configuration in alkali-metal atoms with hyperfine structure and nuclear spin I = 3 / 2 , as a graph with four vertices. Links are treated as coherence. We introduce the transition matrix which describes the connectivity matrix in static graph-model. In general, the transition matrix describes spatiotemporal behavior of the dynamic graph-model. Furthermore, it describes multiple connections and self-looping of vertices. The atomic excitation is made by short pulses, in order that the hyperfine structure is well resolved. Entropy associated with the proposed dynamic graph-model is used to identify transitions as well as local stabilization in the system without invoking the energy concept of the propagated pulses.

International Electronic Conference on Entropy and Its Applications (ECEA)Nov 17, 20192 citations

Study on Graph Entropy Associated with Multilevel Atomic Excitation

Abu Mohamed Alhasan

A graph-model is presented to describe multilevel atomic structure. As an example, we take the double L configuration in alkali-metal atoms with hyperfine structure and nuclear spin , as a graph with four vertices. Links are treated as coherence. We introduce the transition matrix which describes the connectivity matrix in static graph-model. In general, the transition matrix describes spatiotemporal behavior of the dynamic graph-model. Furthermore, it describes multiple connections and self-looping of vertices. The atomic excitation is made by short pulses, in order that the hyperfine structure is well resolved. Entropy associated with the proposed dynamic graph-model is used to identify transitions as well as local stabilization in the system without invoking the energy concept of the propagated pulses.

Book Publisher International (a part of SCIENCEDOMAIN International)Feb 23, 20210 citations

Entropy Associated with Local Stabilization of the Pulse Area in Multilevel Atomic Media

Abu Mohamed Alhasan

This paper provides an entropy analysis to resonant and short pulses propagation in four-level atomic medium.As an example, we take D1 transition in rubidium 87 Rb atoms including hyperfine structure.We show how to construct the time dependent Bloch-metric for each optical transition in the Liouville space.Furthermore, we attempt to relate local stabilization of the pulse area to the distribution of the space-entropy.

Acta Physica Polonica AMay 1, 20182 citations

General dark-state theory for arbitrary multilevel quantum systems

Xuan Zhao, Le-Man Kuang, Jie‐Qiao Liao

The dark-state effect, caused by destructive quantum interference, is an important physical effect in atomic physics and quantum optics. It not only deepens the understanding of light-atom interactions, but also has wide applications in quantum physics and quantum information. Therefore, how to efficiently and conveniently determine the number and form of the dark states in multilevel quantum systems with complex transitions is an important and interesting topic in this field. In this work, we present a general theory for determining the dark states in multilevel quantum systems with any coupling configuration using the arrowhead-matrix method. To confirm the dark states in a multilevel system, we first define the upper- and lower-state subspaces, and then diagonalize the Hamiltonians restricted within the two subspaces to obtain the dressed upper and lower states. By further expressing the transitions between the dressed upper and lower states, we can map the multilevel system to a bipartite-graph network, in which the nodes and links are acted by the dressed states and transitions, respectively. Based on the coupling configurations of the network, we can determine the lower dark states with respect to the upper-state subspace. As examples, we analyze the dark states in three-, four-, and five-level quantum systems, for all possible configurations through the classification of the numbers of upper and lower states. Furthermore, we extend the framework to multilevel quantum systems and discuss the existence of dark states in some typical configurations. We also recover the results of the dark-state polaritons in driven three-level systems with the arrowhead-matrix method. Our theory paves the way for manipulating and utilizing the dark states of multilevel quantum systems in atomic physics and quantum optics.

arXiv:2510.05561Physical Review ADec 23, 20253 citations

Multilevel Phase Switch Generation in Alkali Vapors

Abu Mohamed Alhasan, Salah Abdulrhmann

We attempt to demonstrate optical phase switches in a typical light storage experiment. We computed propagation dynamics of light pulses in sodium-23, rubidium-87, and potassium-39 vapors. These vapors have the same tensorial sets of the density matrix with a nuclear spin I = 3/2. The energy scheme is known as the double-Λ system. We considered an excitation mechanism in which one of two Λ systems was excited by two-color pulses, probe, and drive, following the standard electromagnetically induced transparency configuration. The probe channel contains delayed two pulses after the first probe pulse. Gain is generated through the drive channel and is exposed during propagation. We further investigated the spatiotemporal phase variations in the pulses and found discrete phase distribution for different vapors. The spatiotemporal evolution of the irreducible tensorial sets defines structural differential equations. Additionally, it is particularly suitable for parallel processing. We hope our study finds an application in comparison to alkali vapor magnetometry.

International Electronic Conference on Applied Sciences (ASEC)Dec 12, 20221 citation

Low-Density Parity-Check Codes: Construction and Implementation

Gabofetswe Malema

Low-density parity-check (LDPC) codes have been shown to have good error correcting performance approaching Shannon’s limit. Good error correcting performance enables efficient and reliable communication. However, a LDPC code decoding algorithm needs to be executed efficiently to meet cost, time, power and bandwidth requirements of target applications. The constructed codes should also meet error rate performance requirements of those applications. Since their rediscovery, there has been much research work on LDPC code construction and implementation. LDPC codes can be designed over a wide space with parameters such as girth, rate and length. There is no unique method of constructing LDPC codes. Existing construction methods are limited in some way in producing good error correcting performing and easily implementable codes for a given rate and length. There is a need to develop methods of constructing codes over a wide range of rates and lengths with good performance and ease of hardware implementability. LDPC code hardware design and implementation depend on the structure of target LDPC code and is also as varied as LDPC matrix designs and constructions. There are several factors to be considered including decoding algorithm computations,processing nodes interconnection network, number of processing nodes, amount of memory, number of quantization bits and decoding delay. All of these issues can be handled in several different ways. \nThis thesis is about construction of LDPC codes and their hardware implementation. LDPC code construction and implementation issues mentioned above are too many to be addressed in one thesis. The main contribution of this thesis is the development of LDPC code construction methods for some classes of structured LDPC codes and techniques for reducing decoding time. We introduce two main methods for constructing structured codes. In the first method, column-weight two LDPC codes are derived from distance graphs. A wide range of girths, rates and lengths are obtained compared to existing methods. The performance and implementation complexity of obtained codes depends on the structure of their corresponding distance graphs. In the second method, a search algorithm based on bit-filing and progressive-edge growth algorithms is introduced for constructing quasi-cyclic LDPC codes. The algorithm can be used to form a distance or Tanner graph of a code. This method could also obtain codes over a wide range of parameters. Cycles of length four are avoided by observing the row-column constraint. \nRow-column connections observing this condition are searched sequentially or randomly. Although the girth conditions are not sufficient beyond six, larger girths codes were easily obtained especially at low rates. The advantage of this algorithm compared to other methods is its flexibility. It could be used to construct codes for a given rate and length with girths of at least six for any sub-matrix configuration or rearrangement. The code size is also easily varied by increasing or decreasing sub-matrix size. Codes obtained using a sequential search criteria show poor performance at low girths (6 and 8) while random searches result in good performing codes. \nQuasi-cyclic codes could be implemented in a variety of decoder architectures. One of the many options is the choice of processing nodes interconnect. We show how quasi-cyclic codes processing could be scheduled through a multistage network. Although these net-works have more delay than other modes of communication, they offer more flexibility at a reasonable cost. Banyan and Benes networks are suggested as the most suitable networks. \nDecoding delay is also one of several issues considered in decoder design and implementation. In this thesis, we overlap check and variable node computations to reduce decoding time. Three techniques are discussed, two of which are introduced in this thesis. The techniques are code matrix permutation, matrix space restriction and sub-matrix row-column scheduling. Matrix permutation rearranges the parity-check matrix such that rows and columns that do not have connections in common are separated. This techniques can be applied to any matrix. Its effectiveness largely depends on the structure of the code. We show that its success also depends on the size of row and column weights. Matrix space restriction is another technique that can be applied to any code and has fixed reduction in time or amount of overlap. Its success depends on the amount of restriction and may be traded with performance loss. The third technique already suggested in literature relies on the internal cyclic structure of sub-matrices to achieve overlapping. The technique is limited to LDPC code matrices in which the number of sub-matrices is equal to row and column weights. We show that it can be applied to other codes with a lager number of sub-matrices than code weights. However, in this case maximum overlap is not guaranteed. We calculate the lower bound on the amount of overlapping. Overlapping could be applied to any sub-matrix configuration of quasi-cyclic codes by arbitrarily choosing \nthe starting rows for processing. Overlapping decoding time depends on inter-iteration waiting times. We show that there are upper bounds on waiting times which depend on the code weights. Waiting times could be further reduced by restricting shifts in identity sub-matrices or using smaller sub-matrices. This overlapping technique can reduce the decoding time by up to 50% compared to conventional message and computation scheduling. \nTechniques of matrix permutation and space restriction results in decoder architectures that are flexible in LDPC code design in terms of code weights and size. This is due to the fact that with these techniques, rows and columns are processed in sequential order to achieve overlapping. However, in the existing technique, all sub-matrices have to be processed in parallel to achieve overlapping. Parallel processing of all code sub-matrices requires the architecture to have the number of processing units at least equal to the number sub-matrices. Processing units and memory space should therefore be distributed among the sub-matrices according to the sub-matrices arrangement. This leads to high complexity or inflexibility in the decoder architecture. We propose a simple, programmable and high throughput decoder architecture based on matrix permutation and space restriction techniques.

Jan 1, 200724 citations