Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2211.07124

Entanglement dynamics of coupled quantum oscillators in independent nonMarkovian baths

Jen-Tsung Hsiang·Onat Arısoy·Bei-Lok Hu
View original source ↗Read source document ↗Export metadata ↓

Abstract

This work strives to better understand how the entanglement in an open quantum system, here represented by two coupled Brownian oscillators, is affected by a nonMarkovian environment (with memories), here represented by two independent baths each oscillator separately interacts with. We consider two settings, a `symmetric' configuration wherein the parameters of both oscillators and their baths are identical, and an `asymmetric' configuration wherein they are different, in particular, a `hybrid' configuration, where one of the two coupled oscillators interacts with a nonMarkovian bath and the other with a Markovian bath. We ask two groups of questions: Q1) Which time regime does the bath's nonMarkovianity benefit the system's entanglement most? The answers we get from detailed numerical studies suggest that A1) For an initially entangled pair of oscillators, we see that in the intermediate time range, the duration of entanglement is proportional to the memory time, and it lasts a fraction of the relaxation time, but at late times when the dynamics reaches a steady state, the value of the symplectic eigenvalue of the partially transposed covariance matrix barely benefit from the bath nonMarkovianity. For the second group of questions: Q2)Can the memory of one nonMarkovian bath be passed on to another Markovian bath? And if so, does this memory transfer help to sustain the system's entanglement dynamics? Our results from numerical studies of the asymmetric hybrid configuration indicate that A2) A system with a short memory time can acquire improvement when it is coupled to another system with a long memory time, but, at a cost of the latter. The sustainability of the bipartite entanglement is determined by the party which breaks off entanglement most easily.

Explore related subjects

quant-phcond-mat.stat-mech

Keep this discovery

BibTeXRIS

Jen-Tsung Hsiang, Onat Arısoy, Bei-Lok Hu. 2022-11-14. Entanglement dynamics of coupled quantum oscillators in independent nonMarkovian baths. https://doi.org/10.3390/e24121814

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↗