• Suppr超能文献
  • 文献检索
  • 文档翻译
  • 深度研究
  • 学术资讯
  • Suppr Zotero 插件Zotero 插件
定价套餐&价格
应用&插件
Suppr Zotero 插件Zotero 插件浏览器插件Mac 客户端Win 客户端微信小程序
定价
会员套餐积分包API 积分包
服务
文献检索文档翻译深度研究API 文档MCP 服务
关于我们
关于 Suppr公司介绍联系我们用户协议隐私条款
关注我们

Suppr 超能文献

核心技术专利:CN118964589B侵权必究
粤ICP备2023148730 号-1Suppr @ 2026
  1. 首页
  2. 分享广场
  3. 《Nature》量子计算新突破:从硬件到算法的全面进展

《Nature》量子计算新突破:从硬件到算法的全面进展

文献检索用户6739发表于 2026年05月02日 00:34114阅读
检索问题

Nature 近期关于量子计算的文献

在量子计算领域,近期在《Nature》系列期刊上发表的文献涵盖了从量子计算的实用性、硬件平台、错误缓解与容错、算法开发到量子纠缠和计量等多个前沿方向。以下是对这些文献的详细梳理和分析:

1. 量子计算的实用性和计算优势

多项研究探讨了量子计算在达到容错阶段之前的实用性以及如何展示量子计算的计算优势。

  • 容错前的量子计算实用性: 一项由IBM团队(包括Young-Seok Kim和Abhinav Kandala)发表的研究提供了在达到容错之前量子计算实用性的证据 。这表明即使在当前嘈杂的中等规模量子(NISQ)时代,量子计算仍然具有潜在的应用价值。
  • 随机电路采样的计算优势: Google团队(包括Alexis Morvan和Benjamin Villalonga)通过实现随机电路采样算法,实验证明了两个可观测的相变,并用统计模型进行了解释 。这项工作通过在弱噪声相中对67个量子比特进行32个循环的随机电路采样实验,证明了其计算成本超出了现有经典超级计算机的能力,从而确立了量子处理器可以达到一个稳定、计算复杂的阶段 。这代表了量子计算优势的又一重要里程碑。
  • 光子处理器实现量子计算优势: Xanadu Quantum Technologies团队(包括Lars S. Madsen和Jonathan Lavoie)利用可编程光子处理器实现了量子计算优势 。他们的Borealis处理器使用时间复用和光子数分辨架构,在生成特定分布的样本方面,比最好的经典算法和超级计算机快了5000多万倍。该实验记录了多达219个光子,平均光子数为125,是迄今为止最大规模的玻色采样实验之一,验证了光子学作为量子计算平台关键技术特征的有效性 。

2. 量子计算硬件平台与技术进展

