Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

International Conference on Electronics, Electrical and Information Engineering (ICEEIE)

A fast solution method for complex algorithms in high order tensor networks

Min Xu, Aihua Zhou, He Wang, Lin Peng, Nige Li, Gang Wang, Pei Yang

Published Dec 31, 2025• 0 citations
Publisher
DOI
10.1117/12.3092218

Related papers

Survey of Tensor Networks

Samuel Desrosiers, Glen Evenbly, Thomas E. Baker

Bulletin of the American Physical Society•Mar 5, 2019•0 citations

Fast tensor disentangling algorithm

Kevin Slagle

Many recent tensor network algorithms apply unitary operators to parts of a tensor network in order to reduce entanglement. However, many of the previously used iterative algorithms to minimize entanglement can be slow. We introduce an approximate, fast, and simple algorithm to optimize disentangling unitary tensors. Our algorithm is asymptotically faster than previous iterative algorithms and often results in a residual entanglement entropy that is within 10 to 40% of the minimum. For certain input tensors, our algorithm returns an optimal solution. When disentangling order-4 tensors with equal bond dimensions, our algorithm achieves an entanglement spectrum where nearly half of the singular values are zero. We further validate our algorithm by showing that it can efficiently disentangle random 1D states of qubits.

arXiv:2104.08283•SciPost Physics•Sep 13, 2021•1 citation

Quantum-Inspired Constraint Satisfaction with Tensor Networks

Jincheng Zhang

Constraint satisfaction problems (CSPs) are ubiquitous in various domains, including artificial intelligence, circuit design, and scheduling. Traditional CSP solvers often struggle with problems exhibiting high dimensionality and complex constraints, leading to exponential time complexity in the worst case. This paper proposes a novel approach to CSP solving that draws inspiration from quantum mechanics, specifically superposition and entanglement, through the utilization of tensor networks and quantum-inspired algorithms. We represent CSP variables and constraints using tensor networks, allowing for efficient storage and manipulation of complex relationships. Furthermore, we employ quantum walks, a quantum-inspired search algorithm, to perform constraint propagation and explore the solution space. This approach aims to achieve significant performance gains by effectively exploiting the inherent parallelism and exploration capabilities associated with quantum phenomena. The core claim is that these quantum-inspired techniques can efficiently explore the solution space of CSPs, particularly those with high dimensionality. The mechanism involves tensor network representation and quantum walk-based search. The effectiveness of this method is demonstrated through theoretical analysis and a conceptual framework, paving the way for future research and development in applying quantum-inspired methods to classical problem-solving.

•Aug 28, 2026•0 citations

Optimization problems in contracted tensor networks

Mike Espig, Wolfgang Hackbusch, Stefan Handschuh +1 more

Computing and Visualization in Science•Aug 1, 2011•55 citations

Introduction to Tensor Network Methods

Timo Felser, Simone Montangero

Graduate texts in physics•Jan 1, 2026•0 citations

Quantum-Inspired Tensor Decomposition for Dimensionality Reduction

Jincheng Zhang

This paper presents a novel approach to tensor decomposition, termed Quantum-Inspired Tensor Decomposition (QITD), motivated by the principles of quantum mechanics. Classical tensor decomposition methods often struggle with the computational complexity associated with high-order tensors, particularly those with a large number of dimensions. QITD addresses this limitation by incorporating concepts of quantum superposition and simulated quantum evolution. The core idea is to represent the tensor using a probabilistic tensor network and then iteratively apply a simulated quantum evolution process to optimize the tensor decomposition. This process leverages the potential for exploring a wider solution space compared to traditional deterministic methods. The proposed method aims to achieve speedups and improved performance in dimensionality reduction tasks involving high-order tensors. We define the key mathematical elements and provide a theoretical framework for understanding the algorithm's operation. The effectiveness of the approach is demonstrated through a theoretical analysis and conceptual outline, without requiring experimental validation due to the nature of the proposed method.

•Sep 5, 2026•0 citations
Many recent tensor network algorithms apply unitary operators to parts of a tensor network in order to reduce entanglement. However, many of the previously used iterative algorithms to minimize entanglement can be slow. We introduce an approximate, fast, and simple algorithm to optimize disentangling unitary tensors. Our algorithm is asymptotically faster than previous iterative algorithms and often results in a residual entanglement entropy that is within 10 to 40% of the minimum. For certain input tensors, our algorithm returns an optimal solution. When disentangling order-4 tensors with equal bond dimensions, our algorithm achieves an entanglement spectrum where nearly half of the singular values are zero. We further validate our algorithm by showing that it can efficiently disentangle random 1D states of qubits.
Constraint satisfaction problems (CSPs) are ubiquitous in various domains, including artificial intelligence, circuit design, and scheduling. Traditional CSP solvers often struggle with problems exhibiting high dimensionality and complex constraints, leading to exponential time complexity in the worst case. This paper proposes a novel approach to CSP solving that draws inspiration from quantum mechanics, specifically superposition and entanglement, through the utilization of tensor networks and quantum-inspired algorithms. We represent CSP variables and constraints using tensor networks, allowing for efficient storage and manipulation of complex relationships. Furthermore, we employ quantum walks, a quantum-inspired search algorithm, to perform constraint propagation and explore the solution space. This approach aims to achieve significant performance gains by effectively exploiting the inherent parallelism and exploration capabilities associated with quantum phenomena. The core claim is that these quantum-inspired techniques can efficiently explore the solution space of CSPs, particularly those with high dimensionality. The mechanism involves tensor network representation and quantum walk-based search. The effectiveness of this method is demonstrated through theoretical analysis and a conceptual framework, paving the way for future research and development in applying quantum-inspired methods to classical problem-solving.
This paper presents a novel approach to tensor decomposition, termed Quantum-Inspired Tensor Decomposition (QITD), motivated by the principles of quantum mechanics. Classical tensor decomposition methods often struggle with the computational complexity associated with high-order tensors, particularly those with a large number of dimensions. QITD addresses this limitation by incorporating concepts of quantum superposition and simulated quantum evolution. The core idea is to represent the tensor using a probabilistic tensor network and then iteratively apply a simulated quantum evolution process to optimize the tensor decomposition. This process leverages the potential for exploring a wider solution space compared to traditional deterministic methods. The proposed method aims to achieve speedups and improved performance in dimensionality reduction tasks involving high-order tensors. We define the key mathematical elements and provide a theoretical framework for understanding the algorithm's operation. The effectiveness of the approach is demonstrated through a theoretical analysis and conceptual outline, without requiring experimental validation due to the nature of the proposed method.