Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:quant-ph/0304151 · Physical Review A

Mode entanglement and entangling power in bosonic graphs

Paolo Giorda, Paolo Zanardi

Published Dec 18, 2003• 21 citations
arXivHTMLPDF

Abstract

We analyze the quantum entanglement properties of bosonic particles hopping over graph structures. Mode entanglement of a graph vertex with respect to 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 bipartite 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., nonlinearities, 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

DOI
10.1103/physreva.68.062108

Related papers

Ground-state entanglement in interacting bosonic graphs

P Giorda, Paolo Zanardi

We consider a collection of bosonic modes corresponding to the vertices of a graph Γ. Quantum tunneling can occur only along the edges of Γ and a local self-interaction term is present. Quantum entanglement of one vertex with respect to the rest of the graph (mode entanglement) is analyzed in the ground state of the system as a function of the tunneling amplitude τ. The topology of Γ plays a major role in determining the tunneling amplitude τ max that leads to the maximum value of the mode entanglement. Whereas in most of the cases one finds the intuitively expected result τ max = ∞ , we show that there exists a family of graphs for which the optimal value of τ is pushed down to a finite value. We also show that, for complete graphs, our bi-partite entanglement provides useful insights in the analysis of the crossover between insulating and superfluid ground states.

arXiv:quant-ph/0311058•Europhysics Letters (EPL)•Oct 1, 2004•24 citations

Bipartite mode entanglement of bosonic condensates on tunneling graphs

Paolo Zanardi

We study a set of L spatial bosonic modes localized on a graph $\ensuremath{\Gamma}.$ The particles are allowed to tunnel from vertex to vertex by hopping along the edges of $\ensuremath{\Gamma}.$ We analyze how, in the exact many-body eigenstates of the system, i.e., Bose-Einstein condensates over single-particle eigenfunctions, the bipartite quantum entanglement of a graph vertex with respect to the rest of the graph depends on the topology of $\ensuremath{\Gamma}.$

arXiv:quant-ph/0212120•Physical Review A•May 20, 2003•9 citations

Entanglement of bosonic modes in symmetric graphs

M. Asoudeh, Vahid Karimipour

The ground and thermal states of a quadratic Hamiltonian representing the interaction of bosonic modes or particles are always Gaussian states. We investigate the entanglement properties of these states for the case where the interactions are represented by harmonic forces acting along the edges of symmetric graphs---i.e., one-, two-, and three-dimensional rectangular lattices, mean-field clusters, and platonic solids. We determine the entanglement of formation (EOF) as a function of the interaction strength, calculate the maximum EOF in each case, and compare these values with the bounds found previously for quadratic Hamiltonians.

arXiv:quant-ph/0506022•Physical Review A•Sep 30, 2005•4 citations

Occupancy probabilities in superintegrable bosonic networks

Lachlan Bennett, Angela Foerster, Phillip S. Isaac +1 more

We associate a bosonic network to each complete bipartite graph. A Hamiltonian is defined with hopping terms on the edges of the graph, and a global interaction term depending on the vertex sets. For a generic graph this Hamiltonian is superintegrable, and we derive a Bethe Ansatz solution for the energy and eigenstates. These results provide the means to investigate the quantum dynamics and allow for the computation of occupancy probabilities in certain regimes. We use these results to gain an understanding of entanglement evolution in the network.

Nuclear Physics B•Nov 27, 2023•7 citations

Entanglement Entropy in Quantum Networks with Tunable Geometry

Andrea Azzali, Sridevi Kuriyattil, Andrew J. Daley +1 more

Quantum many-body Hamiltonians with two-body interactions can be represented by graphs, with sites as nodes and two-site couplings as edges. We investigate how the geometry of these graphs affects transport and entanglement growth. To do so, we study dynamics for quantum hopping on a random graph model with an effective range parameter. Tuning it, we interpolate between nearest-neighbor and all-to-all graphs, identifying a new localization regime that is robust in both single-particle and finite-density cases. This provides a model of Anderson localization induced by structural disorder, with implications for amorphous materials and tunable-range analog quantum simulators.

quant-pharXiv:2607.16394•Jul 21, 2026•0 citations

Entanglement generation and dynamics for a Bose–Hubbard model in a double-well potential

Fabio Gentile, A. Montorsi, M. Roncaglia

