SearcharxivSearch

arXiv · 2404.15069

Hopping of the center-of-mass of single G centers in silicon-on-insulator

Abstract

Among the wealth of single fluorescent defects recently detected in silicon, the G center catches interest for its telecom single-photon emission that could be coupled to a metastable electron spin triplet. The G center is a unique defect where the standard Born-Oppenheimer approximation breaks down as one of its atoms can move between 6 lattice sites under optical excitation. The impact of this atomic reconfiguration on the photoluminescence properties of G centers is still largely unknown, especially in silicon-on-insulator (SOI) samples. Here, we investigate the displacement of the center-of-mass of the G center in silicon. We show that single G defects in SOI exhibit a multipolar emission and zero-phonon line fine structures with splittings up to $\sim1$ meV, both indicating a motion of the defect central atom over time. Combining polarization and spectral analysis at the single-photon level, we evidence that the reconfiguration dynamics are drastically different from the one of the unperturbed G center in bulk silicon. The SOI structure freezes the delocalization of the G defect center-of-mass and as a result, enables to isolate linearly polarized optical lines. Under above-bandgap optical excitation, the central atom of G centers in SOI behaves as if it were in a 6-slot roulette wheel, randomly alternating between localized crystal sites at each optical cycle. Comparative measurements in a bulk silicon sample and ab initio calculations highlight that strain is likely the dominant perturbation impacting the G center geometry. These results shed light on the importance of the atomic reconfiguration dynamics to understand and control the photoluminescence properties of the G center in silicon. More generally, these findings emphasize the impact of strain fluctuations inherent to SOI wafers for future quantum integrated photonics applications based on color centers in silicon.

Explore related subjects

Keep this discovery

BibTeXRIS

Alrik Durand, Yoann Baron, Péter Udvarhelyi, Félix Cache, Krithika V. R., Tobias Herzig, Mario Khoury, Sébastien Pezzagna, Jan Meijer, Jean-Michel Hartmann, Shay Reboh, Marco Abbarchi, Isabelle Robert-Philip, Adam Gali, Jean-Michel Gérard, Vincent Jacques, Guillaume Cassabois, Anaïs Dréau. 2024-04-23. Hopping of the center-of-mass of single G centers in silicon-on-insulator. https://doi.org/10.1103/physrevx.14.041071

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Probing the Error-Mitigation Threshold with Matrix Product States

Quantum error mitigation relies on accurate noise characterization, but mismatches between the actual and characterized noise can be amplified and drive a sharp threshold between successful and failed mitigation. In random circuits, this threshold maps onto a random-field Ising transition, but previous exact numerics were limited to small one-dimensional and all-to-all systems, leaving explicit two-dimensional architectures unresolved. We develop a fixed-bond-dimension matrix-product-state method for the replicated transfer dynamics that extends threshold calculations beyond exact propagation while retaining the finite-size signatures of the transition. At system sizes beyond previous exact studies, we recover the predicted absence of a threshold for quenched disorder in 1D, obtain a sharper annealed all-to-all critical point, and resolve architecture-dependent finite-depth thresholds in 2D square and heavy-hex circuits. These results establish replicated tensor-network dynamics as a practical tool for probing error-mitigation thresholds in large and higher-dimensional noisy circuits.

quant-ph

Low-cost algorithm-to-execution framework for surface-code quantum computing

The execution of useful quantum algorithms on fault-tolerant processors requires more than a mapping from logical gates to encoded operations: the spatial organization, non-Clifford resource supply, and execution schedule must also be determined while keeping physical overhead within practical limits. Although the theoretical hierarchy from logical circuits to fault-tolerant operations is well established, these implementation choices are often specified and optimized separately. Here we develop a low-cost algorithm-to-execution framework for surface-code quantum computing. From hierarchical algorithm descriptions, it constructs dependency-preserving logical schedules and an executable workload capturing logical interactions, operation parallelism, and time-resolved non-Clifford demand, thereby linking logical computation to surface-code organization, resource-state preparation, and fault-tolerant execution in a traceable workflow. We apply the framework to twenty benchmark circuits across seven algorithm families and a hierarchically composed application-scale elliptic-curve discrete-logarithm workload. Physical costs vary substantially even for circuits with similar logical resource counts. Under our direct-rotation calibration, non-Clifford implementation selection reduces space-time volume by up to 241.5 times versus an all-synthesis baseline for the QAOA amplitude-amplification workload. Circuit-specific surface-code layouts reduce routed-latency estimates for all twenty benchmarks; thirteen also reduce space-time volume because communication savings outweigh added spatial overhead. These results show that low-cost fault-tolerant execution depends on computation scheduling and organization, not aggregate logical resource counts alone.

quant-ph

Sample-optimal learning of stabilizer states

It is well-known that learning a pure $n$-qubit stabilizer state $|\psi\rangle$ both requires, and can be accomplished with, access to a number of copies of $|\psi\rangle$ linear in $n$. However, the precise constant coefficient of this scaling does not appear to have been determined. Here we prove that $L_\delta(n)$, the smallest number of copies from which a quantum procedure can identify any stabilizer state with failure probability at most $0<\delta<1/8$, satisfies $n+\lceil\log_2(1/\delta)\rceil-3\leq L_\delta(n)\leq n+\left\lceil\log_2(1/\delta)\right\rceil+4$. We present a polynomial-time quantum learning algorithm that saturates this bound, achieving a constant factor improvement in sample-complexity over previously known approaches. As an immediate corollary, we obtain via the Choi-Jamiolkowski isomorphism an algorithm for learning an unknown $n$-qubit Clifford unitary from $2n+\left\lceil\log_2(1/\delta)\right\rceil+4$ queries, the $n$-dependence of which we show to be optimal. Our proof technique, which involves Fourier analysis on the abelian group $\mathbb{Z}_4^n \times \mathbb{F}_2^{n(n-1)/2}$, seems to be qualitatively different to previous approaches to stabilizer state learning, and may be of some independent interest; in particular, it admits natural generalisations to further problems in quantum learning theory.

quant-ph