CoChat
Sign Up
Cited by 70Quantum Computing Algorithms and ArchitectureQuantum Information and CryptographyComplexity and Algorithms in Graphs

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

On the Hardness of Distinguishing Mixed-State Quantum Computations

Open access
Rosgen, B., Watrous, J.·2005·20th Annual IEEE Conference on Computational Complexity (CCC'05)
DOI 10.1109/ccc.2005.21
Open this paper in CoChat — free accountOpen PDF

Abstract

This paper considers the following problem. Two mixed-state quantum circuits Q/sub 0/ and Q/sub 1/ are given, and the goal is to determine which of two possibilities holds: (i) Q/sub 0/ and Q/sub 1/ act nearly identically on all possible quantum state inputs, or (ii) there exists some input state /spl rho/ that Q/sub 0/ and Q/sub 1/ transform into almost perfectly distinguishable outputs. This may be viewed as an abstraction of the problem that asks, given two discrete quantum mechanical processes described by sequences of local interactions, are the processes effectively the same or are they different? We prove that this promise problem is complete for the class QIP of problems having quantum interactive proof systems, and is therefore PSPACE-hard. This is in contrast to the fact that the analogous problem for classical (probabilistic) circuits is in AM, and for unitary quantum circuits is in QMA.

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.1109/ccc.2005.21

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

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?

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

Research works printed but not linked: 13

  1. watrous, 2005, Notes on super-operator norms induced by Schatten norms, Quantum Information and Computation, 5, 58, 10.26421/QIC5.1-6 · DOI
  2. 10.1109/SFCS.2002.1181970 · DOI
  3. 10.1016/S0304-3975(01)00375-9 · DOI
  4. nielsen, 2000, Quantum Computation and Quantum Information
  5. 10.1145/636865.636868 · DOI
  6. 10.1145/1147954.1147962 · DOI
  7. 10.1145/276698.276708 · DOI
  8. 10.1016/S0304-3975(98)00191-1 · DOI
  9. 10.1145/335305.335387 · DOI
  10. kitaev, 2002, Classical and quantum computation, Graduate Studies in Mathematics, 47, 10.1090/gsm/047/18 · DOI
  11. janzing, 2003, "Identity Check" Is QMA-complete
  12. 10.1109/SFCS.1997.646094 · DOI
  13. 10.1103/PhysRevLett.81.5672 · DOI

Cited by

Sorted by citations

See all 70

Metadata

Authors
Rosgen, B., & Watrous, J.
Affiliations
University of Alberta (CA)
ORCID
Watrous, J.
Venue
20th Annual IEEE Conference on Computational Complexity (CCC'05)
Publisher
IEEE
Published
2005-06-28
Pages
344-354
ISSN
1093-0159 (ISSN-L)
DOI
10.1109/ccc.2005.21
OpenAlex
W2266502407
Cited by
70
References
2
Citations by year
2026: 1 · 2025: 1 · 2024: 3 · 2023: 3 · 2021: 2 · 2020: 4 · 2019: 4 · 2018: 1 · 2017: 1 · 2016: 7 · 2015: 3 · 2014: 5 · 2013: 7 · 2012: 3
FWCI
1.88
Type
conference paper
Language
en
Open access
Locations
  • IEEE Conference on Computational Complexity (CCC) (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • arXiv (Cornell University)
Funders
  • Canada Research Chairs
  • Natural Sciences and Engineering Research Council of Canada
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
  • Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › Complexity and Algorithms in Graphs
Keywords
promise problems, quantum interactive proofs, PSPACE-hardness, QMA

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: On the Hardness of Distinguishing Mixed-State Quantum Computations. https://app.cochat.ai/papers/10.1109/ccc.2005.21
The paper
Rosgen, B., & Watrous, J. (2005). On the Hardness of Distinguishing Mixed-State Quantum Computations. 20th Annual IEEE Conference on Computational Complexity (CCC'05). https://doi.org/10.1109/ccc.2005.21