Truncated hybrid tensor networks for distributed quantum simulation

• URL: http://arxiv.org/abs/2609.16520v1
• Date: Tue, 15 Sep 2026 02:09:46 GMT
• Title: Truncated hybrid tensor networks for distributed quantum simulation
• Abstract summary: Current protocols such as circuit knitting incur a quasi-probability sampling cost that grows exponentially with the number of remote gates across the cut.<n>We present a truncated hybrid tensor network (THTN) framework in which a remote two-body gate is applied as a sum of local unitaries on the subsystems.<n>We validate this distributed protocol by classical simulation against time-evolving block decimation (TEBD) at the same bond dimension.
• Score: 18.12647541043629
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Simulation of quantum many-body systems is a principal application of quantum computing, but available devices remain limited by the number of qubits and cannot accommodate systems of the desired size. One approach is to host a large evolution across several modest distributed systems that exchange classical information alone. Current protocols such as circuit knitting incur a quasi-probability sampling cost that grows exponentially with the number of remote gates across the cut, even when physical correlations across the cut are actually bounded. In this work, we present a truncated hybrid tensor network (THTN) framework in which a remote two-body gate is applied as a sum of local unitaries on the subsystems, linked by a classical connecting tensor, and an interface truncation retains Schmidt modes across the cut. Remote gates between the same subsystems can be merged on one connector, so non-one-dimensional models, such as layered partitions with strong intra-layer and weaker interlayer couplings, may be cast onto a one-dimensional cut. The retained non-negative Schmidt coefficients also define a sampling rule for local observables. We validate this distributed protocol by classical simulation against time-evolving block decimation (TEBD) at the same bond dimension. The truncated dynamics track the TEBD references on chains and ladders, with the clearest gain on a layered model.

Related papers

• Quantum Incremental Learning with Mixed State Prototypes [53.319426778720434]
  We introduce a novel quantum incremental learning framework based on trainable mixed-state prototypes.<n>Our model achieves high-dimensional feature concentration using a minimal number of qubits.
  arXiv  Detail & Related papers  (2026-08-11T04:22:42Z)
• Scalable topological quantum computing based on Sine-Cosine chain models [0.0]
  This work proposes a scalable framework for topological quantum computing using Matryoshka-type Sine-Cosine chains.<n>We describe how these chains can be used in Y-junction braiding protocols for gate operations and in extended memory architectures capable of storing multiple qubits simultaneously.
  arXiv  Detail & Related papers  (2026-03-26T22:46:37Z)
• A Scalable Distributed Quantum Optimization Framework via Factor Graph Paradigm [46.08923284345648]
  We introduce a structure-aware framework for distributed quantum optimization.<n>We find that for a search space of size $N$, our framework achieves $O(sqrtN)$ query complexity up to processors and separator dependent factors.<n>We show that structure-aware decomposition delivers a practical path to scalable distributed quantum optimization on quantum networks.
  arXiv  Detail & Related papers  (2026-03-08T15:15:52Z)
• Autonomous stabilization of remote entanglement in a cascaded quantum network [0.44970015278813036]
  We show that remote entanglement can be stabilized indefinitely, instead of only periodically regenerated and redistributed after decay.<n>Our results enable on-demand delivery of high-fidelity entanglement in modular quantum processors and networks.
  arXiv  Detail & Related papers  (2025-09-15T12:50:35Z)
• Distributed Tensor Network Library for Quantum Computing Emulation [0.0]
  HPC tensor network packages tackle this issue with a procedure called circuit slicing.<n>We present a novel alternative approach, where individual tensors are both broadcast and scattered.<n>We showcase its capabilities on ARCHER2, by emulating two well-known algorithms.
  arXiv  Detail & Related papers  (2025-05-09T15:17:42Z)
• Network-assisted collective operations for efficient distributed quantum computing [0.0]
  We propose a scheme for the distribution of collective quantum operations among remote quantum processing units.<n>We show that a general diagonal gate can be distributed among any number of nodes and provide the ebit cost bounds.<n>We provide an exact implementation of a distributed Grover's search algorithm using this protocol to partition the circuit.
  arXiv  Detail & Related papers  (2025-02-26T13:13:13Z)
• Non-Unitary Quantum Machine Learning [0.0]
  We introduce several probabilistic quantum algorithms that overcome the normal unitary restrictions in quantum machine learning. We show that residual connections between layers of a variational ansatz can prevent barren plateaus in models which would otherwise contain them. We also demonstrate a novel rotationally invariant encoding for point cloud data via Schur-Weyl duality.
  arXiv  Detail & Related papers  (2024-05-27T17:42:02Z)
• On Optimizing the Communication of Model Parallelism [74.15423270435949]
  We study a novel and important communication pattern in large-scale model-parallel deep learning (DL) In cross-mesh resharding, a sharded tensor needs to be sent from a source device mesh to a destination device mesh. We propose two contributions to address cross-mesh resharding: an efficient broadcast-based communication system, and an "overlapping-friendly" pipeline schedule.
  arXiv  Detail & Related papers  (2022-11-10T03:56:48Z)
• Over-the-Air Split Machine Learning in Wireless MIMO Networks [56.27831295707334]
  In split machine learning (ML), different partitions of a neural network (NN) are executed by different computing nodes. To ease communication burden, over-the-air computation (OAC) can efficiently implement all or part of the computation at the same time of communication.
  arXiv  Detail & Related papers  (2022-10-07T15:39:11Z)
• Interference-Limited Ultra-Reliable and Low-Latency Communications: Graph Neural Networks or Stochastic Geometry? [45.776476161876204]
  We build a cascaded Random Edge Graph Neural Network (REGNN) to represent the repetition scheme and train it. We analyze the violation probability using geometry in a symmetric scenario and apply a model-based Exhaustive Search (ES) method to find the optimal solution.
  arXiv  Detail & Related papers  (2022-07-11T05:49:41Z)
• Time-Sliced Quantum Circuit Partitioning for Modular Architectures [67.85032071273537]
  Current quantum computer designs will not scale. To scale beyond small prototypes, quantum architectures will likely adopt a modular approach with clusters of tightly connected quantum bits and sparser connections between clusters. We exploit this clustering and the statically-known control flow of quantum programs to create tractable partitionings which map quantum circuits to modular physical machines one time slice at a time.
  arXiv  Detail & Related papers  (2020-05-25T17:58:44Z)

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.