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:1203.3933 · Quantum Information Processing

Concurrence for infinite-dimensional quantum systems

Yu Jing Guo, Jinchuan Hou, Yuncai Wang

Published Mar 6, 2013• 26 citations
arXivHTMLPDF
DOI
10.1007/s11128-013-0552-6

Related papers

Concurrence vectors for entanglement of high-dimensional systems

You-Quan Li, Guo-Qiang Zhu

arXiv:quant-ph/0308139•物理学前沿:英文版•May 9, 2008•19 citations

Monogamy relations of concurrence for any dimensional quantum systems

Xue-Na Zhu, Xianqing Li-Jost, Shao-Ming Fei

arXiv:1710.06577•Quantum Information Processing•Oct 5, 2017•9 citations

Infinite Quantum Systems

Fabio Benatti

Springer eBooks•Jan 1, 1993•0 citations

Monogamy of the Concurrence for Infinite-Dimensional Systems

志琴 穆

Advances in Applied Mathematics•Jan 1, 2024•0 citations

Bounded Quantum Systems

L. E. Reichl

Institute for Nonlinear Science•Jan 1, 2004•0 citations

Designing lattice structures with maximal nearest-neighbor entanglement

Jorge Carlos Navarro-Muñoz, Román López-Sandoval, Martı́n E. Garcia

In this paper, we study the numerical optimization of nearest-neighbor concurrence of bipartite one- and two-dimensional lattices, as well as non-bipartite two-dimensional lattices. These systems are described in the framework of a tight-binding Hamiltonian while the optimization of concurrence was performed using genetic algorithms. Our results show that the concurrence of the optimized lattice structures is considerably higher than that of non-optimized systems. In the case of one-dimensional chains, the concurrence increases dramatically when the system begins to dimerize, i.e., it undergoes a structural phase transition (Peierls distortion). This result is consistent with the idea that entanglement is maximal or shows a singularity near quantum phase transitions. Moreover, the optimization of concurrence in two-dimensional bipartite and non-bipartite lattices is achieved when the structures break into smaller subsystems, which are arranged in geometrically distinguishable configurations.

arXiv:0811.0339•Journal of Physics A Mathematical and Theoretical•Jul 15, 2009•1 citation
In this paper, we study the numerical optimization of nearest-neighbor concurrence of bipartite one- and two-dimensional lattices, as well as non-bipartite two-dimensional lattices. These systems are described in the framework of a tight-binding Hamiltonian while the optimization of concurrence was performed using genetic algorithms. Our results show that the concurrence of the optimized lattice structures is considerably higher than that of non-optimized systems. In the case of one-dimensional chains, the concurrence increases dramatically when the system begins to dimerize, i.e., it undergoes a structural phase transition (Peierls distortion). This result is consistent with the idea that entanglement is maximal or shows a singularity near quantum phase transitions. Moreover, the optimization of concurrence in two-dimensional bipartite and non-bipartite lattices is achieved when the structures break into smaller subsystems, which are arranged in geometrically distinguishable configurations.