pith. machine review for the scientific record. sign in

arxiv: 2507.23679 · v3 · submitted 2025-07-31 · 🪐 quant-ph

Swap Network Augmented Ans\"atze on Arbitrary Connectivity

classification 🪐 quant-ph
keywords connectivityqubitswapatzenetworkansatzarbitraryaugmented
0
0 comments X
read the original abstract

Efficient parametrizations of quantum states are essential for trainable hybrid classical-quantum algorithms. A key challenge in their design consists in adapting to the available qubit connectivity of the quantum processor, which limits the capacity to generate correlations between distant qubits in a resource-efficient and trainable manner. In this work we first introduce an algorithm that optimizes qubit routing for arbitrary connectivity graphs, resulting in a swap network that enables direct interactions between any pair of qubits. We then propose a co-design of circuit layers and qubit routing by embedding the derived swap networks within layered, connectivity-aware ans\"atze. This construction significantly improves the trainability of the ansatz, leading to enhanced performance with reduced resources. We showcase these improvements through ground-state simulations of strongly correlated systems, including spin-glass and molecular electronic structure models. Across exemplified connectivities, the swap-enhanced ansatz consistently achieves lower energy errors using fewer entangling gates, shallower circuits, and fewer parameters than standard layered-structured baselines. Our results indicate that swap network augmented ans\"atze provide enhanced trainability and resource-efficient design to capture complex correlations on devices with constrained qubit connectivity.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.