半导体纳米材料和物理

半导体纳米材料是纳米材料的一个重要组成部分，纳米结构的电子和光子器件将成为下一代微电子和光电子器件的核心。文章介绍了半导体纳米材料研究的新进展，包括四个方面：半导体自组织生长量子点，纳米晶体，微腔光子晶体和纳米结构中的自旋电子学。本世纪开始的半导体纳米材料的研究是上世纪半导体超晶格量子阱研究的延续，同时又开辟了一些新的领域，如：单电子的电子学、单光子的光子学，微腔和光子晶体，稀磁半导体和自旋电子的相干输运等，这些研究将为研制在新原理基础上的新器件和实现量子计算、量子通信打下基础。     

半导体微结构物理效应及其应用讲座 第2讲 量子阱、超晶格物理及其在光电子领域中的应用

文章介绍了半导体量子阱、超晶格的基本物理，以及它在光电子领域中的应用，包括量子阱、量子线、量子点、激光器、光调制器、自电光效应器件、量子点器件等．     

半导体低维体系简介

介绍了量子阱、量子线、量子点、半导体超晶格、二维电子气等典型的低维半导体结构及其性质和分析方法。     

半导体量子电子和光电子器件

本文阐述了半导体异质结构电子的量子特性 ,如电子波输运、库仑阻塞效应等。介绍了几种新颖、典型的量子电子器件和量子光电子器件的物理模型和基本原理。这些器件包括了单电子晶体管、共振隧穿二极管、高电子迁移率晶体管、δ掺杂场效应晶体管、量子点元胞自动机、量子阱红外探测器、埋沟异质结半导体激光器、量子级联激光器等。给出了作者在半导体量子器件物理方面的最新研究结果。     

基于原子操纵技术的人工量子结构研究

扫描隧道显微镜原子操纵技术是指利用扫描探针在特定材料表面以晶格为步长搬运单个原子或分子的技术.它是纳米尺度量子物理与器件研究领域一种独特而有力的研究手段.利用这种手段,人们能够以原子或分子为单元构筑某些常规生长或微加工方法难以制备的人工量子结构,通过对格点原子、晶格尺寸、对称性、周期性的高度控制,实现对局域电子态、自旋序、以及能带拓扑特性等量子效应的设计与调控.原子操纵技术与超快测量及自动控制技术的结合,使得人们能够进一步研究原子级精准的量子器件,因而该技术成为探索未来器件新机理、新工艺的重要工具.本文首先简介原子操纵方法的发展过程和技术要点,然后分别介绍人工电子晶格、半导体表面人工量子点、磁性人工量子结构、人工结构中的信息存储与逻辑运算、单原子精度原型器件等方面的最新研究进展,以及单原子刻蚀和自动原子操纵等方面的技术进展,最后总结并展望原子操纵技术的应用前景和发展趋势.     

半导体量子电子和光电子器件

本阐述了半导体异质结构电子的量子特性,如电子波输运,库仑阻塞效应等,介绍了几种新颖,典型的量子电子器件和量子光电子器件的物理模型和基本原理,这些器件包括了单电子晶体管,共振隧穿二极管,高电子迁移率晶体管,δ掺杂场效应晶体管,量子点元胞自动机,量子阱红外探测器,埋沟异质结半导体激光器,量子级联激光器等,给出了作在半导体量子器件物理方面的最新研究结果。     

半导体超晶格国家重点实验室诚聘英才

中国科学院半导体研究所半导体超晶格国家重点实验室是以半导体物理研究为主的国家重点实验室,在半导体材料生长、器件加工、物理测试和理论研究方面有着非常雄厚的研究基础,20年来为我国在半导体领域的基础研究方面做出了突出的贡献.现计划在半导体自旋电子学、半导体材料与器件物理以及固态量子信息方面招聘人才,研究职位包括固定编制人员、项目聘用人员和博士后.     

半导体超晶格国家重点实验室诚聘英才

中国科学院半导体研究所半导体超晶格国家重点实验室是以半导体物理研究为主的国家重点实验室,在半导体材料生长、器件加工、物理测试和理论研究方面有着非常雄厚的研究基础,20年来为我国在半导体领域的基础研究方面做出了突出的贡献.现计划在半导体自旋电子学、半导体材料与器件物理以及固态量子信息方面招聘人才,研究职位包括固定编制人员、项目聘用人员和博士后.     

半导体超晶格国家重点实验室诚聘英才

中国科学院半导体研究所半导体超晶格国家重点实验室是以半导体物理研究为主的国家重点实验室,在半导体材料生长、器件加工、物理测试和理论研究方面有着非常雄厚的研究基础,20年来为我国在半导体领域的基础研究方面做出了突出的贡献.现计划在半导体自旋电子学、半导体材料与器件物理以及固态量子信息方面招聘人才,研究职位包括固定编制人员、项目聘用人员和博士后.     

