Pith. sign in

REVIEW

Exploring the feasibility of probabilistic and deterministic quantum gates between T centers in silicon

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

arxiv 2508.06474 v2 pith:ZBWAOD2B submitted 2025-08-08 quant-ph physics.optics

Exploring the feasibility of probabilistic and deterministic quantum gates between T centers in silicon

classification quant-ph physics.optics
keywords photonefficiencyfidelityinterference-basedschemeschemessiliconachieve
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

T center defects in silicon provide an attractive platform for quantum technologies due to their unique spin properties and compatibility with mature silicon technologies. We investigate several gate protocols between single T centers, including two probabilistic photon interference-based schemes, a near-deterministic photon scattering gate, and a deterministic magnetic dipole-based scheme. In particular, we study a photon interference-based scheme with feedback which can achieve success probabilities above 50%, and use the photon-count decomposition method to perform the first analytical calculations of its entanglement fidelity and efficiency while accounting for imperfections. We also calculate the fidelity and efficiency of the other schemes. Finally, we compare the performance of all the schemes, considering current and near-future experimental capabilities. In particular, we find that the photon interference-based scheme with feedback has the potential to achieve competitive efficiency and fidelity, making it interesting to explore experimentally.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.