A useful strong lower bound on two-qubit concurrence
type: Item
instance of: scholarly article
title: A useful strong lower bound on two-qubit concurrence
zbMATH Open document ID: 1263.81032
author: M. Jafarpour
author: Abbass Sabour
published in: Quantum Information Processing
publication date: 2013-03-04T00:00:00Z
Mathematics Subject Classification ID: 81P40
zbMATH DE Number: 6140944
zbMATH Keywords: entanglement
zbMATH Keywords: concurrence
zbMATH Keywords: lower bound
zbMATH Keywords: localizable entanglement
MaRDI profile type: Publication
full work available at URL: s11128-011-0288-0
OpenAlex ID: W2037225452
cites work: Quantum cryptography based on Bell’s theorem
cites work: Communication via one- and two-particle operators on Einstein-Podolsky-Rosen states
cites work: Quantum cryptography without Bell’s theorem
cites work: Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
cites work: Quantum Computation
cites work: Quantifying Entanglement
cites work: Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
cites work: Mixed-state entanglement and quantum error correction
cites work: Entanglement of Formation of an Arbitrary State of Two Qubits
cites work: Entanglement and squeezing of multi-qubit systems using a two-axis countertwisting Hamiltonian with an external field
cites work: Concurrence of finite Ising chains with the Dzyaloshinsky–Moriya interaction
cites work: Q3522635
cites work: Q4241225
cites work: Q3523612
cites work: Separability Criterion for Density Matrices
cites work: Localizable entanglement
DOI: 10.1007/S11128-011-0288-0
description: scientific article; zbMATH DE number 6140944