Entanglement via Faraday effect - an old tool at a new job for Quantum Networks

Subir Sachdev A

A new renormalization group approach that maps lattice problems to tensor networks may hold the key to solving seemingly intractable models of strongly correlated systems in any dimension.

Donna Taylor, Irina V. Novikova

Gregor Weihs

Subir Sachdev A

A new renormalization group approach that maps lattice problems to tensor networks may hold the key to solving seemingly intractable models of strongly correlated systems in any dimension.

Davide Ferrari, Michele Amoretti

The growing demand for large-scale quantum computers is pushing research on Distributed Quantum Computing (DQC). Recent experimental efforts have demonstrated some of the building blocks for such a design. DQC systems are clusters of quantum processing units (QPUs) connected by means of quantum network infrastructures. Their extension ranges from the single box to the geographical scale. Furthermore, they can be integrated with classical High Performance Computing systems. Simulation modeling of DQC architectures provides a safe way to test and explore different what-if scenarios. Many simulation tools have been developed to support the research community in designing and evaluating quantum computer and quantum network technologies, including hardware, protocols, and applications. However, a framework for DQC simulation putting equal emphasis on computational and networking aspects has never been proposed, so far. In this paper, a design framework for DQC simulation is presented, whose core component is an Execution Manager that schedules DQC jobs for running on networked quantum computers. Two metrics are proposed for evaluating the impact of the job scheduling algorithms with respect to QPU utilization and quantum network utilization, beyond the traditional concept of makespan. The discussion is supported by a DQC job scheduling example, where two different strategies are compared in terms of the proposed metrics.

Benoît Vermersch