Helios achieves 98 qubits with single-qubit gate infidelity 2.5(1)×10^{-5}, two-qubit 7.9(2)×10^{-4}, and SPAM 4.8(6)×10^{-4}, enabling circuits beyond classical simulation.
Title resolution pending
5 Pith papers cite this work. Polarity classification is still indexing.
5
Pith papers citing it
citation-role summary
method 1
citation-polarity summary
roles
method 1polarities
use method 1representative citing papers
A donor-cluster array architecture in silicon uses shared electrons and natural hyperfine distributions for individual spin addressability, tunable inter-cluster exchange, and high-fidelity gates to enable scalable quantum computing.
Geometry choices in bivariate-bicycle qLDPC syndrome extraction determine leading correlated error structure via weighted exposure, which correlates strongly with logical error rates and is reduced by biplanar layouts.
A new scheme for fault-tolerant quantum computation on qLDPC codes achieves constant qubit overhead and time overhead O(d^{1+o(1)}) for good codes, faster than prior code surgery methods for a<2.
Magnetic domain walls are positioned as a platform for scalable quantum computation architectures leveraging their quantum effects and mobility.
citing papers explorer
-
Helios: A 98-qubit trapped-ion quantum computer
Helios achieves 98 qubits with single-qubit gate infidelity 2.5(1)×10^{-5}, two-qubit 7.9(2)×10^{-4}, and SPAM 4.8(6)×10^{-4}, enabling circuits beyond classical simulation.
-
Scalable Spin Qubit Architecture with Donor-Cluster Arrays in Silicon
A donor-cluster array architecture in silicon uses shared electrons and natural hyperfine distributions for individual spin addressability, tunable inter-cluster exchange, and high-fidelity gates to enable scalable quantum computing.
-
Geometry-induced correlated noise in qLDPC syndrome extraction
Geometry choices in bivariate-bicycle qLDPC syndrome extraction determine leading correlated error structure via weighted exposure, which correlates strongly with logical error rates and is reduced by biplanar layouts.
-
Accelerating Fault-Tolerant Quantum Computation with Good qLDPC Codes
A new scheme for fault-tolerant quantum computation on qLDPC codes achieves constant qubit overhead and time overhead O(d^{1+o(1)}) for good codes, faster than prior code surgery methods for a<2.
-
Perspective: Quantum Computing on Magnetic Racetrack
Magnetic domain walls are positioned as a platform for scalable quantum computation architectures leveraging their quantum effects and mobility.