全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...

抛物量子点中的二能级体系

, PP. 110-114

Keywords: 量子信息,二能级体系,变分法,量子点.

Full-Text   Cite this paper   Add to My Lib

Abstract:

采用Pekar类型的变分方法,在抛物量子点中电子与体纵光学声子(LO)强耦合的条件下,得出了电子的基态,第一激发态的能量及相应的波函数。讨论了电子-声子耦合强度,量子点受限长度对电子在基态∣0〉,激发态∣1〉,叠加态时的概率密度分布的影响。结果显示叠加态时的概率密度随着电子-声子耦合强度的增加而增大,随着量子点受限长度的减小而增大。该结果对以量子点制备量子比特有重要的指导意义。

References

[1]  Johjnson N F, Quantum dots: few-body, low-dimensional systems[J]. J Phys: Condens. Matter, 1995,7( 6):965-990.?
[2]  Hu Yiga, Yin Jiwen,Xiao Jinglin. Average number of optical phonons of weak-coupling impurity bound magnetopolaron in a parabolic quantum dot. Chinese Journal of Quantum Electronics, 2009, 26(5): 636-640.( 胡义嘎,尹辑文,肖景林,抛物量子点中弱耦合杂质束缚磁极化子的光学声子平均数.量子电子学报 2009, 26(5) 636-640 )?
[3]  Senes M,Smith K L, Smeeton.T.N,etal.Strong carrier confinement in InxGa1?xN/GaN quantum dots grown by molecular beam epitaxy[J]. Phys Rev B,2007, 75(4):045314-1-5.?
[4]  Potz W, Control of the non-Markovian dynamics of a qubit[J]. Applied Physics Letter,2006, 89 (25):254102-1-3?
[5]  Li Shushen,Wu Xiaoguang,Zheng Houzhi. Recent progress in solid-state quantum computing[J].WuLi 2004,33(6):404-408 (李树深,吴晓光,郑厚植。固态量子计算机的若干重要物理问题研究。物理2004,33(6):404-408)?
[6]  Amico D, Quantum dot-based quantum buses for quantum computer hardware architecture[J]. Irene.Microelectronics Journal, 2006, 37(12):1440-1441?
[7]  Li S S,Xia J B,Yang F H ,et al .InAs/GaAssingle-electron quantum dot qubit [J].Journal.Applied .Physics,2001,90 (12) :6151-6155?
[8]  Li S S,Xia J B,Feng S L,et al., Quantum computing[J].Pro.Natl.Acad.Sci.USA, 2001,98 (21),11847-11850?
[9]  Chow J M, Gambetta L, Tornberg J K ,et al. Randomized Benchmarking and Process Tomography for Gate Errors in a Solid-State Qubit[J]. Phys. Rev. Lett. 2009,102(9), 090502 -090505?
[10]  Riedmatten H D, Afzelius M, Matthias U. Staudt,et al. A solid-state light–matter interface at the single-photon level[J].Nature ,2008,456, 773-777 .

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133