Time-Aware Beam Search for Quantum Circuit Partitioning in Distributed Quantum Computing

Researchers propose a beam search heuristic for distributed quantum circuit partitioning, achieving lower communication costs than METIS with O(N²T) complexity—outperforming metaheuristics while adapting to arbitrary QPU network topologies.

#DistributedQuantumComputing #QuantumCircuits #Research #Informaq

https://iq.fp2.dev/jc8WB