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

arXiv:quant-ph/0305030 · Journal of Complexity

Quantum approximation I. Embeddings of finite-dimensional Lp spaces

Stefan Heinrich

Published Nov 15, 2003• 35 citations
arXivHTMLPDF
DOI
10.1016/j.jco.2003.08.002

Related papers

Quantum approximation II. Sobolev embeddings

Stefan Heinrich

arXiv:quant-ph/0305031•Journal of Complexity•Nov 15, 2003•43 citations

FINITE-DIMENSIONAL APPROXIMATIONS OF QUANTUM SYSTEMS AND CONNES' EMBEDDING CONJECTURE

Volkher B. Scholz

We study the requirements for and implications of the existence of finite-dimensional approximations of quantum systems with an infinite number of degrees of freedom. We find a close relationship between these physical questions and the embedding problem of Alain Connes, appearing in the theory of von Neumann algebras. We are mainly interested in the bipartite scenario known from quantum information theory, where two independent parties act on a joint physical system, i.e. by performing measurements. This latter example leads to Tsirelson's problem, which asks whether the modeling of bipartite situations using the usual approach of tensor product of Hilbert spaces compared to the situation of only commuting observables leads to the same correlation tables. We model this situation using the theory of operator systems and explain the connection to Connes' embedding problem. We go on by employing the language of operator systems to elaborate on the requirements for the existence of finite-dimensional approximations for general quantum systems. We furthermore introduce the concept of ultraproducts of operator systems and use it to study the implications of two different kinds of finite-dimensional approximations. Note from Publisher: This article contains the abstract only.

WORLD SCIENTIFIC eBooks•Oct 1, 2013•0 citations

On adaptive linear programming decoding of ternary linear codes

Eirik Rosnes, Michael Helmling

In this work, we consider adaptive linear programming (LP) decoding of ternary linear codes, i. e., linear codes over the finite field Fqwith q = 3 elements. In particular, we characterize completely the codeword polytope (or the convex hull) of the binary image, under Flanagan's embedding, of a ternary single parity-check code. Then, this characterization is used to develop an efficient adaptive LP decoder for ternary codes. Numerical experiments confirm that this decoder is very efficient compared to a static LP decoder and scales well with both block length and check node degree. Finally, we briefly consider the case of nonbinary codes over the finite field Fqwith q = 3melements, where m > 1 is a positive integer.

IEEE Information Theory Workshop (ITW)•Apr 1, 2015•5 citations

On the quantum and randomized approximation of linear functionals on function spaces

Boleslaw Z. Kacewicz

Quantum Information Processing•Aug 26, 2010•0 citations

SCHRÖDINGER EQUATION, Lp-DUALITY AND THE GEOMETRY OF WIGNER-YANASE-DYSON INFORMATION

Paolo Gibilisco, Daniele Imparato, Tommaso Isola

We discuss the geometry of Wigner-Yanase-Dyson information via the so-called Amari-Nagaoka embeddings in L-p-spaces of quantum trajectories

•Oct 1, 2008•1 citation

A conjecture on a tight norm inequality in the finite-dimensional l_p

A. S. Holevo, A. V. Utkin

We suggest a tight inequality for norms in $d$-dimensional space $l_p $ which has simple formulation but appears hard to prove. We give a proof for $d=3$ and provide a detailed numerical check for $d\leq 200$ confirming the conjecture. We conclude with a brief survey of solutions for kin problems which anyhow concern minimization of the output entropy of certain quantum channel and rely upon the symmetry properties of the problem. Key words and phrases: $l_p $-norm, Rényi entropy, tight inequality, maximization of a convex function.

quant-pharXiv:2603.24017•Mar 26, 2026
We study the requirements for and implications of the existence of finite-dimensional approximations of quantum systems with an infinite number of degrees of freedom. We find a close relationship between these physical questions and the embedding problem of Alain Connes, appearing in the theory of von Neumann algebras. We are mainly interested in the bipartite scenario known from quantum information theory, where two independent parties act on a joint physical system, i.e. by performing measurements. This latter example leads to Tsirelson's problem, which asks whether the modeling of bipartite situations using the usual approach of tensor product of Hilbert spaces compared to the situation of only commuting observables leads to the same correlation tables. We model this situation using the theory of operator systems and explain the connection to Connes' embedding problem. We go on by employing the language of operator systems to elaborate on the requirements for the existence of finite-dimensional approximations for general quantum systems. We furthermore introduce the concept of ultraproducts of operator systems and use it to study the implications of two different kinds of finite-dimensional approximations. Note from Publisher: This article contains the abstract only.
In this work, we consider adaptive linear programming (LP) decoding of ternary linear codes, i. e., linear codes over the finite field Fqwith q = 3 elements. In particular, we characterize completely the codeword polytope (or the convex hull) of the binary image, under Flanagan's embedding, of a ternary single parity-check code. Then, this characterization is used to develop an efficient adaptive LP decoder for ternary codes. Numerical experiments confirm that this decoder is very efficient compared to a static LP decoder and scales well with both block length and check node degree. Finally, we briefly consider the case of nonbinary codes over the finite field Fqwith q = 3melements, where m > 1 is a positive integer.
We suggest a tight inequality for norms in ddd-dimensional space $l_p $ which has simple formulation but appears hard to prove. We give a proof for d=3d=3d=3 and provide a detailed numerical check for d≤200d\leq 200d≤200 confirming the conjecture. We conclude with a brief survey of solutions for kin problems which anyhow concern minimization of the output entropy of certain quantum channel and rely upon the symmetry properties of the problem. Key words and phrases: $l_p $-norm, Rényi entropy, tight inequality, maximization of a convex function.