Fetching the paper…
Reading the bibliography…
In this work, we propose a testing procedure to distinguish between the different approaches for computing complexity.
C. Bennett, “Logical reversibility of computation,” IBM J. Res. Develop. 17 (1973), 525-532
1973
Earlier work this paper cites.
W. P. Su, J. R. Schrieffer and A. J. Heeger, “Solitons in polyacetylene”, Phys. Rev. Lett
1979
Earlier work this paper cites.
C H. Bennett, J. Gill, “Relative to a Random Oracle A, PA != NPA != co-NPA with Probability”, SIAM J. Comput. 10(1): 96-113 (1981)
1981
Earlier work this paper cites.
A. M. Perelomov, Generalized Coherent States and Their Applications (Springer, Berlin, Heidelberg, 1986)
1986
Earlier work this paper cites.
D. Petz, “An Invitation to the Algebra of Canonical Commutation Relations” (Leuven University Press, Leuven, 1990)
1990
Earlier work this paper cites.
A. Berthiaume and G. Brassard, “The quantum challenge to structural complexity theory,” Proceedings of 7th IEEE Conference on Structure in Complexity Theory,1992
1992
Earlier work this paper cites.
E. Bernstein and U. Vazirani, “Quantum complexity theory,” Proceedings of ACM Symposium on Theory of Computing, 1993
1993
Earlier work this paper cites.
S. Lloyd, “Ultimate physical Limits to computation”, Nature, Aug 2000,volume 406 [quant-ph/9908043]
2000
Earlier work this paper cites.
S. Ryu and T. Takayanagi, “ Holographic derivation of entanglement entropy from AdS/CFT
2006
Earlier work this paper cites.
S. Ryu and T. Takayanagi, “ Aspects of Holographic Entanglement Entropy
2006
Earlier work this paper cites.
M. A. Nielsen, M. R. Dowling, M. Gu, and A. M. Doherty, Quantum Computation as Geometry, Science
2006
Earlier work this paper cites.
T. Gorin, T. Prosen, T. H. Seligman and M. Znidaric, “ Dynamics of Loschmidt echoes and fidelity decay,” Phys. Rep
2006
Earlier work this paper cites.
I. Bengtsson and K. Zyczkowski, “Geometry of Quantum States: An Introduction to Quantum Entanglement ”, Cambridge University Press, 2006
2006
Earlier work this paper cites.
Cambridge University Press, 2009
S. Arora and B. Barak, Computational Complexity: A Modern Approach · 2009
Earlier work this paper cites.
Springer, 2009
J. Watrous, Quantum computational complexity, in Encyclopedia of complexity and systems science, pp. 7174–7201 · 2009
Earlier work this paper cites.
M. Van Raamsdonk, “ Building up spacetime with quantum entanglement
2010
Earlier work this paper cites.
S. Aaronson, “BQP and the polynomial hierarchy”, STOC 2010: 141-150
2010
Earlier work this paper cites.
Oxford University Press, 2011
C. Moore and S. Mertens, The Nature of Computation · 2011
Earlier work this paper cites.
T. J. Osborne, Hamiltonian complexity, Reports on Progress in Physics
2012
Earlier work this paper cites.
S. P. Jordan, K. S. M. Lee and J. Preskill, “Quantum Algorithms for Quantum Field Theories,” Science
2012
Earlier work this paper cites.
A. Goussev, R A. Jalabert, H M. Pastawski, D. Wisniacki, “Loschmidt Echo,” Scholarpedia 7(8),
2012
Earlier work this paper cites.
T. Hartman and J. Maldacena, “Time Evolution of Entanglement Entropy from Black Hole Interiors
2013
Earlier work this paper cites.
J. Maldacena and L. Susskind, “ Cool horizons for entangled black holes
2013
Earlier work this paper cites.
2013
Earlier work this paper cites.
D. Stanford and L. Susskind, Complexity and Shock Wave Geometries, Phys. Rev
2014
Cited alongside, same era.
2014
Cited alongside, same era.
C. L. Kane and T. C. Lubensky, “Topological boundary modes in isostatic lattices”, Nature Phys
2014
Cited alongside, same era.
N. Shiba and T. Takayanagi, “Volume Law for the Entanglement Entropy in Non-local QFTs,” JHEP
2014
Cited alongside, same era.
M. Alishahiha, Holographic Complexity, Phys. Rev
2015
Cited alongside, same era.
2017
Later among the works it cites.
M. Flory, “A complexity/fidelity susceptibility
2017
Later among the works it cites.
M. Alishahiha and A. Faraji Astaneh, “Holographic Fidelity Susceptibility,” Phys. Rev. D
2017
Later among the works it cites.
A. Reynolds and S. F. Ross, Complexity in de Sitter Space, Class. Quant. Grav
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…
S. Gharibian, Y. Huang, Z. Landau, S. W. Shin, et al., Quantum hamiltonian complexity, Foundations and Trends in Theoretical Computer Science
2015
Cited alongside, same era.
S. Aaronson, A. Ambainis, “Forrelation: A Problem that Optimally Separates Quantum from Classical Computing”, STOC 2015: 307-316
2015
Cited alongside, same era.
L. Susskind, Computational Complexity and Black Hole Horizons, Fortsch. Phys
2016
Cited alongside, same era.
L. Susskind, Entanglement is not enough, Fortsch. Phys
2016
Cited alongside, same era.
2016
Cited alongside, same era.
2016
Cited alongside, same era.
J. L. F. Barbon and E. Rabinovici, “Holographic complexity and spacetime singularities,” JHEP
2016
Cited alongside, same era.
2017
Later among the works it cites.
2017
Later among the works it cites.
R. A. Jefferson and R. C. Myers, Circuit complexity in quantum field theory, JHEP
2017
Later among the works it cites.
2017
Later among the works it cites.
2017
Later among the works it cites.
2018
Closest in time.
2018
Closest in time.
M. Moosa, “Evolution of Complexity Following a Global Quench,” JHEP
2018
Closest in time.
M. Moosa, “Divergences in the rate of complexification,” Phys. Rev. D
2018
Closest in time.
Y. S. An and R. H. Peng, “Effect of the dilaton on holographic complexity growth,” Phys. Rev. D
2018
Closest in time.
2018
Closest in time.
2018
Closest in time.
2018
Closest in time.
2018
Closest in time.
2018
Closest in time.
2018
Closest in time.
R. Raz and A. Tal “Oracle Separation of BQP and PH,” Electronic Colloquium on Computational Complexity, Report No. 107 (2018)
2018
Closest in time.
B. Czech, “Einstein Equations from Varying Complexity,” Phys. Rev. Lett
2018
Closest in time.
2018
Closest in time.