activity
19942005
most citedGeneralizing Tsirelson's bound on Bell inequalities using a min-max principle

42 citations · 233 across the 19 of their papers we have counts for

collaborators
Showing quant-phShow all

24 papers · 1 filter

quant-ph20059 cited

Characterization of quantum computable decision problems by state discrimination

Karl Svozil

One advantage of quantum algorithms over classical computation is the possibility to spread out, process, analyse and extract information in multipartite configurations in coherent…

quant-ph200519 cited

Feasibility of the interlock protocol against man-in-the-middle attacks on quantum cryptography

Karl Svozil

If an eavesdropper succeeds in compromising the quantum as well as the classical channels and mimics the receiver "Bob" for the sender "Alice" and vice versa, one defence strategy…

quant-ph20045 cited

Tracing the bounds on Bell-type inequalities

Stefan Filipp, Karl Svozil

Bell-type inequalities and violations thereof reveal the fundamental differences between standard probability theory and its quantum counterpart. In the course of previous investig…

quant-ph200442 cited

Generalizing Tsirelson's bound on Bell inequalities using a min-max principle

Stefan Filipp, Karl Svozil

Bounds on the norm of quantum operators associated with classical Bell-type inequalities can be derived from their maximal eigenvalues. This quantitative method enables detailed pr…

quant-ph200419 cited

From Heisenberg to Goedel via Chaitin

C. S. Calude, M. A. Stay

In 1927 Heisenberg discovered that the ``more precisely the position is determined, the less precisely the momentum is known in this instant, and vice versa''. Four years later Göd…

quant-ph200314 cited

Testing the bounds on quantum probabilities

Stefan Filipp, Karl Svozil

Bounds on quantum probabilities and expectation values are derived for experimental setups associated with Bell-type inequalities. In analogy to the classical bounds, the quantum l…