REVIEW 7 cited by
Qudits and high-dimensional quantum computing
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
Qudits and high-dimensional quantum computing
read the original abstract
Qudit is a multi-level computational unit alternative to the conventional 2-level qubit. Compared to qubit, qudit provides a larger state space to store and process information, and thus can provide reduction of the circuit complexity, simplification of the experimental setup and enhancement of the algorithm efficiency. This review provides an overview of qudit-based quantum computing covering a variety of topics ranging from circuit building, algorithm design, to experimental methods. We first discuss the qudit gate universality and a variety of qudit gates including the pi/8 gate, the SWAP gate, and the multi-level-controlled gate. We then present the qudit version of several representative quantum algorithms including the Deutsch-Jozsa algorithm, the quantum Fourier transform, and the phase estimation algorithm. Finally we discuss various physical realizations for qudit computation such as the photonic platform, iron trap, and nuclear magnetic resonance.
Forward citations
Cited by 7 Pith papers
-
Gauss law codes and vacuum codes from lattice gauge theories
Gauss law codes identify the full gauge-invariant sector as the code space while vacuum codes restrict to the matter vacuum, with the two shown to be unitarily equivalent for finite gauge groups.
-
Preparing multi-qudit states in a definite-weight subspace
A deterministic algorithm prepares arbitrary multi-qudit states in definite-weight subspaces via Gray codes for multiset permutations and applies it to SU(3) Bethe states and SU(d) Dicke states.
-
Preparing multi-qudit states in a definite-weight subspace
A deterministic algorithm prepares arbitrary multi-qudit states in a definite-weight subspace via Gray-code ordering of multiset permutations, reducing preparation to controlled 2-qudit Gray rotations, and is demonstr...
-
Fault-Tolerant Resource Comparison of Qudit and Qubit Encodings for Diagonal Quadratic Operators
Qudit encodings for quadratic diagonal evolutions require exponentially stronger synthesis advantages than qubits to win asymptotically in product formulas but can yield constant-factor savings in LCU at low d.
-
Fault-Tolerant Resource Comparison of Qudit and Qubit Encodings for Diagonal Quadratic Operators
For diagonal quadratic evolutions, qubit encodings are asymptotically cheaper than qudit encodings in both Trotter and LCU settings, but small-dimension qudits can win under favorable synthesis or code-switching assumptions.
-
Fault-Tolerant Resource Comparison of Qudit and Qubit Encodings for Diagonal Quadratic Operators
The paper derives explicit finite-d break-even synthesis costs for qudit vs. qubit encodings of diagonal quadratic operators in product-formula and LCU simulations, identifying low-d regions where qudits yield savings.
-
Signature of paraparticles: a minimal Gedankenexperiment
A minimal Gedankenexperiment reduces the signature of Z2×Z2-graded permutation-group paraparticles to a chirality test that can be simulated with qudits.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.