The study of entanglement between bosonic systems is of primary importance for establishing feasible resources needed for implementing quantum information protocols, both in their interacting atomic or photonic realizations. Atomic systems are particularly efficient in the production of large amounts of entanglement, providing higher information density than conventional qubit entangled states. Such increased quantum resources pave the way to novel fundamental tests of nature and efficient applications in quantum information, metrology and sensing. We consider a basic setup made up of two parties A and B, each one populated by a single level bosonic variable. The bosons are interacting and can hop between A and B, thus describing a two-site Bose–Hubbard Hamiltonian. We consider the generation of quantum states in several situations that cover the majority of physical realizations: ground state, finite temperature, unitary dynamics, dissipation through dephasing and loss of particles. The system is analyzed through truncated exact diagonalization, as a function of the microscopic parameters. The nonseparability of the obtained quantum states is estimated by means of the negativity, which has recently been proven to be a suitable measure of entanglement [M. Roncaglia, A. Montorsi and M. Genovese, Phys. Rev. A 90 (2014) 062303]. Finally, we calculate lower bounds of the entanglement of formation (EOF), an indicator that quantifies the minimal amount of entanglement resources needed to build up such states.

arXiv:1411.3937•International Journal of Quantum Information•Nov 1, 2014•1 citation
We analyze the quantum entanglement properties of bosonic particles hopping over graph structures. Mode entanglement of a graph vertex with respect to 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 bipartite 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., nonlinearities, 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
We consider a collection of bosonic modes corresponding to the vertices of a graph Γ. Quantum tunneling can occur only along the edges of Γ and a local self-interaction term is present. Quantum entanglement of one vertex with respect to the rest of the graph (mode entanglement) is analyzed in the ground state of the system as a function of the tunneling amplitude τ. The topology of Γ plays a major role in determining the tunneling amplitude τ max that leads to the maximum value of the mode entanglement. Whereas in most of the cases one finds the intuitively expected result τ max = ∞ , we show that there exists a family of graphs for which the optimal value of τ is pushed down to a finite value. We also show that, for complete graphs, our bi-partite entanglement provides useful insights in the analysis of the crossover between insulating and superfluid ground states.
We study a set of L spatial bosonic modes localized on a graph $\ensuremath{\Gamma}.$ The particles are allowed to tunnel from vertex to vertex by hopping along the edges of $\ensuremath{\Gamma}.$ We analyze how, in the exact many-body eigenstates of the system, i.e., Bose-Einstein condensates over single-particle eigenfunctions, the bipartite quantum entanglement of a graph vertex with respect to the rest of the graph depends on the topology of $\ensuremath{\Gamma}.$
The ground and thermal states of a quadratic Hamiltonian representing the interaction of bosonic modes or particles are always Gaussian states. We investigate the entanglement properties of these states for the case where the interactions are represented by harmonic forces acting along the edges of symmetric graphs---i.e., one-, two-, and three-dimensional rectangular lattices, mean-field clusters, and platonic solids. We determine the entanglement of formation (EOF) as a function of the interaction strength, calculate the maximum EOF in each case, and compare these values with the bounds found previously for quadratic Hamiltonians.
We associate a bosonic network to each complete bipartite graph. A Hamiltonian is defined with hopping terms on the edges of the graph, and a global interaction term depending on the vertex sets. For a generic graph this Hamiltonian is superintegrable, and we derive a Bethe Ansatz solution for the energy and eigenstates. These results provide the means to investigate the quantum dynamics and allow for the computation of occupancy probabilities in certain regimes. We use these results to gain an understanding of entanglement evolution in the network.
Quantum many-body Hamiltonians with two-body interactions can be represented by graphs, with sites as nodes and two-site couplings as edges. We investigate how the geometry of these graphs affects transport and entanglement growth. To do so, we study dynamics for quantum hopping on a random graph model with an effective range parameter. Tuning it, we interpolate between nearest-neighbor and all-to-all graphs, identifying a new localization regime that is robust in both single-particle and finite-density cases. This provides a model of Anderson localization induced by structural disorder, with implications for amorphous materials and tunable-range analog quantum simulators.
The study of entanglement between bosonic systems is of primary importance for establishing feasible resources needed for implementing quantum information protocols, both in their interacting atomic or photonic realizations. Atomic systems are particularly efficient in the production of large amounts of entanglement, providing higher information density than conventional qubit entangled states. Such increased quantum resources pave the way to novel fundamental tests of nature and efficient applications in quantum information, metrology and sensing. We consider a basic setup made up of two parties A and B, each one populated by a single level bosonic variable. The bosons are interacting and can hop between A and B, thus describing a two-site Bose–Hubbard Hamiltonian. We consider the generation of quantum states in several situations that cover the majority of physical realizations: ground state, finite temperature, unitary dynamics, dissipation through dephasing and loss of particles. The system is analyzed through truncated exact diagonalization, as a function of the microscopic parameters. The nonseparability of the obtained quantum states is estimated by means of the negativity, which has recently been proven to be a suitable measure of entanglement [M. Roncaglia, A. Montorsi and M. Genovese, Phys. Rev. A 90 (2014) 062303]. Finally, we calculate lower bounds of the entanglement of formation (EOF), an indicator that quantifies the minimal amount of entanglement resources needed to build up such states.