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.