Fetching the paper…
Reading the bibliography…
Contemporary quantum computers have relatively high levels of noise, making it difficult to use them to perform useful calculations, even with a large number of qubits.
1905
Earlier work this paper cites.
Maurice George Kendall and Others, The Advanced Theory of Statistics (Charles Griffin and Co., Ltd., London, 1946)
1946
Earlier work this paper cites.
A Berthiaume, D Deutsch, and R Jozsa, “The stabilisation of quantum computations,”
1994
Earlier work this paper cites.
A Yu. Kitaev, “Quantum measurements and the abelian stabilizer problem,”
1995
Earlier work this paper cites.
D Aharonov and M Ben-Or, “Fault-tolerant quantum computation with constant error,”
1997
Earlier work this paper cites.
Adriano Barenco, André Berthiaume, David Deutsch, Artur Ekert, Richard Jozsa, and Chiara Macchiavello, “Stabilization of quantum computations by symmetrization,”
1997
Earlier work this paper cites.
John Preskill, “Lecture notes for physics 229: Quantum information and computation,”
1998
Earlier work this paper cites.
Asher Peres, “Error symmetrization in quantum computers,”
1999
Earlier work this paper cites.
J I Cirac, A K Ekert, and C Macchiavello, “Optimal purification of single qubits,”
1999
Earlier work this paper cites.
Paweł Horodecki and Artur Ekert, “Method for direct detection of quantum entanglement,”
2002
Earlier work this paper cites.
Artur K Ekert, Carolina Moura Alves, Daniel K L Oi, Michał Horodecki, Paweł Horodecki, and L C Kwek, “Direct estimations of linear and nonlinear functionals of a quantum state,”
2002
Earlier work this paper cites.
Todd A Brun, “Measuring polynomial functions of states,”
2004
Earlier work this paper cites.
D V Dmitriev and V Ya Krivnov, “Quasi-one-dimensional anisotropic heisenberg model in a transverse magnetic field,”
2004
Earlier work this paper cites.
Sergey Bravyi and Alexei Kitaev, “Universal quantum computation with ideal clifford gates and noisy ancillas,”
2005
Earlier work this paper cites.
E Knill, “Quantum computing with realistically noisy devices,”
2005
Earlier work this paper cites.
2006
Earlier work this paper cites.
Dave Bacon, Isaac L Chuang, and Aram W Harrow, “Efficient quantum circuits for schur and Clebsch-Gordan transforms,”
2006
Earlier work this paper cites.
Matthew B Hastings, Iván González, Ann B Kallin, and Roger G Melko, “Measuring renyi entanglement entropy in quantum monte carlo simulations,”
2010
Earlier work this paper cites.
D S Wang, A G Fowler, A M Stephens, and L C L Hollenberg, “Threshold error rates for the toric and planar codes,”
2010
Earlier work this paper cites.
Austin G Fowler, Matteo Mariantoni, John M Martinis, and Andrew N Cleland, “Surface codes: Towards practical large-scale quantum computation,”
2012
Earlier work this paper cites.
Clare Horsman, Austin G Fowler, Simon Devitt, and Rodney Van Meter, “Surface code quantum computing by lattice surgery,”
2012
Cited alongside, same era.
Juan Carlos Garcia-Escartin and Pedro Chamorro-Posada, “SWAP test and Hong-Ou-Mandel effect are equivalent,”
2013
Cited alongside, same era.
Tosio Kato, Perturbation theory for linear operators (Springer Science & Business Media, 2013)
2013
Cited alongside, same era.
Roman Orus, “A practical introduction to tensor networks: Matrix product states and projected entangled pair states,”
2014
Cited alongside, same era.
Rajibul Islam, Ruichao Ma, Philipp M Preiss, M Eric Tai, Alexander Lukin, Matthew Rispoli, and Markus Greiner, “Measuring entanglement entropy in a quantum many-body system,”
2015
Cited alongside, same era.
2019
Later among the works it cites.
Yanzhu Chen, Maziar Farahzad, Shinjae Yoo, and Tzu-Chieh Wei, “Detector tomography on IBM quantum computers and mitigation of an imperfect measurement,”
2019
Later among the works it cites.
Yiğit Subaşı, Lukasz Cincio, and Patrick J Coles, “Entanglement spectroscopy with a depth-two quantum circuit,”
2019
Later among the works it cites.
Jordan Cotler, Soonwon Choi, Alexander Lukin, Hrant Gharibyan, Tarun Grover, M Eric Tai, Matthew Rispoli, Robert Schittko, Philipp M Preiss, Adam M Kaufman, Markus Greiner, Hannes Pichler, and Patrick Hayden, “Quantum virtual cooling,”
2019
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Leonardo Banchi, Abolfazl Bayat, and Sougato Bose, “Entanglement entropy scaling in solid-state spin arrays via capacitance measurements,”
2016
Cited alongside, same era.
Kristan Temme, Sergey Bravyi, and Jay M Gambetta, “Error mitigation for Short-Depth quantum circuits,”
2017
Cited alongside, same era.
Jarrod R McClean, Mollie E Kimchi-Schwartz, Jonathan Carter, and Wibe A de Jong, “Hybrid quantum-classical hierarchy for mitigation of decoherence and determination of excited states,”
2017
Cited alongside, same era.
Sonika Johri, Damian S Steiger, and Matthias Troyer, “Entanglement spectroscopy on a quantum computer,”
2017
Cited alongside, same era.
Jacob Biamonte and Ville Bergholm, “Tensor networks in a nutshell,”
2017
Cited alongside, same era.
Jacob C Bridgeman and Christopher T Chubb, “Hand-waving and interpretive dance: an introductory course on tensor networks,”
2017
Cited alongside, same era.
John Preskill, “Quantum computing in the NISQ era and beyond,”
2018
Cited alongside, same era.
2019
Later among the works it cites.
Earl Campbell, “Random compiler for fast hamiltonian simulation,”
2019
Later among the works it cites.
Andrew M Childs, Aaron Ostrander, and Yuan Su, “Faster quantum simulation by randomization,”
2019
Later among the works it cites.
Daniel Litinski, “A Game of Surface Codes: Large-Scale Quantum Computing with Lattice Surgery,”
2019
Later among the works it cites.
P Krantz, M Kjaergaard, F Yan, T P Orlando, S Gustavsson, and W D Oliver, “A quantum engineer’s guide to superconducting qubits,”
2019
Later among the works it cites.
2020
Closest in time.
2020
Closest in time.
2020
Closest in time.
Jarrod R McClean, Zhang Jiang, Nicholas C Rubin, Ryan Babbush, and Hartmut Neven, “Decoding quantum errors with subspace expansions,”
2020
Closest in time.
Google AI Quantum and Collaborators, “Hartree-Fock on a superconducting qubit quantum computer,”
2020
Closest in time.
Filip B Maciejewski, Zoltán Zimborás, and Michał Oszmaniec, “Mitigation of readout noise in near-term quantum devices by classical post-processing based on detector tomography,”
2020
Closest in time.
2020
Closest in time.
Yingkai Ouyang, David R White, and Earl T Campbell, “Compilation by stochastic Hamiltonian sparsification,”
2020
Closest in time.
Bálint Koczor, “Exponential error suppression for Near-Term quantum devices,”
2020
Closest in time.
Jordan Cotler and Frank Wilczek, “Quantum overlapping tomography,”
2020
Closest in time.
Xavier Bonet-Monroig, Ryan Babbush, and Thomas E O’Brien, “Nearly optimal measurement scheduling for partial tomography of quantum states,”
2020
Closest in time.