AMAlejandro Montanez-Barrera

Alejandro Montanez-Barrera

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Alejandro Montanez-Barrera has a total of 60 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Optimizing QAOA circuit transpilation with parity twine and SWAP network encodings

    by J. A. Montañez-Barrera, Yanjun Ji, Michael R. von Spakovsky, David E. Bernal Neira, Kristel Michielsen

    Mapping quantum approximate optimization algorithm (QAOA) circuits with nontrivial connectivity in fixed-layout quantum platforms, such as superconducting quantum processing units (QPUs), requires a transpilation process to match the circuit to the hardware layout. This step is critical for reducing error rates on noisy QPUs. Two approaches that improve the resources required for such transpilation are the SWAP network and parity twine chains (PTC), which reduce the two-qubit gate count and circuit depth needed to represent fully connected circuits. In this work, we introduce a simulated annealing-based method that further reduces the encoding overhead of PTC and SWAP networks for QAOA circuits with nonfully connected two-qubit interactions. The method is benchmarked against various transpilers, including the Qiskit SAT mapper, demonstrating that beyond specific connectivity thresholds it achieves significant reductions in both two-qubit gate count and circuit depth. For example, for a 120-qubit QAOA instance with 25% connectivity, our method achieves an 87% reduction in depth and a 29% reduction in two-qubit gates compared with the Qiskit transpiler. Finally, the practical impact of PTC encoding is validated by benchmarking QAOA on the and devices, showing improved performance for systems of up to 20 qubits.

  • Top Cited Papers
    Open Access

    The Quantum Optimization Benchmarking Library

    by Thorsten Koch, David E. Bernal Neira, Ying Chen, Giorgio Cortiana, Daniel J. Egger, Raoul Heese, Narendra N. Hegade, Alejandro Gomez Cadavid, Rhea Huang, Toshinari Itoko, et al.

    Recent progress has brought benchmarking of (heuristic) quantum algorithms at scale within reach. Particularly in combinatorial optimization, it is key to empirically analyze and track progress towards quantum advantage. This work introduces a systematic, fair and comparable benchmarking framework for quantum optimization methods by presenting ten model-independent problem classes that are challenging for classical methods. Track records of specific instances and solutions are given in an accompanying open-source repository. While the individual properties of the problem classes vary, they all become challenging from less than 100 to, at most, an order of 100,000 decision variables. We reference results from state-of-the-art solvers for instances across all problem classes and demonstrate exemplary baseline results obtained with quantum solvers for selected problems, which illustrate standardized benchmark reporting. The presented problem instances may be approached with classical or quantum algorithms executed on varying hardware platforms to drive the field towards quantum advantage.


  • Open Access

    Interplay of Confinement and Localization in a Programmable Rydberg Atom Chain

    by Andrea B. Rava, Jhon A. Montanez-Barrera, Kristel Michielsen, Jaka Vodeb

    Analog quantum simulators promise access to complex many-body dynamics, yet their performance is ultimately set by how device imperfections compete with intrinsic physical mechanisms. Here we present an end-to-end study of correlation spreading in a programmable Rydberg-atom chain realizing a longitudinal-field transverse-field Ising model, focusing on the joint impact of confinement and effective disorder. Experiments performed on QuEra's Aquila quantum processor are benchmarked against large-scale coherent emulations using the Juelich Quantum Annealing Simulator (JUQAS), enabling the controlled inclusion of realistic hardware imperfections. In the ideal coherent limit, a tunable longitudinal field induces confinement of domain-wall excitations into mesonic bound states, leading to a progressive truncation of the correlation light cone. When experimentally relevant inhomogeneities and fluctuations are included, correlations instead saturate at finite distance even in the nominally deconfined regime, revealing localization driven by emergent disorder. The close quantitative agreement between noisy emulations and experimental data allows us to attribute the observed saturation to specific hardware error channels and to identify the dominant contribution. Our results establish a practical framework for diagnosing and modeling error-induced localization in Rydberg quantum processors, while demonstrating that confinement remains a robust and programmable mechanism for engineering non-ergodic dynamics on near-term quantum hardware.

  • Open Access

    Benchmarking neutral atom-based quantum processors at scale

    by Andrea B. Rava, Kristel Michielsen, J. A. Montanez-Barrera

    In recent years, neutral atom-based quantum computation has been established as a competing alternative for the realization of fault-tolerant quantum computation. However, as with other quantum technologies, various sources of noise limit their performance. With processors continuing to scale up, new techniques are needed to characterize and compare them in order to track their progress. In this work, we present two systematic benchmarks that evaluate these quantum processors at scale. We use the quantum adiabatic algorithm (QAA) and the quantum approximate optimization algorithm (QAOA) to solve maximal independent set (MIS) instances of random unit-disk graphs. These benchmarks are scalable, relying not on prior knowledge of the system's evolution but on the quality of the MIS solutions obtained. We benchmark quera_aquila and pasqal_fresnel on problem sizes up to 102 and 85 qubits, respectively. Overall, quera_aquila performs better on QAOA and QAA instances. Finally, we generate MIS instances of up to 1000 qubits, providing scalable benchmarks for evaluating future, larger processors as they become available.

  • Open Access

    Diagnosing crosstalk in large-scale QPUs using zero-entropy classical shadows

    by J A Montañez-Barrera, G P Beretta, Kristel Michielsen, Michael R von Spakovsky

    As quantum processing units (QPUs) scale toward hundreds of qubits, diagnosing noise-induced correlations (crosstalk) becomes critical for reliable quantum computation. In this work, we introduce Zero-Entropy Classical Shadows (ZECS), a diagnostic tool that uses information of a rank-one quantum state tomography reconstruction from classical shadow information to make a crosstalk diagnosis. We use ZECS on trapped ion and superconductive QPUs including ionq_forte (36 qubits), ibm_brisbane (127 qubits), and ibm_fez (156 qubits), using from 1000 to 6000 samples. With these samples, we use the ZECS to characterize crosstalk among disjoint qubit subsets across the full hardware. This information is then used to select low-crosstalk qubit subsets on ibm_fez for executing the quantum approximate optimization algorithm on a 20-qubit problem. Compared to the best qubit selection via Qiskit transpilation, our method improves solution quality by 10% and increases algorithmic coherence by 33%. ZECS offers a scalable and measurement-efficient approach to diagnosing crosstalk in large-scale QPUs.


  • Top Cited Papers
    Open Access

    Toward a linear-ramp QAOA protocol: evidence of a scaling advantage in solving some combinatorial optimization problems

    by J. A. Montañez-Barrera, Kristel Michielsen

    The quantum approximate optimization algorithm (QAOA) is a promising algorithm for solving combinatorial optimization problems (COPs), with performance governed by variational parameters $${\{{\gamma }_{i},{\beta }_{i}\}}_{i = 0}^{p-1}$$ { γ i , β i } i = 0 p − 1 . While most prior work has focused on classically optimizing these parameters, we demonstrate that fixed linear ramp schedules, linear ramp QAOA (LR-QAOA), can efficiently approximate optimal solutions across diverse COPs. Simulations with up to N q = 42 qubits and p = 400 layers suggest that the success probability scales as $$P({x}^{* })\approx {2}^{-\eta (p){N}_{q}+C}$$ P ( x * ) ≈ 2 − η ( p ) N q + C , where η(p) decreases with increasing p. For example, in Weighted Maxcut instances, η(10) = 0.22 improves to η(100) = 0.05. Comparisons with classical algorithms, including simulated annealing, Tabu Search, and branch-and-bound, show a scaling advantage for LR-QAOA. We show results of LR-QAOA on multiple QPUs (IonQ, Quantinuum, IBM) with up to N q = 109 qubits, p = 100, and circuits requiring 21,200 CNOT gates. Finally, we present a noise model based on two-qubit gate counts that accurately reproduces the experimental behavior of LR-QAOA.


  • Top Cited Papers

    Transfer learning of optimal QAOA parameters in combinatorial optimization

    by J. A. Montañez-Barrera, Dennis Willsch, Kristel Michielsen


  • Top Cited Papers
    Open Access

    Unbalanced penalization: a new approach to encode inequality constraints of combinatorial problems for quantum optimization algorithms

    by J A Montañez-Barrera, Dennis Willsch, A Maldonado-Romo, Kristel Michielsen

    Solving combinatorial optimization problems of the kind that can be codified by quadratic unconstrained binary optimization (QUBO) is a promising application of quantum computation. Some problems of this class suitable for practical applications such as the traveling salesman problem (TSP), the bin packing problem (BPP), or the knapsack problem (KP) have inequality constraints that require a particular cost function encoding. The common approach is the use of slack variables to represent the inequality constraints in the cost function. However, the use of slack variables considerably increases the number of qubits and operations required to solve these problems using quantum devices. In this work, we present an alternative method that does not require extra slack variables and consists of using an unbalanced penalization function to represent the inequality constraints in the QUBO. This function is characterized by larger penalization when the inequality constraint is not achieved than when it is. We evaluate our approach on the TSP, BPP, and KP, successfully encoding the optimal solution of the original optimization problem near the ground state cost Hamiltonian. Additionally, we employ D-Wave Advantage and D-Wave hybrid solvers to solve the BPP, surpassing the performance of the slack variables approach by achieving solutions for up to 29 items, whereas the slack variables approach only handles up to 11 items. This new approach can be used to solve combinatorial problems with inequality constraints with a reduced number of resources compared to the slack variables approach using quantum annealing or variational quantum algorithms.


  • Open Access

    Unbalanced penalization: A new approach to encode inequality constraints of combinatorial problems for quantum optimization algorithms

    by Alejandro Montanez-Barrera, Dennis Willsch, Alberto Maldonado-Romo, Kristel Michielsen

    Solving combinatorial optimization problems of the kind that can be codified by quadratic unconstrained binary optimization (QUBO) is a promising application of quantum computation. Some problems of this class suitable for practical applications such as the traveling salesman problem (TSP), the bin packing problem (BPP), or the knapsack problem (KP) have inequality constraints that require a particular cost function encoding. The common approach is the use of slack variables to represent the inequality constraints in the cost function. However, the use of slack variables considerably increases the number of qubits and operations required to solve these problems using quantum devices. In this work, we present an alternative method that does not require extra slack variables and consists of using an unbalanced penalization function to represent the inequality constraints in the QUBO. This function is characterized by larger penalization when the inequality constraint is not achieved than when it is. We evaluate our approach on the TSP, BPP, and KP, successfully encoding the optimal solution of the original optimization problem near the ground state cost Hamiltonian. Additionally, we employ D-Wave Advantage and D-Wave hybrid solvers to solve the BPP, surpassing the performance of the slack variables approach by achieving solutions for up to 29 items, whereas the slack variables approach only handles up to 11 items. This new approach can be used to solve combinatorial problems with inequality constraints with a reduced number of resources compared to the slack variables approach using quantum annealing or variational quantum algorithms.


  • Open Access

    Improving Performance in Combinatorial Optimization Problems with Inequality Constraints: An Evaluation of the Unbalanced Penalization Method on D-Wave Advantage

    by J. A. Montanez-Barrera, Pim van Den Heuvel, Dennis Willsch, Kristel Michielsen

    Combinatorial optimization problems are one of the target applications of current quantum technology, mainly because of their industrial relevance, the difficulty of solving large instances of them classically, and their equivalence to Ising Hamiltonians using the quadratic unconstrained binary optimization (QUBO) formulation. Many of these applications have inequality constraints, usually encoded as penalization terms in the QUBO formulation using additional variables known as slack variables. The slack variables have two disadvantages: (i) these variables extend the search space of optimal and suboptimal solutions, and (ii) the variables add extra qubits and connections to the quantum algorithm. Recently, a new method known as unbalanced penalization has been presented to avoid using slack variables. This method offers a trade-off between additional slack variables to ensure that the optimal solution is given by the ground state of the Ising Hamiltonian, and using an unbalanced heuristic function to penalize the region where the inequality constraint is violated with the only certainty that the optimal solution will be in the vicinity of the ground state. This work tests the unbalanced penalization method using real quantum hardware on D-Wave Advantage for the traveling salesman problem (TSP). The results show that the unbalanced penalization method outperforms the solutions found using slack variables and sets a new record for the largest TSP solved with quantum technology.