课题基金 / 基金详情

Zero-error quantum information and operator theory: emerging links

Zero-error quantum information and operator theory: emerging links
零错误量子信息和算子理论:新兴链接
批准号:
EP/K032763/1
负责人:
Ivan Todorov
金额:
$4.19万
依托单位:
依托单位国家:
英国
项目类别:
Research Grant
财政年份:
2013
资助国家:
英国
项目状态:
已结题
起止时间:
2013 至 --

项目摘要

项目成果

Ivan Todorov的其他基金

相似基金

相关文献

中文摘要
翻译
图是最简单的数学对象之一-根据定义,图是一组称为顶点的点和一组边,每条边连接一对给定的顶点。如果顶点被标号为1,2,…,n,则每条边都是一对(i,j),其中i和j介于1和n之间。图在计算机科学、工程和数学本身中有大量的应用。正是香农在20世纪50年代的S意识到它们可以成功地应用于信息论。如果符号i通过通信信道发送,则由于在该传输期间可能发生的错误,接收器可能将其与另一符号j混淆。可以以这种方式混淆的符号对(i,j)形成图的边集,称为信道的混淆图。Shannon定义了一个渐近参数,称为信道的零错误容量(或者,等价地,对应的混淆图的零错误容量),它衡量信息可以在多大程度上通过信道无错误地发送。给定一个n点图G,在20世纪80年代,S、Pauslen、Power和Smith研究了M_n空间M_n的线性子空间S(G)。当(i,j)不是G的边时,所有n×n矩阵的元素都有零i,j-入口。S(G)空间是一个算子系统,即它在共轭转置运算下是封闭的,它包含单位矩阵,它充分地标识了图G的基础。算子系统有着辉煌的历史和在分析中的大量应用,从而为图论开辟了一条分析的途径。我们注意到,并不是M_n中的所有算子系统都能以所描述的方式从图中得到,这是我们所使用的方法的一个关键点。目前,量子计算机的建设正在进行中。这些努力背后的理论科学是量子信息论,它是量子物理学一般领域的一部分。与经典物理学不同,量子物理学的主要特征是非对易性:它背后的数学工具使用空间M_n及其无限维广义,其中对易规则ab=ba一般不成立。在量子通道的研究中,非对易性是突出的特征,量子通道是用于传输量子信息的通道。最近,Duan,Severini和温特将量子通道的混淆图定义为M_n中的某个算符系统,并证明了M_n中的每个算符系统都是这样产生的。因此,在非交换图M_n中称为算子系统是很自然的。S(G)算子系统类可以很容易地被证明为所有非交换图类的自然子类。量子零误差能力被引入,但一些重要的问题仍然悬而未决。本研究项目的目的是使用算符理论的方法来研究量子零误差能力,算符理论是研究算符系统的一般分支。我们计划获得一个称为图的Lovasz数的参数的量子版本的新估计(这个量为零错误容量提供了一个更容易计算的界),研究其他参数,如非交换色数,并奠定“非交换图论”的基础,其中经典图的基本运算,如传递到补图、子图和同态图像,可以在算子系统的背景下成功地执行。我们计划解决一些关于引入的参数的渐近版本的问题,这些问题有望阐明图论和量子信息中的公开问题和猜想。
英文摘要
Graphs are among the simplest mathematical objects - by definition, a graph is a set of points called vertices, and a set of edges, each edge connecting a pair of given vertices. If the vertices are labelled by the numbers 1,2,...,n, then each edge is a pair (i,j), where i and j are between 1 and n. Graphs have a large number of applications in computer science, engineering and mathematics itself. It was Shannon in the 1950's who realised that they can be used successfully in the theory of information. If a symbol, say i, is sent through a communication channel, then due to an error that may occur during this transfer, it may be confused by the receiver with another symbol, say j. The pairs (i,j) of symbols that can be confused in such way form the set of edges of a graph, called the confusability graph of the channel. Shannon defined an asymptotic parameter, called the zero-error capacity of the channel (or, equivalently, of the corresponding confusability graph), which measures the extent to which information can be sent through the channel with zero error. Given a graph G on n vertices, in the 1980's, Pauslen, Power and Smith studied the linear subspace S(G) of the space M_n of all n by n matrices consisting of those elements that have zero i,j-entry when (i,j) is not an edge of G. The space S(G) is an operator system - that is, it is closed under the operation of conjugate transpose and contains the identity matrix - which fully identifies the underlying graph G. Operator systems have an illustrious history and a large number of applications within Analysis, and the aforementioned paper thus opened up an analytical avenue for Graph Theory. We note that not all operator systems in M_n can be obtained from graphs in the described way, and this is a crucial point for the approach used in our proposal. At present, there are ongoing efforts for the construction of quantum computers. The theoretical science that lies behind these efforts is Quantum Information Theory, a part of the general field of quantum physics. The main feature of quantum, as opposed to classical, physics, is non-commutativity: the mathematical tools behind it use the space M_n and its infinite dimensional generalisations where the commutation rule ab = ba does not hold in general. Non-commutativity features prominently in the study of quantum channels, that is, channels used to transfer quantum information. Recently, Duan, Severini and Winter defined the confusability graph of a quantum channel as a certain operator system in M_n, and showed that every operator system in M_n arises in this way. It is thus natural to call operator systems in M_n non-commutative graphs. The class of operator systems S(G) can be identified in an easy and elegant way as a natural subclass of the class of all non-commutative graphs. Quantum zero-error capacities were introduced, but a number of important questions were left open. The aim of the present research project is to study of quantum zero-error capacities using methods from Operator Theory - the general branch where the study of operator systems belongs. We plan to obtain new estimates on the quantum version of a parameter known as Lovasz number of a graph (a quantity that provides an easier computable bound for the zero-error capacity), study other parameters such as non-commutative chromatic numbers, and lay the foundations of a "non-commutative graph theory", where basic operations with classical graphs such as passing to a complement, a subgraph and a homomorphic image can be carried out successfully in the context of operator systems. We plan to address a number of questions regarding asymptotic versions of the introduced parameters that are expected to shed light on open problems and conjectures in Graph Theory and Quantum Information.
期刊论文(2)
专著(0)
科研奖励(0)
会议论文
DOI: 10.1093/qmath/hav004
发表时间: 2013-11
期刊: Quarterly Journal of Mathematics
影响因子: 0.7
作者: [V. Paulsen;I. Todorov]
通讯作者: V. Paulsen;I. Todorov
DOI: 10.1016/j.jfa.2016.01.010
发表时间: 2014-07
期刊: Journal of Functional Analysis
影响因子: 1.7
作者: [V. Paulsen;S. Severini;D. Stahlke;I. Todorov;A. Winter]
通讯作者: V. Paulsen;S. Severini;D. Stahlke;I. Todorov;A. Winter
Noncommutative Analysis in the Theory of Nonlocal Games
  • 批准号:
    2154459
  • 项目类别:
    Standard Grant
  • 资助金额:
    $26.11万
  • 财政年份:
    2022
  • 负责人:
    Ivan Todorov
  • 依托单位:
