Originated in communications engineering and theoretically rooted in idempotent analysis, the theory of network calculus (NetCal) presents an elegant methodology for offering performance guarantees in deterministic queuing systems. In this research we ...

We analyze quantum two prover one round interactive proof systems, in which noninteracting provers can share unlimited entanglement. The maximum acceptance probability is characterized as a superoperator norm. We get some partial results and in ...