SearcharxivSearch

arXiv · 2111.11812

Wavelet-resolved coherence beats in the Overhauser field of a thermal nuclear spin ensemble

Abstract

This work introduces the so-called synchrosqueezed wavelet transform, to shed light on the dipolar fluctuations of a thermal ensemble of nuclear spins in a diamond crystal structure, hyperfine-coupled to a central spin. The raw time series of the nuclear spin bath coherent dynamics is acquired through the two-point correlation function computed using the cluster correlation expansion method. The dynamics can be conveniently analyzed according to zero-, single-, and double-quantum transitions derived from the dipolar pairwise spin flips. We show that in the early-time behavior when the coherence is preserved in the spin ensemble, the Overhauser field fluctuations are modulated by dipole-dipole-induced small inhomogeneous detunings of nearly resonant transitions within the bath. The resulting beating extending over relatively longer time intervals is featured on the scalograms where both temporal and spectral behaviors of nuclear spin noise are unveiled simultaneously. Moreover, a second kind of beating that affects faster dynamics is readily discernible, originating from the inhomogeneous spread of the hyperfine coupling of each nucleus with the central spin. Additionally, any quadrupolar nuclei within the bath imprint as beating residing in the zero-quantum channel. The nuclear spin environment can be directionally probed by orienting the hyperfine axis. Thereby, crucial spatial information about the closely separated spin clusters surrounding the central spin are accessible. Thus, a wavelet-based post processing can facilitate the identification of proximal nuclear spins as revealed by their unique beating patterns on the scalograms. Finally, when these features are overwhelmed by either weakly or strongly coupled classical noise sources, we demonstrate the efficacy of thresholding techniques in the wavelet domain in denoising contaminated scalograms.

Explore related subjects

Keep this discovery

BibTeXRIS

Ekrem Taha Güldeste, Ceyhun Bulutay. 2021-11-23. Wavelet-resolved coherence beats in the Overhauser field of a thermal nuclear spin ensemble. https://doi.org/10.1103/physrevb.105.075202

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