⚛️ quantum physics

Qubit-qudit entanglement transfer in defect centers with high-spin nuclei

This paper proposes a deterministic scheme for accumulating maximal entanglement between long-lived nuclear spin qudits in defect centers by leveraging the Ising component of hyperfine interactions to transfer entanglement from electron spin qubits, a method applicable to systems like the germanium vacancy in diamond.

Original authors: W. -R. Hannes, Guido Burkard

Published 2026-07-10

📖 5 min read🧠 Deep dive

CC BY 4.0

Original authors: W. -R. Hannes, Guido Burkard

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). ✨ This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

Imagine you have two friends, Alice and Bob, who live in different cities. They want to share a secret code so powerful that whatever happens to one instantly affects the other, no matter the distance. This is called entanglement, the "spooky action at a distance" that quantum physicists love.

Usually, Alice and Bob use simple "coins" (qubits) to share this secret. But in this paper, the authors, Wolf-Rüdiger Hannes and Guido Burkard, propose a wilder idea: what if they used giant spinning tops instead? These tops are "qudits," which can have many more sides than a coin (up to 11 sides for certain atoms!). The goal is to build a super-secure quantum internet where these multi-sided tops hold the memory, while simple coins do the talking.

The Magic Trick: Passing the Baton

Here's the problem: Alice and Bob can't just hand their giant tops to each other. They can only talk to their local "messenger" (an electron spin) and then send a signal to the other person. The authors suggest a clever relay race.

The Messenger Run: Alice and Bob's messengers (electrons) meet in the middle (via a photon, a particle of light) and get entangled.
The Handoff: Alice's messenger whispers a secret to her giant top, and Bob's does the same.
The Check: The messengers are measured. If the result is "good," the entanglement is successfully transferred to the giant tops.

The paper shows that by repeating this handoff process, you can stack up entanglement, layer by layer, until the two giant tops are perfectly linked.

The Golden Rule: Powers of Two

The authors discovered a very specific "sweet spot" for this trick. If your giant top has a number of sides that is a power of two (like 2, 4, 8, or 16), the process is a guaranteed success. It's like a perfectly tuned machine: you just set the angles right, and bam, you get a perfect link every single time, without needing to fiddle with the tops in between.

However, if your top has a weird number of sides (like 3, 5, or 6), the machine gets sticky.

The Bad News: The paper explicitly rules out the idea that you can get a perfect, guaranteed link for these "weird" numbers without doing extra work. You can't just run the same simple relay race and expect a perfect result for a 3-sided top.
The Workaround: For these tricky numbers, you have two choices:
1. Take a chance: You can try the relay race, but you might only succeed 1 out of 3 times (or 1 out of 6, etc.).
2. Do some extra gymnastics: You can stop in the middle of the race to "drive" (manually rotate) the tops to fix the angles. This makes it work perfectly, but it's more complicated.

The "No-Driving" Dream

The authors are particularly excited about a "driving-free" scheme. Imagine trying to balance a stack of plates without ever touching them once they start spinning. For the "power of two" tops, this is possible. You just set the initial spin and the timing, and the physics does the rest. This is a huge deal because manually "driving" these tops can be slow and difficult, especially for atoms with high spin.

Who Can Use This?

This isn't just a theory for a blackboard. The authors point to real-world candidates that could use this trick:

Germanium Vacancies in Diamond: Specifically, the isotope $^{73}$ Ge, which has a nuclear spin of 9/2. This gives it 10 possible levels (sides). Since 10 isn't a power of two, you'd have to leave two levels empty to make it an 8-sided top (which is $2^3$ ) to get that perfect, guaranteed result.
Other Contenders: They mention other atoms like $^{123}$ Sb (12 sides) and $^{209}$ Bi (10 sides) in silicon, and even $^{14}$ NV centers in diamond (3 sides).

How Sure Are They?

The authors have proven the math behind this. They derived the exact conditions needed for the transfer to work.

They simulated the results for various scenarios (like the 3-sided top) and found that while perfect, guaranteed entanglement is impossible without extra driving for non-power-of-two dimensions, you can still get very close or use a probabilistic method.
They suggest that this scheme is applicable to a wide range of materials, but they haven't built the actual machine yet. They are saying, "Here is the blueprint, and the math says it works."

The Big Picture

Think of this as upgrading from a walkie-talkie (qubits) to a high-definition video call (qudits). The authors have figured out how to send the video signal through the same old wires, provided you follow the right rhythm. If you have a screen size that fits a perfect power of two, the picture is crystal clear and guaranteed. If your screen is a weird size, you might get some static or need to adjust the focus manually.

This work suggests that we can build much larger, more complex quantum networks using these high-spin atoms, potentially allowing for more powerful quantum computers and unhackable communication networks in the future. But for now, it's a solid theoretical foundation showing us exactly how to make the magic happen.

Technical Summary: Qubit-qudit entanglement transfer in defect centers with high-spin nuclei

Problem Statement
The paper addresses the challenge of generating maximally entangled states between two distant memory qudits in a quantum network, where the qudits are encoded in high-spin nuclear spins ( $I \ge 1$ ) and interact only via their respective electron spin qubits. While high-spin nuclei offer large Hilbert spaces ( $d = 2I + 1$ ) beneficial for quantum error correction and measurement-based quantum computing (MBQC), transferring entanglement from a communication qubit (electron) to a memory qudit (nucleus) in a deterministic and efficient manner remains a significant hurdle. Specifically, the authors investigate whether maximal entanglement can be generated deterministically without requiring complex, continuous driving of the nuclear spins, leveraging the native Ising component of the hyperfine interaction.

