Fetching the paper…
Reading the bibliography…
Estimating expectation values is a key subroutine in quantum algorithms.
P. Jordan and E. Wigner, Über das Paulische Äquivalenzverbot, Z. Phys. 47
1928
Earlier work this paper cites.
A. N. Habermann, Parallel neighbor-sort (or the glory of the induction principle), Carnegie Mellon University Technical Report No. AD-759-248 (1972)
1972
Earlier work this paper cites.
R. P. Feynman, Simulating physics with computers, Int. J. Theor. Phys. 21
1982
Earlier work this paper cites.
B. Efron, Bootstrap methods: Another look at the jackknife, in Breakthroughs in Statistics , edited by S. Kotz and N. L. Johnson (Springer, New York, 1992) pp. 569–593
1992
Earlier work this paper cites.
S. R. White, Density matrix formulation for quantum renormalization groups, Phys. Rev. Lett. 69
1992
Earlier work this paper cites.
M. Reck, A. Zeilinger, H. J. Bernstein, and P. Bertani, Experimental realization of any discrete unitary operator, Phys. Rev. Lett. 73
1994
Earlier work this paper cites.
L. G. Valiant, Quantum computers that can be simulated classically in polynomial time, in Proceedings of the 33rd Annual ACM Symposium on Theory of Computing (2001) pp. 114–123
2001
Earlier work this paper cites.
E. Knill, Fermionic linear optics and matchgates, arXiv:quant-ph/0108033 (2001)
2001
Earlier work this paper cites.
B. M. Terhal and D. P. DiVincenzo, Classical simulation of noninteracting-fermion quantum circuits, Phys. Rev. A 65
2002
Earlier work this paper cites.
W. Fulton and J. Harris, Representation Theory: A First Course (Springer-Verlag, New York, 2004)
2004
Earlier work this paper cites.
S. Bravyi, Lagrangian representation for fermionic linear optics, Quantum Inf. Comput. 5
2005
Earlier work this paper cites.
D. P. DiVincenzo and B. M. Terhal, Fermionic linear optics revisited, Found. Phys. 35
2005
Earlier work this paper cites.
T. J. Osborne, Efficient approximation of the dynamics of one-dimensional quantum spin systems, Phys. Rev. Lett. 97
2006
Earlier work this paper cites.
R. Jozsa and A. Miyake, Matchgates and classical simulation of quantum circuits, Proc. R. Soc. A 464
2008
Earlier work this paper cites.
E. Magesan, J. M. Gambetta, and J. Emerson, Scalable and robust randomized benchmarking of quantum processes, Phys. Rev. Lett. 106
2011
Earlier work this paper cites.
A. G. Fowler, M. Mariantoni, J. M. Martinis, and A. N. Cleland, Surface codes: Towards practical large-scale quantum computation, Phys. Rev. A 86
2012
Earlier work this paper cites.
S. Bravyi and R. König, Classical simulation of dissipative fermionic linear optics, Quantum Inf. Comput. 12
2012
Earlier work this paper cites.
J. M. Gambetta et al. , Characterization of addressability by simultaneous randomized benchmarking, Phys. Rev. Lett. 109
2012
Earlier work this paper cites.
E. Magesan, J. M. Gambetta, and J. Emerson, Characterizing quantum gates via randomized benchmarking, Phys. Rev. A 85
2012
Earlier work this paper cites.
T. Sugiyama, P. S. Turner, and M. Murao, Precision-guaranteed quantum tomography, Phys. Rev. Lett. 111
2013
Earlier work this paper cites.
I. M. Georgescu, S. Ashhab, and F. Nori, Quantum simulation, Rev. Mod. Phys. 86
2014
Earlier work this paper cites.
A. Peruzzo et al. , A variational eigenvalue solver on a photonic quantum processor, Nat. Commun. 5
2014
Earlier work this paper cites.
J. Kelly et al. , State preservation by repetitive error detection in a superconducting quantum circuit, Nature 519
2015
Earlier work this paper cites.
J. Wallman, C. Granade, R. Harper, and S. T. Flammia, Estimating the coherence of noise, New J. Phys. 17
2015
Earlier work this paper cites.
J. R. McClean, J. Romero, R. Babbush, and A. Aspuru-Guzik, The theory of variational hybrid quantum-classical algorithms, New J. Phys. 18
2016
Earlier work this paper cites.
P. J. J. O’Malley et al. , Scalable quantum simulation of molecular energies, Phys. Rev. X 6
2016
Earlier work this paper cites.
J. J. Wallman and J. Emerson, Noise tailoring for scalable quantum computation via randomized compiling, Phys. Rev. A 94
2016
Earlier work this paper cites.
W. R. Clements, P. C. Humphreys, B. J. Metcalf, W. S. Kolthammer, and I. A. Walmsley, Optimal design for universal multiport interferometers, Optica 3
2016
Earlier work this paper cites.
G. Feng et al. , Estimating the coherence of noise in quantum control of a solid-state qubit, Phys. Rev. Lett. 117
2016
Earlier work this paper cites.
A. Kandala et al. , Hardware-efficient variational quantum eigensolver for small molecules and quantum magnets, Nature 549
2017
Earlier work this paper cites.
K. Temme, S. Bravyi, and J. M. Gambetta, Error mitigation for short-depth quantum circuits, Phys. Rev. Lett. 119
2017
Earlier work this paper cites.
T. Proctor, K. Rudinger, K. Young, M. Sarovar, and R. Blume-Kohout, What randomized benchmarking actually measures, Phys. Rev. Lett. 119
2017
Earlier work this paper cites.
2017
Earlier work this paper cites.
J. Preskill, Quantum computing in the NISQ era and beyond, Quantum 2
2018
Earlier work this paper cites.
J. I. Colless et al. , Computation of molecular spectra on a quantum processor with an error-resilient algorithm, Phys. Rev. X 8
2018
Earlier work this paper cites.
E. F. Dumitrescu et al. , Cloud quantum computing of an atomic nucleus, Phys. Rev. Lett. 120
2018
Earlier work this paper cites.
C. Hempel et al. , Quantum chemistry calculations on a trapped-ion quantum simulator, Phys. Rev. X 8
2018
Earlier work this paper cites.
X. Bonet-Monroig, R. Sagastizabal, M. Singh, and T. E. O’Brien, Low-cost error mitigation by symmetry verification, Phys. Rev. A 98
2018
Earlier work this paper cites.
Z. Jiang, K. J. Sung, K. Kechedzhi, V. N. Smelyanskiy, and S. Boixo, Quantum algorithms to simulate many-body physics of correlated fermions, Phys. Rev. Applied 9
2018
Earlier work this paper cites.
N. C. Rubin, R. Babbush, and J. McClean, Application of fermionic marginal constraints to hybrid quantum algorithms, New J. Phys. 20
2018
Earlier work this paper cites.
I. D. Kivlichan et al. , Quantum simulation of electronic structure with linear depth and connectivity, Phys. Rev. Lett. 120
2018
Earlier work this paper cites.
J. J. Wallman, Randomized benchmarking with gate-dependent noise, Quantum 2
2018
Earlier work this paper cites.
A. Carignan-Dugas, K. Boone, J. J. Wallman, and J. Emerson, From randomized benchmarking experiments to gate-set circuit fidelity: how to interpret randomized benchmarking decay parameters, New J. Phys. 20
2018
Earlier work this paper cites.
A. Chapman and A. Miyake, Classical simulation of quantum circuits by dynamical localization: Analytic results for Pauli-observable scrambling in time-dependent disorder, Phys. Rev. A 98
2018
Earlier work this paper cites.
S. Boixo et al. , Characterizing quantum supremacy in near-term devices, Nat. Phys. 14
2018
Earlier work this paper cites.
C. Neill et al. , A blueprint for demonstrating quantum supremacy with superconducting qubits, Science 360
2018
Cited alongside, same era.
X. Yuan, S. Endo, Q. Zhao, Y. Li, and S. C. Benjamin, Theory of variational quantum simulation, Quantum 3
2019
Cited alongside, same era.
A. Kandala, K. Temme, A. D. Córcoles, A. Mezzacapo, J. M. Chow, and J. M. Gambetta, Error mitigation extends the computational reach of a noisy quantum processor, Nature 567
2019
Cited alongside, same era.
C. Kokail et al. , Self-verifying variational quantum simulation of lattice models, Nature 569
2019
Cited alongside, same era.
F. Arute et al. (Google AI Quantum and collaborators), Quantum supremacy using a programmable superconducting processor, Nature 574
2019
Cited alongside, same era.
L. S. Madsen et al. , Quantum computational advantage with a programmable photonic processor, Nature 606
2022
Later among the works it cites.
J. F. Gonthier, M. D. Radin, C. Buda, E. J. Doskocil, C. M. Abuan, and J. Romero, Measurements as a roadblock to near-term practical quantum advantage in chemistry: resource analysis, Phys. Rev. Res. 4
2022
Later among the works it cites.
J. Tilly et al. , The variational quantum eigensolver: a review of methods and best practices, Physics Reports 986
2022
Later among the works it cites.
S. H. Sack, R. A. Medina, A. A. Michailidis, R. Kueng, and M. Serbyn, Avoiding barren plateaus using classical shadows, PRX Quantum 3
2022
Later among the works it cites.
G. Boyd and B. Koczor, Training variational quantum circuits with CoVaR: Covariance root finding with classical shadows, Phys. Rev. X 12
2022
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
S. Aaronson and G. N. Rothblum, Gentle measurement of quantum states and differential privacy, in Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing (Association for Computing Machinery, New York, 2019) pp. 322–333
2019
Cited alongside, same era.
S. McArdle, X. Yuan, and S. Benjamin, Error-mitigated digital quantum simulation, Phys. Rev. Lett. 122
2019
Cited alongside, same era.
J. Helsen, X. Xue, L. M. K. Vandersypen, and S. Wehner, A new class of efficient randomized benchmarking protocols, npj Quantum Inf. 5
2019
Cited alongside, same era.
S. McArdle, S. Endo, A. Aspuru-Guzik, S. C. Benjamin, and X. Yuan, Quantum computational chemistry, Rev. Mod. Phys. 92
2020
Cited alongside, same era.
B. Bauer, S. Bravyi, M. Motta, and G. K.-L. Chan, Quantum algorithms for quantum chemistry and quantum materials science, Chem. Rev. 120
2020
Cited alongside, same era.
Y. Nam et al. , Ground-state energy estimation of the water molecule on a trapped-ion quantum computer, npj Quantum Inf. 6
2020
Cited alongside, same era.
N. C. Rubin et al. (Google AI Quantum and collaborators), Hartree-Fock on a superconducting qubit quantum computer, Science 369
2020
Cited alongside, same era.
Later among the works it cites.
2022
Later among the works it cites.
B. O’Gorman, Fermionic tomography and learning, arXiv:2207.14787 (2022)
2022
Later among the works it cites.
G. H. Low, Classical shadows of fermions with particle number symmetry, arXiv:2208.08964 (2022)
2022
Later among the works it cites.
2022
Later among the works it cites.
D. E. Koh and S. Grewal, Classical shadows with noise, Quantum 6
2022
Later among the works it cites.
E. Van Den Berg, Z. K. Minev, and K. Temme, Model-free readout-error mitigation for quantum expectation values, Phys. Rev. A 105
2022
Later among the works it cites.
R. Takagi, S. Endo, S. Minagawa, and M. Gu, Fundamental limits of quantum error mitigation, npj Quantum Inf. 8
2022
Later among the works it cites.
2022
Later among the works it cites.
M. Oszmaniec, N. Dangniam, M. E. S. Morales, and Z. Zimborás, Fermion sampling: a robust quantum computational advantage scheme using fermionic linear optics and magic input states, PRX Quantum 3
2022
Later among the works it cites.
M. Fishman, S. R. White, and E. M. Stoudenmire, The ITensor software library for tensor network calculations, SciPost Phys. Codebases 4
2022
Later among the works it cites.
2022
Later among the works it cites.
J. Helsen, S. Nezami, M. Reagor, and M. Walter, Matchgate benchmarking: Scalable benchmarking of a continuous family of many-qubit gates, Quantum 6
2022
Later among the works it cites.
D. S. Wild and A. M. Alhambra, Classical simulation of short-time quantum dynamics, PRX Quantum 4
2023
Closest in time.
N. Sundaresan et al. , Demonstrating multi-round subsystem quantum error correction using matching and maximum likelihood decoders, Nat. Commun. 14
2023
Closest in time.
Google Quantum AI, Suppressing quantum errors by scaling a surface code logical qubit, Nature 614
2023
Closest in time.
V. V. Sivak et al. , Real-time quantum error correction beyond break-even, Nature 616
2023
Closest in time.
Z. Ni et al. , Beating the break-even point with a discrete-variable-encoded logical qubit, Nature 616
2023
Closest in time.
M. Motta et al. , Quantum chemistry simulation of ground-and excited-state properties of the sulfonium cation on a superconducting quantum processor, Chem. Sci. 14
2023
Closest in time.
T. E. O’Brien et al. (Google Quantum AI and collaborators), Purification-based quantum error mitigation of pair-correlated electron simulations, Nat. Phys. (2023)
2023
Closest in time.
2023
Closest in time.
Z. Cai et al. , Quantum error mitigation, Rev. Mod. Phys. 95
2023
Closest in time.
2023
Closest in time.
2023
Closest in time.
J. Kunjummen, M. C. Tran, D. Carney, and J. M. Taylor, Shadow process tomography of quantum channels, Phys. Rev. A 107
2023
Closest in time.
K. Wan, W. J. Huggins, J. Lee, and R. Babbush, Matchgate shadows for fermionic quantum simulation, Commun. Math. Phys. 404
2023
Closest in time.
R. Babbush et al. , Quantum simulation of exact electron dynamics can be more efficient than classical mean-field methods, Nat. Commun. 14
2023
Closest in time.
2023
Closest in time.
T. Gu, X. Yuan, and B. Wu, Efficient measurement schemes for bosonic systems, Quantum Sci. Technol. 8
2023
Closest in time.
A. Elben et al. , The randomized measurement toolbox, Nat. Rev. Phys. 5
2023
Closest in time.
A. Seif, Z.-P. Cian, S. Zhou, S. Chen, and L. Jiang, Shadow distillation: Quantum error mitigation with classical shadows for near-term quantum processors, PRX Quantum 4
2023
Closest in time.
2023
Closest in time.
R. Takagi, H. Tajima, and M. Gu, Universal sampling lower bounds for quantum error mitigation, Phys. Rev. Lett. 131
2023
Closest in time.
K. Tsubouchi, T. Sagawa, and N. Yoshioka, Universal cost bound of quantum error mitigation based on quantum estimation theory, Phys. Rev. Lett. 131
2023
Closest in time.
Cirq Developers, Cirq (2023)
2023
Closest in time.
2023
Closest in time.
C. Huang et al. , Quantum instruction set design for performance, Phys. Rev. Lett. 130
2023
Closest in time.
S. Becker, N. Datta, L. Lami, and C. Rouzé, Classical shadow tomography for continuous variables quantum systems, IEEE Trans. Inf. Theory 70
2024
Closest in time.
H. Jnane, J. Steinberg, Z. Cai, H. C. Nguyen, and B. Koczor, Quantum error mitigated classical shadows, PRX Quantum 5
2024
Closest in time.
B. Wu and D. E. Koh, Error-mitigated fermionic classical shadows on noisy quantum devices, npj Quantum Inf. 10
2024
Closest in time.