Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > quant-ph > arXiv:2407.01196

Help | Advanced Search

Quantum Physics

arXiv:2407.01196 (quant-ph)
[Submitted on 1 Jul 2024 ]

Title: Implementation of a scalable universal two-qubit quantum processor with electron and nuclear spins in a trapped ion

Title: 具有被捕获离子中电子自旋和核自旋的可扩展通用两量子比特量子处理器的实现

Authors:Ji Bian, Teng Liu, Qifeng Lao, Min Ding, Huiyi Zhang, Xinxin Rao, Pengfei Lu, Le Luo
Abstract: Increasing the quantum information processing power with limited number of hosts is vital for achieving quantum advantage. Here we propose a novel scheme that achieves a scalable n-ion-2n-qubit quantum processor utilizing four internal levels of each ion, and experimentally implement a 1-ion-2-qubit universal processor using the valence electron spin and nuclear spin of a single 171Yb+ ion. Fidelities of single-qubit and two-qubit gates are around 0.98 obtained by quantum process tomography. Additionally, the Grover's algorithm is implemented with a successful rate exceeding 0.99. We provide explicit scaling-up protocols based on standard laser-less and laser-based frameworks, and further demonstrate that the electron/nuclear-spin scheme allows less demanding two-qubit entangling gates between different ions. The replacement of some inter-atomic gates by intra-atomic gates could increase the fidelity of some quantum circuits. Our work paves the way towards achieving 2n-times increase in the size of quantum computational Hilbert space with n ions.
Abstract: 增加有限数量的宿主量子信息处理能力对于实现量子优势至关重要。 这里我们提出一种新方案,利用每个离子的四个内部能级,实现可扩展的n离子-2n量子比特量子处理器,并实验实现了使用单个171Yb+离子的价电子自旋和核自旋的1离子-2量子比特通用处理器。 通过量子过程层析成像获得的单量子比特和双量子比特门保真度约为0.98。 此外,Grover算法的实现成功率超过0.99。 我们提供了基于标准无激光和有激光框架的明确扩展协议,并进一步证明电子/核自旋方案允许在不同离子之间实现要求更低的双量子比特纠缠门。 将一些原子间门替换为原子内门可以提高某些量子电路的保真度。 我们的工作为实现n离子情况下量子计算希尔伯特空间大小2n倍的增长铺平了道路。
Subjects: Quantum Physics (quant-ph)
Cite as: arXiv:2407.01196 [quant-ph]
  (or arXiv:2407.01196v1 [quant-ph] for this version)
  https://doi.org/10.48550/arXiv.2407.01196
arXiv-issued DOI via DataCite

Submission history

From: Ji Bian [view email]
[v1] Mon, 1 Jul 2024 11:40:45 UTC (597 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • HTML (experimental)
  • TeX Source
  • Other Formats
license icon view license
Current browse context:
quant-ph
< prev   |   next >
new | recent | 2024-07

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号