Fetching the paper…
Reading the bibliography…
We describe algorithms to obtain an approximate classical description of a $d$-dimensional quantum state when given access to a unitary (and its inverse) that prepares it.
Quantum computing: Lecture notes, 2019
Ronald de Wolf · 1907
Earlier work this paper cites.
Probability inequalities for sums of bounded random variables
Wassily Hoeffding · 1963
Earlier work this paper cites.
A Bound on Tail Probabilities for Quadratic Forms in Independent Random Variables
D. L. Hanson and F. T. Wright · 1971
Earlier work this paper cites.
Approximate quantum Fourier transform and decoherence
Adriano Barenco, Artur Ekert, Kalle-Antti Suominen, and Päivi Törmä · 1996
Earlier work this paper cites.
Universal quantum simulators
Seth Lloyd · 1996
Earlier work this paper cites.
Quantum complexity theory
Ethan Bernstein and Umesh Vazirani · 1997
Earlier work this paper cites.
Bound on the number of functions that can be distinguished with k quantum queries
Edward Farhi, Jeffrey Goldstone, Sam Gutmann, and Michael Sipser · 1999
Earlier work this paper cites.
Fast parallel circuits for the quantum Fourier transform
Richard Cleve and John Watrous · 2000
Earlier work this paper cites.
Quantum computation and quantum information
Michael A. Nielsen and Isaac L. Chuang · 2000
Earlier work this paper cites.
A new proof for the existence of mutually unbiased bases
Somshubhro Bandyopadhyay, P. Oscar Boykin, Vwani P. Roychowdhury, and Farrokh Vatan · 2002
Earlier work this paper cites.
Quantum amplitude amplification and estimation
Gilles Brassard, Peter Høyer, Michele Mosca, and Alain Tapp · 2002
Earlier work this paper cites.
Fast quantum algorithm for numerical gradient estimation
Stephen P. Jordan · 2005
Earlier work this paper cites.
Parameterized Complexity Theory
Jörg Flum and Martin Grohe · 2006
Earlier work this paper cites.
Architectures for a quantum random access memory
Vittorio Giovannetti, Seth Lloyd, and Lorenzo Maccone · 2008
Earlier work this paper cites.
Quantum algorithm for linear systems of equations
Aram W. Harrow, Avinatan Hassidim, and Seth Lloyd · 2009
Earlier work this paper cites.
Quantum state tomography via compressed sensing
David Gross, Yi-Kai Liu, Steven T. Flammia, Stephen Becker, and Jens Eisert · 2010
Earlier work this paper cites.
Non-asymptotic theory of random matrices: extreme singular values
Mark Rudelson and Roman Vershynin · 2010
Earlier work this paper cites.
Quantum query complexity of state conversion
Troy Lee, Rajat Mittal, Ben W. Reichardt, Robert Špalek, and Márió Szegedy · 2011
Cited alongside, same era.
Quantum tomography via compressed sensing: error bounds, sample complexity and efficient estimators
Steven T Flammia, David Gross, Yi-Kai Liu, and Jens Eisert · 2012
Cited alongside, same era.
Low depth algorithms for quantum amplitude estimation
Tudor Giurgica-Tiron, Iordanis Kerenidis, Farrokh Labib, Anupam Prakash, and William J. Zeng · 2012
Cited alongside, same era.
Relations for certain symmetric norms and anti-norms before and after partial trace
Alexey E Rastegin · 2012
Cited alongside, same era.
Quantum Singular Value Transformation & Its Algorithmic Applications
András Gilyén · 2019
Later among the works it cites.
András Gilyén, Yuan Su, Guang Hao Low, and Nathan Wiebe · 2019
Later among the works it cites.
Hamiltonian simulation by qubitization
Guang Hao Low and Isaac L. Chuang · 2019
Later among the works it cites.
Hamiltonian simulation with nearly optimal dependence on spectral norm
Guang Hao Low · 2019
Later among the works it cites.
A Quantum View on Convex Optimization
Joran van Apeldoorn · 2020
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Mark Rudelson and Roman Vershynin · 2013
Cited alongside, same era.
Introduction to Matrix Analysis and Applications
Fumio Hiai and Dénes Petz · 2014
Cited alongside, same era.
Variations on quantum adversary
Aleksandrs Belovs · 2015
Cited alongside, same era.
An introduction to matrix concentration inequalities
Joel A. Tropp · 2015
Cited alongside, same era.
Ryan O’Donnell and John Wright · 2016
Cited alongside, same era.
Sample-optimal tomography of quantum states
Jeongwan Haah, Aram W. Harrow, Zhengfeng Ji, Xiaodi Wu, and Nengkun Yu · 2017
Cited alongside, same era.
Low rank matrix recovery from rank one measurements
Richard Kueng, Holger Rauhut, and Ulrich Terstiege · 2017
Cited alongside, same era.
Hamiltonian simulation by uniform spectral amplification
Guang Hao Low and Isaac L. Chuang · 2017
Cited alongside, same era.
Predicting many properties of a quantum system from very few measurements
Hsin-Yuan Huang, Richard Kueng, and John Preskill · 2020
Later among the works it cites.
A quantum interior point method for LPs and SDPs
Iordanis Kerenidis and Anupam Prakash · 2020
Later among the works it cites.
Quantum probability oracles & multidimensional amplitude estimation
Joran van Apeldoorn · 2021
Later among the works it cites.
Informationally complete povm-based shadow tomography, 2021
Atithi Acharya, Siddhartha Saha, and Anirvan M Sengupta · 2021
Later among the works it cites.
Quantum algorithms for multivariate monte carlo estimation, 2021
Arjan Cornelissen and Sofiene Jerbi · 2021
Later among the works it cites.
Nearly optimal quantum algorithm for estimating multiple expectation values, 2021
William J. Huggins, Kianna Wan, Jarrod McClean, Thomas E. O’Brien, Nathan Wiebe, and Ryan Babbush · 2021
Later among the works it cites.
Average-case verification of the Quantum Fourier Transform enables worst-case phase estimation
Noah Linden and Ronald de Wolf · 2021
Later among the works it cites.
Tight bounds for state tomography with incoherent measurements, 2022
Sitan Chen, Brice Huang, Jerry Li, Allen Liu, and Mark Sellke · 2022
Closest in time.
Logical shadow tomography: Efficient estimation of error-mitigated observables, 2022
Hong-Ye Hu, Ryan LaRose, Yi-Zhuang You, Eleanor Rieffel, and Zhihui Wang · 2022
Closest in time.
Computational complexity of mathematical operations
Wikipedia · 2022
Closest in time.
An improved sample complexity lower bound for quantum state tomography, 2022
Henry Yuen · 2022
Closest in time.