Cited by 432Quantum Information and CryptographyQuantum Mechanics and ApplicationsQuantum Computing Algorithms and Architecture

Optimal creation of entanglement using a two-qubit gate

Open access
Kraus, B., Cirac, J. I.·2001·Physical Review A

Abstract

We consider a general unitary operator acting on two qubits in a product state. We find the conditions such that the state of the qubits after the action is as entangled as possible. We also consider the possibility of using ancilla qubits to increase the entanglement.

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

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

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

Integrity signals

Registry

Crossref · 10.1103/physreva.63.062309

Cites

18 of 18 references verified0 citation errors · 0 not checkable

Statistics

Claims the paper makes

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

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

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

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • The time complexity of tensor-network simulation scales exponentially with the treewidth of the circuit graph.

    “The time complexity scales exponentially with the treewidth of the circuit graph [28].”

    From Validating quantum computers using randomized model circuits (2019) · cites this paper as [28]

Self-check

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

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

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Kraus, B., & Cirac, J. I.
Affiliations
Universität Innsbruck (AT)
Venue
Physical Review A
Published
2001-05-17
Volume
63
Issue
6
ISSN
  • 0556-2791 (ISSN-L)
  • 1050-2947
  • 1094-1622
OpenAlex
W2029289973
Cited by
432
References
18
Citations by year
2026: 23 · 2025: 29 · 2024: 25 · 2023: 25 · 2022: 22 · 2021: 19 · 2020: 19 · 2019: 18 · 2018: 9 · 2017: 8 · 2016: 11 · 2015: 16 · 2014: 12 · 2013: 18 · 2012: 7
FWCI
20.85
Type
journal article
Language
en
Open access
Locations
  • Physical Review A (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • CERN Document Server (European Organization for Nuclear Research) (submittedVersion)
  • mediaTUM – the media and publications repository of the Technical University Munich (Technical University Munich) (submittedVersion)
  • arXiv (Cornell University)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Information and Cryptography
  • Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Mechanics and Applications
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
Keywords
entanglement generation, two-qubit gates, product states, unitary operators, ancilla qubits

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