SearcharxivSearch

arXiv · 2312.12643

Characterizing the magnetic noise power spectrum of dark spins in diamond

Abstract

Coherence times of spin qubits in solid-state platforms are often limited by the presence of a spin bath. While some properties of these typically dark bath spins can be indirectly characterized via the central qubit, it is important to characterize their properties by direct measurement. Here we use pulsed electron paramagnetic resonance (pEPR) based Carr-Purcell-Meiboom-Gill (CPMG) dynamical decoupling to measure the magnetic noise power spectra for ensembles of P1 (substitutional nitrogen) centers in diamond that typically form the bath for NV (nitrogen-vacancy) centers. The experiments on the P1 centers were performed on a low [N] CVD (chemical vapor deposition) sample and a high [N] HPHT (high-temperature, high-pressure) sample at 89 mT. We characterize the NV centers of the latter sample using the same 2.5 GHz pEPR spectrometer. All power spectra show two distinct features, a broad component that is observed to scale as approximately $1/\omega^{0.7-1.0}$, and a prominent peak at the $^{13}$C Larmor frequency. The behavior of the broad component is consistent with an inhomogeneous distribution of Lorentzian spectra due to clustering of P1 centers, which has recently been shown to be prevalent in HPHT diamond. It is unknown if such clustering occurs in CVD diamond. We develop techniques utilizing harmonics of the CPMG filter function to improve characterization of high-frequency signals, which we demonstrate on the $^{13}$C nuclear Larmor frequency. At 190 mT this is 2.04 MHz, 5.7 times higher than the CPMG modulation frequency ($<357$ kHz, hardware-limited). We assess the robustness of our methods in the presence of finite pulse widths and flip angle errors. Understanding the interactions of dark spins will inform methods of diamond fabrication for quantum technology. These techniques are applicable to ac magnetometry for nanoscale nuclear magnetic resonance and chemical sensing.

Explore related subjects

Keep this discovery

BibTeXRIS

Ethan Q. Williams, Chandrasekhar Ramanathan. 2023-12-19. Characterizing the magnetic noise power spectrum of dark spins in diamond. https://doi.org/10.1088/1367-2630/adb2b8

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