Methodology
The authors propose a scheme based on a general model of a quantum network node consisting of an electron spin (communication qubit) and a central nuclear spin (memory qudit). The protocol operates in discrete iterations:

Entanglement Generation: Distant electron spins are projected into an entangled state (typically a Bell state $|\Psi^\pm\rangle$ or cluster state) via a spin-photon interface (e.g., single-photon interference in a Mach-Zehnder interferometer).
Controlled Interaction: In each node, a controlled gate $C(U_{K,0}, U_{K,1})$ is applied between the electron and nuclear spins. This gate exploits the secular (Ising) part of the hyperfine interaction ( $A_\parallel S_z I_z$ ), which induces a conditional phase rotation on the nuclear spin depending on the electron state.
Measurement: The electron spins are measured in the $X$ basis. The nuclear spin state is projected based on the measurement outcomes.

The core of the methodology involves deriving "transferability conditions" for the effective gate acting on the nuclear subspace. The authors analyze the conditions required for:

Deterministic complete transfer: Where entanglement is fully transferred regardless of measurement outcomes, doubling the Schmidt rank in each step.
Deterministic maximal entanglement: Specifically for the final iteration where the target dimension $d$ is reached.
Probabilistic schemes: Where post-selection of measurement outcomes is used to achieve maximal entanglement.

The study considers various qudit dimensions $d$ , distinguishing between cases where $d$ is an integer power of two ( $d=2^n$ ) and other values. It also explores schemes with and without intermediate nuclear spin driving (local unitary operations).

Key Contributions and Results

Deterministic Accumulation for $d=2^n$ : The paper demonstrates that if the qudit dimension $d$ is an integer power of two, maximal entanglement can be generated deterministically and without intermittent nuclear spin driving. By initializing the nuclear spins in an equal superposition state $|+d\rangle$ and applying a specific sequence of CPHASE angles $\phi^{(\nu)} = 2^\nu \pi / d$ , the protocol achieves a complete transfer of 1 ebit of entanglement in each iteration. After $n$ iterations, the system reaches a maximally entangled state with $E = \log_2 d$ .
Conditions for Odd and Non-Power-of-Two Dimensions: For dimensions where $d$ is not a power of two (e.g., $d=3$ ), the authors show that a complete deterministic transfer of 1 ebit is impossible if the previous state has an odd Schmidt rank. They derive necessary and sufficient conditions for the final iteration to generate maximal entanglement, which often requires specific resource states (e.g., cluster states) and precise tuning of parameters.
Schemes for $d=3$ and $d=6$ : For the specific case of $d=3$ , the authors construct a scheme that achieves maximal entanglement with a success rate of 50% without driving, or deterministically if nuclear spin driving is allowed between iterations. They extend this logic to $d=6$ by virtually reducing the dimension during initialization.
Probabilistic Protocols: For general $d$ , the authors propose probabilistic schemes using post-selection. A universal phase set $\phi^{(\nu)} = 2\pi/2^\nu$ is identified which generates maximal entanglement with a success rate of $1/d$ for $d \neq 2^n$ when using Bell states as resources.
Multipartite Entanglement: The scheme is extended to larger networks. By successively applying the two-node protocol to neighboring nodes in a chain, the authors show that genuine multipartite entanglement, specifically qudit Greenberger-Horne–Zeilinger (GHZ) states, can be generated. For $M$ nodes, the success rate for generating a GHZ state is $1/d^{M-1}$ under specific post-selection conditions.
Applicability to Physical Systems: The model is shown to be applicable to several candidate systems, including the $^{73}$ Ge germanium vacancy (GeV) in diamond ( $I=9/2$ ), the $^{14}$ NV center ( $I=1$ ), and implanted group-V donors in silicon (e.g., $^{123}$ Sb, $^{209}$ Bi). The authors note that for systems with strong hyperfine coupling, the process is fast (nanosecond scale), well within electron coherence times.

Significance and Claims
The authors claim that their work provides a solution to the problem of generating maximally entangled states between distant high-spin nuclear memories using only the native Ising hyperfine coupling. The primary significance lies in the demonstration that:

Scalability: The scheme allows for the deterministic accumulation of entanglement in qudits of dimension $d=2^n$ without the need for complex, continuous driving of nuclear spins, which is often slow or difficult to implement for high-spin systems.
Hardware Efficiency: The protocol imposes no additional demands on controlling hardware compared to standard qubit schemes, aside from the initialization and potential final state correction.
Versatility: The approach is applicable to a wide range of solid-state defect centers and donor systems, offering a pathway to utilize the large Hilbert spaces of high-spin nuclei for quantum communication and MBQC.
Robustness: The deterministic nature of the $d=2^n$ protocol is robust against the specific value of the electron-nuclear energy splitting parameter ( $\xi$ ), provided the resource state is a Bell state.

The paper concludes that while deterministic maximal entanglement for arbitrary $d$ without driving is generally not possible, the proposed schemes (including those with intermittent driving or post-selection) offer viable pathways for high-dimensional quantum networking. The work serves as a theoretical foundation for extending existing qubit-based quantum network architectures to higher-dimensional qudit platforms.