• 文献检索
  • 文档翻译
  • 深度研究
  • 学术资讯
  • Suppr Zotero 插件Zotero 插件
  • 邀请有礼
  • 套餐&价格
  • 历史记录
应用&插件
Suppr Zotero 插件Zotero 插件浏览器插件Mac 客户端Windows 客户端微信小程序
定价
高级版会员购买积分包购买API积分包
服务
文献检索文档翻译深度研究API 文档MCP 服务
关于我们
关于 Suppr公司介绍联系我们用户协议隐私条款
关注我们

Suppr 超能文献

核心技术专利:CN118964589B侵权必究
粤ICP备2023148730 号-1Suppr @ 2026

文献检索

告别复杂PubMed语法,用中文像聊天一样搜索,搜遍4000万医学文献。AI智能推荐,让科研检索更轻松。

立即免费搜索

文件翻译

保留排版,准确专业,支持PDF/Word/PPT等文件格式,支持 12+语言互译。

免费翻译文档

深度研究

AI帮你快速写综述,25分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验

用光量子电路解决独立集问题。

Solving independent set problems with photonic quantum circuits.

机构信息

Hefei National Research Center for Physical Sciences at the Microscale and School of Physical Sciences, University of Science and Technology of China, Hefei 230026, China.

CAS Center for Excellence in Quantum Information and Quantum Physics, University of Science and Technology of China, Shanghai 201315, China.

出版信息

Proc Natl Acad Sci U S A. 2023 May 30;120(22):e2212323120. doi: 10.1073/pnas.2212323120. Epub 2023 May 22.

DOI:10.1073/pnas.2212323120
PMID:37216545
原文链接:https://pmc.ncbi.nlm.nih.gov/articles/PMC10235971/
Abstract

An independent set (IS) is a set of vertices in a graph such that no edge connects any two vertices. In adiabatic quantum computation [E. Farhi, ., Science 292, 472-475 (2001); A. Das, B. K. Chakrabarti, Rev. Mod. Phys. 80, 1061-1081 (2008)], a given graph (, ) can be naturally mapped onto a many-body Hamiltonian [Formula: see text], with edges [Formula: see text] being the two-body interactions between adjacent vertices [Formula: see text]. Thus, solving the IS problem is equivalent to finding all the computational basis ground states of [Formula: see text]. Very recently, non-Abelian adiabatic mixing (NAAM) has been proposed to address this task, exploiting an emergent non-Abelian gauge symmetry of [Formula: see text] [B. Wu, H. Yu, F. Wilczek, Phys. Rev. A 101, 012318 (2020)]. Here, we solve a representative IS problem [Formula: see text] by simulating the NAAM digitally using a linear optical quantum network, consisting of three C-Phase gates, four deterministic two-qubit gate arrays (DGA), and ten single rotation gates. The maximum IS has been successfully identified with sufficient Trotterization steps and a carefully chosen evolution path. Remarkably, we find IS with a total probability of 0.875(16), among which the nontrivial ones have a considerable weight of about 31.4%. Our experiment demonstrates the potential advantage of NAAM for solving IS-equivalent problems.

摘要

独立集(IS)是图中的顶点集合,其中没有边连接任意两个顶点。在绝热量子计算中[E. Farhi 等,Science 292, 472-475 (2001);A. Das, B. K. Chakrabarti, Rev. Mod. Phys. 80, 1061-1081 (2008)],给定的图(,)可以自然地映射到一个多体哈密顿量[公式:见文本],其中边[公式:见文本]是相邻顶点[公式:见文本]之间的二体相互作用。因此,解决 IS 问题相当于找到[公式:见文本]的所有计算基态。最近,非阿贝尔绝热混合(NAAM)已被提出用于解决这个任务,利用[公式:见文本]的一个新兴非阿贝尔规范对称性[B. Wu, H. Yu, F. Wilczek, Phys. Rev. A 101, 012318 (2020)]。在这里,我们通过使用由三个 C-Phase 门、四个确定性两量子比特门阵列(DGA)和十个单旋转门组成的线性光学量子网络,对具有代表性的 IS 问题[公式:见文本]进行数字模拟,成功地解决了该问题。通过足够的 Trotterization 步骤和精心选择的演化路径,成功地识别出了最大的 IS。值得注意的是,我们发现 IS 的总概率为 0.875(16),其中非平凡的 IS 具有相当大的权重约 31.4%。我们的实验证明了 NAAM 在解决 IS 等效问题方面的潜在优势。

https://cdn.ncbi.nlm.nih.gov/pmc/blobs/7653/10235971/e46bb4940069/pnas.2212323120fig05.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/7653/10235971/8e6f35647a69/pnas.2212323120fig01.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/7653/10235971/393032c791a9/pnas.2212323120fig02.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/7653/10235971/cd1e8aac7ee9/pnas.2212323120fig03.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/7653/10235971/f1b9d1387c08/pnas.2212323120fig04.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/7653/10235971/e46bb4940069/pnas.2212323120fig05.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/7653/10235971/8e6f35647a69/pnas.2212323120fig01.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/7653/10235971/393032c791a9/pnas.2212323120fig02.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/7653/10235971/cd1e8aac7ee9/pnas.2212323120fig03.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/7653/10235971/f1b9d1387c08/pnas.2212323120fig04.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/7653/10235971/e46bb4940069/pnas.2212323120fig05.jpg

相似文献

