Now showing items 1-3 of 3

    • Di, Tiegang (Texas A&M University, 2006-08-16)
      This dissertation consists of three sections. In the first section, we discuss the generation of arbitrary two-qubit entangled states and present three generation methods. The first method is based on the interaction of ...
    • Kamat, Angad Mohandas (Texas A&M University, 2008-10-10)
      Quantum computing resources have been known to provide speed-ups in computational complexity in many algorithms. The impact of these resources in communication, however, has not attracted much attention. We investigate the ...
    • Abdelhamid Awad Aly Ahmed, Sala (Texas A&M University, 2008-10-10)
      It is conjectured that quantum computers are able to solve certain problems more quickly than any deterministic or probabilistic computer. For instance, Shor's algorithm is able to factor large integers in polynomial ...