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 Journal of Theoretical Physics

Tensor products and probability weights

Matthias P. Kl�y, Charles H. Randall, David J. Foulis

Published Mar 1, 1987• 68 citations
Publisher
DOI
10.1007/bf00668911

Related papers

Classical Tensor Codes and Quantum Tanner Codes Achieve Capacity on Erasure Channels

Henry D. Pfister, Oscar Sprumont, Gilles Zémor

We show that on the classical erasure channel, the tensor product of two capacity-achieving code families is itself capacity-achieving under mild conditions. We also prove that duals of tensor products of independent uniform random binary linear codes achieve erasure capacity. Using these local codes, for every erasure probability $ρ\in(0,1/2)$ and every rate gap $\varepsilon>0$, we obtain a family of binary quantum Tanner codes of rate at least $1-2ρ-\varepsilon$. For fixed $ρ$ and $\varepsilon$, these codes have bounded check weights, minimum distance growing linearly with the blocklength, and a linear-time erasure decoder whose decoding error decays exponentially with the blocklength.

arXiv:2611.14087•Nov 10, 2026•0 citations

Density Matrix and Statistical Tensors

Springer eBooks•Jan 1, 2002•0 citations

Independent Events and Tensor Products

Springer eBooks•Jun 16, 2006•0 citations

Accurate and interpretable representation of correlated electronic structure via Tensor Product Selected CI

Nicole M. Braunscheidel, Arnab Bachhar, Nicholas J. Mayhall

The task of computing wavefunctions that are accurate, yet simple enough mathematical objects to use for reasoning, has long been a challenge in quantum chemistry. The difficulty in drawing physical conclusions from a wavefunction is often related to the generally large number of configurations with similar weights. In Tensor Product Selected Configuration Interaction (TPSCI), we use a locally correlated tensor product state basis, which has the effect of concentrating the weight of a state onto a smaller number of physically interpretable degrees of freedom. In this paper, we apply TPSCI to a series of three molecular systems ranging in separability, one of which is the first application of TPSCI to an open-shell bimetallic system. For each of these systems, we obtain accurate solutions to large active spaces, and analyze the resulting wavefunctions through a series of different approaches including (i) direct inspection of the TPS basis coefficients, (ii) construction of Bloch effective Hamiltonians, and (iii) computation of cluster correlation functions.

arXiv:2403.06913•Faraday Discussions•Jan 1, 2024•11 citations

Quantum Tensor Networks, Stochastic Processes, and Weighted Automata

Siddarth Srinivasan, Sandesh Adhikary, Jacob Miller +2 more

Modeling joint probability distributions over sequences has been studied from many perspectives. The physics community developed matrix product states, a tensor-train decomposition for probabilistic modeling, motivated by the need to tractably model many-body systems. But similar models have also been studied in the stochastic processes and weighted automata literature, with little work on how these bodies of work relate to each other. We address this gap by showing how stationary or uniform versions of popular quantum tensor network models have equivalent representations in the stochastic processes and weighted automata literature, in the limit of infinitely long sequences. We demonstrate several equivalence results between models used in these three communities: (i) uniform variants of matrix product states, Born machines and locally purified states from the quantum tensor networks literature, (ii) predictive state representations, hidden Markov models, norm-observable operator models and hidden quantum Markov models from the stochastic process literature,and (iii) stochastic weighted automata, probabilistic automata and quadratic automata from the formal languages literature. Such connections may open the door for results and methods developed in one area to be applied in another.

arXiv:2010.10653•Oct 20, 2020•6 citations

Density Matrix and Statistical Tensors

Vsevolod V. Balashov, Alexei N. Grum-Grzhimailo, Nikolai M. Kabachnik

Springer eBooks•Jan 1, 2000•1 citation
We show that on the classical erasure channel, the tensor product of two capacity-achieving code families is itself capacity-achieving under mild conditions. We also prove that duals of tensor products of independent uniform random binary linear codes achieve erasure capacity. Using these local codes, for every erasure probability ρ∈(0,1/2)ρ\in(0,1/2)ρ∈(0,1/2) and every rate gap ε>0\varepsilon>0ε>0, we obtain a family of binary quantum Tanner codes of rate at least 1−2ρ−ε1-2ρ-\varepsilon1−2ρ−ε. For fixed ρρρ and ε\varepsilonε, these codes have bounded check weights, minimum distance growing linearly with the blocklength, and a linear-time erasure decoder whose decoding error decays exponentially with the blocklength.
The task of computing wavefunctions that are accurate, yet simple enough mathematical objects to use for reasoning, has long been a challenge in quantum chemistry. The difficulty in drawing physical conclusions from a wavefunction is often related to the generally large number of configurations with similar weights. In Tensor Product Selected Configuration Interaction (TPSCI), we use a locally correlated tensor product state basis, which has the effect of concentrating the weight of a state onto a smaller number of physically interpretable degrees of freedom. In this paper, we apply TPSCI to a series of three molecular systems ranging in separability, one of which is the first application of TPSCI to an open-shell bimetallic system. For each of these systems, we obtain accurate solutions to large active spaces, and analyze the resulting wavefunctions through a series of different approaches including (i) direct inspection of the TPS basis coefficients, (ii) construction of Bloch effective Hamiltonians, and (iii) computation of cluster correlation functions.
Modeling joint probability distributions over sequences has been studied from many perspectives. The physics community developed matrix product states, a tensor-train decomposition for probabilistic modeling, motivated by the need to tractably model many-body systems. But similar models have also been studied in the stochastic processes and weighted automata literature, with little work on how these bodies of work relate to each other. We address this gap by showing how stationary or uniform versions of popular quantum tensor network models have equivalent representations in the stochastic processes and weighted automata literature, in the limit of infinitely long sequences. We demonstrate several equivalence results between models used in these three communities: (i) uniform variants of matrix product states, Born machines and locally purified states from the quantum tensor networks literature, (ii) predictive state representations, hidden Markov models, norm-observable operator models and hidden quantum Markov models from the stochastic process literature,and (iii) stochastic weighted automata, probabilistic automata and quadratic automata from the formal languages literature. Such connections may open the door for results and methods developed in one area to be applied in another.