Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2204.09965

Exact Master Equation for Quantum Brownian Motion with Generalization to Momentum-Dependent System-Environment Couplings

Yu-Wei Huang·Wei-Min Zhang
View original source ↗Read source document ↗Export metadata ↓

Abstract

In this paper, we generalize the quantum Brownian motion to include momentum-dependent system-environment couplings. The conventional QBM model corresponds to the spacial case $W_k = V_k$. The generalized QBM is more complicated but the generalization is necessary. This is because the particle transition and the pair production between the system and the environment represent two very different physical processes, and usually cannot have the same coupling strengths. Thus, the conventional QBM model, which is well-defined at classical level, is hardly realized in real quantum physical world. We discuss the physical realizations of the generalized QBM in different physical systems, and derive its exact master equation for both the initial decoupled states and initial correlated states. The Hu-Paz-Zhang master equation of the conventional QBM model is reproduced as a special case. We find that the renormalized Brownian particle Hamiltonian after traced out all the environmental states induced naturally a momentum-dependent potential, which also shows the necessity of including the momentum-dependent coupling in the QBM Hamiltonian. In the Hu-Paz-Zhang master equation, such a renormalized potential is misplaced so that the correct renormalization Hamiltonian has not been found. With the exact master equation for both the initial decoupled and and initial correlated states, the issues about the initial jolt which is a long-stand problem in the Hu-Paz-Zhang master equation is also re-examined. We find that the so-called "initial jolt", which has been thought to be an artificial effect due to the use of the initial decoupled system-environment states, has nothing do to with the initial decoupled state. The new exact master equation for the generalized QBM also has the potential applications to photonics quantum computing.

Explore related subjects

quant-ph

Keep this discovery

BibTeXRIS

Yu-Wei Huang, Wei-Min Zhang. 2022-04-21. Exact Master Equation for Quantum Brownian Motion with Generalization to Momentum-Dependent System-Environment Couplings. https://doi.org/10.1103/physrevresearch.4.033151

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↗