Mode Entanglement and Entangling power in Bosonic Graphs
arXiv:quant-ph/0304151 · doi:10.1103/PhysRevA.68.062108
Abstract
We analyze the quantum entanglement properties of bosonic particles hopping over graph structures.Mode-entanglement of a graph vertex with respect the rest of the graph is generated, starting from a product state, by turning on for a finite time a tunneling along the graph edges. The maximum achieved during the dynamical evolution by this bi-partite entanglement characterizes the entangling power of a given hopping hamiltonian. We studied this entangling power as a function of the self-interaction parameters i.e., non-linearities, for all the graphs up to four vertices and for two different natural choices of the initial state. The role of graph topology and self-interaction strengths in optimizing entanglement generation is extensively studied by means of exact numerical simulations and by perturbative calculations.
LaTeX, 15 pages, 19 figures
References in corpus (5)
- Quantum phase transition from a superfluid to a Mott insulator in a gas of ultracold atoms
- Controlling Spin Exchange Interactions of Ultracold Atoms in Optical Lattices
- The entanglement of indistinguishable particles shared between two parties
- Entanglement of two-mode Bose-Einstein condensates
- Bi-partite mode entanglement of bosonic condensates on tunneling graph
Cited by in corpus (9)
- Multi-party entanglement in graph states
- Entanglement and Quantum Phase Transition in Low Dimensional Spin Systems
- Entanglement and Density Matrix of a Block of Spins in AKLT Model
- Bipartite quantum states and random complex networks
- Topology-induced confined superfluidity in inhomogeneous arrays
- Coupling bosonic modes with a qubit: entanglement dynamics at zero and finite-temperatures
- Entanglement in the Bogoliubov vacuum
- Relation between two measures of entanglement in spin-1/2 and spinless fermion quantum chain systems
- A single photon produces general W state of N qubits and its application