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

Comparison of Information Systems and Quantum Teleportation

Eran Shmaya

Published Oct 27, 2004• 0 citations
OpenAlex

Abstract

A classic theorem in statistics about comparison between information systems is given an analogue in quantum probabilistic setup. The proof relies on the separation theorem for convex sets and on quantum teleportation.

Related papers

Teleportation into Quantum Statistics

Richard David Gill

The paper is a tutorial introduction to quantum information theory, developing the basic model and emphasizing the role of statistics and probability.

arXiv:math/0405572•Journal of the Korean Statistical Society•May 29, 2004•9 citations

Comparison of information structures and completely positive maps

Eran Shmaya

A theorem of Blackwell about comparison between information structures in classical statistics is given an analogue in the quantum probabilistic setup. The theorem provides an operational interpretation for trace-preserving completely positive maps, which are the natural quantum analogue of classical stochastic maps. The proof of the theorem relies on the separation theorem for convex sets and on quantum teleportation.

arXiv:quant-ph/0410233•Journal of Physics A Mathematical and General•Oct 19, 2005•25 citations

Extreme Points of the Convex set of Stochastic Maps on A C*-Algebra

Kalyanapuram Rangachari Parthasarathy

Let [Formula: see text] be a unital C*-subalgebra of the C*-algebra ℬ(ℋ) of all bounded operators on a complex separable Hilbert space ℋ. Let [Formula: see text] denote the convex set of all unital, linear, completely positive and normal maps of [Formula: see text] into itself. Using Stinespring's theorem, we present a criterion for an element [Formula: see text] to be extremal. When [Formula: see text], this criterion leads to an explicit description of the set of all extreme points of [Formula: see text]. We also obtain a quantum probabilistic analogue of the classical Birkhoff's theorem2 that every bistochastic matrix can be expressed as a convex combination of permutation matrices.

Infinite Dimensional Analysis Quantum Probability and Related Topics•Oct 1, 1998•4 citations

Teleportation topology

Louis Hirsch Kauffman

The paper discusses teleportation in the context of comparing quantum and topological points of view.

arXiv:quant-ph/0407224•Optics and Spectroscopy•Aug 1, 2005•51 citations

Quantum teleportation and its applications

Akira Furusawa

I will briefly introduce the concept of quantum entanglement and quantum teleportation.Moreover, I will show their applications.

Journal of the Visualization Society of Japan•Jan 1, 2007•0 citations

Probabilistically Checking Quantum Proofs, with Interaction

Baocheng Sun, Thomas Vidick

The model of interactive oracle proofs (IOP) generalizes the notion of probabilistically checkable proof (PCP), in which a static proof is verified probabilistically by querying a small number of bits, to the interactive setting: a polynomial-time verifier interacts with an unbounded prover, but is restricted to only reading a small number of bits, in total, from the messages sent by the prover. IOPs provide a relaxed setting in which to study local probabilistic verification. They have proved instrumental in devising efficient methods for verification through subsequent compilation into non-interactive or succinct protocols. We study a quantum analogue of interactive oracle proofs (qIOP) in which the verifier and communication are both allowed to be quantum; yet the verifier is restricted to perform measurements only on a small number of qubits received from the prover. Our main result is a qIOP for any language in QMA, in which the total communication is polynomial but the verifier only reads a polylogarithmic number of qubits in total. The protocol has completeness parameter exponentially close to $1$ and soundness bounded away from $1$ by a constant. In the absence of a quantum PCP theorem, this provides the first information-theoretically sound local and robust characterization of QMA, albeit interactive. Our protocol combines the use of a quantum locally testable code (LTC) with classical techniques, notably probabilistically checkable proofs of proximity (PCPP). We avoid the necessity for complex multi-qubit tests employed in other settings by leveraging the local indistinguishability property of the quantum LTC.

cs.CCCross-listedarXiv:2606.09588•Jun 9, 2026•0 citations
Let [Formula: see text] be a unital C*-subalgebra of the C*-algebra ℬ(ℋ) of all bounded operators on a complex separable Hilbert space ℋ. Let [Formula: see text] denote the convex set of all unital, linear, completely positive and normal maps of [Formula: see text] into itself. Using Stinespring's theorem, we present a criterion for an element [Formula: see text] to be extremal. When [Formula: see text], this criterion leads to an explicit description of the set of all extreme points of [Formula: see text]. We also obtain a quantum probabilistic analogue of the classical Birkhoff's theorem2 that every bistochastic matrix can be expressed as a convex combination of permutation matrices.
The model of interactive oracle proofs (IOP) generalizes the notion of probabilistically checkable proof (PCP), in which a static proof is verified probabilistically by querying a small number of bits, to the interactive setting: a polynomial-time verifier interacts with an unbounded prover, but is restricted to only reading a small number of bits, in total, from the messages sent by the prover. IOPs provide a relaxed setting in which to study local probabilistic verification. They have proved instrumental in devising efficient methods for verification through subsequent compilation into non-interactive or succinct protocols. We study a quantum analogue of interactive oracle proofs (qIOP) in which the verifier and communication are both allowed to be quantum; yet the verifier is restricted to perform measurements only on a small number of qubits received from the prover. Our main result is a qIOP for any language in QMA, in which the total communication is polynomial but the verifier only reads a polylogarithmic number of qubits in total. The protocol has completeness parameter exponentially close to 111 and soundness bounded away from 111 by a constant. In the absence of a quantum PCP theorem, this provides the first information-theoretically sound local and robust characterization of QMA, albeit interactive. Our protocol combines the use of a quantum locally testable code (LTC) with classical techniques, notably probabilistically checkable proofs of proximity (PCPP). We avoid the necessity for complex multi-qubit tests employed in other settings by leveraging the local indistinguishability property of the quantum LTC.