CIF: Small: Fundamental limits in ambiguous communication
  • 批准号:
    2115071
  • 项目类别:
    Standard Grant
  • 资助金额:
    $18.26万
  • 财政年份:
    2021
  • 负责人:
    Ivan Todorov
  • 依托单位:
Operator Multipliers
  • 批准号:
    EP/D050677/1
  • 项目类别:
    Research Grant
  • 资助金额:
    $15.53万
  • 财政年份:
    2006
  • 负责人:
    Ivan Todorov
  • 依托单位:
国内基金
海外基金
基于Laplace Error惩罚函数的变量选择方法及其在全基因组关联分析中的应用
  • 批准号:
    11001280
  • 项目类别:
    青年科学基金项目
  • 资助金额:
    17.0万元
  • 批准年份:
    2010
  • 负责人:
    王学钦
  • 依托单位:
低辐射空间环境下商用多核处理器层次化软件容错技术研究
  • 批准号:
    90818016
  • 项目类别:
    重大研究计划
  • 资助金额:
    50.0万元
  • 批准年份:
    2008
  • 负责人:
    傅忠传
  • 依托单位:
伪随机序列的设计与分析
  • 批准号:
    60802029
  • 项目类别:
    青年科学基金项目
  • 资助金额:
    20.0万元
  • 批准年份:
    2008
  • 负责人:
    胡红钢
  • 依托单位:
随机系统的递推辨识和优化