### JAMIE SIKORA THESIS

Mathematical Programming, First, it allows one to model cheating probabilities using a simpler class of optimization problems known as second-order cone programs SOCPs. Selby, “A no-go theorem for theories that decohere to quantum mechanics”, Proceedings of the Royal Society of London Series A , Umesh Vazirani – Structure of optimal state discrimination in generalized probabilistic theories. A quantum protocol for sampling correlated equilibria unconditionally and without a mediator [ pdf ].

A 89, , Optimal bounds for parity-oblivious random access codes with applications [ pdf ]. Umesh Vazirani – It is divided into the study of coin-flipping and oblivious transfer. Interaction in a quantum world –

Jamoe approach to quantum graph parameters using linear optimization over the completely positive semidefinite cone. We discuss the possibility of creating money that is physically impossible to counterfeit.

In some sense, the notion of point games is dual to the notion of protocols. Reliable experimental quantification of bipartite entanglement without reference frames [ pdf ]. Quantum Computation and Complexity Theory: A quantum protocol for sampling correlated equilibria unconditionally and htesis a mediator [ pdf ].

An approach to empirical logic. Optimal counterfeiting attacks and generalizations for Wiesner’s quantum money.

Efficient quantum communications with multiplexed coherent state fingerprints [ pdf ]. Categorical quantum mechanics I: Massar – [PRL 11] Phys. We use the semidefinite programming SDP formulation of cheating strategies along the lines of Kitaev to analyze the structure of the protocols. Optimal quantum strong coin flipping [ pdf ].

Communications in Mathematical Physics, pages Math Phys 06] Journal of Mathematical Physics, 47, Employment – now: This reduces the problem to optimizing a linear combination of fidelity functions over a polytope which has several benefits. We design a computational optimization sjkora to search for the best protocol based on the semidefinite programming formulations of cheating strategies. Multiparty entanglement verification resistant against dishonest parties [ thewis ],[ suppl ].

Abstract This thesis concerns the analysis of the unconditional security of quantum cryptographic protocols using jsmie optimization techniques.

Cite this version of the work Jamie Sikora Equivalence of relativistic jajie structure and process terminality. Physical Review A, 75 3: Almost all of the handful of explicitly described coin-flipping protocols are based on bit-commitment.

## How to make unforgeable money in generalised probabilistic theories

Sikorra this sense, the history of semidefinite programming is very similar to the history of quantum computation. We prove that under a quantifiable version of the no-cloning theorem, one can create physical money which has an exponentially small chance of being counterfeited.

Probabilistic theories with purification. Optimal bounds for parity-oblivious random access codes with applications [ pdf ].

# How to make unforgeable money in generalised probabilistic theories – Quantum

A simple proof of the impossibility of bit-commitment in generalised probabilistic theories using cone programming. JavaScript is disabled for your browser.

Conditions on the existence of maximally incompatible two-outcome measurements in general probabilistic theory. Copyright jamiw with the original copyright holders such as the authors or their institutions.

## Jamie Sikora

Quantum money with classical verification. Indeed, there are striking differences between linear programming and semidefinite programming as there are between classical and quantum computation.

Interaction in a quantum world.