多篇文献详细介绍了各种量子计算平台的最新进展,包括光子、超导、离子阱和自旋量子比特等。

  • 光子量子计算平台:
    • Praevium Research团队(PsiQuantum团队成员,包括Koen Alexander和Matthew Wingert)展示了一种可制造的用于光子量子计算的平台 。他们基准测试了一套单片集成的硅光子模块,用于生成、操纵、组网和检测预示光子量子比特。实验结果显示,双轨光子量子比特的状态制备和测量保真度达到99.98% ± 0.01%,独立光子源之间的Hong-Ou-Mandel (HOM) 量子干涉可见度达到99.50% ± 0.25%,两量子比特融合保真度达到99.22% ± 0.12%,以及片间量子比特互连保真度达到99.72% ± 0.04%(以光子检测为条件,未考虑损耗) 。该团队还预告了下一代技术,如低损耗氮化硅(SiN)波导、高效率光子数分辨探测器(PNRDs)和用于高速切换的钛酸钡(BTO)电光相位移器等,以解决损耗问题并提高性能 。
    • Peking University、Shanxi University和King University的团队(包括Xinyu Jia和Jianwei Wang)报告了在集成微梳中确定性地生成连续变量八模式纠缠 。该芯片产生低于阈值的多模压缩真空光频梳,通过违反van Loock-Furusawa判据,证明了八模式状态的不可分离性和在数百兆赫兹边带频率上的超模多方纠缠。这项工作展示了连续变量集成光子量子器件在促进量子计算、网络和传感方面的潜力 。
  • 超导量子计算平台:
    • Google团队(包括Xiao Mi和Yu Chen)在一项研究中,利用超导处理器实现了时间晶体本征态序 。他们采用时间反演协议来量化外部退相干的影响,并利用量子典型性来规避密集采样本征谱的指数成本。通过实验有限尺寸分析,他们还确定了从时间离散晶体(DTC)出相的相变,为在量子处理器上研究非平衡物相提供了可扩展的方法 。
    • Google Quantum AI团队(包括T. I. Andersen和Aditya Locharla)在超导处理器中实现了图顶点的非阿贝尔编织 。他们通过实验验证了任意子的融合规则并进行编织,以实现其统计行为。这项工作为非阿贝尔编织提供了新见解,并可能通过未来引入纠错实现拓扑保护,为容错量子计算开辟道路 。
    • IMEC团队(包括Jacques Van Damme和K. De Greve)展示了在300毫米晶圆上采用先进CMOS制造工艺生产超导量子比特 。这项研究标志着一种新的、大规模、真正CMOS兼容的超导量子计算处理器制造方法的出现 。
  • 离子阱量子计算平台:
    • ETH Zurich团队(包括Shreyans Jain和Jonathan Home)实现了一种用于量子计算的微加工潘宁离子阱 。该设计通过用3特斯拉磁场取代射频场,消除了传统离子阱的限制。他们展示了对离子在捕获平面内进行任意传输的能力,并实现了对离子进行完全量子控制。潘宁微阱的这一独特特征改进了量子电荷耦合器件架构的连接性和灵活性,为实现大规模离子阱量子计算、量子模拟和量子传感提供了便利 。
  • 自旋量子比特平台:
    • QuTech团队(包括Jurgen Dijkema和Lieven M. K. Vandersypen)展示了通过超导谐振器在250微米距离上实现的两个半导体自旋量子比特之间的腔介导iSWAP振荡 。这种分离距离比该平台常用直接相互作用机制大几个数量级。他们在谐振器通过虚拟光子介导自旋-自旋耦合的机制下操作系统,并报告了两个自旋布居的受控频率反相振荡。这些观察结果与自旋量子比特的iSWAP振荡一致,并表明可以在10纳秒内实现纠缠操作,预示着片上自旋量子比特模块可扩展网络的潜力 。

3. 量子错误缓解与容错

错误是当前量子计算面临的核心挑战之一,多项研究聚焦于错误缓解和容错策略。

  • 错误缓解:
    • Google团队(包括Thomas E. O’Brien和F. D. Malone)验证了利用纯态期望的错误缓解策略,用于模拟配对电子系统 。他们比较了在多达20个超导量子比特上,基于时间或空间加倍量子资源的错误缓解性能,观察到错误减少了一到两个数量级。研究还发现,错误缓解的增益与系统规模呈多项式抑制关系,但外推结果表明,要实现经典上不可行的变分化学模拟,还需要大幅改进硬件 。
    • Harvard University、Université Claude Bernard Lyon 1等机构的团队(包括Yihui Quek和Jens Eisert)提出了量子错误缓解局限性的指数级更紧密界限 。他们将错误缓解与统计推断问题联系起来,表明即使在当前实验的浅电路深度下,最坏情况下也需要超多项式数量的样本才能估计无噪声可观测量的期望值。他们的研究表明,噪声引起的“扰乱”(scrambling)可能在比之前认为的更小的深度下发生,并对量子机器学习中的核估计、变分量子算法中噪声引起的“贫瘠高原”的出现,以及在噪声存在下估计期望值或制备哈密顿量基态的指数级量子加速构成了限制 。
  • 容错量子计算:
    • Google Quantum AI团队(包括Rajeev Acharya和Jarrod R. McClean)通过扩展表面代码逻辑量子比特来抑制量子错误 。他们的实验结果首次证明了量子纠错能够通过增加量子比特数量来提高性能,为达到计算所需的逻辑错误率指明了方向 。
    • IBM团队(包括Riddhi Swaroop Gupta和Benjamin J. Brown)实现了具有超收支平衡保真度的魔术态编码 。这证明了可以使用纠错来提高嘈杂量子比特逻辑门的质量。他们还展示了通过自适应电路(根据中间电路测量结果改变电路元件)可以增加魔术态的产量,这是许多纠错子程序所需的基本能力。这项原型技术有望减少大规模量子计算架构中生产高保真魔术态所需的物理量子比特数量 。
    • Austrian Academy of Sciences和The University of Tokyo团队(包括Hayata Yamasaki和Masato Koashi)提出了一种时间高效、常数空间开销的容错量子计算协议 。与传统需要大量物理量子比特的容错协议不同,他们的方法通过连接多个小型量子码而不是单一大型量子低密度奇偶校验码来实现常数空间开销,并仅需准多对数时间开销。该协议即使解码器运行时间不恒定也具有容错性,使得在可行空间开销和可忽略不计时间开销下,实现大量量子加速成为可能 。
    • IBM团队(包括Sergey Bravyi和Theodore J. Yoder)提出了一种高阈值和低开销的容错量子内存 。他们介绍了一个具有0.75%物理错误率阈值的代码家族,这在过去20年中是错误阈值方面的领先代码。该代码家族的综合征测量循环需要n个辅助量子比特和深度为8的电路,其中包括CNOT门、量子比特初始化和测量。他们展示了在物理错误率为0.1%的假设下,使用288个物理量子比特,可以保存12个逻辑量子比特近100万个综合征循环,而表面代码需要近3000个物理量子比特才能达到相同性能。这些发现使得低开销容错量子内存的演示在近期量子处理器的能力范围内 。

