Mathematical and Theoretical, 48 2: Linear conic formulations for two-party correlations and values of nonlocal games. The American Mathematical Monthly, 77 4: Moreover, we discuss some of the difficulties that arise when considering non-quantum theories. Statistics View Google statistics.
Experimental verification of multipartite entanglement in quantum networks [ pdf ]. Quantum computing gives a generalized model of computation to tackle new and old problems, improving on and generalizing older classical techniques. The list may be incomplete as not all publishers provide suitable and complete citation data. A 90, , Information processing in generalized probabilistic theories.
Massar – [PRL 11] Phys. Indeed, there are striking differences between linear programming and semidefinite programming as there are between classical and quantum computation.
Quantum Computation and Complexity Theory: Experimental verification of multipartite entanglement in quantum networks [ pdf ]. An Axiomatic Basis of Quantum Mechanics.
Gus Gutoski – Academic Home Page
On Crossref’s cited-by service no data on citing works was found last attempt Optimal bounds for quantum bit commitment [ pdf ]. Information processing in generalized probabilistic theories.
No signaling and quantum key distribution. International Workshop on Post-Quantum Cryptography [ ps ]. Interaction in the quantum world [ pdf ].
How to make unforgeable money in generalised probabilistic theories
We discuss the possibility of creating money that is physically impossible to counterfeit. Quantum theory from five reasonable axioms.
Theory and Feasibility”, Statistics View Google statistics. Physical Review A, 75 3: The American Mathematical Monthly, 77 4: Conic approach to quantum graph sikkora using linear optimization over the completely positive semidefinite cone.
Jamie Sikora | Perimeter Institute
Moreover, we discuss some of the difficulties that arise when considering non-quantum theories. Communications in Mathematical Physics, 17 3: Multiparty entanglement verification resistant against dishonest parties tthesis pdf ],[ suppl ].
Mathematical Programming, Employment – now: Two-prover one-round proof systems: In some sense, the notion of point games is dual to the notion of protocols. Limitations on separable measurements by convex optimization.
Reconstructing quantum theory from diagrammatic postulates. Collections Combinatorics and Optimization Theses. Learning with Errors is easy with quantum samples [ pdf ].
We prove that under a quantifiable version of the no-cloning theorem, one can create physical jamiee which has an exponentially small chance of being counterfeited. We also derive a lower bound by constructing a bit-commitment protocol from an oblivious transfer protocol.
An operational approach to quantum probability.
Gus Gutoski – Academic Home Page
First, it allows one to model cheating probabilities using a simpler class of optimization problems known as second-order cone programs SOCPs. In this work, we examine Wiesner’s money scheme in the jamei of generalised probabilistic theories. The third part examines the relationship between oblivious transfer, bit-commitment, and coin-flipping. A simpler proof of existence of quantum weak coin flipping with arbitrarily small bias [ pdf ].
We design a computational optimization approach to search for the best protocol based on the semidefinite programming formulations of cheating strategies.