SWAP-Network Routing and Spectral Qubit Ordering for MPS Imaginary-Time Optimization

• URL: http://arxiv.org/abs/2511.02980v1
• Date: Tue, 04 Nov 2025 20:37:26 GMT
• Title: SWAP-Network Routing and Spectral Qubit Ordering for MPS Imaginary-Time Optimization
• Abstract summary: We propose a quantum-inspired solver that performs imaginary-time evolution (ITE) on a matrix product state (MPS)<n>We investigate two distinct network architectures based on rectangular and triangular meshes of SWAP gates.<n>We observe an over 20$times$ reduction in error when combining spectral ordering and triangular SWAP networks.
• Score: 0.06610877051761614
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We propose a quantum-inspired combinatorial solver that performs imaginary-time evolution (ITE) on a matrix product state (MPS), incorporating non-local couplings through structured SWAP networks and spectral qubit mapping of logical qubits. The SWAP networks, composed exclusively of local two-qubit gates, effectively mediate non-local qubit interactions. We investigate two distinct network architectures based on rectangular and triangular meshes of SWAP gates and analyze their performance in combination with spectral qubit ordering, which maps logical qubits to MPS sites based on the Laplacian of the logical qubit connectivity graph. The proposed framework is evaluated on synthetic MaxCut instances with varying graph connectivity, as well as on a dynamic portfolio optimization problem based on real historical asset data involving 180 qubits. On certain problem configurations, we observe an over 20$\times$ reduction in error when combining spectral ordering and triangular SWAP networks compared to optimization with shuffled qubit ordering. Furthermore, an analysis of the entanglement entropy during portfolio optimization reveals that spectral qubit ordering not only improves solution quality but also enhances the total and spatially distributed entanglement within the MPS. These findings demonstrate that exploiting problem structure through spectral mapping and efficient routing networks can substantially enhance the performance of tensor-network-based optimization algorithms.

Related papers

• Algorithmic Separation between Constant-Depth and Logarithmic-Depth Neural Networks [64.7580803923092]
  We prove the first algorithmic separation between constant-depth and logarithmic-depth networks.<n>Specifically, we identify a class of Boolean functions with hierarchically structured spectra that logarithmic-depth networks can learn efficiently.
  arXiv  Detail & Related papers  (2026-07-28T02:13:30Z)
• Renormalization Group Guided Tensor Network Structure Search [58.0378300612202]
  Network structure search (TN-SS) aims to automatically discover optimal network topologies and rank robustness for efficient tensor decomposition in high-dimensional data representation.<n>We propose RGTN (Renormalization Group guided Network search), a physics-inspired framework transforming TN-SS via multi-scale renormalization group flows.
  arXiv  Detail & Related papers  (2025-12-31T06:31:43Z)
• Scalable Quantum Walk-Based Heuristics for the Minimum Vertex Cover Problem [0.0]
  We propose a novel quantum algorithm for the Minimum Vertex Cover (MVC) problem based on continuous-time quantum walks (CTQWs)<n>In this framework, the coherent propagation of a quantum walker over a graph encodes its structural properties into state amplitudes.<n>We show that the CTQW-based algorithm consistently achieves superior approximation ratios and exhibits remarkable robustness with respect to network topology.
  arXiv  Detail & Related papers  (2025-12-02T17:04:57Z)
• COMPAS: A Distributed Multi-Party SWAP Test for Parallel Quantum Algorithms [4.584616394519209]
  We introduce COMPAS, an architecture that realizes multivariate trace estimation across a multi-party network of interconnected modular and distributed QPUs.<n>Unlike other schemes, which must choose between optimality in circuit depth or GHZ width, COMPAS achieves both at once.<n>We analyze network-level errors and simulate the effects of circuit-level noise on the architecture.
  arXiv  Detail & Related papers  (2025-11-28T18:31:15Z)
• A Gradient Meta-Learning Joint Optimization for Beamforming and Antenna Position in Pinching-Antenna Systems [63.213207442368294]
  We consider a novel optimization design for multi-waveguide pinching-antenna systems.<n>The proposed GML-JO algorithm is robust to different choices and better performance compared with the existing optimization methods.
  arXiv  Detail & Related papers  (2025-06-14T17:35:27Z)
