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

Constructing a rational cp-matrix whose every cp-factorization is irrational, with GPT-6 Astra

Yaroslav Shitov

Published Sep 9, 2026• 0 citations
Publisher
DOI
10.13140/rg.2.2.14795.14889

Related papers

Rational Yang-Baxterization and factorized S-matrix

Mo‐Lin Ge, Kang Xue

Physics Letters A•Jan 1, 1991•3 citations

Determining the tensor rank of (2, 2, m) matrix multiplication with GPT-5.6 Sol

Yaroslav Shitov

•Aug 30, 2026•2 citations

A Quantum group approach to constructing factorizable S matrices

Timothy J. Hollowood

•Jan 1, 1990•7 citations

Irrational CFTs from coupled anyon chains with non-invertible symmetries?

António Antunes, Junchen Rong

Irrational CFTs in 1+1d with a discrete spectrum and no conserved currents other than the stress-tensor are expected to be generic, unsolvable by standard methods, and hard to construct explicitly. We introduce a lattice model that realizes a candidate for such a CFT as a conformal phase of matter without fine-tuning. The model is constructed by coupling N≥3 N ≥ 3 golden anyon chains together, preserving N N copies of the Fibonacci non-invertible symmetry. We use the MPS/DMRG approach to study this model numerically, which allows us to calculate the corresponding conformal data, obtaining hints of its irrationality. Along the way, we characterize the phase diagram for N=2 N = 2 coupled chains where we identify a weakly first-order phase transition as well as critical points that we are able to identify with known rational CFTs, except for one case. We also provide an extensive list of rational CFTs with 1<c<2.1 1 < c < 2.1 .

arXiv:2507.14280•SciPost Physics•Jul 6, 2026•12 citations

Efficient Construction of Canonical Polyadic Approximations of Tensor Networks

Karl Pierce, Edward F. Valeev

We consider the problem of constructing a canonical polyadic (CP) decomposition for a tensor network, rather than a single tensor. We illustrate how it is possible to reduce the complexity of constructing an approximate CP representation of the network by leveraging its structure in the course of the CP factor optimization. The utility of this technique is demonstrated for the order-4 Coulomb interaction tensor approximated by two order-3 tensors via an approximate generalized square-root (SQ) factorization, such as density fitting or (pivoted) Cholesky. The complexity of constructing a four-way CP decomposition is reduced from O ( n 4 R CP ) (for the nonapproximated Coulomb tensor) to O ( n 3 R CP ) (for the SQ-factorized Coulomb tensor), where n and R CP are the basis and CP ranks, respectively. This reduces the cost of constructing the CP approximation of two-body interaction tensors of relevance to accurate many-body electronic structure by up to 2 orders of magnitude for systems with up to 36 atoms studied here. The full four-way CP approximation of the Coulomb interaction tensor is shown to be more accurate than the known approaches which utilize CP-factorizations of the SQ factors (which are also constructed with an O ( n 3 R CP ) cost), such as the algebraic pseudospectral and tensor hypercontraction approaches. The CP-decomposed SQ factors can also serve as a robust initial guess for the four-way CP factors.

arXiv:2208.09992•Journal of Chemical Theory and Computation•Dec 9, 2022•12 citations

Quantum Algorithms for Integer Factorization

Song Yuan Yan

Springer eBooks•Jan 1, 2015•0 citations
Irrational CFTs in 1+1d with a discrete spectrum and no conserved currents other than the stress-tensor are expected to be generic, unsolvable by standard methods, and hard to construct explicitly. We introduce a lattice model that realizes a candidate for such a CFT as a conformal phase of matter without fine-tuning. The model is constructed by coupling N≥3 N ≥ 3 golden anyon chains together, preserving N N copies of the Fibonacci non-invertible symmetry. We use the MPS/DMRG approach to study this model numerically, which allows us to calculate the corresponding conformal data, obtaining hints of its irrationality. Along the way, we characterize the phase diagram for N=2 N = 2 coupled chains where we identify a weakly first-order phase transition as well as critical points that we are able to identify with known rational CFTs, except for one case. We also provide an extensive list of rational CFTs with 1<c<2.1 1 < c < 2.1 .
We consider the problem of constructing a canonical polyadic (CP) decomposition for a tensor network, rather than a single tensor. We illustrate how it is possible to reduce the complexity of constructing an approximate CP representation of the network by leveraging its structure in the course of the CP factor optimization. The utility of this technique is demonstrated for the order-4 Coulomb interaction tensor approximated by two order-3 tensors via an approximate generalized square-root (SQ) factorization, such as density fitting or (pivoted) Cholesky. The complexity of constructing a four-way CP decomposition is reduced from O ( n 4 R CP ) (for the nonapproximated Coulomb tensor) to O ( n 3 R CP ) (for the SQ-factorized Coulomb tensor), where n and R CP are the basis and CP ranks, respectively. This reduces the cost of constructing the CP approximation of two-body interaction tensors of relevance to accurate many-body electronic structure by up to 2 orders of magnitude for systems with up to 36 atoms studied here. The full four-way CP approximation of the Coulomb interaction tensor is shown to be more accurate than the known approaches which utilize CP-factorizations of the SQ factors (which are also constructed with an O ( n 3 R CP ) cost), such as the algebraic pseudospectral and tensor hypercontraction approaches. The CP-decomposed SQ factors can also serve as a robust initial guess for the four-way CP factors.