Welcome to my research page!

I am Ernesto Campos, a researcher and adjunct professor of computer science at the Monterrey Institute of Technology (ITESM).

I study the intersection of quantum and classical machine learning, with research subjects including variational quantum algorithms, quantum approximate optimization, analog-digital algorithms, quantum walks, and tensor networks.

Much of my work on variational quantum algorithms has focused on a simple question: when, and why, does training succeed? In 2021, we identified several mechanisms that explain failure modes in shallow circuits. We showed that cost landscapes can undergo abrupt training transitions,1 where shallow models become trapped in trivial minima and require substantially greater depth to reach meaningful solutions. We also introduced the notion of training saturation,2 demonstrating that layerwise-optimized circuits hit a structural ceiling beyond which performance cannot improve. In parallel, we proved parameter concentration effects,3 showing that optimal parameters cluster across problem instances.

These results helped shift attention away from barren plateaus as the only obstacle, toward a broader landscape of structural training limits. In response, we proposed hardware-native, problem-tailored ansatz constructions.4 These models not only improved performance on combinatorial optimization problems, but also exhibited markedly better training behavior than generic circuit templates. More recently, we proved that QAOA achieves the same depth scaling as Grover search for unstructured problems,5 formally establishing a quantum speedup in that setting.

Together, this line of work has helped shape modern strategies such as warm-start initialization and dynamically constructed ansatz circuits. The central challenge now is sharper: to identify trainable quantum models that cannot be efficiently dequantized, and that deliver a provable advantage on meaningful problems.

Do you want to work with me?

Contact me to attend our weekly meetings! We are currently working on cost landscape engineering to improve variational algorithm trainability, and ensemble quantum algorithms that combine multiple models to solve complex problems within the scale constraints of near-term devices.

Teaching

I enjoy teaching students from all kinds of backgrounds—whether in physics, computer science, or beyond. My goal is to make challenging topics in quantum computing and computer science feel approachable and exciting by connecting theory with hands-on practice.

My courses at ITESM:

  1. Software Architecture and Design
    Spring 2026
  2. Introduction to Quantum Computing
    Fall 2025

Selected publications

  1. Depth scaling of unstructured search via quantum approximate optimization
    E. Campos, D. Rabinovich, A. Uvarov
    Physical Review A 110.1 (2024), 012428
  2. Ion native variational ansatz for quantum approximate optimization
    D. Rabinovich, S. Adhikary, E. Campos, V. Akshay, E. Anikin, R. Sengupta, O. Lakhmanskaya, K. Lakhmanskiy, J. Biamonte
    Physical Review A 106, 032418 (2022)
  3. Training saturation in layerwise quantum approximate optimisation
    E. Campos, D. Rabinovich, V. Akshay, J. Biamonte
    (Letter) Physical Review A 104, L030401 (2021)
  4. Parameter concentrations in quantum approximate optimization
    V. Akshay, D. Rabinovich, E. Campos, J. Biamonte
    (Letter) Physical Review A 104, L010401 (2021)
  5. Abrupt transitions in variational quantum circuit training
    E. Campos, A. Nasrallah, J. Biamonte
    Physical Review A 103, 032607 (2021)