Optimal bounds for quantum bit commitment [ pdf ]. Multiparty entanglement verification resistant against dishonest parties [ pdf ],[ suppl ]. Generalized probabilistic theories and conic extensions of polytopes. An operational approach to quantum probability. Linear conic formulations for two-party correlations and values of nonlocal games. Quantum computing gives a generalized model of computation to tackle new and old problems, improving on and generalizing older classical techniques. The American Mathematical Monthly, 77 4:
Moreover, we discuss some of the difficulties that arise when considering non-quantum theories.
Analyzing Quantum Cryptographic Protocols Using Optimization Techniques
sikoa An operational approach to quantum probability. Their power and their problems. QMA variants with polynomially many provers. Categorical quantum mechanics I: In some sense, the notion of point games is dual to the notion of protocols. New lower bounds for privacy in communication complexity [ pdf ]. Optimal counterfeiting attacks and generalizations for Wiesner’s quantum money. A quantum protocol for sampling correlated equilibria unconditionally and without a mediator [ pdf ].
Habilitation a Diriger des Recherches: Nonlocality and conflicting interest games [ pdf ]. Learning kamie Errors is easy with quantum samples [ pdf ].
Interaction in the quantum world [ pdf ]. Privacy in Quantum Communication Complexity [ pdf ]. Math Phys 06] Journal of Mathematical Physics, 47, A 84, Postdoctoral Associate in the Dept. New constructions for quantum money [ pdf ]. sikira
Indeed, there are striking differences between linear programming and semidefinite programming as there are between classical and quantum computation. Second, it siiora with the construction of point games due to Kitaev as described in Mochon’s work. The mathematical foundations tnesis quantum mechanics. Physical Review A, 75 3: For example, semidefinite programming provides a tool for potentially improving results based on linear programming or investigating old problems that have eluded analysis by linear programming.
Reliable experimental quantification of bipartite entanglement without reference frames [ pdf ]. Physical Review A, thseis 6: Quantum commitments from complexity assumptions [ pdf ]. Copyright remains with the original copyright holders such as the authors or their institutions.
Known lower bounds for bit-commitment then lead to a constant lower bound on the bias of oblivious transfer. Helvetia Physica Acta, We create a protocol filter using cheating strategies, some of which build upon known strategies and others are based on convex optimization and linear algebra.
University of California, Berkeley Ph. Physical review letters, 95 1: A 89, jamis, This framework is broad enough to allow for essentially any potential theory of nature, provided that it admits an operational description. Communications in Mathematical Physics, pages