Abstract
Abstract
We study the temporal evolution of the circuit complexity for a subsystem in harmonic lattices after a global quantum quench of the mass parameter, choosing the initial reduced density matrix as the reference state. Upper and lower bounds are derived for the temporal evolution of the complexity for the entire system. The subsystem complexity is evaluated by employing the Fisher information geometry for the covariance matrices. We discuss numerical results for the temporal evolutions of the subsystem complexity for a block of consecutive sites in harmonic chains with either periodic or Dirichlet boundary conditions, comparing them with the temporal evolutions of the entanglement entropy. For infinite harmonic chains, the asymptotic value of the subsystem complexity is studied through the generalised Gibbs ensemble.
Publisher
Springer Science and Business Media LLC
Subject
Nuclear and High Energy Physics
Reference135 articles.
1. M.A. Nielsen, A Geometric Approach to Quantum Circuit Lower Bounds, Quant. Inf. Comput. 6 (2006) 213 [quant-ph/0502070].
2. M.A. Nielsen, M.R. Dowling, M. Gu and A. Doherty, Quantum computation as geometry, Science 311 (2006) 1133 [quant-ph/0603161].
3. M.R. Dowling and M.A. Nielsen, The Geometry of Quantum Computation, Quant. Inf. Comput. 8 (2008) 861 [quant-ph/0701004].
4. J. Watrous, Quantum Computational Complexity, in Encyclopedia of Complexity and Systems Science, Springer (2009), p. 7174 [DOI] [arXiv:0804.3401].
5. S. Aaronson, The Complexity of Quantum States and Transformations: From Quantum Money to Black Holes, arXiv:1607.05256 [INSPIRE].
Cited by
18 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献