GMGlen Bigan Mbeng

Glen Bigan Mbeng

*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


Glen Bigan Mbeng has a total of 17 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Performance of parity QAOA for the signed max-cut problem

    by Anita Weidinger, Glen Bigan Mbeng, Michael Fellner, Davit Khachatryan, Wolfgang Lechner

    The practical implementation of quantum optimization algorithms on noisy intermediate-scale quantum devices requires accounting for their limited connectivity. As such, the Parity architecture was introduced to overcome this limitation by encoding binary optimization problems onto planar quantum chips. We investigate the performance of the Quantum Approximate Optimization Algorithm on the Parity architecture (Parity QAOA) for solving instances of the signed Max-Cut problem on complete and regular graphs. By comparing the algorithms at fixed circuit depth, we demonstrate that Parity QAOA outperforms conventional QAOA implementations based on SWAP networks. Our analysis utilizes Clifford circuits to estimate lower performance bounds for Parity QAOA for problem sizes that would be otherwise inaccessible on classical computers. For single layer circuits we additionally benchmark the recursive variant of the two algorithms, showing that their performance is equal.


  • Top Cited Papers
    Open Access

    The quantum Ising chain for beginners

    by Glen Bigan Mbeng, Angelo Russomanno, Giuseppe E. Santoro

    We present here various techniques to work with clean and disordered quantum Ising chains, for the benefit of students and non-experts. Starting from the Jordan-Wigner transformation, which maps spin-1/2 systems into fermionic ones, we review some of the basic approaches to deal with the superconducting correlations that naturally emerge in this context. In particular, we analyze the form of the ground state and excitations of the model, relating them to the symmetry-breaking physics, and illustrate aspects connected to calculating dynamical quantities, thermal averages, correlation functions, and entanglement entropy. A few problems provide simple applications of the techniques.


  • Open Access

    Error mitigation for quantum approximate optimization

    by Anita Weidinger, Glen Bigan Mbeng, Wolfgang Lechner

    Solving optimization problems on near term quantum devices requires developing error mitigation techniques to cope with hardware decoherence and dephasing processes. We propose a mitigation technique based on parity encoding. This method uses a redundant encoding of logical variables to solve optimization problems on fully programmable planar quantum chips. We discuss how this redundancy can be exploited to mitigate errors in quantum optimization algorithms. In the specific context of the quantum approximate optimization algorithm, we show that errors can be significantly mitigated by appropriately modifying the objective cost function.


  • Avoiding barren plateaus via transferability of smooth solutions in a Hamiltonian variational ansatz

    by Antonio A. Mele, Glen B. Mbeng, Giuseppe E. Santoro, Mario Collura, Pietro Torta

    A large ongoing research effort focuses on variational quantum algorithms (VQAs), representing leading candidates to achieve computational speed-ups on current quantum devices. The scalability of VQAs to a large number of qubits, beyond the simulation capabilities of classical computers, is still debated. Two major hurdles are the proliferation of low-quality variational local minima, and the exponential vanishing of gradients in the cost-function landscape, a phenomenon referred to as barren plateaus. In this work, we show that by employing iterative search schemes, one can effectively prepare the ground state of paradigmatic quantum many-body models, also circumventing the barren plateau phenomenon. This is accomplished by leveraging the transferability to larger system sizes of a class of iterative solutions, displaying an intrinsic smoothness of the variational parameters, a result that does not extend to other solutions found via random-start local optimization. Our scheme could be directly tested on near-term quantum devices, running a refinement optimization in a favorable local landscape with nonvanishing gradients.


  • Quantum Optimization via Four-Body Rydberg Gates

    by Clemens Dlaska, Kilian Ender, Glen Bigan Mbeng, Andreas Kruckenhauser, Wolfgang Lechner, Rick van Bijnen

    A large ongoing research effort focuses on obtaining a quantum advantage in the solution of combinatorial optimization problems on near-term quantum devices. A particularly promising platform implementing quantum optimization algorithms are arrays of trapped neutral atoms, laser coupled to highly excited Rydberg states. However, encoding combinatorial optimization problems in atomic arrays is challenging due to limited interqubit connectivity of the native finite-range interactions. Here, we present a four-body Rydberg parity gate, enabling a direct and straightforward implementation of the parity architecture, a scalable architecture for encoding arbitrarily connected interaction graphs. Our gate relies on adiabatic laser pulses and is fully programmable by adjusting two hold times during operation. We numerically demonstrate implementations of the quantum approximate optimization algorithm (QAOA) for small-scale test problems. Variational optimization steps can be implemented with a constant number of system manipulations, paving the way for experimental investigations of QAOA beyond the reach of numerical simulations.


  • Open Access

    Reinforcement-learning-assisted quantum optimization

    by Matteo M. Wauters, Emanuele Panizon, Glen B. Mbeng, Giuseppe E. Santoro

    We propose a reinforcement learning (RL) scheme for feedback quantum control within the quantum approximate optimization algorithm (QAOA). We reformulate the QAOA variational minimization as a learning task, where an RL agent chooses the control parameters for the unitaries, given partial information on the system. Such an RL scheme finds a policy converging to the optimal adiabatic solution of the quantum Ising chain that can also be successfully transferred between systems with different sizes, even in the presence of disorder. This allows for immediate experimental verification of our proposal on more complicated models: the RL agent is trained on a small control system, simulated on classical hardware, and then tested on a larger physical sample.


  • Optimal working point in digitized quantum annealing

    by Glen Bigan Mbeng, Luca Arceci, Giuseppe E. Santoro

    We present a study of the digitized quantum annealing protocol proposed by R. Barends et al. [ Nature (London) 534, 222 (2016)]. Our analysis, performed on the benchmark case of a transverse Ising chain problem, shows that the algorithm has a well-defined optimal working point for the annealing time τPopt, scaling as τPopt∼P, where P is the number of digital Trotter steps, beyond which the residual energy error shoots up toward the value characteristic of the maximally disordered state. We present an analytical analysis for the translationally invariant transverse Ising chain case, but our numerical evidence suggests that this scenario is more general, surviving, for instance, the presence of disorder.