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

Lecture notes in electrical engineering

Computing with Probabilistic Transfer Matrices

Smita Krishnaswamy, Igor L. Markov, John P. Hayes

Published Sep 21, 2012• 0 citations
Publisher
DOI
10.1007/978-90-481-9644-9_3

Related papers

Classical and probabilistic computation

Joseph M. Landsberg

Graduate studies in mathematics•Jun 19, 2024•0 citations

A General Construction of the Transfer Matrices of (k, N + t)-Sum Boxes

Martianus Frederic Ezerman, Gaojun Luo, Jihao Fan +1 more

We closely study N-sum boxes and their transfer matrices. Recently formulated as an abstraction for linear computations over quantum network, such a box allows for tools from quantum information processing to be applied on classical computational problems. We investigate (k, N + t)-sum boxes, which are generalized version of the N-sum boxes, and propose a general construction of their transfer matrices. Seen in this light, an N-sum box is a special case when k = N and t = 0.

IEEE Information Theory Workshop (ITW)•Sep 29, 2025•0 citations

Probabilistic Description of Systems

Roger Balian

Springer eBooks•Jan 1, 1991•0 citations

Quantum circuits with mixed states

Dorit Aharonov, Alexei Kitaev, Noam Nisan

We define the model of quantum circuits with density matrices, where non-unitary gates are allowed. Measurements in the middle of the computation, noise and decoherence are implemented in a natural way in this model, which is shown to be equivalent in computational power to standard quantum circuits. The main result in this paper is a solution for the subroutine problem: The general function that a quantum circuit outputs is a probabilistic function, but using pure state language, such a function can not be used as a black box in other computations. We give a natural definition of using general subroutines, and analyze their computational power. We suggest convenient metrics for quantum computing with mixed states. For density matrices we analyze the so called ``trace metric'', and using this metric, we define and discuss the ``diamond metric'' on superoperators. These metrics enable a formal discussion of errors in the computation. Using a ``causality'' lemma for density matrices, we also prove a simple lower bound for probabilistic functions.

arXiv:quant-ph/9806029•ACM Symposium on Theory of Computing (STOC)•Jan 1, 1998•431 citations

Diagonalizing Transfer Matrices and Matrix Product Operators: A Medley of Exact and Computational Methods

Jutho Haegeman, Frank Verstraete

Transfer matrices and matrix product operators play a ubiquitous role in the field of many-body physics. This review gives an idiosyncratic overview of applications, exact results, and computational aspects of diagonalizing transfer matrices and matrix product operators. The results in this paper are a mixture of classic results, presented from the point of view of tensor networks, and new results. Topics discussed are exact solutions of transfer matrices in equilibrium and nonequilibrium statistical physics, tensor network states, matrix product operator algebras, and numerical matrix product state methods for finding extremal eigenvectors of matrix product operators.

arXiv:1611.08519•Annual Review of Condensed Matter Physics•Mar 31, 2017•118 citations

Approximate solutions for large transfer matrix problems

Norman H. Fuchs

Nuclear Physics B - Proceedings Supplements•Sep 1, 1988•1 citation
We define the model of quantum circuits with density matrices, where non-unitary gates are allowed. Measurements in the middle of the computation, noise and decoherence are implemented in a natural way in this model, which is shown to be equivalent in computational power to standard quantum circuits. The main result in this paper is a solution for the subroutine problem: The general function that a quantum circuit outputs is a probabilistic function, but using pure state language, such a function can not be used as a black box in other computations. We give a natural definition of using general subroutines, and analyze their computational power. We suggest convenient metrics for quantum computing with mixed states. For density matrices we analyze the so called ``trace metric'', and using this metric, we define and discuss the ``diamond metric'' on superoperators. These metrics enable a formal discussion of errors in the computation. Using a ``causality'' lemma for density matrices, we also prove a simple lower bound for probabilistic functions.
Transfer matrices and matrix product operators play a ubiquitous role in the field of many-body physics. This review gives an idiosyncratic overview of applications, exact results, and computational aspects of diagonalizing transfer matrices and matrix product operators. The results in this paper are a mixture of classic results, presented from the point of view of tensor networks, and new results. Topics discussed are exact solutions of transfer matrices in equilibrium and nonequilibrium statistical physics, tensor network states, matrix product operator algebras, and numerical matrix product state methods for finding extremal eigenvectors of matrix product operators.