Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1509.06318

Thermal Baths as Quantum Resources: More Friends than Foes?

Gershon Kurizki·Ephraim Shahmoon·Analia Zwick
View original source ↗Read source document ↗Export metadata ↓

Abstract

In this article we argue that thermal reservoirs (baths) are potentially useful resources in processes involving atoms interacting with quantized electromagnetic fields and their applications to quantum technologies. One may try to suppress the bath effects by means of dynamical control, but such control does not always yield the desired results. We wish instead to take advantage of bath effects, that do not obliterate "quantumness" in the system-bath compound. To this end, three possible approaches have been pursued by us: (i) Control of a quantum system faster than the correlation time of the bath to which it couples: Such control allows us to reveal quasi-reversible/coherent dynamical phenomena of quantum open systems, manifest by the quantum Zeno or anti-Zeno effects (QZE or AZE, respectively). Dynamical control methods based on the QZE are aimed not only at protecting the quantumness of the system, but also diagnosing the bath spectra or transferring quantum information via noisy media. By contrast, AZE-based control is useful for fast cooling of thermalized quantum systems. (ii) Engineering the coupling of quantum systems to selected bath modes: This approach, based on field -atom coupling control in cavities, waveguides and photonic band structures, allows to drastically enhance the strength and range of atom-atom coupling through the mediation of the selected bath modes. More dramatically, it allows us to achieve bath-induced entanglement that may appear paradoxical if one takes the conventional view that coupling to baths destroys quantumness. (iii) Engineering baths with appropriate non-flat spectra: This approach is a prerequisite for the construction of the simplest and most efficient quantum heat machines (engines and refrigerators). We may thus conclude that often thermal baths are "more friends than foes" in quantum technologies.

Explore related subjects

quant-ph

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Gershon Kurizki, Ephraim Shahmoon, Analia Zwick. 2015-09-21. Thermal Baths as Quantum Resources: More Friends than Foes?. https://doi.org/10.1088/0031-8949%2F90%2F12%2F128002

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