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:0904.3874 · Journal of Physics A Mathematical and Theoretical

Highly entangled multi-qubit states with simple algebraic structure

Juan Tapiador, Julio Cesar Hernandez-Castro, J A Clark, Susan Stepney

Published Sep 22, 2009• 18 citations
arXivHTMLPDF

Abstract

Recent works by Brown et al and Borras et al have explored numerical optimisation procedures to search for highly entangled multi-qubit states according to some computationally tractable entanglement measure. We present an alternative scheme based upon the idea of searching for states having not only high entanglement but also simple algebraic structure. We report results for 4, 5, 6, 7 and 8 qubits discovered by this approach, showing that many of such states do exist. In particular, we find a maximally entangled 6-qubit state with an algebraic structure simpler than the best results known so far. For the case of 7, we discover states with high, but not maximum, entanglement and simple structure, as well as other desirable properties. Some preliminary results are shown for the case of 8 qubits.

DOI
10.1088/1751-8113/42/41/415301

Related papers

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

CONSTRUCTING MAXIMALLY MULTIQUBIT ENTANGLED STATE VIA BELL-PAIR STATE

Xin-Wei Zha, Jianxia Qi

Brown et al. and Borras et al. have explored numerical optimization procedures to search for highly entangled five- and six-qubit states. Here, we give a relation between the genuine multiqubit entangled state and Bell state for 4-, 5-, and 6-qubit systems. And the general method to construct maximally multipartite entangled state is also presented.

International Journal of Quantum Information•Jun 15, 2011•6 citations

Multiqubit systems: highly entangled states and entanglement distribution

Antoni Borràs, Angel Ricardo Plastino, Josep Amengual i Batle +3 more

A comparison is made of various searching procedures, based upon different entanglement measures or entanglement indicators, for highly entangled multi-qubits states. In particular, our present results are compared with those recently reported by Brown et al. [J. Phys. A: Math. Gen. 38 (2005) 1119]. The statistical distribution of entanglement values for the aforementioned multi-qubit systems is also explored.

arXiv:0803.3979•Journal of Physics A Mathematical and Theoretical•Oct 16, 2007•166 citations

Constructing quantum circuits for maximally entangled multi-qubit states using the genetic algorithm

Zheyong Fan, Hugo de GARIS, Ben Goertzel +2 more

Numerical optimization methods such as hillclimbing and simulated annealing have been applied to search for highly entangled multi-qubit states. Here the genetic algorithm is applied to this optimization problem -- to search not only for highly entangled states, but also for the corresponding quantum circuits creating these states. Simple quantum circuits for maximally (highly) entangled states are discovered for 3, 4, 5, and 6-qubit systems; and extension of the method to systems with more qubits is discussed. Among other results we have found explicit quantum circuits for maximally entangled 5 and 6-qubit circuits, with only 8 and 13 quantum gates respectively. One significant advantage of our method over previous ones is that it allows very simple construction of quantum circuits based on the quantum states found.

arXiv:1003.3142•Mar 16, 2010•2 citations

Working with measurement-based computations on qudits

Piotr Mitosek, Miriam Backens

Measurement-based quantum computing is a universal model of quantum computation in which successive product measurements of an entangled resource state drive the computation. The non-deterministic nature of measurements necessitates adaptivity to ensure an overall deterministic computation. Flow structures characterise cases in which such an adaptive correction procedure is possible. Recently, flow has been defined in a setting where the resource states are prime-dimensional qudit graph states rather than the usual qubit graph states. Yet, this qudit flow definition is more burdensome to work with than analogous definitions for qubits. Here, we give a simpler definition of qudit flow and consider various useful properties of this flow, drawing on results for the qubit case. In particular, we show how to focus qudit flow and argue that focused flow is canonical. We improve the previous algebraic formulation to capture focused flow and use it to obtain an $O(n^3)$ flow-finding algorithm (where $n$ is the number of qudits), matching the best known complexity for qubit flows and improving on the previous $O(n^4)$ result for qudits. Furthermore, we explore multiple flow-preserving transformations, thus opening a pathway to using flow for optimisation. These transformations include pivoting, removal and insertion of certain types of vertices, and reversibility of flow. Lastly, we propose an algorithmic approach to generating large qudit computations with flow, for testing or machine learning.

quant-pharXiv:2606.30525•Electronic Proceedings in Theoretical Computer Science•Jun 30, 2026•2 citations

A maximally entangled seven-qubit state

Xin-Wei Zha, Haiyang Song, Jianxia Qi +2 more

A highly entangled seven-qubit state is reported that sheds some new light on a recent conjecture by Borras et al (2007 J. Phys. A: Math. Theor. 40 13407). The seven-qubit state given in this paper has 32 balanced purities equal to 1/8 and the remaining three purities equal to 1/4, whose marginal density matrices for subsystems of one and two qubits are all completely mixed.

arXiv:1110.5011•Journal of Physics A Mathematical and Theoretical•May 29, 2012•30 citations
Recent works by Brown et al and Borras et al have explored numerical optimisation procedures to search for highly entangled multi-qubit states according to some computationally tractable entanglement measure. We present an alternative scheme based upon the idea of searching for states having not only high entanglement but also simple algebraic structure. We report results for 4, 5, 6, 7 and 8 qubits discovered by this approach, showing that many of such states do exist. In particular, we find a maximally entangled 6-qubit state with an algebraic structure simpler than the best results known so far. For the case of 7, we discover states with high, but not maximum, entanglement and simple structure, as well as other desirable properties. Some preliminary results are shown for the case of 8 qubits.
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.
Numerical optimization methods such as hillclimbing and simulated annealing have been applied to search for highly entangled multi-qubit states. Here the genetic algorithm is applied to this optimization problem -- to search not only for highly entangled states, but also for the corresponding quantum circuits creating these states. Simple quantum circuits for maximally (highly) entangled states are discovered for 3, 4, 5, and 6-qubit systems; and extension of the method to systems with more qubits is discussed. Among other results we have found explicit quantum circuits for maximally entangled 5 and 6-qubit circuits, with only 8 and 13 quantum gates respectively. One significant advantage of our method over previous ones is that it allows very simple construction of quantum circuits based on the quantum states found.
Measurement-based quantum computing is a universal model of quantum computation in which successive product measurements of an entangled resource state drive the computation. The non-deterministic nature of measurements necessitates adaptivity to ensure an overall deterministic computation. Flow structures characterise cases in which such an adaptive correction procedure is possible. Recently, flow has been defined in a setting where the resource states are prime-dimensional qudit graph states rather than the usual qubit graph states. Yet, this qudit flow definition is more burdensome to work with than analogous definitions for qubits. Here, we give a simpler definition of qudit flow and consider various useful properties of this flow, drawing on results for the qubit case. In particular, we show how to focus qudit flow and argue that focused flow is canonical. We improve the previous algebraic formulation to capture focused flow and use it to obtain an O(n3)O(n^3)O(n3) flow-finding algorithm (where nnn is the number of qudits), matching the best known complexity for qubit flows and improving on the previous O(n4)O(n^4)O(n4) result for qudits. Furthermore, we explore multiple flow-preserving transformations, thus opening a pathway to using flow for optimisation. These transformations include pivoting, removal and insertion of certain types of vertices, and reversibility of flow. Lastly, we propose an algorithmic approach to generating large qudit computations with flow, for testing or machine learning.