MCMichele Cattelan

Michele Cattelan

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

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Michele Cattelan has a total of 4 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Parallel circuit implementation of variational quantum algorithms

    by Michele Cattelan, Sheir Yarkoni, Wolfgang Lechner

    We present a framework to split quantum circuits of variational quantum algorithms (VQAs) to allow for parallel training and execution to solve problems larger than the number of available qubits in a quantum device. We apply this method to combinatorial optimization problems, where inherent structures can be identified, and show how to implement these parallelized quantum circuits. We show how to formulate an objective function for the classical optimizer to guide the optimization towards meaningful solutions. We test our framework by creating a parallelized version of the Quantum Approximate Optimization Algorithm and a variational version of quantum annealing and explain how our framework applies to other quantum optimization algorithms. We provide results obtained both from simulation and experiments on real hardware. Our results show that the information lost by splitting the quantum circuits can be partially recovered by optimizing a global objective function evaluated with the separate circuit samples.


  • Open Access

    Modeling routing problems in QUBO with application to ride-hailing

    by Michele Cattelan, Sheir Yarkoni

    Many emerging commercial services are based on the sharing or pooling of resources for common use with the aim of reducing costs. Businesses such as delivery-, mobility-, or transport-as-a-service have become standard in many parts of the world, fulfilling on-demand requests for customers in live settings. However, it is known that many of these problems are NP-hard, and therefore both modeling and solving them accurately is a challenge. Here we focus on one such routing problem, the Ride Pooling Problem (RPP), where multiple customers can request on-demand pickups and drop-offs from shared vehicles within a fleet. The combinatorial optimization task is to optimally pool customer requests using the limited set of vehicles, akin to a small-scale flexible bus route. In this work, we propose a quadratic unconstrained binary optimization (QUBO) program and introduce efficient formulation methods for the RPP to be solved using metaheuristics, and specifically emerging quantum optimization algorithms.


  • Open Access

    Scalable embedding of parity constraints in quantum annealing hardware

    by Michele Cattelan, Jemma Bennett, Sheir Yarkoni, Wolfgang Lechner

    One of the main bottlenecks in solving combinatorial optimization problems with quantum annealers is the qubit connectivity in the hardware. A possible solution for larger connectivty is minor embedding. This techniques makes the geometrical properties of the combinatorial optimization problem, encoded as a Hamiltonian, match the properties of the quantum annealing hardware. The embedding itself is a hard computational problem and therefore heuristic algorithms are required. In this work, we present fixed, modular and scalable embeddings that can be used to embed any combinatorial optimization problem described as an Ising Hamiltonian. These embeddings are the result of an extension of the well-known parity mapping, which has been used in the past to map higher-order Ising Hamiltonians to quadratic Hamiltonians, which are suitable for existing quantum hardware. We show how our new embeddings can be mapped to existing quantum annealers and that the embedded Hamiltonian physical properties match the original Hamiltonian properties.