4. 量子算法与模拟

研究人员也在积极开发新的量子算法,并利用量子计算进行物理模拟。

  • 高效量子热模拟: California Institute of Technology、University of Copenhagen和Alfréd Rényi Institute of Mathematics团队(包括Chi-Fang Chen和András Gilyén)提出了一种高效的量子热模拟算法 。该算法类似于马尔可夫链蒙特卡罗(MCMC)方法,表现出详细平衡、尊重局部性,并可作为开放量子系统热化问题的玩具模型。这项新构造有望在量子计算和物理科学及其他领域的应用中发挥重要作用 。

5. 量子纠缠与计量

量子纠缠是量子力学的基本特征,也是量子技术增强能力的核心。

  • 集体测量实现量子增强传感: Australian National University、University of Cambridge和Nanyang Technological University的团队(包括Lorcán O. Conlon和Syed M. Assad)在超导、离子阱和光子系统上实验演示了理论最优的单次和两次拷贝集体测量,用于同时估计两个非对易量子比特旋转 。这使得他们能够实现量子增强传感,即使在高退相干水平下,计量增益仍然存在,并为不确定性原理的解释提供了基本见解。这项工作也预示了未来量子增强传感网络的发展方向 。

6. 分布式量子计算

扩展量子计算规模的另一个途径是分布式量子计算。

  • 通过光网络链路实现分布式量子计算: University of Oxford团队(包括D. Main和D. M. Lucas)展示了通过光网络链路实现分布式量子计算 。由于光子可以与各种系统接口,这种多功能的分布式量子计算架构为各种物理平台的大规模量子计算提供了可行的途径 。

总结

近期《Nature》系列期刊在量子计算领域发表的文献揭示了该领域的蓬勃发展和多方面突破。主要亮点包括:

  • 实用性与计算优势的证据: 研究证实了在容错实现之前量子计算的实用性,并通过随机电路采样和光子处理器展示了超越经典超级计算机的计算优势 。
  • 多样化的硬件平台: 光子、超导、离子阱和自旋量子比特平台都在不断进步,特别是光子平台在可制造性和纠缠态生成方面取得了显著成果 ,超导平台在实现复杂量子现象和CMOS兼容制造方面展现潜力 ,离子阱在微型化和灵活性方面取得进展 ,以及自旋量子比特实现了远距离纠缠操作 。
  • 错误缓解与容错是核心: 错误缓解策略能够显著降低错误率,但其局限性也已被深入探讨 。同时,容错量子计算的关键技术,如表面代码的扩展 、魔术态编码的突破 、以及低开销容错协议和量子内存的开发 ,都取得了重要进展,为未来大规模量子计算机的实现奠定了基础。
  • 新算法和应用探索: 新的量子算法,如高效量子热模拟,正在被开发,有望在物理科学等领域发挥作用 。
  • 量子纠缠与网络: 量子纠缠的集体测量为量子增强传感提供了新途径 ,而分布式量子计算通过光网络链路为实现大规模量子计算提供了可扩展的架构 。

这些研究共同描绘了量子计算领域一个充满活力和快速发展的图景,从基础科学突破到工程实现,都在为最终实现大规模、实用的量子计算机而努力。

References

1Evidence for the utility of quantum computing before fault toleranceOpenAlex

Young‐Seok Kim, Andrew Eddins, Sajant Anand, et al.
.

2A manufacturable platform for photonic quantum computingOpenAlex

