The DOI matches its Crossref record; 38 of the 38 references it cites were found in a registry or an index.
Negative quasi-probability as a resource for quantum computation
Open accessAbstract
A central problem in quantum information is to determine the minimal physical resources that are required for quantum computational speedup and, in particular, for fault-tolerant quantum computation.We establish a remarkable connection between the potential for quantum speed-up and the onset of negative values in a distinguished quasi-probability representation, a discrete analogue of the Wigner function for quantum systems of odd dimension.This connection allows us to resolve an open question on the existence of bound states for magic state distillation: we prove that there exist mixed states outside the convex hull of stabilizer states that cannot be distilled to non-stabilizer target states using stabilizer operations.We also provide an efficient simulation protocol for Clifford circuits that extends to a large class of mixed states, including bound universal states.
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.
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
Weedbrook, C., Pirandola, S., García-Patrón, R., Cerf, N. J., Ralph, T. C., Shapiro, J. H., & Lloyd, S. (2012) · Reviews of Modern Physics · doi:10.1103/revmodphys.84.621 · Cited by 3,664
Nonabelions in the fractional quantum hall effect
Moore, G., & Read, N. (1991) · Nuclear Physics B · doi:10.1016/0550-3213(91)90407-o · Cited by 2,968
Efficient Classical Simulation of Slightly Entangled Quantum Computations
Vidal, G. (2003) · Physical Review Letters · doi:10.1103/physrevlett.91.147902 · Cited by 2,368
Universal quantum computation with ideal Clifford gates and noisy ancillas
Bravyi, S., & Kitaev, A. (2005) · Physical Review A · doi:10.1103/physreva.71.022316 · Cited by 1,525
Improved simulation of stabilizer circuits
Aaronson, S., & Gottesman, D. (2004) · Physical Review A · doi:10.1103/physreva.70.052328 · Cited by 1,515
Mixed-state entanglement and distillation: Is there a ‘bound’ entanglement in nature?
Horodecki, M., Horodecki, P., & Horodecki, R. (1998) · Physical Review Letters · doi:10.1103/physrevlett.80.5239 · Cited by 1,208
Power of One Bit of Quantum Information
Knill, E., & Laflamme, R. (1998) · Physical Review Letters · doi:10.1103/physrevlett.81.5672 · Cited by 884
Negativity of the Wigner function as an indicator of non-classicality
Kenfack, A., & yczkowski, K. (2004) · Journal of Optics B: Quantum and Semiclassical Optics · doi:10.1088/1464-4266/6/10/003 · Cited by 779
When is the wigner quasi-probability density non-negative?
Hudson, R. L. (1974) · Reports on Mathematical Physics · doi:10.1016/0034-4877(74)90007-x · Cited by 647
Restrictions on Transversal Encoded Quantum Gate Sets
Eastin, B., & Knill, E. (2009) · Physical Review Letters · doi:10.1103/physrevlett.102.110502 · Cited by 457
Cited by
Chitambar, E., & Gour, G. (2019) · Reviews of Modern Physics · doi:10.1103/revmodphys.91.025001 · Cited by 1,276
Contextuality supplies the ‘magic’ for quantum computation
Howard, M., Wallman, J., Veitch, V., & Emerson, J. (2014) · Nature · doi:10.1038/nature13460 · Cited by 616
Self-citationThe resource theory of stabilizer quantum computation
Veitch, V., Hamed Mousavian, S. A., Gottesman, D., & Emerson, J. (2014) · New Journal of Physics · doi:10.1088/1367-2630/16/1/013009 · Cited by 501
Self-citationApplication of a Resource Theory for Magic States to Fault-Tolerant Quantum Computing
Howard, M., & Campbell, E. (2017) · Physical Review Letters · doi:10.1103/physrevlett.118.090501 · Cited by 387
Simulation of quantum circuits by low-rank stabilizer decompositions
Bravyi, S., Browne, D., Calpin, P., Campbell, E., Gosset, D., & Howard, M. (2019) · Quantum · doi:10.22331/q-2019-09-02-181 · Cited by 302
Metadata
- Authors
- Veitch, V., Ferrie, C., Gross, D., & Emerson, J.
- Venue
- New Journal of Physics
- Publisher
- IOP Publishing
- Published
- 2012-11-08
- Volume
- 14
- Issue
- 11
- Pages
- 113011
- ISSN
- 1367-2630 (ISSN-L)
- OpenAlex
- W2016124611
- Cited by
- 377
- References
- 38
- FWCI
- 14.57
- Type
- journal article
- Language
- en
- Open access
- gold
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: Negative quasi-probability as a resource for quantum computation. https://app.cochat.ai/papers/10.1088/1367-2630/14/11/113011
- The paper
- Veitch, V., Ferrie, C., Gross, D., & Emerson, J. (2012). Negative quasi-probability as a resource for quantum computation. New Journal of Physics. https://doi.org/10.1088/1367-2630/14/11/113011
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.