Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1405.2825

Non-equilibrium Quantum Many-Body Green Function Formalism in the light of Quantum Information Theory

A. K. Rajgaopal
View original source ↗Read source document ↗Export metadata ↓

Abstract

The following issues are discussed inspired by the recent paper of Kadanoff (arXiv: 1403:6162): (a) Construction of a generalized one-particle Wigner distribution (GWD) function (analog of the classical distribution function) from which the quantum kinetic equation due to Kadanoff and Baym (KB) is derived, often called the Quantum Boltzmann Equation (QBE); (b) The equation obeyed by this has a collision contribution in the form of a two-particle Green function. This term is manipulated to have Kinetic Entropy in parallel to its counterpart in the classical Boltzmann kinetic equation for the classical distribution function. This proved to be problematic in that unlike in the classical Boltzmann kinetic equation, the contribution from the kinetic entropy term was non-positive; (3) Kadanoff surmised that this situation could perhaps be related to quantum entanglement that may not have been included in his theory. It is shown that GWD is not positive everywhere (indicating dynamical quantumness) just like the commonly recognized property of the Wigner function (negative property indicating quantumness of the state). The issue of non-positive feature appearing in approximate evaluation of patently positive entities in many particle systems is here pointed to an early discussion of this issue (Phys. Rev. A10, 1852 (1974)) in terms of a theorem on truncation of cumulant expansion of a probability distribution function due to Marcinkeiwicz. The last issue of presence or absence of entanglement in an approximate evaluation of a many particle correlation poses a new problem; it is considered here in terms of fermionic entanglement theory in the light of density matrix and Green function theory of many-fermion systems. The clue comes from the fact that the Hartree-Fock approximation exhbits no entantanglement in two-particle fermion density matrix and hence also in two-particle Green function.

Explore related subjects

quant-ph

Keep this discovery

BibTeXRIS

A. K. Rajgaopal. 2014-05-12. Non-equilibrium Quantum Many-Body Green Function Formalism in the light of Quantum Information Theory. https://arxiv.org/abs/1405.2825

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↗