半导体超晶格国家重点实验室诚聘英才

中国科学院半导体研究所半导体超晶格国家重点实验室是以半导体物理研究为主的国家重点实验室,在半导体材料生长、器件加工、物理测试和理论研究方面有着非常雄厚的研究基础,20年来为我国在半导体领域的基础研究方面做出了突出的贡献.现计划在半导体自旋电子学、半导体材料与器件物理以及固态量子信息方面招聘人才,研究职位包括固定编制人员、项目聘用人员和博士后.     

Entanglement of Formation of an Arbitrary State of Two Rebits

We consider entanglement for quantum states defined in vector spaces over the real numbers. Such real entanglement is different from entanglement in standard quantum mechanics over the complex numbers. The differences provide insight into the nature of entanglement in standard quantum theory. Wootters [Phys. Rev. Lett. 80, 2245 (1998)] has given an explicit formula for the entanglement of formation of two qubits in terms of what he calls the concurrence of the joint density operator. We give a contrasting formula for the entanglement of formation of an arbitrary state of two rebits, a rebit being a system whose Hilbert space is a 2-dimensional real vector space.     

Robust Quantum Search with Uncertain Number of Target States

The quantum search algorithm is one of the milestones of quantum algorithms. Compared with classical algorithms, it shows quadratic speed-up when searching marked states in an unsorted database. However, the success rates of quantum search algorithms are sensitive to the number of marked states. In this paper, we study the relation between the success rate and the number of iterations in a quantum search algorithm of given λ=M/N, where M is the number of marked state and N is the number of items in the dataset. We develop a robust quantum search algorithm based on Grover–Long algorithm with some uncertainty in the number of marked states. The proposed algorithm has the same query complexity ON as the Grover’s algorithm, and shows high tolerance of the uncertainty in the ratio M/N. In particular, for a database with an uncertainty in the ratio M±MN, our algorithm will find the target states with a success rate no less than 96%.     

Decomposition Properties of Quantum Discord

The quantum discord was introduced by Ollivier,Zurek,Henderson,and Vedral as an indicator of the degree of quantumness of mixed states.In this paper,we provide a decomposition condition for quantum discord.Moreover,we show that under the condition,the quantum correlations between the quantum systems can be captured completely by the entanglement measure.Finally,we present examples of our conclusions.     

Security proof of counterfactual quantum cryptography against general intercept-resend attacks and its vulnerability

Counterfactual quantum cryptography,recently proposed by Noh,is featured with no transmission of signal particles.This exhibits evident security advantages,such as its immunity to the well-known photon-number-splitting attack.In this paper,the theoretical security of counterfactual quantum cryptography protocol against the general interceptresend attacks is proved by bounding the information of an eavesdropper Eve more tightly than in Yin’s proposal [Phys.Rev.A 82 042335(2010)].It is also shown that practical counterfactual quantum cryptography implementations may be vulnerable when equipped with imperfect apparatuses,by proving that a negative key rate can be achieved when Eve launches a time-shift attack based on imperfect detector efficiency.     

Information Complexity of Quantum Gates

This paper considers the realizability of quantum gates from the perspective of information complexity. Since the gate is a physical device that must be controlled classically, it is subject to random error. We define the complexity of gate operation in terms of the difference between the entropy of the variables associated with initial and final states of the computation. We argue that the gate operations are irreversible if there is a difference in the accuracy associated with input and output variables. It is shown that under some conditions the gate operation may be associated with unbounded entropy, implying impossibility of implementation. PACS number: 03.65     

Implementation of Quantum Fourier Transform and Its Applications via Quantum-Dot Spins and Microcavity

A scheme for implementing discrete quantum Fourier transform is proposed via quantum dots embedded in a microcavity, and then some of its applications are investigated, i.e., Deutsch 3ozsa. algorithm and Shor＇s quantum factoring. In particular, the detailed process of implementing one~qubit Deutsch Jozsa algorithm and the factorization of N = 15 are given. The microcavity mode is only virtually excited in the whole interaction, so the effective decoherent has slight effect on the current scheme. These schemes would be an important step to fabricate a solid quantum computer.     

Many-Agent Controlled Teleportation of Multi-qubit Quantum Information via Quantum Entanglement Swapping

We present a method to teleport multi-qubit quantum information in an easy way from a sender to a receiver via the control of many agents in a network. Only when all the agents collaborate with the quantum information receiver can the unknown states in the sender＇s qubits be fully reconstructed in the receiver＇s qubits. In our method, agents＇s control parameters are obtained via quantum entanglement swapping. As the realization of the many-agent controlled teleportation is concerned, compared to the recent method [G.P. Yang, et al., Phys. Rev. A 70 （2004） 022329], our present method considerably reduces the preparation difficulty of initial states and the identification difficulty of entangled states, moreover, it does not need local Hadamard operations and it is more feasible in technology.