SearcharxivSearch

arXiv subjects

M. Almousa

Publications and source records attributed to M. Almousa.

2 recordsLinked to original sources

Geometry and quantum brachistochrone analysis of multiple entangled spin-1/2 particles under all-range Ising interaction

We present a unified geometric and dynamical framework for a physical system consisting of $n$ spin-$1/2$ particles with all-range Ising interaction. Using the Fubini-Study formalism, we derive the metric tensor of the associated quantum state manifold and compute the corresponding Riemann curvature. Our analysis reveals that the system evolves over a smooth, compact, two-dimensional manifold with spherical topology and a dumbbell-like structure shaped by collective spin interactions. We further investigate the influence of the geometry and topology of the resulting state space on the behavior of geometric and topological phases acquired by the system. We explore how this curvature constrains the system's dynamical behavior, including its evolution speed and Fubini-Study distance between the quantum states. Within this geometric framework, we address the quantum brachistochrone problem and derive the minimal time required for optimal evolution, a result useful for time-efficient quantum circuit design. Subsequently, we explore the role of entanglement in shaping the state space geometry, modulating geometric phase, and controlling evolution speed and brachistochrone time. Our results reveal that entanglement enhances dynamics up to a critical threshold, beyond which geometric constraints begin to hinder evolution. Moreover, entanglement induces critical shifts in the geometric phase, making it a sensitive indicator of entanglement levels and a practical tool for steering quantum evolution. This approach offers valuable guidance for developing quantum technologies that require time-efficient control strategies rooted in the geometry of quantum state space.

quant-ph

Optimizing Multi-Hop Quantum Communication using Bidirectional Quantum Teleportation Protocol

In this paper, we introduce a new method for Bidirectional Quantum Teleportation called Bidirectional Quantum Teleportation using the Modified Dijkstra Algorithm and Quantum Walk (BQT-MDQW). This method uses different types of entangled states, such as the GHZ-Bell state, W-Bell state, and Cluster-Bell state, to improve quantum communication in multi-hop quantum wireless networks. We focus on the W-Bell state and compare the quantum Dijkstra algorithm with the classical Dijkstra method to see which one works better. We apply both versions to quantum and classical simulators, measuring their performance through fidelity, memory utilization, and throughput calculations. Our results show that the shortest path problem may be solved with significantly reduced computer complexity using the quantum Dijkstra algorithm based on quantum walks. The introduction of a quantum walk, which permits dynamic transitions between quantum channels and the effective exploration of quantum network states, is an important part of the protocol. Using the capacity of the quantum walk to adjust to changing quantum states, we also introduce a method for successfully identifying unitary matrices under varying quantum channels. The bidirectional teleportation structure of the protocol is designed to solve the multi-hop teleportation problem in quantum wireless networks. In addition, we present quantum Dijkstra's algorithm, which uses quantum gates to significantly decrease computational complexity and solve the networking problem by building on the quantum walk framework. This method shows how quantum computing may be used to solve arbitrary optimization issues such as the shortest path problem. Finally, we present a novel multi-hop quantum teleportation system encompassing both unidirectional and bidirectional communication, as introduced in the quantum Dijkstra algorithm system...

quant-ph