@article{13125,
  abstract     = {The quantum approximate optimization algorithm (QAOA) is a variational quantum algorithm, where a quantum computer implements a variational ansatz consisting of p layers of alternating unitary operators and a classical computer is used to optimize the variational parameters. For a random initialization, the optimization typically leads to local minima with poor performance, motivating the search for initialization strategies of QAOA variational parameters. Although numerous heuristic initializations exist, an analytical understanding and performance guarantees for large p remain evasive.We introduce a greedy initialization of QAOA which guarantees improving performance with an increasing number of layers. Our main result is an analytic construction of 2p + 1 transition states—saddle points with a unique negative curvature direction—for QAOA with p + 1 layers that use the local minimum of QAOA with p layers. Transition states connect to new local minima, which are guaranteed to lower the energy compared to the minimum found for p layers. We use the GREEDY procedure to navigate the exponentially increasing with p number of local minima resulting from the recursive application of our analytic construction. The performance of the GREEDY procedure matches available initialization strategies while providing a guarantee for the minimal energy to decrease with an increasing number of layers p. },
  author       = {Sack, Stefan and Medina Ramos, Raimel A and Kueng, Richard and Serbyn, Maksym},
  issn         = {2469-9934},
  journal      = {Physical Review A},
  number       = {6},
  publisher    = {American Physical Society},
  title        = {{Recursive greedy initialization of the quantum approximate optimization algorithm with guaranteed improvement}},
  doi          = {10.1103/physreva.107.062404},
  volume       = {107},
  year         = {2023},
}

@article{10769,
  abstract     = {studiamos aspectos de Teoría Cuántica de Campos a densidad finita usando técnicas y conceptos de información cuántica. Nos enfocamos en fermiones de Dirac masivos con potencial químico en 1+1 dimensiones espacio-temporales. Usando la entropía de entrelazamiento en un intervalo, construimos la función c entrópica que es finita. Esta función c no es monótona, e incorpora el entrelazamiento de largo alcance proveniente de la superficie de Fermi. Motivados por trabajos previos de modelos en la red, calculamos numéricamente las entropías de Renyi y encontramos oscilaciones de Friedel. Seguidamente, analizamos la información mutua como una medida de correlación entre diferentes regiones. Usando una expansión de distancia grande desarrollada por Cardy, argumentamos que la información mutua detecta las correlaciones inducidas por la superficie de Fermi todavía al orden dominante en la expansión. Finalmente, analizamos la entropía relativa y sus generalizaciones de Renyi para distinguir estados con diferente carga. Encontramos que estados en diferentes sectores de superselección dan origen a un comportamiento super-extensivo en la entropía relativa.},
  author       = {Daguerre, L. and Torroba, G. and Medina Ramos, Raimel A and Solís, M.},
  issn         = {18501168},
  journal      = {Anales de la Asociacion Fisica Argentina},
  number       = {4},
  pages        = {93--98},
  publisher    = {Asociación Física Argentina},
  title        = {{Non relativistic quantum field theory: Dynamics and irreversibility}},
  doi          = {10.31527/analesafa.2021.32.4.93},
  volume       = {32},
  year         = {2022},
}

@article{11471,
  abstract     = {Variational quantum algorithms are promising algorithms for achieving quantum advantage on nearterm devices. The quantum hardware is used to implement a variational wave function and measure observables, whereas the classical computer is used to store and update the variational parameters. The optimization landscape of expressive variational ansätze is however dominated by large regions in parameter space, known as barren plateaus, with vanishing gradients, which prevents efficient optimization. In this work we propose a general algorithm to avoid barren plateaus in the initialization and throughout the optimization. To this end we define a notion of weak barren plateaus (WBPs) based on the entropies of local reduced density matrices. The presence of WBPs can be efficiently quantified using recently introduced shadow tomography of the quantum state with a classical computer. We demonstrate that avoidance of WBPs suffices to ensure sizable gradients in the initialization. In addition, we demonstrate that decreasing the gradient step size, guided by the entropies allows WBPs to be avoided during the optimization process. This paves the way for efficient barren plateau-free optimization on near-term devices. },
  author       = {Sack, Stefan and Medina Ramos, Raimel A and Michailidis, Alexios and Kueng, Richard and Serbyn, Maksym},
  issn         = {2691-3399},
  journal      = {PRX Quantum},
  keywords     = {General Medicine},
  number       = {2},
  publisher    = {American Physical Society},
  title        = {{Avoiding barren plateaus using classical shadows}},
  doi          = {10.1103/prxquantum.3.020365},
  volume       = {3},
  year         = {2022},
}

@article{10067,
  abstract     = {The search for novel entangled phases of matter has lead to the recent discovery of a new class of “entanglement transitions,” exemplified by random tensor networks and monitored quantum circuits. Most known examples can be understood as some classical ordering transitions in an underlying statistical mechanics model, where entanglement maps onto the free-energy cost of inserting a domain wall. In this paper we study the possibility of entanglement transitions driven by physics beyond such statistical mechanics mappings. Motivated by recent applications of neural-network-inspired variational Ansätze, we investigate under what conditions on the variational parameters these Ansätze can capture an entanglement transition. We study the entanglement scaling of short-range restricted Boltzmann machine (RBM) quantum states with random phases. For uncorrelated random phases, we analytically demonstrate the absence of an entanglement transition and reveal subtle finite-size effects in finite-size numerical simulations. Introducing phases with correlations decaying as 1/r^α in real space, we observe three regions with a different scaling of entanglement entropy depending on the exponent α. We study the nature of the transition between these regions, finding numerical evidence for critical behavior. Our work establishes the presence of long-range correlated phases in RBM-based wave functions as a required ingredient for entanglement transitions.},
  author       = {Medina Ramos, Raimel A and Vasseur, Romain and Serbyn, Maksym},
  issn         = {2469-9969},
  journal      = {Physical Review B},
  number       = {10},
  publisher    = {American Physical Society},
  title        = {{Entanglement transitions from restricted Boltzmann machines}},
  doi          = {10.1103/physrevb.104.104205},
  volume       = {104},
  year         = {2021},
}

@article{10545,
  abstract     = {Classical models with complex energy landscapes represent a perspective avenue for the near-term application of quantum simulators. Until now, many theoretical works studied the performance of quantum algorithms for models with a unique ground state. However, when the classical problem is in a so-called clustering phase, the ground state manifold is highly degenerate. As an example, we consider a 3-XORSAT model defined on simple hypergraphs. The degeneracy of classical ground state manifold translates into the emergence of an extensive number of Z2 symmetries, which remain intact even in the presence of a quantum transverse magnetic field. We establish a general duality approach that restricts the quantum problem to a given sector of conserved Z2 charges and use it to study how the outcome of the quantum adiabatic algorithm depends on the hypergraph geometry. We show that the tree hypergraph which corresponds to a classically solvable instance of the 3-XORSAT problem features a constant gap, whereas the closed hypergraph encounters a second-order phase transition with a gap vanishing as a power-law in the problem size. The duality developed in this work provides a practical tool for studies of quantum models with classically degenerate energy manifold and reveals potential connections between glasses and gauge theories.},
  author       = {Medina Ramos, Raimel A and Serbyn, Maksym},
  issn         = {2469-9934},
  journal      = {Physical Review A},
  number       = {6},
  publisher    = {American Physical Society},
  title        = {{Duality approach to quantum annealing of the 3-variable exclusive-or satisfiability problem (3-XORSAT)}},
  doi          = {10.1103/physreva.104.062423},
  volume       = {104},
  year         = {2021},
}

