SearcharxivSearch

arXiv · 2211.06176

Move aside pentacene: Diazapentacene doped para-terphenyl as a zero-field room-temperature maser with strong coupling for cavity quantum electrodynamics

Abstract

Masers, the microwave analogue of lasers, promise to deliver ultra-low noise amplification of microwave signals for use in medical MRI imaging and deep-space communication. Research on masers in modern times was rekindled thanks to the discovery of gain media that were operable at room-temperature, eschewing bulky cryogenics that hindered their use. However, besides the two known materials of pentacene doped in para-terphenyl and negatively-charged nitrogen-vacancy defects in diamond, there has been scarce progress in the search for completely new room-temperature gain media. Here we show the discovery of 6,13-diazapentacene doped in para-terphenyl as a maser gain medium that can operate at room-temperature and without an external magnetic field. A measured maser pulse power of -10 dBm shows it is on par with pentacene-doped para-terphenyl in absolute power, while possessing compelling advantages against its pentacene predecessor in that it has a faster amplification startup time, can be excited with longer wavelength light at 620 nm and enjoys greater chemical stability from added nitrogen groups. Furthermore, we show that the maser bursts allow 6,13-diazapentacene-doped para-terphenyl to reach the strong coupling regime for cavity quantum electrodynamics, where it has a high cooperativity of 182. We study the optical and microwave spin dynamics of 6,13-diazapentacene-doped para-terphenyl in order to evaluate its behavior as a maser gain medium, where it features fast intersystem crossing and an advantageously higher triplet quantum yield. Our results pave the way for the future discovery of other similar maser materials and help point to such materials as promising candidates for the study of cavity quantum electrodynamic effects at room-temperature.

Explore related subjects

Keep this discovery

BibTeXRIS

Wern Ng, Xiaotian Xu, Max Attwood, Hao Wu, Zhu Meng, Xi Chen, Mark Oxborrow. 2022-11-11. Move aside pentacene: Diazapentacene doped para-terphenyl as a zero-field room-temperature maser with strong coupling for cavity quantum electrodynamics. https://arxiv.org/abs/2211.06176

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