1
Solving independent set problems with photonic quantum circuits.用光量子电路解决独立集问题。
Proc Natl Acad Sci U S A. 2023 May 30;120(22):e2212323120. doi: 10.1073/pnas.2212323120. Epub 2023 May 22.
2
Quantum Speedup and Mathematical Solutions of Implementing Bio-Molecular Solutions for the Independent Set Problem on IBM Quantum Computers.量子加速和在 IBM 量子计算机上实现独立集问题的生物分子解决方案的数学解。
IEEE Trans Nanobioscience. 2021 Jul;20(3):354-376. doi: 10.1109/TNB.2021.3075733. Epub 2021 Jun 30.
3
Bioinspired Quantum Oracle Circuits for Biomolecular Solutions of the Maximum Cut Problem.受生物启发的量子查询电路在最大切割问题的生物分子解决方案中的应用。
IEEE Trans Nanobioscience. 2024 Jul;23(3):499-506. doi: 10.1109/TNB.2024.3395420. Epub 2024 Jul 1.
4
Quantum adiabatic theorem for unbounded Hamiltonians with a cutoff and its application to superconducting circuits.具有截断的无界哈密顿量的量子绝热定理及其在超导电路中的应用。
Philos Trans A Math Phys Eng Sci. 2023 Jan 23;381(2241):20210407. doi: 10.1098/rsta.2021.0407. Epub 2022 Dec 5.
5
Quantum theory of spin waves for helical ground states in a hollandite lattice.钙钛矿晶格中螺旋基态自旋波的量子理论。
J Phys Condens Matter. 2018 Dec 5;30(48):485803. doi: 10.1088/1361-648X/aae9bc.
6
Experimental implementation of local adiabatic evolution algorithms by an NMR quantum information processor.利用核磁共振量子信息处理器对局部绝热演化算法进行实验实现。
J Magn Reson. 2005 Dec;177(2):285-98. doi: 10.1016/j.jmr.2005.08.004. Epub 2005 Sep 19.
7
Quantum tunneling and quantum walks as algorithmic resources to solve hard K-SAT instances.量子隧穿和量子游走作为解决困难K - 可满足性实例的算法资源。
Sci Rep. 2021 Aug 19;11(1):16845. doi: 10.1038/s41598-021-95801-1.
8
Cyclic permutations for qudits in d dimensions.d维量子位的循环排列
Sci Rep. 2019 Apr 19;9(1):6337. doi: 10.1038/s41598-019-42708-7.
9
From quantum link models to D-theory: a resource efficient framework for the quantum simulation and computation of gauge theories.从量子链接模型到D理论:规范理论量子模拟与计算的资源高效框架
Philos Trans A Math Phys Eng Sci. 2022 Feb 7;380(2216):20210068. doi: 10.1098/rsta.2021.0068. Epub 2021 Dec 20.
10
An Algorithm to detect balancing of iterated line sigraph.一种检测迭代线符号图平衡性的算法。
Springerplus. 2015 Nov 17;4(1):704. doi: 10.1186/s40064-015-1499-0. eCollection 2015.

引用本文的文献

1
Finding independent sets in large-scale graphs with a coherent Ising machine.使用相干伊辛机在大规模图中寻找独立集。
Sci Adv. 2025 Feb 14;11(7):eads7223. doi: 10.1126/sciadv.ads7223.

本文引用的文献

1
Hardware Efficient Quantum Simulation of Non-Abelian Gauge Theories with Qudits on Rydberg Platforms.基于里德堡平台上的量子位对非阿贝尔规范理论进行硬件高效量子模拟。
Phys Rev Lett. 2022 Oct 14;129(16):160501. doi: 10.1103/PhysRevLett.129.160501.
2
Quantum optimization of maximum independent set using Rydberg atom arrays.利用里德堡原子阵列对最大独立集进行量子优化。
Science. 2022 Jun 10;376(6598):1209-1215. doi: 10.1126/science.abo6587. Epub 2022 May 5.
3
A graph placement methodology for fast chip design.一种用于快速芯片设计的图形布局方法。
Nature. 2021 Jun;594(7862):207-212. doi: 10.1038/s41586-021-03544-w. Epub 2021 Jun 9.
4
Probing dynamical phase transitions with a superconducting quantum simulator.利用超导量子模拟器探测动力学相变。
Sci Adv. 2020 Jun 17;6(25):eaba4935. doi: 10.1126/sciadv.aba4935. eCollection 2020 Jun.
5
Experimental Ten-Photon Entanglement.实验性十光子纠缠
Phys Rev Lett. 2016 Nov 18;117(21):210502. doi: 10.1103/PhysRevLett.117.210502. Epub 2016 Nov 15.
6
A coherent Ising machine for 2000-node optimization problems.一个用于 2000 节点优化问题的连贯伊辛机。
Science. 2016 Nov 4;354(6312):603-606. doi: 10.1126/science.aah4243. Epub 2016 Oct 20.
7
Digitized adiabatic quantum computing with a superconducting circuit.超导电路中的数字化绝热量子计算。
Nature. 2016 Jun 9;534(7606):222-6. doi: 10.1038/nature17658.
8
Digital quantum simulation of fermionic models with a superconducting circuit.利用超导电路对费米子模型进行数字量子模拟。
Nat Commun. 2015 Jul 8;6:7654. doi: 10.1038/ncomms8654.
9
Experimental determination of Ramsey numbers.实验确定 Ramsey 数。
Phys Rev Lett. 2013 Sep 27;111(13):130505. doi: 10.1103/PhysRevLett.111.130505. Epub 2013 Sep 25.
10
A biological solution to a fundamental distributed computing problem.一种基本分布式计算问题的生物学解决方案。
Science. 2011 Jan 14;331(6014):183-5. doi: 10.1126/science.1193210.