The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Hardness of Classically Simulating the One-Clean-Qubit Model
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.
Integrity signals
Registry
Cites
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.
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?
An efficient certification protocol for photonic state preparation was introduced theoretically, allowing discrimination of relevant classes of Fock states and Gaussian/non-Gaussian pure states.
“An efficient certification protocol for photonic state preparation was also introduced theoretically [614], allowing to discriminate relevant classes of Fock states and Gaussian/non-Gaussian pure states.”
From Photonic quantum information processing: a review (2019) · cites this paper as [614]
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
A scheme for efficient quantum computation with linear optics
Knill, E., Laflamme, R., & Milburn, G. J. (2001) · Nature · doi:10.1038/35051009 · Cited by 5,880
Elementary gates for quantum computation
Barenco, A., Bennett, C. H., Cleve, R., DiVincenzo, D. P., Margolus, N., Shor, P., Sleator, T., Smolin, J. A., & Weinfurter, H. (1995) · Physical Review A · doi:10.1103/physreva.52.3457 · Cited by 4,311
Gottesman, D., & Chuang, I. L. (1999) · Nature · doi:10.1038/46503 · Cited by 1,860
Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy
Bremner, M. J., Jozsa, R., & Shepherd, D. J. (2011) · Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rspa.2010.0301 · Cited by 308
Flagged first, then by citations
Research works printed but not linked: 16
- 10.1103/PhysRevLett.81.5672 · DOI
- 10.1103/PhysRevLett.100.050502 · DOI
- 10.1103/PhysRevA.75.042310 · DOI
- A. Ambainis, 2000, Proceedings of the Thirty Second Annual ACM Symposium on Theory of Computing : Portland, Oregon, 2000
- 10.1103/PhysRevA.68.022302 · DOI
- 10.1103/PhysRevLett.92.177906 · DOI
- P. W. Shor, 2008, Quantum Inf. Comput., 8, 681, 10.26421/QIC8.8-9-1 · DOI
- 10.1103/PhysRevLett.103.250501 · DOI
- S. P. Jordan, 2009, Quantum Inf. Comput., 9, 264, 10.26421/QIC9.3-4-6 · DOI
- 10.1103/PhysRevA.72.042316 · DOI
- B. Terhal, 2004, Quantum Inf. Comput., 4, 134, 10.26421/QIC4.2-5 · DOI
- 10.4086/toc.2013.v009a004 · DOI
- 10.1098/rspa.2005.1546 · DOI
- 10.1098/rspa.2011.0232 · DOI
- 10.1137/0220053 · DOI
- 10.1103/PhysRevLett.86.5188 · DOI · Paper page
Cited by
Sorted by citations
Photonic quantum information processing: a review
Flamini, F., Spagnolo, N., & Sciarrino, F. (2019) · Reports on Progress in Physics · doi:10.1088/1361-6633/aad5b2 · Cited by 770
Harnessing Disordered-Ensemble Quantum Dynamics for Machine Learning
Fujii, K., & Nakajima, K. (2017) · Physical Review Applied · doi:10.1103/physrevapplied.8.024030 · Cited by 337
Self-citationOn the complexity and verification of quantum random circuit sampling
Bouland, A., Fefferman, B., Nirkhe, C., & Vazirani, U. (2019) · Nature Physics · doi:10.1038/s41567-018-0318-2 · Cited by 287
Achieving quantum supremacy with sparse and noisy commuting quantum computations
Bremner, M. J., Montanaro, A., & Shepherd, D. J. (2017) · Quantum · doi:10.22331/q-2017-04-25-8 · Cited by 191
Computational advantage of quantum random sampling
Hangleiter, D., & Eisert, J. (2023) · Reviews of Modern Physics · doi:10.1103/revmodphys.95.035001 · Cited by 145
Metadata
- Authors
- Morimae, T., Fujii, K., & Fitzsimons, J. F.
- Venue
- Physical Review Letters
- Publisher
- American Physical Society (APS)
- Published
- 2014-04-02
- Volume
- 112
- Issue
- 13
- ISSN
- 0031-9007
- 1079-7114
- Cited by
- 70
- References
- 4
- Language
- en
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