PsiQuantum team, Koen Alexander, Avishai Benyamini, et al.
for quantum computing with photons. We benchmark a set of monolithically integrated silicon-photonics-based modules to generate, manipulate, network and detect heralded photonic qubits, demonstrating dual-rail photonic qubits with 99.98% ± 0.01% state preparation and measurement fidelity, Hong-Ou-Mandel (HOM) quantum interference between independent photon sources with 99.50% ± 0.25% visibility, two-qubit fusion with 99.22% ± 0.12% fidelity and a chip-to-chip qubit interconnect with 99.72% ± 0.04% fidelity, conditional on photon detection and not accounting for loss. We preview a selection of next-generation technologies: low-loss silicon nitride (SiN) waveguides and components to address loss, as well as fabrication-tolerant photon sources, high-efficiency photon-number-resolving detectors (PNRDs), low-loss chip-to-fibre coupling and barium titanate (BTO) electro-optic phase shifters for high-performance fast switching.

3Approaching optimal entangling collective measurements on quantum computing platformsOpenAlex

Lorcán O. Conlon, Tobias Vogl, Christian D. Marciniak, et al.
Entanglement is a fundamental feature of quantum mechanics and holds great promise for enhancing metrology and communications. Much of the focus of quantum metrology so far has been on generating highly entangled quantum states that offer better sensitivity, per resource, than what can be achieved classically. However, to reach the ultimate limits in multi-parameter quantum metrology and quantum information processing tasks, collective measurements, which generate entanglement between multiple copies of the quantum state, are necessary. Here, we experimentally demonstrate theoretically optimal single- and two-copy collective measurements for simultaneously estimating two non-commuting qubit rotations. This allows us to implement quantum-enhanced sensing, for which the metrological gain persists for high levels of decoherence, and to draw fundamental insights about the interpretation of the uncertainty principle. We implement our optimal measurements on superconducting, trapped-ion and photonic systems, providing an indication of how future quantum-enhanced sensing networks may look.

4Phase transitions in random circuit samplingOpenAlex

Alexis Morvan, Benjamin Villalonga, Xiao Mi, et al.
. Nevertheless, quantum algorithms' outputs can be trivialized by noise, making them susceptible to classical computation spoofing. Here, by implementing an algorithm for random circuit sampling, we demonstrate experimentally that two phase transitions are observable with cross-entropy benchmarking, which we explain theoretically with a statistical model. The first is a dynamical transition as a function of the number of cycles and is the continuation of the anti-concentration point in the noiseless case. The second is a quantum phase transition controlled by the error per cycle; to identify it analytically and experimentally, we create a weak-link model, which allows us to vary the strength of the noise versus coherent evolution. Furthermore, by presenting a random circuit sampling experiment in the weak-noise phase with 67 qubits at 32 cycles, we demonstrate that the computational cost of our experiment is beyond the capabilities of existing classical supercomputers. Our experimental and theoretical work establishes the existence of transitions to a stable, computationally complex phase that is reachable with current quantum processors.

5Quantum machine learningOpenAlex

Jacob Biamonte, Péter Wittek, Nicola Pancotti, et al.

6Distributed quantum computing across an optical network linkOpenAlex

D. Main, P. Drmota, D. P. Nadlinger, et al.
. As photons can be interfaced with a variety of systems, the versatile DQC architecture demonstrated here provides a viable pathway towards large-scale quantum computing for a range of physical platforms.

7Purification-based quantum error mitigation of pair-correlated electron simulationsOpenAlex

Thomas E. O’Brien, G. Anselmetti, Fotios Gkritsis, et al.
Abstract An important measure of the development of quantum computing platforms has been the simulation of increasingly complex physical systems. Before fault-tolerant quantum computing, robust error-mitigation strategies were necessary to continue this growth. Here, we validate recently introduced error-mitigation strategies that exploit the expectation that the ideal output of a quantum algorithm would be a pure state. We consider the task of simulating electron systems in the seniority-zero subspace where all electrons are paired with their opposite spin. This affords a computational stepping stone to a fully correlated model. We compare the performance of error mitigations on the basis of doubling quantum resources in time or in space on up to 20 qubits of a superconducting qubit quantum processor. We observe a reduction of error by one to two orders of magnitude below less sophisticated techniques such as postselection. We study how the gain from error mitigation scales with the system size and observe a polynomial suppression of error with increased resources. Extrapolation of our results indicates that substantial hardware improvements will be required for classically intractable variational chemistry simulations.

8Efficient quantum thermal simulationOpenAlex

