Browsing by Subject "Quantum computing"
Now showing 1 - 2 of 2
Results Per Page
Sort Options
Item Open Access Experimental and computational analyses of electroabsorption in polar InGaN/GaN quantum zigzag heterostructures(IEEE, 2008-11) Sarı, Emre; Özel, Tuncay; Koç, Aslı; Ju, J.-W.; Ahn, H.-K.; Lee, I.-H.; Baek, J. H.; Demir, Hilmi VolkanTraditional quantum confined Stark effect is well known to lead to strong electroabsorption in multiple quantum well (MQW) structures, yielding only red-shift of the absorption edge with the externally applied electric field, independent of the direction of the applied field. However, a little is known the electroabsorption behavior in III nitride quantum structures grown on c-plane of their wurtzite crystal structure, which is substantially different than the electroabsorption of conventional quantum structures. Such III-N heterostructures exhibit strong polarization fields and discontinuity of such polarization fields at their heterointerfaces causes stimulation of large electrostatic fields in alternating directions for their wells and barriers. Consequently, their energy band diagrams form a zigzag potential profile in conduction and valence bands, instead of those with square profiles. A natural and suitable approach for understanding these polarization fields and also developing insight to design related devices (e.g., electroabsorption modulators) is to study electroabsorption behavior as a function of the polarization field in such polar structures. To this end, we present a comparative, computational and experimental study of electroabsorption in our different designs of c-plane grown polar InGaN/GaN quantum structures with varying levels of polarization.Item Open Access An information-theoretic analysis of Grover's algorithm(IEEE, 2003-06-07) Arıkan, ErdalGrover discovered a quantum algorithm for identifying a target element in an unstructured search universe of N items in approximately 1r/4VN queries to a quantum oracle. For classical search using a classical oracle, the search complexity is of order N /2 queries since on average half of the items must be searched. In work preceding Grover's, Bennett et al. had shown that no quantum algorithm can solve the search problem in fewer than D(VN) queries. Thus, Grover's algorithm has optimal order of complexity. Here, we present an informationtheoretic analysis of Grover's algorithm and show that the square-root speed-up by Grover's algorithm is the best possible by any algorithm using the same quantum oracle.