Quasiprobability decompositions with reduced sampling overhead
Open accessThe DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Abstract
Quantum error-mitigation techniques can reduce noise on current quantum hardware without the need for fault-tolerant quantum error correction. For instance, the quasiprobability method simulates a noise-free quantum computer using a noisy one, with the caveat of only producing the correct expected values of observables. The cost of this error mitigation technique manifests as a sampling overhead which scales exponentially in the number of corrected gates. In this work, we present an algorithm based on mathematical optimization that aims to choose the quasiprobability decomposition in a noise-aware manner. This directly leads to a significantly lower basis of the sampling overhead compared to existing approaches. A key element of the novel algorithm is a robust quasiprobability method that allows for a tradeoff between an approximation error and the sampling overhead via semidefinite programming.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Quantum Computing in the NISQ era and beyond
Preskill, J. (2018) · Quantum · doi:10.22331/q-2018-08-06-79 · Cited by 8,830
Error Mitigation for Short-Depth Quantum Circuits
Temme, K., Bravyi, S., & Gambetta, J. M. (2017) · Physical Review Letters · doi:10.1103/physrevlett.119.180509 · Cited by 1,379
Hybrid quantum-classical hierarchy for mitigation of decoherence and determination of excited states
McClean, J. R., Kimchi-Schwartz, M. E., Carter, J., & de Jong, W. A. (2017) · Physical Review A · doi:10.1103/physreva.95.042308 · Cited by 516
Fault-Tolerant Quantum Computation with Constant Error Rate
Aharonov, D., & Ben-Or, M. (2008) · SIAM Journal on Computing · doi:10.1137/s0097539799359385 · Cited by 513 · cited 3×
“The linearity of the trace together with (1) implies”
BackgroundInfluentialQuantum-assisted quantum compiling
Khatri, S., LaRose, R., Poremba, A., Cincio, L., Sornborger, A. T., & Coles, P. J. (2019) · Quantum · doi:10.22331/q-2019-05-13-140 · Cited by 382 · cited 1×
“Variational unitary approximations are studied in various settings such as 12 , where the interested reader can fi nd more information.”
BackgroundLearning-Based Quantum Error Mitigation
Strikis, A., Qin, D., Chen, Y., Benjamin, S. C., & Li, Y. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.040330 · Cited by 237 · cited 2×
“Some more recent research has shown that cross-correlations can be tackled by using variants of the quasiprobability method which do not rely on tomography to find the optimal quasiprobability coefficients [21].”
BackgroundMethodLearning-based quantum error mitigation
Strikis, A., Qin, D., Chen, Y., Benjamin, S. C., & Li, Y. (2020) · arXiv · doi:10.48550/arxiv.2005.07601 · Cited by 237
Cai, Z. (2021) · npj Quantum Information · doi:10.1038/s41534-021-00404-3 · Cited by 76 · cited 1×
“In [7] the authors utilize the quasiprobability method to simulate noise with reduced strength in order to be used in conjunction with the error extrapolation method.”
Method
Cited by
The Variational Quantum Eigensolver: A review of methods and best practices
Tilly, J., Chen, H., Cao, S., Picozzi, D., Setia, K., Li, Y., Grant, E., Wossnig, L., Rungger, I., Booth, G. H., et al. (2022) · Physics Reports · doi:10.1016/j.physrep.2022.08.003 · Cited by 1,031
Cai, Z., Babbush, R., Benjamin, S. C., Endo, S., Huggins, W. J., Li, Y., McClean, J. R., & O’Brien, T. E. (2023) · Reviews of Modern Physics · doi:10.1103/revmodphys.95.045005 · Cited by 591
Probabilistic error cancellation with sparse Pauli–Lindblad models on noisy quantum processors
van den Berg, E., Minev, Z. K., Kandala, A., & Temme, K. (2023) · Nature Physics · doi:10.1038/s41567-023-02042-2 · Cited by 305
Error Mitigation for Universal Gates on Encoded Qubits
Piveteau, C., Sutter, D., Bravyi, S., Gambetta, J. M., & Temme, K. (2021) · Physical Review Letters · doi:10.1103/physrevlett.127.200505 · Cited by 81
Self-citationProvable bounds for noise-free expectation values computed from noisy samples
Barron, S. V., Egger, D. J., Pelofske, E., Bärtschi, A., Eidenbenz, S., Lehmkuehler, M., & Woerner, S. (2024) · Nature Computational Science · doi:10.1038/s43588-024-00709-1 · Cited by 25
Self-citation
Metadata
- Authors
- Piveteau, C., Sutter, D., & Woerner, S.
- Venue
- npj Quantum Information
- Published
- 2022-02-03
- Volume
- 8
- Issue
- 1
- ISSN
- 2056-6387 (ISSN-L)
- OpenAlex
- W3124217503
- Cited by
- 57
- References
- 8
- FWCI
- 3.88
- 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: Quasiprobability decompositions with reduced sampling overhead. https://app.cochat.ai/papers/10.1038/s41534-022-00517-3
- The paper
- Piveteau, C., Sutter, D., & Woerner, S. (2022). Quasiprobability decompositions with reduced sampling overhead. npj Quantum Information. https://doi.org/10.1038/s41534-022-00517-3
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.