推进量子网络:理想和噪声光子系统的一些工具和协议

Jason Saied, Jeffrey Marshall, Namit Anand, Shon Grabbe, E. Rieffel
{"title":"推进量子网络:理想和噪声光子系统的一些工具和协议","authors":"Jason Saied, Jeffrey Marshall, Namit Anand, Shon Grabbe, E. Rieffel","doi":"10.1117/12.3023843","DOIUrl":null,"url":null,"abstract":"Quantum networking at many scales will be critical to future quantum technologies and experiments on quantum systems. Photonic links enable quantum networking. They will connect co-located quantum processors to enable large-scale quantum computers, provide links between distant quantum computers to support distributed, delegated, and blind quantum computing, and will link distant nodes in space enabling new tests of fundamental physics. Here, we discuss recent work advancing photonic tools and protocols that support quantum networking. We provide analytical results and numerics for the effect of distinguishability errors on key photonic circuits; we considered a variety of error models and developed new metrics for benchmarking the quality of generated photonic states. We review a distillation protocol by one of the authors that mitigates distinguishability errors. We also review recent results by a subset of the authors on the efficient simulation of photonic circuits via approximation by coherent states. We study some interactions between the theory of universal sets, unitary t-designs, and photonics: while many of the results we state in this direction may be known to experts, we aim to bring them to the attention of the broader quantum information science community and to phrase them in ways that are more familiar to this community. We prove, translating a result from representation theory, that there are no non-universal infinite closed $2$-designs in $U(V)$ when $\\dim V \\geq 2$. As a consequence, we observe that linear optical unitaries form a $1$-design but not a 2-design. Finally, we apply a result of Oszmaniec and Zimbor\\'{a}s to prove that augmenting the linear optical unitaries with any nontrivial SNAP gate is sufficient to achieve universality.","PeriodicalId":517711,"journal":{"name":"Quantum Computing, Communication, and Simulation IV","volume":"18 3","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-03-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Advancing quantum networking: some tools and protocols for ideal and noisy photonic systems\",\"authors\":\"Jason Saied, Jeffrey Marshall, Namit Anand, Shon Grabbe, E. Rieffel\",\"doi\":\"10.1117/12.3023843\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Quantum networking at many scales will be critical to future quantum technologies and experiments on quantum systems. Photonic links enable quantum networking. They will connect co-located quantum processors to enable large-scale quantum computers, provide links between distant quantum computers to support distributed, delegated, and blind quantum computing, and will link distant nodes in space enabling new tests of fundamental physics. Here, we discuss recent work advancing photonic tools and protocols that support quantum networking. We provide analytical results and numerics for the effect of distinguishability errors on key photonic circuits; we considered a variety of error models and developed new metrics for benchmarking the quality of generated photonic states. We review a distillation protocol by one of the authors that mitigates distinguishability errors. We also review recent results by a subset of the authors on the efficient simulation of photonic circuits via approximation by coherent states. We study some interactions between the theory of universal sets, unitary t-designs, and photonics: while many of the results we state in this direction may be known to experts, we aim to bring them to the attention of the broader quantum information science community and to phrase them in ways that are more familiar to this community. We prove, translating a result from representation theory, that there are no non-universal infinite closed $2$-designs in $U(V)$ when $\\\\dim V \\\\geq 2$. As a consequence, we observe that linear optical unitaries form a $1$-design but not a 2-design. Finally, we apply a result of Oszmaniec and Zimbor\\\\'{a}s to prove that augmenting the linear optical unitaries with any nontrivial SNAP gate is sufficient to achieve universality.\",\"PeriodicalId\":517711,\"journal\":{\"name\":\"Quantum Computing, Communication, and Simulation IV\",\"volume\":\"18 3\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-03-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Quantum Computing, Communication, and Simulation IV\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1117/12.3023843\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Quantum Computing, Communication, and Simulation IV","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1117/12.3023843","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

多种尺度的量子网络对于未来的量子技术和量子系统实验至关重要。光子链路实现了量子网络。它们将连接同处一地的量子处理器以实现大规模量子计算机,提供远距离量子计算机之间的链接以支持分布式、委托式和盲量子计算,并将连接太空中的远距离节点以实现对基础物理学的新测试。在此,我们将讨论最近在推进支持量子网络的光子工具和协议方面所做的工作。我们提供了可区分性误差对关键光子电路影响的分析结果和数值计算;我们考虑了各种误差模型,并开发了新的指标来衡量生成的光子状态的质量。我们回顾了其中一位作者提出的减轻可区分性误差的蒸馏协议。我们还回顾了部分作者通过相干态近似高效模拟光子电路的最新成果。我们研究了普遍集理论、单元 t 设计和光子学之间的一些相互作用:虽然我们在这个方向上阐述的许多结果可能为专家所熟知,但我们的目的是让更广泛的量子信息科学界注意到这些结果,并以这个界别更熟悉的方式来表述它们。我们通过转换表示理论的一个结果证明,当 $\dim V\geq 2$ 时,$U(V)$ 中不存在非通用的无限闭合 2$ 设计。因此,我们观察到线性光学单元构成了 1$ 设计,但不是 2$ 设计。最后,我们应用 Oszmaniec 和 Zimbor\'{a}s 的一个结果来证明,用任何非难 SNAP 门来增强线性光学单元足以实现普遍性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Advancing quantum networking: some tools and protocols for ideal and noisy photonic systems
Quantum networking at many scales will be critical to future quantum technologies and experiments on quantum systems. Photonic links enable quantum networking. They will connect co-located quantum processors to enable large-scale quantum computers, provide links between distant quantum computers to support distributed, delegated, and blind quantum computing, and will link distant nodes in space enabling new tests of fundamental physics. Here, we discuss recent work advancing photonic tools and protocols that support quantum networking. We provide analytical results and numerics for the effect of distinguishability errors on key photonic circuits; we considered a variety of error models and developed new metrics for benchmarking the quality of generated photonic states. We review a distillation protocol by one of the authors that mitigates distinguishability errors. We also review recent results by a subset of the authors on the efficient simulation of photonic circuits via approximation by coherent states. We study some interactions between the theory of universal sets, unitary t-designs, and photonics: while many of the results we state in this direction may be known to experts, we aim to bring them to the attention of the broader quantum information science community and to phrase them in ways that are more familiar to this community. We prove, translating a result from representation theory, that there are no non-universal infinite closed $2$-designs in $U(V)$ when $\dim V \geq 2$. As a consequence, we observe that linear optical unitaries form a $1$-design but not a 2-design. Finally, we apply a result of Oszmaniec and Zimbor\'{a}s to prove that augmenting the linear optical unitaries with any nontrivial SNAP gate is sufficient to achieve universality.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信