Quantum -QuBIC: Connecting the Quantum Dots: Theory of Quantum Computing in a Solid-state Implementation

EIA-0130400罗伯特·乔因特威斯康星大学麦迪逊分校题目：连接量子点；固态实现中的量子计算理论一个关于量子点结构中量子计算的理论研究计划正在进行中。在这种类型的量子计算机中，量子比特是捕获在硅-锗半导体异质结构中的电子的自旋。这些电子的误差分布和消相干特性正在计算中，似乎相关误差和相互消相干在这个点实现中是重要的。人们正在研究这些现象对量子算法和量子纠错方案的影响。这是通过研究它们在两个典型的量子过程中的作用来实现的。第一个是量子随机游走，这是一个简单的算法例子，可以在一维或二维的量子点量子比特阵列上实现。二是多数函数的计算。这两个问题的一个特别吸引人的特点是，在需要相对较少的量子比特的情况下进行这两个问题是有趣和可行的。更普遍的问题也正在得到解决。某些类型的量子算法将更容易受到某些类型的错误的影响。这导致了量子抗误码算法的可能性，而这种类似经典概念的推广的可行性正在确定中。

EIA-0130400Robert JoyntUniversity of Wisconsin-MadisonTitle: Connecting the Quantum Dots; Theory of Quantum Computing in a Solid-state ImplementationA program of theoretical research on quantum computation in quantum dot structures is underway. In this type of quantum computer, the qubits are the spins of electrons trapped in a silicon-germanium semiconductor heterostructure. The error distributions and decoherence properties of these electrons are being calculated, and it appears that correlated errors and mutual decoherence are important in this dot implementation. The impact of these phenomena on quantum algorithms and quantum error correction schemes is being investigated. This is done by examining their effect in two paradigmatic quantum processes. The first is the quantum random walk, a simple example of an algorithm that can be implemented on a one- or two-dimensional array of quantum dot qubits. The second is the computation of the majority function. A particularly attractive feature of both problems is that it is interesting and feasible to do them in cases that require relatively few qubits. More general questions are also being addressed. Certain types of quantum algorithms will be more susceptible to certain types of errors. This leads to the possibility of quantum error-resistant algorithms, and the feasibility of this generalization of the similar classical concept is being determined.