Abstract Qudit‐based quantum gates offer several advantages over qubit‐based counterparts, such as higher information density, the ability to address more complex problems, and richer quantum operations. In this study, three realistic protocols are presented for implementing a 44‐dimensional (16D) two‐qudit controlled‐SUM (CSUM) gate, where the 4D control qudit and 4D target qudit are encoded in the polarization degree of freedom (DoF) and spatial DoF of two photons, respectively. The first protocol is implemented exclusively using linear optical elements without auxiliary resources, making it feasible with current optical technologies and achieving an efficiency of 1/9. The second protocol utilizes photon scattering by a microcavity‐quantum‐dot system, enabling the 16D CSUM gate to operate deterministically without postselection. The third protocol introduces an error‐heralded mechanism based on the second protocol, theoretically achieving unity fidelity. Moreover, all protocols operate without ancillary photons, offering the advantages of compact circuits and low cost while further promoting the development of high‐dimensional quantum computation.Abstract Qudit‐based quantum gates offer several advantages over qubit‐based counterparts, such as higher information density, the ability to address more complex problems, and richer quantum operations. In this study, three realistic protocols are presented for implementing a 44‐dimensional (16D) two‐qudit controlled‐SUM (CSUM) gate, where the 4D control qudit and 4D target qudit are encoded in the polarization degree of freedom (DoF) and spatial DoF of two photons, respectively. The first protocol is implemented exclusively using linear optical elements without auxiliary resources, making it feasible with current optical technologies and achieving an efficiency of 1/9. The second protocol utilizes photon scattering by a microcavity‐quantum‐dot system, enabling the 16D CSUM gate to operate deterministically without postselection. The third protocol introduces an error‐heralded mechanism based on the second protocol, theoretically achieving unity fidelity. Moreover, all protocols operate without ancillary photons, offering the advantages of compact circuits and low cost while further promoting the development of high‐dimensional quantum computation.

arXiv:2504.17388Advanced Quantum TechnologiesAug 4, 20253 citations

Universal quantum computation with qudits

Ming‐Xing Luo, Xiaojun Wang

Science China Physics Mechanics and AstronomyJun 27, 201482 citations

Parallelism for quantum computation with qudits

Dianne Prost O’Leary, Gavin K. Brennen, Stephen S. Bullock

Robust quantum computation with $d$ -level quantum systems (qudits) poses two requirements: fast, parallel quantum gates and high-fidelity two-qudit gates. We first describe how to implement parallel single-qudit operations. It is by now well known that any single-qudit unitary can be decomposed into a sequence of Givens rotations on two-dimensional subspaces of the qudit state space. Using a coupling graph to represent physically allowed couplings between pairs of qudit states, we then show that the logical depth (time) of the parallel gate sequence is equal to the height of an associated tree. The implementation of a given unitary can then optimize the tradeoff between gate time and resources used. These ideas are illustrated for qudits encoded in the ground hyperfine states of the alkali-metal atoms $^{87}\mathrm{Rb}$ and $^{133}\mathrm{Cs}$ . Second, we provide a protocol for implementing parallelized nonlocal two-qudit gates using the assistance of entangled qubit pairs. Using known protocols for qubit entanglement purification, this offers the possibility of high-fidelity two-qudit gates.Robust quantum computation with $d$-level quantum systems (qudits) poses two requirements: fast, parallel quantum gates and high-fidelity two-qudit gates. We first describe how to implement parallel single-qudit operations. It is by now well known that any single-qudit unitary can be decomposed into a sequence of Givens rotations on two-dimensional subspaces of the qudit state space. Using a coupling graph to represent physically allowed couplings between pairs of qudit states, we then show that the logical depth (time) of the parallel gate sequence is equal to the height of an associated tree. The implementation of a given unitary can then optimize the tradeoff between gate time and resources used. These ideas are illustrated for qudits encoded in the ground hyperfine states of the alkali-metal atoms $^{87}\mathrm{Rb}$ and $^{133}\mathrm{Cs}$. Second, we provide a protocol for implementing parallelized nonlocal two-qudit gates using the assistance of entangled qubit pairs. Using known protocols for qubit entanglement purification, this offers the possibility of high-fidelity two-qudit gates.

arXiv:quant-ph/0603081Physical Review ASep 28, 200660 citations

Agnostic learning of qudit stabilizer states

Wentao Qi, Boyan Xu, Shiguang Feng +1 more

