Search arXivSearch

arXiv · quant-ph/0408084

Non-Markovian qubit dynamics in a thermal field bath: Relaxation, decoherence and entanglement

Abstract

We study the non-Markovian dynamics of a qubit made up of a two-level atom interacting with an electromagnetic field (EMF) initially at finite temperature. Unlike most earlier studies where the bath is assumed to be fixed, we study the coherent evolution of the combined qubit-EMF system, thus allowing for the back-action from the bath on the qubit and the qubit on the bath in a self-consistent manner. In this way we can see the development of quantum correlations and entanglement between the system and its environment, and how that affects the decoherence and relaxation of the system. We find non-exponential decay for both the diagonal and non-diagonal matrix elements of the qubit's reduced density matrix in the pointer basis. From the diagonal elements we see the qubit relaxes to thermal equilibrium with the bath. From the non-diagonal elements, we see the decoherence rate beginning at the usually predicted thermal rate, but changing to the zero temperature decoherence rate as the qubit and bath become entangled. These two rates are comparable, as was shown before in the zero temperature case [C. Anastopoulos and B. L. Hu, Phys. Rev. A {\bf 62} (2000) 033821]. On the entanglement of a qubit with the EMF under this type of resonant coupling we calculated, for the qubit reduced density matrix, the fidelity and the von Neumann entropy, which is a measure of the purity of the density matrix. The present more accurate non-Markovian calculations predict lower loss of fidelity and purity as compared with the Markovian results. Generally speaking, with the inclusion of quantum correlations between the qubit and its environment, the non-Markovian processes tend to slow down the drive of the system to equilibrium, prolonging the decoherence and better preserving the fidelity and purity of the system.

Explore related subjects

Keep this discovery

BibTeXRIS

S. Shresta, C. Anastopoulos, A. Dragulescu, B. L. Hu. 2004-08-13. Non-Markovian qubit dynamics in a thermal field bath: Relaxation, decoherence and entanglement. https://doi.org/10.1103/physreva.71.022109

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