1
Return

Near-Heisenberg-limit Quantum Computing

delete2025-11-19
delete0
delete
OA
AI
F
Frank Z. Wang
DOI:10.1145/3769850delete
deleteOriginal
deleteShare
deleteSave
View PDF
Abstract

Abstract

En 中文
Quantum computing is fundamentally limited by the Planck constant (\(h = 6.63\ \times {{10}^{ - 34}}\ J \cdot s\)) through the Heisenberg Limit. The energy consumption over a given time, or the speed of processing information with a specific energy budget, is a core research focus in quantum computing. To date, the smallest action (the energy-time cost) achieved is approximately \({{10}^{ - 29}}J \cdot s\), using a giant spin qubit composed of 20 spins. In our study, we achieved an action of \(1.66\ \times {{10}^{ - 34}}\ J \cdot s\) to reversibly manipulate a single spin qubit through a spin-spin magnetic interaction experiment. By adhering to the principle of least action, our theoretical and experimental results establish the minimal action required. Our findings highlight the potential of spin-qubit quantum computers as accelerators for computation-intensive applications, such as AI and Post-Quantum Cryptography, since they exhibit several unique advantages: 1. High energy efficiency (by approaching the Heisenberg limit as well as the Landauer bound); 2. High-density integration (with just an atom/ion per qubit); 3. Long coherence times (tens of seconds); 4. High-fidelity (98%); and 5. Fault tolerance (through decoherence-free subspaces).
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

A
ACM Transactions on Quantum Computing
IF:
6.8
Papers:
539
Citations:
508

Organization

No organization information available
Cited Papers

Cited Papers

Citing Papers

Citing Papers