Searcharxiv⌕ Search

arXiv subjects

Y. Zhiyenbayev

Publications and source records attributed to Y. Zhiyenbayev.

2 recordsLinked to original sources

Programmable quantum emitter formation in silicon

Silicon-based quantum emitters are candidates for large-scale qubit integration due to their single-photon emission properties and potential for spin-photon interfaces with long spin coherence times. Here, we demonstrate local writing and erasing of selected light-emitting defects using fs laser pulses in combination with hydrogen-based defect activation and passivation. By selecting forming gas (N2/H2) during thermal annealing of carbon-implanted silicon, we form Ci centers while passivating the more common G-centers. The Ci center is a telecom S-band emitter with very promising spin properties that consists of a single interstitial carbon atom in the silicon lattice. Density functional theory calculations show that the Ci center brightness is enhanced by several orders of magnitude in the presence of hydrogen. Fs-laser pulses locally affect the passivation or activation of quantum emitters with hydrogen and enable programmable quantum emitter formation in a qubit-by-design paradigm.

quant-ph↗

Quantum compiling with diffusive sets of gates

Given a set of quantum gates and a target unitary operation, the most elementary task of quantum compiling is the identification of a sequence of the gates that approximates the target unitary to a determined precision $\varepsilon$. Solovay-Kitaev theorem provides an elegant solution which is based on the construction of successively tighter `nets' around the unity comprised by successively longer sequences of gates. The procedure for the construction of the nets, according to this theorem, requires accessibility to the inverse of the gates as well. In this work, we propose a method for constructing nets around unity without this requirement. The algorithmic procedure is applicable to sets of gates which are diffusive enough, in the sense that sequences of moderate length cover the space of unitary matrices in a uniform way. We prove that the number of gates sufficient for reaching a precision $\varepsilon$ scales as $ \log (1/\varepsilon )^{\log 3 / log 2} $ while the pre-compilation time is increased as compared to thatof the Solovay-Kitaev algorithm by the exponential factor 3/2.

quant-ph↗