Searcharxiv⌕ Search

arXiv · quant-ph/0407206

Entanglement Sharing and Decoherence in the Spin-Bath

Abstract

The monogamous nature of entanglement has been illustrated by the derivation of entanglement sharing inequalities - bounds on the amount of entanglement that can be shared amongst the various parts of a multipartite system. Motivated by recent studies of decoherence, we demonstrate an interesting manifestation of this phenomena that arises in system-environment models where there exists interactions between the modes or subsystems of the environment. We investigate this phenomena in the spin-bath environment, constructing an entanglement sharing inequality bounding the entanglement between a central spin and the environment in terms of the pairwise entanglement between individual bath spins. The relation of this result to decoherence will be illustrated using simplified system-bath models of decoherence.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Christopher M. Dawson, Andrew P. Hines, Ross H. McKenzie, G. J. Milburn. 2005-03-10. Entanglement Sharing and Decoherence in the Spin-Bath. https://doi.org/10.1103/physreva.71.052321

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

KEEP EXPLORING

Related papers

Certified Lipschitz Bounds for Hybrid Quantum-Classical Decision Models

We study certified upper bounds on Lipschitz constants for hybrid quantum-classical decision models, which combine classical neural-network layers with parameterized quantum circuits. We pair an SDP-based certificate for classical layers with an exact spectral characterization for probability-output quantum models. For hybrid architectures, these componentwise estimates are connected through the encoding maps to obtain a certified composition bound for the complete model. The resulting bounds support sensitivity analyses relevant to robustness, stability, generalization, and fairness.

quant-ph↗

Quantum-to-classical transition and the emergence of trajectory level Darwinism with measurements distributed in time: a path integral approach

We present a formulation for the emergence of classical dynamics in a quantum world using a path integral approach that incorporates continuous measurements. It complements decoherence and coarse-grained measurement frameworks. The formulation provides the joint statistics of a sequence of measurements, with each Feynman path picking up a random phase proportional to the measurement strength, and we give conditions under which trajectories near classical paths dominate the probability amplitude. Information proliferates across the environment, a key feature of quantum Darwinism, via plane-wave probe scattering. In the continuous limit, momentum kicks from the probes add a further phase to each trajectory--the origin of the back-action force. We provide conditions under which measurements yield enough ``which-path'' information while keeping the wave packet localized. This describes the quantum-to-classical transition at the level of individual measurement records, complementing the ensemble description by density matrices. The same scattering that decoheres a trajectory also heats it, tying decoherence and measurement back-action together. This bounds how redundantly a classical trajectory can be recorded before back-action randomizes it into Brownian motion. The bound is not restrictive for macroscopic systems. For a trapped particle, it is set by the resolution in units of the zero-point motion and collapses to a single record where the semiclassical description of the orbit fails; for a free coordinate it marks the loss of deterministic objectivity even while the classical action remains large. In both cases, it delimits the regime in which objective classical trajectories exist. The crossover is driven by photon recoil, already resolved in levitated optomechanics; the bound recasts it as the point where a redundantly recorded trajectory, still objective, stops being deterministic.

quant-ph↗

Simulating Gaussian boson sampling on graphs in polynomial time

We show that a distribution related to Gaussian Boson Sampling (GBS) on graphs can be sampled classically in polynomial time. Graphical applications of GBS typically sample from this distribution, and thus quantum algorithms do not provide exponential speedup for these applications. We also show that another distribution related to Boson sampling can be sampled classically in polynomial time.

quant-ph↗