• An Efficient Iterative Algorithm for Qubit Mapping via Layer-Weight Assignment and Search Space Reduction [7.698997402561804]
  Current quantum devices support interactions only between physically adjacent qubits, preventing quantum circuits from being directly executed on these devices.<n>To minimize the insertion of additional SWAP gates, we propose HAIL, an efficient iterative qubit mapping algorithm.<n>We show that HAIL-3 reduces the number of additional gates inserted in the $mathcalB_23$ by 20.62% compared to state-of-the-art algorithms.
  arXiv  Detail & Related papers  (2025-02-11T13:21:33Z)
• SPARQ: Efficient Entanglement Distribution and Routing in Space-Air-Ground Quantum Networks [50.91365514137301]
  Space-air-ground quantum (SPARQ) network is developed as a means for providing a seamless on-demand entanglement distribution. Deep reinforcement learning framework is proposed and trained using deep Q-network (DQN) on multiple graphs of SPARQ. Third-party entanglement distribution policy is proposed to establish entanglement between communication parties.
  arXiv  Detail & Related papers  (2024-09-19T16:31:37Z)
• All-to-all reconfigurability with sparse and higher-order Ising machines [0.0]
  We introduce a multiplexed architecture that emulates all-to-all network functionality. We show that running the adaptive parallel tempering algorithm demonstrates competitive algorithmic and prefactor advantages. scaled magnetic versions of p-bit IMs could lead to orders of magnitude improvements over the state of the art for generic optimization.
  arXiv  Detail & Related papers  (2023-11-21T20:27:02Z)
• Optimization Guarantees of Unfolded ISTA and ADMM Networks With Smooth Soft-Thresholding [57.71603937699949]
  We study optimization guarantees, i.e., achieving near-zero training loss with the increase in the number of learning epochs. We show that the threshold on the number of training samples increases with the increase in the network width.
  arXiv  Detail & Related papers  (2023-09-12T13:03:47Z)
• Binarizing Sparse Convolutional Networks for Efficient Point Cloud Analysis [93.55896765176414]
  We propose binary sparse convolutional networks called BSC-Net for efficient point cloud analysis. We employ the differentiable search strategies to discover the optimal opsitions for active site matching in the shifted sparse convolution. Our BSC-Net achieves significant improvement upon our srtong baseline and outperforms the state-of-the-art network binarization methods.
  arXiv  Detail & Related papers  (2023-03-27T13:47:06Z)
• Deep Architecture Connectivity Matters for Its Convergence: A Fine-Grained Analysis [94.64007376939735]
  We theoretically characterize the impact of connectivity patterns on the convergence of deep neural networks (DNNs) under gradient descent training. We show that by a simple filtration on "unpromising" connectivity patterns, we can trim down the number of models to evaluate.
  arXiv  Detail & Related papers  (2022-05-11T17:43:54Z)
• i-SpaSP: Structured Neural Pruning via Sparse Signal Recovery [11.119895959906085]
  We propose a novel, structured pruning algorithm for neural networks -- the iterative, Sparse Structured Pruning, dubbed as i-SpaSP. i-SpaSP operates by identifying a larger set of important parameter groups within a network that contribute most to the residual between pruned and dense network output. It is shown to discover high-performing sub-networks and improve upon the pruning efficiency of provable baseline methodologies by several orders of magnitude.
  arXiv  Detail & Related papers  (2021-12-07T05:26:45Z)
• ZoPE: A Fast Optimizer for ReLU Networks with Low-Dimensional Inputs [30.34898838361206]
  We present an algorithm called ZoPE that solves optimization problems over the output of feedforward ReLU networks with low-dimensional inputs. Using ZoPE, we observe a $25times speedup on property 1 of the ACAS Xu neural network verification benchmark and an $85times speedup on a set of linear optimization problems.
  arXiv  Detail & Related papers  (2021-06-09T18:36:41Z)
• MOPS-Net: A Matrix Optimization-driven Network forTask-Oriented 3D Point Cloud Downsampling [86.42733428762513]
  MOPS-Net is a novel interpretable deep learning-based method for matrix optimization. We show that MOPS-Net can achieve favorable performance against state-of-the-art deep learning-based methods over various tasks.
  arXiv  Detail & Related papers  (2020-05-01T14:01:53Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.