Quantum Computation: Foundations, Security, Cryptography and Group Theory

量子计算：基础、安全、密码学和群论

• 批准号: EP/F020813/1
• 负责人: Simon Gay
• 金额: $ 4.99万
• 依托单位: University of Glasgow
• 依托单位国家: 英国
• 项目类别: Research Grant
• 财政年份: 2008
• 资助国家: 英国
• 起止时间: 2008 至 无数据
• 项目状态: 已结题
• 来源: https://gtr.ukri.org/projects?ref=EP%2FF020813%2F1
• 关键词: Quantum; Computation; Foundations; Security; Cryptography

Quantum computation is based on computers which operate on the level of quantum mechanics rather than classical electronics. The advantage of this is that in quantum mechanics entities can be simultaneously in many different positions at once: and this allows states of a quantum computer to behave in some ways like a stack of parallel states. This parallel stack does not unfortunately come without strings and, because of the physics of quantum mechanics, it is very difficult to find out what is in any such stack at a particular time: so reading the output of a quantum computer is not easy. Some powerful quantum algorithms have been developed: for example by Shor to factor integers much faster than conventional algorithms can. However the number of such algorithms that we know is not growing very rapidly. One reason for this is that we do not have a systematic understanding of how to build up quantum computing algorithms and indeed do not have a comprehensive library of algorithms for very basic functions and procedures for building from them. The main aims of this project are to construct such a systematic foundation for quantum computation and to establish procedures for basic processes.We shall test our success in these objectives by attempting to construct algorithms for problems which arise in group theory. This area of mathematics provides an endless array of algorithmic problems at all levels of difficulty, so is a good test bed for a potential computation system. We shall also consider how to extend the analysis of cryptographic systems from classical schemes to quantum schemes. In particular this is expected to allow us to build an automated voting process which cannot be tampered with or broken into, by the people who run it.

量子计算基于在量子力学而不是经典电子学水平上操作的计算机。这样做的好处是，在量子力学中，实体可以同时处于许多不同的位置：这使得量子计算机的状态在某些方面表现得像一堆平行状态。不幸的是，这种并行堆栈并不是没有弦，而且由于量子力学的物理学原理，很难在特定时间找到任何这样的堆栈中有什么：所以阅读量子计算机的输出并不容易。一些强大的量子算法已经被开发出来：例如Shor可以比传统算法更快地分解整数。然而，我们所知道的此类算法的数量并没有快速增长。其中一个原因是，我们对如何构建量子计算算法没有系统的理解，而且确实没有一个全面的算法库，用于非常基本的功能和程序。本项目的主要目标是为量子计算构建这样一个系统的基础，并建立基本过程的程序。我们将通过尝试为群论中出现的问题构建算法来测试我们在这些目标上的成功。这一数学领域提供了无数的各种难度的算法问题，因此是潜在计算系统的良好测试平台。我们还将考虑如何将密码系统的分析从经典方案扩展到量子方案。特别是，这将使我们能够建立一个自动化的投票过程，不能被篡改或闯入，由谁运行它的人。

项目成果

Model Checking for Communicating Quantum Processes

• 发表时间: 2012
• 期刊: Int. J. Unconv. Comput.
• 作者: T. A. Davidson;S. Gay;Hynek Mlnarik;R. Nagarajan;N. Papanikolaou

Formal Analysis of Quantum Systems using Process Calculus

• DOI: 10.4204/eptcs.59.9
• 发表时间: 2011-08
• 作者: T. A. Davidson;S. Gay;R. Nagarajan

Formal verification techniques using quantum process calculus

• 发表时间: 2012
• 作者: T. A. Davidson