ABAlberto Bottarelli

Alberto Bottarelli

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

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Alberto Bottarelli has a total of 18 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Symmetry-enhanced counterdiabatic quantum algorithm for qudits

    by Alberto Bottarelli, Mikel Garcia de Andoin, Pranav Chandarana, Koushik Paul, Xi Chen, Mikel Sanz, Philipp Hauke

    Qubit-based variational quantum algorithms have undergone rapid development in recent years but still face several challenges. Here, we introduce a symmetry-based enhancement to digitized counterdiabatic quantum algorithms, applicable for qudits of any dimension. This approach offers three types of compression compared to conventional variational circuits. First, compression in the circuit depth is achieved by counterdiabatic protocols. Second, information about the problem is compressed by replacing qubits with qudits, allowing for a more efficient representation of the problem. Finally, the number of parameters is reduced by employing the symmetries of the system. We illustrate this approach by tackling a graph-based optimization problem -3-, a highly entangled state preparation, the qutrit W state, and a two-body only antiferromagnetic Ising problem. As our numerical results show, we achieve a better convergence with a lower circuit depth and less measurement overhead, albeit with some identified limitations for which we propose a work-around. This work leads to a better design of shallow variational quantum circuits, improving the feasibility of their implementation on near-term qudit devices.


  • Open Access

    Quantum Resources in Non-Abelian Lattice Gauge Theories: Nonstabilizerness, Multipartite Entanglement, and Fermionic Non-Gaussianity

    by Gopal Chandra Santra, Julius Mildenberger, Edoardo Ballini, Alberto Bottarelli, Matteo M. Wauters, Philipp Hauke

    Lattice gauge theories (LGTs) represent one of the most ambitious goals of quantum simulation. From a practical implementation perspective, non-Abelian theories present significantly tougher challenges than Abelian LGTs. However, it is unknown whether this is also reflected in increased values of quantum resources relating to the complexity of simulating quantum many-body models. Here, we compare three paradigmatic measures of quantum resources -- stabilizer Rényi entropy, generalized geometric measure of entanglement, and fermionic antiflatness -- for pure-gauge theories on a ladder with Abelian $\mathbb{Z}_N$ as well as non-Abelian $D_3$ and SU(2) gauge symmetries. We find that non-Abelian symmetries are not necessarily inherently harder to simulate than Abelian ones, but rather the required quantum resources depend nontrivially on the interplay between the group structure, superselection sector, and encoding of the gauge constraints. Our findings help indicate where quantum advantage could emerge in simulations of LGTs, both in NISQ and fault-tolerant eras.

  • Open Access

    Inequality constraints in variational quantum circuits with qudits

    by Alberto Bottarelli, Sebastian Schmitt, Philipp Hauke

    Quantum optimization is emerging as a prominent candidate for exploiting the capabilities of near-term quantum devices. Many application-relevant optimization tasks require the inclusion of inequality constraints, usually handled by enlarging the Hilbert space through the addition of slack variables. This approach, however, requires significant additional resources especially when considering multiple constraints. Here, we study an alternative direct implementation of these constraints within the quantum approximate optimization algorithm, achieved using qudit-sum gates, and compare it to the slack variable method generalized to qudits. We benchmark these approaches on three paradigmatic optimization problems. We find that the direct implementation of the inequality penalties vastly outperforms the slack variables method, especially when studying real-world inspired problems with many constraints. Within the direct penalty implementation, a linear energy penalty for unfeasible states outperforms other investigated functional forms, such as the canonical quadratic penalty. The proposed approach may thus be an enabling step for approaching realistic industry-scale and fundamental science problems with large numbers of inequality constraints.


  • Open Access

    Formulation of the Electric Vehicle Charging and Routing Problem for a Hybrid Quantum-Classical Search Space Reduction Heuristic

    by M. Garcia de Andoin, A. Bottarelli, S. Schmitt, I. Oregi, P. Hauke, M. Sanz

    Combinatorial optimization problems have attracted much interest in the quantum computing community in the recent years as a potential testbed to showcase quantum advantage. In this paper, we show how to exploit multilevel carriers of quantum information -- qudits -- for the construction of algorithms for constrained quantum optimization. These systems have been recently introduced in the context of quantum optimization and they allow us to treat more general problems than the ones usually mapped into qubit systems. In particular, we propose a hybrid classical quantum heuristic strategy that allows us to sample constrained solutions while greatly reducing the search space of the problem, thus optimizing the use of fewer quantum resources. As an example, we focus on the Electric Vehicle Charging and Routing Problem (EVCRP). We translate the classical problem and map it into a quantum system, obtaining promising results on a toy example which shows the validity of our technique.

  • Open Access

    Quantum routing of information using chiral quantum walks

    by Alberto Bottarelli, Massimo Frigerio, Matteo G. A. Paris

    We address routing of classical and quantum information over quantum network, and show how to exploit chirality to achieve nearly optimal and robust transport. In particular, we prove how continuous time chiral quantum walks over a minimal graph may be used to model directional transfer and routing of information over a network. At first, we show how classical information, encoded onto an excitation localized at one vertex of a simple graph, may be sent to any other chosen location with nearly unit fidelity by tuning a single phase. Then, we prove that high-fidelity transport is also possible for coherent superpositions of states, i.e. for routing of quantum information. Furthermore, we show that by tuning the phase parameter one obtains universal quantum routing, i.e. indipendent on the input state. In our scheme, chirality is governed by a single phase, and the routing probability is robust against fluctuations of this parameter. Finally, we address characterization of quantum routers and show how to exploit the self energies of the graph to achieve high precision in estimating the phase parameter.

  • Open Access

    Quantum routing of information using chiral quantum walks

    by Alberto Bottarelli, Massimo Frigerio, Matteo G. A. Paris

    We address routing of classical and quantum information over quantum network and show how to exploit chirality (directionality) to achieve nearly optimal and robust transport. In particular, we prove how continuous-time chiral quantum walks over a minimal graph are able to model directional transfer of information over a network. At first, we show how classical information, encoded onto an excitation localized at one vertex of a simple graph, may be sent to any other chosen location with nearly unit fidelity by tuning a single phase. Then, we prove that high-fidelity transport is also possible for coherent superpositions of states, i.e., for routing of quantum information. Furthermore, we show that by tuning the phase parameter, one obtains universal quantum routing, i.e., independent on the input state. In our scheme, chirality is governed by a single phase, and the routing probability is robust against fluctuations of this parameter. Finally, we address characterization of quantum routers and show how to exploit the self-energies of the graph to achieve high precision in estimating the phase parameter.