Fetching the paper…
Reading the bibliography…
Quantum complexity is a measure of the minimal number of elementary operations required to approximately prepare a given state or unitary channel.
1905
Earlier work this paper cites.
1905
Earlier work this paper cites.
1910
Earlier work this paper cites.
1910
Earlier work this paper cites.
1912
Earlier work this paper cites.
A. W. Harrow and R. A. Low, “Random Quantum Circuits are Approximate 2-designs,” Commun. Math. Phys
1919
Earlier work this paper cites.
P. Bocchieri and A. Loinger, “Quantum recurrence theorem,” Phys. Rev
1957
Earlier work this paper cites.
Academic Press, New York; London, 1969
H. P. McKean, Stochastic integrals · 1969
Earlier work this paper cites.
PhD thesis, Indian Statistical Institute, Kolkata, 1969
J. Rao, Some contributions to the analysis of circular data · 1969
Earlier work this paper cites.
L. S. Schulman, “Note on the quantum recurrence theorem,” Phys. Rev. A
1978
Earlier work this paper cites.
A. Peres, “Recurrence phenomena in quantum dynamics,” Phys. Rev. Lett
1982
Earlier work this paper cites.
University of Iowa Press, 1982
S. J. Szarek, “Nets of Grassmann manifold and orthogonal groups,” in Proceedings of Banach Space Workshop · 1982
Earlier work this paper cites.
S. J. Szarek, “Metric Entropy of Homogeneous Spaces,” Banach Cent. Publ
1998
Earlier work this paper cites.
American Mathematical Society, 2002
A. Y. Kitaev, A. H. Shen, and M. N. Vyalyi, Classical and Quantum Computation · 2002
Earlier work this paper cites.
A. W. Harrow, B. Recht, and I. L. Chuang, “Efficient discrete approximations of quantum gates,” J. Math. Phys
2002
Earlier work this paper cites.
J. M. Maldacena, “Eternal black holes in anti-de Sitter,” JHEP
2003
Earlier work this paper cites.
L. Susskind, “Black Holes at Exp-time,” arXiv:2006.01280 [hep-th]
2006
Earlier work this paper cites.
M. A. Nielsen, M. R. Dowling, M. Gu, and A. C. Doherty, “Quantum Computation as Geometry,” Science
2006
Earlier work this paper cites.
G. K. Brennen, S. S. Bullock, and D. P. O’Leary, “Efficient Circuits for Exact-Universal Computations with Qudits,” Quantum Info. Comput
2006
Earlier work this paper cites.
P. Hayden and J. Preskill, “Black holes as mirrors: Quantum information in random subsystems,” JHEP
2007
Earlier work this paper cites.
2007
Cited alongside, same era.
M. Žnidarič, “Exact convergence times for generation of random bipartite entanglement,” Phys. Rev
2008
Cited alongside, same era.
Springer New York, New York, NY, 2009
J. Watrous, Quantum Computational Complexity · 2009
Cited alongside, same era.
R. A. Low, “Large deviation bounds for k-designs,” Proc. R. Soc. A
2009
Cited alongside, same era.
Graduate Texts in Mathematics. Springer, Dordrecht, 2009
R. W. Goodman and N. R. Wallach, Symmetry, Representations, and Invariants · 2009
Cited alongside, same era.
L. Susskind, “Entanglement is not enough,” Fortsch. Phys
2016
Later among the works it cites.
2016
Later among the works it cites.
2017
Later among the works it cites.
2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
X. Chen, Z.-C. Gu, and X.-G. Wen, “Local unitary transformation, long-range quantum entanglement, wave function renormalization, and topological order,” Phys. Rev
2010
Cited alongside, same era.
2010
Cited alongside, same era.
2010
Cited alongside, same era.
2010
Cited alongside, same era.
Cambridge University Press, 10th ed., 2011
M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information · 2011
Cited alongside, same era.
J. Tropp, “Freedman’s inequality for matrix martingales,” Electronic Communications in Probability
2011
Cited alongside, same era.
2012
Cited alongside, same era.
2017
Later among the works it cites.
J. Cotler, N. Hunter-Jones, J. Liu, and B. Yoshida, “Chaos, Complexity, and Random Matrices,” JHEP
2017
Later among the works it cites.
O. Marchal and J. Arbel, “On the sub-Gaussianity of the Beta and Dirichlet distributions,” Electron. Commun. Probab
2017
Later among the works it cites.
Mathematical surveys and monographs. American Mathematical Society, Providence, RI, 2017
G. Aubrun and S. J. Szarek, Alice and Bob meet Banach: the interface of asymptotic geometric analysis and quantum information theory · 2017
Later among the works it cites.
A. R. Brown and L. Susskind, “Second law of quantum complexity,” Phys. Rev
2018
Later among the works it cites.
A. Nahum, S. Vijay, and J. Haah, “Operator Spreading in Random Unitary Circuits,” Phys. Rev. X
2018
Later among the works it cites.
2018
Later among the works it cites.
L. Hackl and R. C. Myers, “Circuit complexity for free fermions,” JHEP
2018
Later among the works it cites.
E. Bacry, S. Gaïffas, and J. Muzy, “Concentration inequalities for matrix martingales in continuous time,” Probability Theory and Related Fields
2018
Later among the works it cites.
2019
Later among the works it cites.
T. Zhou and X. Chen, “Operator dynamics in a brownian quantum circuit,” Phys. Rev. E
2019
Later among the works it cites.
2019
Later among the works it cites.
J. Eisert, “Entangling Power and Quantum Circuit Complexity,” Phys. Rev. Lett
2021
Later among the works it cites.
S.-K. Jian, G. S. Bentsen, and B. Swingle, “Linear growth of circuit complexity from brownian dynamics,” Journal of High Energy Physics
2022
Closest in time.
2023
Closest in time.
K. Życzkowski and H.-J. Sommers, “Truncations of random unitary matrices,” J. Phys. A
2045
Closest in time.