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

Bulletin of the American Physical Society

Search for an Entanglement Measure for N-Qubit States via Phase Symmetry

Joshua Geller

Published Mar 21, 2011• 0 citations
OpenAlex

Related papers

Entanglement classification of symmetric N-qubit States

Thierry Bastin, Stéphanie Krins, Pierre Mathonet +3 more

•Jan 1, 2009•0 citations

Characterization of pure quantum states of multiple qubits using the Groverian entanglement measure

Yishai Shimoni, Daniel Shapira, Ofer Biham

The Groverian entanglement measure $G(\ensuremath{\psi})$ is applied to characterize pure quantum states $\ensuremath{\mid}\ensuremath{\psi}⟩$ of multiple qubits. This is an operational measure of entanglement in the sense that it quantifies the utility of the state $\ensuremath{\mid}\ensuremath{\psi}⟩$ as an initial state for the search algorithm. A convenient parametrization is presented, which allows us to calculate the Groverian measure analytically for certain states of high symmetry. A numerical procedure is used in order to calculate it for arbitrary pure states of multiple qubits. Using the Groverian measure to evaluate the entanglement produced by quantum algorithms may provide useful insight into the role of entanglement in making quantum algorithms powerful. Here we calculate $G(\ensuremath{\psi})$ for the intermediate states generated during the evolution of Grover's algorithm for various initial states and for different sets of marked states. It is shown that Grover's iterations generate highly entangled states in intermediate stages of the quantum search process, even if the initial state and the target state are product states.

arXiv:quant-ph/0309062•Physical Review A•Jun 2, 2004•46 citations

Searching for highly entangled multi-qubit states

Iain D K Brown, Susan Stepney, Anthony Sudbery +1 more

We present a simple numerical optimization procedure to search for highly entangled states of 2, 3, 4 and 5 qubits. We develop a computationally tractable entanglement measure based on the negative partial transpose criterion, which can be applied to quantum systems of an arbitrary number of qubits. The search algorithm attempts to optimize this entanglement cost function to find the maximal entanglement in a quantum system. We present highly entangled 4-qubit and 5-qubit states discovered by this search. We show that the 4-qubit state is not quite as entangled, according to two separate measures, as the conjectured maximally entangled Higuchi–Sudbery state. Using this measure, these states are more highly entangled than the 4-qubit and 5-qubit GHZ states. We also present a conjecture about the NPT measure, inspired by some of our numerical results, that the single-qubit reduced states of maximally entangled states are all totally mixed.

Journal of Physics A Mathematical and General•Jan 20, 2005•195 citations

Entanglement Equivalence of symmetric N-qubit States

Thierry Bastin, Stéphanie Krins, Pierre Mathonet +3 more

•Jan 1, 2009•0 citations

Four-qubit critical states

Luke Oeding, Ian Tan

Abstract Verstraete et al (2003 Phys. Rev. A 68 012103) showed that SLOCC invariants provide entanglement monotones. We observe that many highly entangled or useful four-qubit states that appear in prior literature are stationary points of such entanglement measures. This motivates the search for more stationary points. We use the notion of critical points (in the sense of the Kempf-Ness theorem) together with Vinberg theory to reduce the complexity of the problem significantly. We solve the corresponding systems utilizing modern numerical nonlinear algebra methods and reduce the solutions by natural symmetries. This method produces an extended list of four-qubit stationary points, which includes all the critical states in the survey by Enríquez et al (2016 J. Phys.: Conf. Ser. 698 012003). To illustrate the potential for application, we discuss the use of these states to generate pure five-qubit and six-qubit quantum error correcting codes by reversing a construction of Rains (1996 IEEE Trans. Inf. Theory 44 1388–94).

arXiv:2410.08317•Journal of Physics A Mathematical and Theoretical•Jun 12, 2025•4 citations

Entanglement measure for pure six-qubit quantum states

João Luzeilton de Oliveira, David Sena Oliveira, Rubens Viana Ramos

Quantum Information Processing•May 19, 2011•3 citations
The Groverian entanglement measure $G(\ensuremath{\psi})$ is applied to characterize pure quantum states $\ensuremath{\mid}\ensuremath{\psi}⟩$ of multiple qubits. This is an operational measure of entanglement in the sense that it quantifies the utility of the state $\ensuremath{\mid}\ensuremath{\psi}⟩$ as an initial state for the search algorithm. A convenient parametrization is presented, which allows us to calculate the Groverian measure analytically for certain states of high symmetry. A numerical procedure is used in order to calculate it for arbitrary pure states of multiple qubits. Using the Groverian measure to evaluate the entanglement produced by quantum algorithms may provide useful insight into the role of entanglement in making quantum algorithms powerful. Here we calculate $G(\ensuremath{\psi})$ for the intermediate states generated during the evolution of Grover's algorithm for various initial states and for different sets of marked states. It is shown that Grover's iterations generate highly entangled states in intermediate stages of the quantum search process, even if the initial state and the target state are product states.
We present a simple numerical optimization procedure to search for highly entangled states of 2, 3, 4 and 5 qubits. We develop a computationally tractable entanglement measure based on the negative partial transpose criterion, which can be applied to quantum systems of an arbitrary number of qubits. The search algorithm attempts to optimize this entanglement cost function to find the maximal entanglement in a quantum system. We present highly entangled 4-qubit and 5-qubit states discovered by this search. We show that the 4-qubit state is not quite as entangled, according to two separate measures, as the conjectured maximally entangled Higuchi–Sudbery state. Using this measure, these states are more highly entangled than the 4-qubit and 5-qubit GHZ states. We also present a conjecture about the NPT measure, inspired by some of our numerical results, that the single-qubit reduced states of maximally entangled states are all totally mixed.
Abstract Verstraete et al (2003 Phys. Rev. A 68 012103) showed that SLOCC invariants provide entanglement monotones. We observe that many highly entangled or useful four-qubit states that appear in prior literature are stationary points of such entanglement measures. This motivates the search for more stationary points. We use the notion of critical points (in the sense of the Kempf-Ness theorem) together with Vinberg theory to reduce the complexity of the problem significantly. We solve the corresponding systems utilizing modern numerical nonlinear algebra methods and reduce the solutions by natural symmetries. This method produces an extended list of four-qubit stationary points, which includes all the critical states in the survey by Enríquez et al (2016 J. Phys.: Conf. Ser. 698 012003). To illustrate the potential for application, we discuss the use of these states to generate pure five-qubit and six-qubit quantum error correcting codes by reversing a construction of Rains (1996 IEEE Trans. Inf. Theory 44 1388–94).