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

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

Optimal manipulations with qubits: Universal-NOT gate

Bužek, V., Hillery, M., Werner, R. F. · 1999 · Physical Review A

Abstract

Quantum information processing is usually associated with a specific computational basis. Nevertheless, for a deeper understanding of the fundamental principles of quantum computing, it is essential to investigate what is the fidelity of universal operations that are basis independent; i.e., the task is to perform optimally a specific operation on a qubit or a quantum register that is in an unknown state. In this paper we introduce the universal-NOT gate that takes as an input a qubit in an arbitrary state $|\ensuremath{\Psi}〉$ and generates an output that is as close as possible to the orthogonal state $|{\ensuremath{\Psi}}^{\ensuremath{\perp}}〉.$

Overview

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.60.r2626

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.

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

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 234

Metadata

Authors
Bužek, V., Hillery, M., & Werner, R. F.
Venue
Physical Review A
Published
1999-10-01
Volume
60
Issue
4
Pages
R2626-R2629
ISSN
  • 0556-2791 (ISSN-L)
  • 1050-2947
  • 1094-1622
OpenAlex
W2056953191
Cited by
234
References
2
FWCI
10.99
Type
journal article
Language
en
Open access
closed

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: Optimal manipulations with qubits: Universal-NOT gate. https://app.cochat.ai/papers/10.1103/physreva.60.r2626
The paper
Bužek, V., Hillery, M., & Werner, R. F. (1999). Optimal manipulations with qubits: Universal-NOT gate. Physical Review A. https://doi.org/10.1103/physreva.60.r2626

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.