SHF: Small: Fault-Tolerant Quantum Computation in Multi-Qubit Block Codes

SHF：小型：多量子位块代码中的容错量子计算

• 批准号: 1421078
• 负责人: Todd Brun
• 金额: $ 47.76万
• 依托单位: University of Southern California
• 依托单位国家: 美国
• 项目类别: Standard Grant
• 财政年份: 2014
• 资助国家: 美国
• 起止时间: 2014-09-01 至 2018-07-31
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=1421078&HistoricalAwards=false
• 关键词: SHF; Small; Fault; Tolerant; Quantum

Quantum computers use the peculiar properties of quantum mechanics---superposition, entanglement, and interference---to do new kinds of information processing. Large scale quantum computers could solve certain difficult problems that are beyond the ability of standard classical computers. Building quantum computers is challenging due to decoherence---quantum noise---which disrupts the needed quantum effects. The solution is fault-tolerant quantum computation: quantum information is encoded in quantum error-correcting codes, and shielded from the effects of noise. Theory shows that this will work if the decoherence rate is not too high, but most constructions require a daunting amount of overhead to do computation. The number of quantum bits (qubits) and basic operations (quantum gates) needed are multiplied by a very large factor.This research will minimize the overhead required by encoding the qubits of the computation in multi-qubit storage blocks that achieve higher rates than most codes that have been studied before. A small number of additional processor blocks will also be constructed, using a different quantum code. These different codes allow different types of quantum gates to be done efficiently, so by choosing the right combination of codes, any quantum computation can be done: such a quantum computer is called universal. Qubits are transferred between the code blocks by quantum teleportation, and are protected from decoherence at all times.This project also takes a somewhat different tack on fault tolerance. Rather than study conditions that allow quantum computations of arbitrarily large size, this research will ask, for a fixed choice of codes and a given level of decoherence, how large a quantum computation can be done. Since in reality only computations up to a certain size can actually be done, this is the most immediately practical question.This project will support two Ph.D. students at USC, and will be an active strand of research at USC's Center for Quantum Information Science and Technology (CQIST). CQIST, and the PI, support education and outreach in the Los Angeles area and elsewhere, and also organize and sponsor international conferences on quantum information science.

量子计算机利用量子力学的特殊性质-叠加、纠缠和干涉-进行新的信息处理。 大规模量子计算机可以解决超出标准经典计算机能力的某些难题。 由于退相干-量子噪声-破坏了所需的量子效应，构建量子计算机是具有挑战性的。 解决方案是容错量子计算：量子信息被编码在量子纠错码中，并免受噪声的影响。 理论表明，如果退相干率不是太高，这将是可行的，但大多数构造需要大量的开销来进行计算。 所需的量子比特（qubit）和基本操作（quantum gates）的数量乘以一个非常大的因子。这项研究将最大限度地减少在多量子比特存储块中编码计算的量子比特所需的开销，从而实现比以前研究的大多数代码更高的速率。 还将使用不同的量子代码构建少量额外的处理器块。 这些不同的代码允许不同类型的量子门有效地完成，因此通过选择正确的代码组合，可以完成任何量子计算：这样的量子计算机被称为通用计算机。 量子比特通过量子隐形传态在代码块之间传输，并始终受到保护，不受退相干的影响。这个项目在容错方面也采取了一些不同的策略。 这项研究不是研究允许任意大规模量子计算的条件，而是询问，对于固定的代码选择和给定的退相干水平，可以进行多大的量子计算。 由于在现实中，只有一定规模的计算实际上可以做，这是最直接的实际问题。该公司是南加州大学的学生，并将成为南加州大学量子信息科学与技术中心（CQIST）的一个活跃的研究领域。 CQIST和PI支持洛杉矶地区和其他地方的教育和推广，并组织和赞助量子信息科学的国际会议。