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:math-ph/9910031 · Reports on Mathematical Physics

The quantum information manifold for ε-bounded forms

Matheus R. Grasselli, R. F. Streater

Published Dec 1, 2000• 18 citations
arXivHTMLPDF
DOI
10.1016/s0034-4877(00)90003-x

Related papers

The information manifold for relatively bounded forms

R. F. Streater

We construct a Banach manifold of states, which are Gibbs states for potentials that are form-bounded in the sense of Kato relative to the free Hamiltonian. We construct the (+1)-affine structure and the (+1)-affine connection in the sense of Amari.

arXiv:math-ph/9910035•Oct 22, 1999•5 citations

Information geometry for quantum systems

Amari, Shun-ichi, Nagaoka, Hiroshi

Translations of mathematical monographs•Apr 13, 2007•2 citations

Quantum Information Geometry and Quantum Estimation

Masahito Hayashi

Graduate texts in physics•Nov 3, 2016•5 citations

The analytic quantum information manifold

R. F. Streater

Let H be a self-adjoint operator such that exp(-aH) is of trace class for some a<1. Let V be a symmetric operator, Kato bounded relative to H. We show that log Tr[exp(-H+xV)] is a real analytic function of x in a hood of x=0. We show that the Gibbs states of H+xV form a real analytic Banach manifold. This work has been extended in math-ph/9910031.

arXiv:math-ph/9910036•Oct 22, 1999•12 citations

Graph entropy and quantum sorting problems

Andrew Chi-Chih Yao

Let P = (X, < P) be a partial order on a set of n elements X = x1, x2,..., xn. Define the quantum sorting problem QSORTP as: given n distinct numbers x1, x2,..., xn consistent with P, sort them by a quantum decision tree using comparisons of the form "xi: xj". Let Qε(P) be the minimum number of queries used by any quantum decision tree for solving QSORTP with error less than ε (where 0 < ε < 1/10 is fixed). It was proved by Hoyer, Neerbek and Shi (Algorithmica 34 (2002), 429--448) that, when P0 is the empty partial order, Qε(P0) ≥ Ω (n log n), i. e., the classical information lower bound holds for quantum decision trees when the input permutations are unrestricted.In this paper we show that the classical information lower bound holds, up to an additive linear term, for quantum decision trees for any partial order P. Precisely, we prove Qε(P) ≥ c log2 e(P)-c'n where c,c' > 0 are constants and e(P) is the number of linear orderings consistent with P. Our proof builds on an interesting connection between sorting and Korner's graph entropy that was first noted and developed by Kahn and Kim (JCSS 51(1995), 390--399).

ACM Symposium on Theory of Computing (STOC)•Jun 13, 2004•5 citations

Quantum Information Geometry and Quantum Estimation

Springer eBooks•Sep 1, 2006•0 citations
Let P = (X, < P) be a partial order on a set of n elements X = x1, x2,..., xn. Define the quantum sorting problem QSORTP as: given n distinct numbers x1, x2,..., xn consistent with P, sort them by a quantum decision tree using comparisons of the form "xi: xj". Let Qε(P) be the minimum number of queries used by any quantum decision tree for solving QSORTP with error less than ε (where 0 < ε < 1/10 is fixed). It was proved by Hoyer, Neerbek and Shi (Algorithmica 34 (2002), 429--448) that, when P0 is the empty partial order, Qε(P0) ≥ Ω (n log n), i. e., the classical information lower bound holds for quantum decision trees when the input permutations are unrestricted.In this paper we show that the classical information lower bound holds, up to an additive linear term, for quantum decision trees for any partial order P. Precisely, we prove Qε(P) ≥ c log2 e(P)-c'n where c,c' > 0 are constants and e(P) is the number of linear orderings consistent with P. Our proof builds on an interesting connection between sorting and Korner's graph entropy that was first noted and developed by Kahn and Kim (JCSS 51(1995), 390--399).