Chi-Fang Chen, Michael J. Kastoryano, Fernando G. S. L. Brandão, et al.
. Here we propose an efficient quantum algorithm for thermal simulation that-akin to MCMC methods-exhibits detailed balance, respects locality and serves as a toy model for thermalization in open quantum systems. The enduring impact of MCMC methods suggests that our new construction may play an equally important part in quantum computing and applications in the physical sciences and beyond.

9Penning micro-trap for quantum computingOpenAlex

Shreyans Jain, Tobias Sägesser, Pavel Hrmo, et al.
. Here we realize a micro-fabricated Penning ion trap that removes these restrictions by replacing the radio-frequency field with a 3 T magnetic field. We demonstrate full quantum control of an ion in this setting, as well as the ability to transport the ion arbitrarily in the trapping plane above the chip. This unique feature of the Penning micro-trap approach opens up a modification of the quantum charge-coupled device architecture with improved connectivity and flexibility, facilitating the realization of large-scale trapped-ion quantum computing, quantum simulation and quantum sensing.

10Exponentially tighter bounds on limitations of quantum error mitigationOpenAlex

Yihui Quek, Daniel Stilck França, Sumeet Khatri, et al.
Quantum error mitigation has been proposed as a means to combat unwanted and unavoidable errors in near-term quantum computing without the heavy resource overheads required by fault-tolerant schemes. Recently, error mitigation has been successfully applied to reduce noise in near-term applications. In this work, however, we identify strong limitations to the degree to which quantum noise can be effectively 'undone' for larger system sizes. Our framework rigorously captures large classes of error-mitigation schemes in use today. By relating error mitigation to a statistical inference problem, we show that even at shallow circuit depths comparable to those of current experiments, a superpolynomial number of samples is needed in the worst case to estimate the expectation values of noiseless observables, the principal task of error mitigation. Notably, our construction implies that scrambling due to noise can kick in at exponentially smaller depths than previously thought. Noise also impacts other near-term applications by constraining kernel estimation in quantum machine learning, causing an earlier emergence of noise-induced barren plateaus in variational quantum algorithms and ruling out exponential quantum speed-ups in estimating expectation values in the presence of noise or preparing the ground state of a Hamiltonian.

11Quantum computational advantage with a programmable photonic processorOpenAlex

Lars S. Madsen, Fabian Laudenbach, Mohsen Falamarzi. Askarani, et al.
, using a time-multiplexed and photon-number-resolving architecture. On average, it would take more than 9,000 years for the best available algorithms and supercomputers to produce, using exact methods, a single sample from the programmed distribution, whereas Borealis requires only 36 μs. This runtime advantage is over 50 million times as extreme as that reported from earlier photonic machines. Ours constitutes a very large GBS experiment, registering events with up to 219 photons and a mean photon number of 125. This work is a critical milestone on the path to a practical quantum computer, validating key technological features of photonics as a platform for this goal.

12Encoding a magic state with beyond break-even fidelityOpenAlex

Riddhi Swaroop Gupta, Neereja Sundaresan, Thomas Alexander, et al.
, namely, that we can use error correction to improve the quality of logic gates with noisy qubits. Moreover, we show that the yield of magic states can be increased using adaptive circuits, in which the circuit elements are changed depending on the outcome of mid-circuit measurements. This demonstrates an essential capability needed for many error-correction subroutines. We believe that our prototype will be invaluable in the future as it can reduce the number of physical qubits needed to produce high-fidelity magic states in large-scale quantum-computing architectures.

13Cavity-mediated iSWAP oscillations between distant spinsOpenAlex

Jurgen Dijkema, Xiao Xue, Patrick Harvey-Collard, et al.
Direct interactions between quantum particles naturally fall off with distance. However, future quantum computing architectures are likely to require interaction mechanisms between qubits across a range of length scales. In this work, we demonstrate a coherent interaction between two semiconductor spin qubits 250 μm apart using a superconducting resonator. This separation is several orders of magnitude larger than for the commonly used direct interaction mechanisms in this platform. We operate the system in a regime in which the resonator mediates a spin-spin coupling through virtual photons. We report the anti-phase oscillations of the populations of the two spins with controllable frequency. The observations are consistent with iSWAP oscillations of the spin qubits, and suggest that entangling operations are possible in 10 ns. These results hold promise for scalable networks of spin qubit modules on a chip.

14Suppressing quantum errors by scaling a surface code logical qubitOpenAlex

