REVIEW 4 cited by
Quantum logic operations and algorithms in a single 25-level atomic qudit
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Quantum logic operations and algorithms in a single 25-level atomic qudit
read the original abstract
Scaling quantum computers remains a substantial scientific and technological challenge. Leveraging the full range of intrinsic degrees of freedom in quantum systems offers a promising route towards enhanced algorithmic performance and hardware efficiency. We experimentally study the use of $^{137}$Ba$^+$ ions for quantum information processing, achieving high-fidelity state preparation and readout of up to 25 internal levels, thus forming a 25-dimensional qudit. By probing superpositions of up to 24 states, we investigate how errors scale with qudit dimension $d$ and identify the primary error sources affecting quantum coherence. Additionally, we demonstrate high-dimensional qudit operations by implementing a 3-qubit Bernstein-Vazirani algorithm and a 4-qubit Toffoli gate with a single ion. Our findings suggest that quantum computing architectures based on large-dimensional qudits hold significant promise.
Forward citations
Cited by 4 Pith papers
-
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.
-
Qudit-native simulation of the Potts model
A qudit-native circuit decomposition maps the Potts-model interaction onto a symmetric light-shift gate or an aux-level MS-gate sequence, and Trotterized evolution reproduces DQPT signatures in a q=3 chain.
-
Transition-aware decomposition of single-qudit gates
For any connected selection-rule graph, any single-qudit unitary decomposes into at most d(d−1)/2 allowed two-level pulses via a BFS-based QR-style algorithm.
-
Computational and physical complexity of synthesizing random multi-qudit quantum states and unitary operators
Computational complexity of random multi-qudit states and unitaries scales exponentially with qudit number, while physical complexity scales more slowly.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.