SearcharxivSearch

arXiv · 2210.01024

Emergence of highly coherent quantum subsystems of a noisy and dense spin system

Abstract

Quantum sensors and qubits are usually two-level systems (TLS), the quantum analogs of classical bits which assume binary values '0' or '1'. They are useful to the extent to which they can persist in quantum superpositions of '0' and '1' in real environments. However, such TLS are never alone in real materials and devices, and couplings to other degrees of freedom limit the lifetimes - called decoherence times - of the superposition states. Decoherence occurs via two major routes - excitation hopping and fluctuating electromagnetic fields. Common mitigation strategies are based on material improvements, exploitation of clock states which couple only to second rather than first order to external perturbations, and reduction of interactions via extreme dilution of pure materials made from isotopes selected to minimize noise from nuclear spins. We demonstrate that for a dense TLS network in a noisy nuclear spin bath, we can take advantage of interactions to pass from hopping to fluctuation dominance, increasing decoherence times by almost three orders of magnitude. In the dilute rare-earth insulator LiY1-xTbxF4, Tb ions realize TLS characterized by a 30GHz splitting and readily implemented clock states. Dipolar interactions lead to coherent, localized pairs of Tb ions, that decohere due to fluctuating quantum mechanical ring-exchange interaction, sensing the slow dynamics of the surrounding, nearly localized Tb spins. The hopping and fluctuation regimes are sharply distinguished by their Rabi oscillations and the invisible vs. strong effect of classic 'error correcting' microwave pulse sequences. Laying open the decoherence mechanisms at play in a dense, disordered and noisy network of interacting TLS, our work expands the search space for quantum sensors and qubits to include clusters in dense, disordered materials, that can be explored for localization effects.

Explore related subjects

Keep this discovery

BibTeXRIS

A. Beckert, M. Grimm, N. Wili, R. Tschaggelar, G. Jeschke, G. Matmon, S. Gerber, M. Müller, G. Aeppli. 2022-10-03. Emergence of highly coherent quantum subsystems of a noisy and dense spin system. https://doi.org/10.1038/s41567-023-02321-y

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