Fetching the paper…
Reading the bibliography…
The scarcity of qubits is a major obstacle to the practical usage of quantum computers in the near future.
Everything you always wanted to know about LOCC (but were afraid to ask)
E. Chitambar, D. Leung, L. Mančinska, M. Ozols, and A. Winter · 1953
Earlier work this paper cites.
Demonstrating the viability of universal quantum computation using teleportation and single-qubit operations
D. Gottesman and I. L. Chuang · 1999
Earlier work this paper cites.
Robustness of entanglement
G. Vidal and R. Tarrach · 1999
Earlier work this paper cites.
Optimal local implementation of nonlocal quantum gates
J. Eisert, K. Jacobs, P. Papadopoulos, and M. B. Plenio · 2000
Earlier work this paper cites.
Classical deterministic complexity of Edmonds’ problem and quantum entanglement
L. Gurvits · 2003
Earlier work this paper cites.
Negative quasi-probability as a resource for quantum computation
V. Veitch, C. Ferrie, D. Gross, and J. Emerson · 2012
Earlier work this paper cites.
The resource theory of stabilizer quantum computation
V. Veitch, S. A. H. Mousavian, D. Gottesman, and J. Emerson · 2014
Earlier work this paper cites.
Estimating outcome probabilities of quantum circuits using quasiprobabilities
H. Pashayan, J. J. Wallman, and S. D. Bartlett · 2015
Earlier work this paper cites.
Trading classical and quantum computational resources
S. Bravyi, G. Smith, and J. A. Smolin · 2016
Earlier work this paper cites.
Error mitigation for short-depth quantum circuits
K. Temme, S. Bravyi, and J. M. Gambetta · 2017
Cited alongside, same era.
Application of a resource theory for magic states to fault-tolerant quantum computing
M. Howard and E. Campbell · 2017
Cited alongside, same era.
Practical quantum error mitigation for near-future applications
S. Endo, S. C. Benjamin, and Y. Li · 2018
Cited alongside, same era.
Error mitigation extends the computational reach of a noisy quantum processor
A. Kandala, K. Temme, A. D. Córcoles, A. Mezzacapo, J. M. Chow, and J. M. Gambetta · 2019
Cited alongside, same era.
Quantifying magic for multi-qubit operations
J. R. Seddon and E. T. Campbell · 2019
Cited alongside, same era.
Robustness of magic and symmetries of the stabiliser polytope
M. Heinrich and D. Gross · 2019
Cited alongside, same era.
Constructing a virtual two-qubit gate by sampling single-qubit operations
K. Mitarai and K. Fujii · 2021
Later among the works it cites.
Error mitigation for universal gates on encoded qubits
C. Piveteau, D. Sutter, S. Bravyi, J. M. Gambetta, and K. Temme · 2021
Later among the works it cites.
Quantifying quantum speedups: Improved classical simulation from tighter magic monotones
J. R. Seddon, B. Regula, H. Pashayan, Y. Ouyang, and E. T. Campbell · 2021
Later among the works it cites.
Overhead for simulating a non-local channel with local channels by quasiprobability sampling
K. Mitarai and K. Fujii · 2021
Later among the works it cites.
Cross-cross resonance gate
K. Heya and N. Kanazawa · 2021
Later among the works it cites.
Doubling the size of quantum simulators by entanglement forging
A. Eddins, M. Motta, T. P. Gujarati, S. Bravyi, A. Mezzacapo, C. Hadfield, and S. Sheldon · 2022
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Simulating large quantum circuits on a small quantum computer
T. Peng, A. W. Harrow, M. Ozols, and X. Wu · 2020
Cited alongside, same era.
Advanced methods for quasiprobabilistic quantum error mitigation
C. Piveteau · 2020
Cited alongside, same era.
Closest in time.
Quasiprobability decompositions with reduced sampling overhead
C. Piveteau, D. Sutter, and S. Woerner · 2022
Closest in time.
At what cost can we simulate large quantum circuits on small quantum computers?, 2022
C. Piveteau and D. Sutter · 2022
Closest in time.