Google Quantum AI, Rajeev Acharya, I. L. Aleǐner, et al.
excluding this event). We accurately model our experiment, extracting error budgets that highlight the biggest challenges for future systems. These results mark an experimental demonstration in which quantum error correction begins to improve performance with increasing qubit number, illuminating the path to reaching the logical error rates required for computation.

15Time-crystalline eigenstate order on a quantum processorOpenAlex

Xiao Mi, Matteo Ippoliti, Chris Quintana, et al.
. Our work employs a time-reversal protocol to quantify the impact of external decoherence, and leverages quantum typicality to circumvent the exponential cost of densely sampling the eigenspectrum. Furthermore, we locate the phase transition out of the DTC with an experimental finite-size analysis. These results establish a scalable approach to studying non-equilibrium phases of matter on quantum processors.

16Non-Abelian braiding of graph vertices in a superconducting processorOpenAlex

Google Quantum AI and Collaborators, T. I. Andersen, Yuri D. Lensky, et al.
to create and braid them. This allows us to experimentally verify the fusion rules of the anyons and braid them to realize their statistics. We then study the prospect of using the anyons for quantum computation and use braiding to create an entangled state of anyons encoding three logical qubits. Our work provides new insights about non-Abelian braiding and, through the future inclusion of error correction to achieve topological protection, could open a path towards fault-tolerant quantum computing.

17Advanced CMOS manufacturing of superconducting qubits on 300 mm wafersOpenAlex

Jacques Van Damme, S. Massar, R. Acharya, et al.
and more process optimization. This result marks the advent of an alternative and new, large-scale, truly CMOS-compatible fabrication method for superconducting quantum computing processors.

18Time-Efficient Constant-Space-Overhead Fault-Tolerant Quantum ComputationOpenAlex

Hayata Yamasaki, Masato Koashi
Abstract Scaling up quantum computers to attain substantial speedups over classical computing requires fault tolerance. Conventionally, protocols for fault-tolerant quantum computation demand excessive space overheads by using many physical qubits for each logical qubit. A more recent protocol using quantum analogues of low-density parity-check codes needs only a constant space overhead that does not grow with the number of logical qubits. However, the overhead in the processing time required to implement this protocol grows polynomially with the number of computational steps. To address these problems, here we introduce an alternative approach to constant-space-overhead fault-tolerant quantum computing using a concatenation of multiple small-size quantum codes rather than a single large-size quantum low-density parity-check code. We develop techniques for concatenating different quantum Hamming codes with growing size. As a result, we construct a low-overhead protocol to achieve constant space overhead and only quasi-polylogarithmic time overhead simultaneously. Our protocol is fault tolerant even if a decoder has a non-constant runtime, unlike the existing constant-space-overhead protocol. This code concatenation approach will make possible a large class of quantum speedups with feasibly bounded space overhead yet negligibly short time overhead.

19High-threshold and low-overhead fault-tolerant quantum memoryOpenAlex

Sergey Bravyi, Andrew W. Cross, Jay Gambetta, et al.
that for 20 years was the leading code in terms of error threshold. The syndrome measurement cycle for a length-n code in our family requires n ancillary qubits and a depth-8 circuit with CNOT gates, qubit initializations and measurements. The required qubit connectivity is a degree-6 graph composed of two edge-disjoint planar subgraphs. In particular, we show that 12 logical qubits can be preserved for nearly 1 million syndrome cycles using 288 physical qubits in total, assuming the physical error rate of 0.1%, whereas the surface code would require nearly 3,000 physical qubits to achieve said performance. Our findings bring demonstrations of a low-overhead fault-tolerant quantum memory within the reach of near-term quantum processors.

20Continuous-variable multipartite entanglement in an integrated microcombOpenAlex

Xinyu Jia, Chonghao Zhai, Xuezhi Zhu, et al.
. Here we report the deterministic generation of a continuous-variable eight-mode entanglement on an integrated optical chip. The chip delivers a quantum microcomb that produces multimode squeezed-vacuum optical frequency combs below the threshold. We verify the inseparability of our eight-mode state and demonstrate supermode multipartite entanglement over hundreds of megahertz sideband frequencies through violation of the van Loock-Furusawa criteria. By measuring the full matrices of nullifier correlations with sufficiently low off-diagonal noises, we characterize multipartite entanglement structures, which are approximate to the expected cluster-type structures for finite squeezing. This work shows the potential of continuous-variable integrated photonic quantum devices for facilitating quantum computing, networking and sensing.
内容由 AI 生成,仅供参考,请仔细甄别