SearcharxivSearch

arXiv · 1512.00248

Engineering Long-Lived Collective Dark States in Spin Ensembles

Abstract

Ensembles of electron spins in hybrid microwave systems are powerful and versatile components for future quantum technologies. Quantum memories with high storage capacities are one such example which require long-lived states that can be addressed and manipulated coherently within the inhomogeneously broadened ensemble. This broadening is essential for true multimode memories, but induces a considerable spin dephasing and together with dissipation from a cavity interface poses a constraint on the memory's storage time. In this work we show how to overcome both of these limitations through the engineering of long-lived dark states in an ensemble of electron spins hosted by nitrogen-vacancy centres in diamond. By burning narrow spectral holes into a spin ensemble strongly coupled to a superconducting microwave cavity, we observe long-lived Rabi oscillations with high visibility and a decay rate that is a factor of forty smaller than the spin ensemble linewidth and thereby a factor of more than three below the pure cavity dissipation rate. This significant reduction lives up to the promise of hybrid devices to perform better than their individual subcomponents. To demonstrate the potential of our approach we realise the first step towards a solid-state microwave spin multiplexer by engineering multiple long-lived dark states. Our results show that we can fully access the "decoherence free" subspace in our experiment and selectively prepare protected states by spectral hole burning. This technique opens up the way for truly long-lived quantum memories, solid-state microwave frequency combs, optical to microwave quantum transducers and spin squeezed states. Our approach also paves the way for a new class of cavity QED experiments with dense spin ensembles, where dipole spin-spin interactions become important and many-body phenomena will be directly accessible on a chip.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Stefan Putz, Andreas Angerer, Dmitry O. Krimer, Ralph Glattauer, William J. Munro, Stefan Rotter, Jörg Schmiedmayer, Johannes Majer. 2015-12-01. Engineering Long-Lived Collective Dark States in Spin Ensembles. https://doi.org/10.1038/nphoton.2016.225

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