Groverian entanglement measure and evolution of entanglement in search algorithm for \(n (=3, 5)\)-qubit systems with real coefficients

DOI10.1007/s11128-007-0057-2zbMath1134.81325arXivquant-ph/0609064OpenAlexW2156209752MaRDI QIDQ2460284

C. M. Bhandari, Arti Chamoli

Publication date: 14 November 2007

Published in: Quantum Information Processing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/quant-ph/0609064

zbMATH Keywords

von Neumann entropyGrover's search algorithmentanglement monotonesuccess probabilityGroverian entanglementthree-way tangle

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Quantum computation (81P68)

Related Items (4)

Entanglement in phase estimation algorithm and quantum counting algorithm ⋮ Entanglement measure for pure six-qubit quantum states ⋮ Residual entanglement with negativity for pure four-qubit quantum states ⋮ Comment on ``Groverian entanglement measure and evolution of entanglement in search algorithm for \(n(= 3, 5)\)-qubit systems with real coefficients (volume 6, number 4, August 2007), by arti chamoli and C. M. bhandari

Cites Work

• Success rate and entanglement measure in Grover's search algorithm for certain kinds of four qubit states
• Quantum theory, the Church–Turing principle and the universal quantum computer
• Quantifying Entanglement
• Mixed-state entanglement and quantum error correction
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Groverian entanglement measure and evolution of entanglement in search algorithm for \(n (=3, 5)\)-qubit systems with real coefficients