Quantum key distribution (QKD) provides unconditional security in theory. However, practical QKD systems face challenges in maximizing the secure key rate and extending transmission distances. In this paper, we introduce a comparative study of the BB84 protocol using coincidence detection with two different quantum channels: a free space and underwater quantum channels. A simulated seawater was used as an example for underwater quantum channel. Different single photon detection modules were used on Bob’s side to capture the coincidence counts. Results showed that increasing the mean photon number generally leads to a higher rate of coincidence detection and therefore higher possibility of increasing the secure key rate. The secure key rate can reach 0.0239 (bits/pulse) with a quantum bit error rate (QBER) of 3.2% for the free space channel and 1.5% for the simulated sea-water channel. The security parameters for each value of the mean photon number closely align with the corresponding theoretical predictions. However, some discrepancies were observed, primarily due to a mismatch in photon detection efficiency for SPDMs and system fluctuations. The theoretical calculations also predict that using coincidence detection, the key can be distributed over distances of up to 195 km.
In this paper, we introduce the concept of almost Quasi-Frobcnius fuzzy ring as a " " of Quasi-Frobenius ring. We give some properties about this concept with qoutient fuzzy ring. Also, we study the fuzzy external direct sum of fuzzy rings.
The main object of this paper is to study the representations of monomial groups and characters technique for representations of monomial groups. We refer to monomial groups by M-groups. Moreover we investigate the relation of monomial groups and solvable groups. Many applications have been given the symbol G e.g. group of order 297 is an M-group and solvable. For any group G, the factor group G/G? (G? is the derived subgroup of G) is an M-group in particular if G = Sn, SL(4,R).
It is believed that culture plays an important role in the ELF classroom activities (Al- Mutawa, & Kilani, 1989:87). It is important for the teacher to recognize potential negative (culturally based) perceptions of their learners. In Iraq, for instance, it is not. Uncommon to meet silent expressionless students that arc supposedly English language learners. It is possible for the beginner to interpret this negatively as a lack of interest in the study of English. This interpretation may play a harmful role in the classroom methodology. An instructor has to be intercultural competent to be an effective teacher. It will be more effective if the instructor adopts a consistent style of instruction to allow learners to adapt within the bounds of
... Show MoreWe claim that a proper subact Ṅ have been compactly packed (c.P) in generalization idea of c.P modules to S Acts. whether for all family of prime subact {Pα}(α∈λ) for some β∈λ Pβ ⊇ Ṅ when ∪(α∈λ)Pα, ⊇ N. We refer to an S-Act Ṁ as c.P. if every subact is compactly packed. We study various properties of c.P S-Acts.
The Video effect on Youths Value
In this paper is to introduce the concept of hyper AT-algebras is a generalization of AT-algebras and study a hyper structure AT-algebra and investigate some of its properties. “Also, hyper AT-subalgebras and hyper AT-ideal of hyper AT-algebras are studied. We study on the fuzzy theory of hyper AT-ideal of hyper AT-algebras hyper AT-algebra”. “We study homomorphism of hyper AT-algebras which are a common generalization of AT-algebras.
Brachycerous Dipteran species on alfalfa plant Medicago sativa surveyed in several regions of Iraq from March to November 2012. The study was registered 14 species belonging to nine genera and four families. The results showed that Limnophra quaterna, Atherigona laevigata and Atherigona theodori as new records to Iraq and new pests of alfalfa.
Czerwi’nski et al. introduced Lucky labeling in 2009 and Akbari et al and A.Nellai Murugan et al studied it further. Czerwi’nski defined Lucky Number of graph as follows: A labeling of vertices of a graph G is called a Lucky labeling if for every pair of adjacent vertices u and v in G where . A graph G may admit any number of lucky labelings. The least integer k for which a graph G has a lucky labeling from the set 1, 2, k is the lucky number of G denoted by η(G). This paper aims to determine the lucky number of Complete graph Kn, Complete bipartite graph Km,n and Complete tripartite graph Kl,m,n. It has also been studied how the lucky number changes whi
... Show More