Learning a classical description of a quantum state is a fundamental task in quantum computation. Among the most important classes of quantum states are stabilizer states, which play a central role in quantum error correction and fault-tolerant computation. To mitigate the effects of realistic noise, agnostic learning of stabilizer states has emerged as a natural and well-motivated problem. Recently, Chen \textit{et al.} [STOC'25, p. 429-438] resolved this problem for qubit systems by using a stabilizer bootstrapping framework. However, the agnostic learning of qudit stabilizer states remains largely unexplored, since the qudit setting introduces fundamental structural differences that prevent a direct generalization of existing qubit techniques. In this paper, we successfully generalize the stabilizer bootstrapping framework to qudit systems and present the first efficient quantum algorithm for agnostic learning of qudit stabilizer states. Specifically, given copies of an unknown $n$ -qudit pure state $|ψ\rangle$ that has fidelity $τ$ with some stabilizer state, our algorithm outputs a stabilizer state $|φ\rangle$ such that $\left| \braket{φ|ψ} \right|^2 \geq τ- \varepsilon$ with high probability. The algorithm uses only single-copy and four-copy measurements, and its sample and time complexity scale as $(d/τ)^{O(d^2 \log(1/τ))} \cdot \mathrm{poly}(n, 1/\varepsilon)$ , where the dimension $d$ is an odd prime. As a direct corollary, our algorithm enables efficient estimation of the magic of a quantum state, as quantified by its stabilizer fidelity. Completing the picture, we also present a streamlined algorithm for the high-fidelity regime $τ> \cos^2(π/8)$ , establishing a qudit analogue of the threshold-based approach in prior qubit work.Learning a classical description of a quantum state is a fundamental task in quantum computation. Among the most important classes of quantum states are stabilizer states, which play a central role in quantum error correction and fault-tolerant computation. To mitigate the effects of realistic noise, agnostic learning of stabilizer states has emerged as a natural and well-motivated problem. Recently, Chen \textit{et al.} [STOC'25, p. 429-438] resolved this problem for qubit systems by using a stabilizer bootstrapping framework. However, the agnostic learning of qudit stabilizer states remains largely unexplored, since the qudit setting introduces fundamental structural differences that prevent a direct generalization of existing qubit techniques. In this paper, we successfully generalize the stabilizer bootstrapping framework to qudit systems and present the first efficient quantum algorithm for agnostic learning of qudit stabilizer states. Specifically, given copies of an unknown $n$-qudit pure state $|ψ\rangle$ that has fidelity $τ$ with some stabilizer state, our algorithm outputs a stabilizer state $|φ\rangle$ such that $\left| \braket{φ|ψ} \right|^2 \geq τ- \varepsilon$ with high probability. The algorithm uses only single-copy and four-copy measurements, and its sample and time complexity scale as $(d/τ)^{O(d^2 \log(1/τ))} \cdot \mathrm{poly}(n, 1/\varepsilon)$, where the dimension $d$ is an odd prime. As a direct corollary, our algorithm enables efficient estimation of the magic of a quantum state, as quantified by its stabilizer fidelity. Completing the picture, we also present a streamlined algorithm for the high-fidelity regime $τ> \cos^2(π/8)$, establishing a qudit analogue of the threshold-based approach in prior qubit work.

quant-pharXiv:2607.15559Jul 20, 20260 citations

Components for high-fidelity quantum computing

David Peter Divincenzo

Jan 1, 20180 citations

Efficient quantum circuits for qudits

Gavin K. Brennen, Stephen S. Bullock, Dianne Prost O’Leary

Bulletin of the American Physical SocietyMar 24, 20050 citations

Robust quantum computation with

d

-level quantum systems (qudits) poses two requirements: fast, parallel quantum gates and high-fidelity two-qudit gates. We first describe how to implement parallel single-qudit operations. It is by now well known that any single-qudit unitary can be decomposed into a sequence of Givens rotations on two-dimensional subspaces of the qudit state space. Using a coupling graph to represent physically allowed couplings between pairs of qudit states, we then show that the logical depth (time) of the parallel gate sequence is equal to the height of an associated tree. The implementation of a given unitary can then optimize the tradeoff between gate time and resources used. These ideas are illustrated for qudits encoded in the ground hyperfine states of the alkali-metal atoms

^{87}\mathrm{Rb}

and

^{133}\mathrm{Cs}

. Second, we provide a protocol for implementing parallelized nonlocal two-qudit gates using the assistance of entangled qubit pairs. Using known protocols for qubit entanglement purification, this offers the possibility of high-fidelity two-qudit gates.

n

-qudit pure state

|ψ\rangle

that has fidelity

τ

with some stabilizer state, our algorithm outputs a stabilizer state

|φ\rangle

such that

\left| \braket{φ|ψ} \right|^2 \geq τ- \varepsilon

with high probability. The algorithm uses only single-copy and four-copy measurements, and its sample and time complexity scale as

(d/τ)^{O(d^2 \log(1/τ))} \cdot \mathrm{poly}(n, 1/\varepsilon)

, where the dimension

d

is an odd prime. As a direct corollary, our algorithm enables efficient estimation of the magic of a quantum state, as quantified by its stabilizer fidelity. Completing the picture, we also present a streamlined algorithm for the high-fidelity regime

τ> \cos^2(π/8)

, establishing a qudit analogue of the threshold-based approach in prior qubit work.