Circuit Complexity through phase transitions: consequences in quantum state preparation

Abstract

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.

25 pages, 12 figures

References in corpus (31)

• A Quantum Approximate Optimization Algorithm
• Cost Function Dependent Barren Plateaus in Shallow Parametrized Quantum Circuits
• The Variational Quantum Eigensolver: a review of methods and best practices
• Quantum Computation as Geometry
• Quantum critical scaling of the geometric tensors
• Quantum chaos and the complexity of spread of states
• Is there evidence for exponential quantum advantage in quantum chemistry?
• Mixed-state fidelity and quantum criticality at finite temperature
• Ground state fidelity from tensor network representations
• Quantum fidelity and quantum phase transitions in matrix product states
• Quantum Adiabatic Brachistochrone
• Optimal control, geometry, and quantum computing
• Quantum Computational Complexity -- From Quantum Information to Black Holes and Back
• Quantum complexity and topological phases of matter
• Fidelity approach to quantum phase transitions: finite size scaling for quantum Ising model in a transverse field
• Krylov Complexity in Quantum Field Theory
• Scaling of variational quantum circuit depth for condensed matter systems
• Adiabatic Spectroscopy and a Variational Quantum Adiabatic Algorithm
• Cosmological Krylov Complexity
• From CFTs to theories with Bondi-Metzner-Sachs symmetries: Complexity and out-of-time-ordered correlators
• Complexity of mixed Gaussian states from Fisher information geometry
• Variational waveguide QED simulators
• Quantum kernels to learn the phases of quantum matter
• Complexity and information geometry in spin chains
• Exploring chaos in Dicke Model using ground state fidelity and Loschmidt echo
• Complexity in the Lipkin-Meshkov-Glick Model
• Renormalization group flows and quantum phase transitions: fidelity versus entanglement
• Complexity of Bose-Hubbard Model : Quantum Phase Transition
• Minimal action control method in quantum critical models
• Real space circuit complexity as a probe of phase diagrams
• Perturbative Complexity of Interacting Theory

Cited by in corpus (5)

• Transformer Wave Function for Quantum Long-Range models
• Holographic Complexity and Phase Transition for AdS Black Holes
• Sketching phase diagrams using low-depth variational quantum algorithms
• Time-dependent Hamiltonians and Geometry of Operators Generated by Them
• Comparing quantum complexity and quantum fidelity