Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Cited by 198

The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.

Searching for highly entangled multi-qubit states

Open access
Brown, Iain D K, Stepney, Susan, Sudbery, Anthony, Braunstein, Samuel L · 2005 · Journal of Physics A: Mathematical and General

Abstract

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.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1088/0305-4470/38/5/013

Cites

2 of 2 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 2 references

Cited by

See all 198

Metadata

Authors
Brown, I. D. K., Stepney, S., Sudbery, A., & Braunstein, S. L.
Venue
Journal of Physics A: Mathematical and General
Published
2005-01-20
Volume
38
Issue
5
Pages
1119-1131
ISSN
  • 0305-4470 (ISSN-L)
  • 1361-6447
OpenAlex
W1973666218
Cited by
198
References
2
FWCI
3.44
Type
journal article
Language
en
Open access
bronze

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Searching for highly entangled multi-qubit states. https://app.cochat.ai/papers/10.1088/0305-4470/38/5/013
The paper
Brown, I. D. K., Stepney, S., Sudbery, A., & Braunstein, S. L. (2005). Searching for highly entangled multi-qubit states. Journal of Physics A: Mathematical and General. https://doi.org/10.1088/0305-4470/38/5/013

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.