Scholarlink

<p>Spin qubits in silicon are strong contenders for the realization of a practical quantum computer, having demonstrated single- and two-qubit gates with fidelities above the fault-tolerant threshold, and entanglement of three qubits. However, maintaining high-fidelity operations while increasing the qubit count remains challenging and therefore only two-qubit algorithms have been executed. Here we utilize a four-qubit silicon processor with all control fidelities above the fault-tolerant threshold and demonstrate a three-qubit Grover’s search algorithm with a ~95% probability of finding the marked state. Our processor is made of three phosphorus atoms precision-patterned into isotopically pure silicon, which localise one electron. The long coherence times of the qubits enable single-qubit fidelities above 99.9% for all qubits. Moreover, the efficient single-pulse multi-qubit operations enabled by the electron–nuclear hyperfine interaction facilitate controlled-Z gates between all pairs of nuclear spins with fidelities above 99% when using the electron as an ancilla. These control fidelities, combined with high-fidelity non-demolition readout of all nuclear spins, allow the creation of a three-qubit Greenberger–Horne–Zeilinger state with 96.2% fidelity. Looking ahead, coupling neighbouring nuclear spin registers, as the one shown here, via electron–electron exchange may enable larger, fault-tolerant quantum processors.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Grover’s algorithm in a four-qubit silicon processor above the fault-tolerant threshold

  • 期刊论文

  • 出版模式：

    开放获取

  • 发表日期：

    2025年2月20日

查看全文
  • I. Thorvaldson,
  • D. Poulos,
  • C. M. Moehle,
  • S. H. Misha,
  • H. Edlbauer,
  • J. Reiner,
  • H. Geng,
  • B. Voisin,
  • M. T. Jones,
  • M. B. Donnelly,
  • L. F. Peña,
  • C. D. Hill,
  • C. R. Myers,
  • J. G. Keizer,
  • Y. Chung,
  • S. K. Gorman,
  • L. Kranz,
  • M. Y. Simmons

摘要

Spin qubits in silicon are strong contenders for the realization of a practical quantum computer, having demonstrated single- and two-qubit gates with fidelities above the fault-tolerant threshold, and entanglement of three qubits. However, maintaining high-fidelity operations while increasing the qubit count remains challenging and therefore only two-qubit algorithms have been executed. Here we utilize a four-qubit silicon processor with all control fidelities above the fault-tolerant threshold and demonstrate a three-qubit Grover’s search algorithm with a ~95% probability of finding the marked state. Our processor is made of three phosphorus atoms precision-patterned into isotopically pure silicon, which localise one electron. The long coherence times of the qubits enable single-qubit fidelities above 99.9% for all qubits. Moreover, the efficient single-pulse multi-qubit operations enabled by the electron–nuclear hyperfine interaction facilitate controlled-Z gates between all pairs of nuclear spins with fidelities above 99% when using the electron as an ancilla. These control fidelities, combined with high-fidelity non-demolition readout of all nuclear spins, allow the creation of a three-qubit Greenberger–Horne–Zeilinger state with 96.2% fidelity. Looking ahead, coupling neighbouring nuclear spin registers, as the one shown here, via electron–electron exchange may enable larger, fault-tolerant quantum processors.