SciPost logo

SciPost Submission Page

Circuit Complexity through phase transitions: consequences in quantum state preparation

by Sebastián Roca-Jerat, Teresa Sancho-Lorente, Juan Román-Roche, David Zueco

This Submission thread is now published as

Submission summary

Authors (as registered SciPost users): Sebastián Roca-Jerat · Juan Román-Roche · David Zueco
Submission information
Preprint Link: scipost_202307_00035v2  (pdf)
Date accepted: 2023-10-16
Date submitted: 2023-10-10 09:10
Submitted by: Roca-Jerat, Sebastián
Submitted to: SciPost Physics
Ontological classification
Academic field: Physics
  • Quantum Physics
Approach: Theoretical


In this paper, we analyze the circuit complexity for preparing ground states of quantum many-body systems. In particular, how this complexity grows as the ground state approaches a quantum phase transition. We discuss different definitions of complexity, namely the one following the Fubini-Study metric or the Nielsen complexity. We also explore different models: Ising, ZZXZ or Dicke. In addition, different forms of state preparation are investigated: analytic or exact diagonalization techniques, adiabatic algorithms (with and without shortcuts), and Quantum Variational Eigensolvers. We find that the divergence (or lack thereof) of the complexity near a phase transition depends on the non-local character of the operations used to reach the ground state. For Fubini-Study based complexity, we extract the universal properties and their critical exponents. In practical algorithms, we find that the complexity depends crucially on whether or not the system passes close to a quantum critical point when preparing the state. For both VQE and Adiabatic algorithms, we provide explicit expressions and bound the growth of complexity with respect to the system size and the execution time, respectively.

List of changes

Minor changes regarding bibliography.

- Reference [72] added
- Several references updated

Published as SciPost Phys. 15, 186 (2023)

Login to report or comment