In this work, we examine Wiesner’s money scheme in the framework of generalised probabilistic theories. Selby, “A no-go theorem for theories that decohere to quantum mechanics”, Proceedings of the Royal Society of London Series A , Known lower bounds for bit-commitment then lead to a constant lower bound on the bias of oblivious transfer. Cite this version of the work Jamie Sikora Physical Review A, 81 6: Information processing in generalized probabilistic theories.
Quantum recommendation systems [ pdf ]. We discuss the possibility of creating money that is physically impossible to counterfeit. Second, it helps with the construction of point games due to Kitaev as described in Mochon’s work. Efficient quantum communications with multiplexed coherent state fingerprints [ pdf ]. Experimental plug and play quantum coin flipping [ pdf ].
Practical quantum coin flipping [ pdf ]. Two-prover one-round proof systems: University of California, Berkeley Ph.
Analyzing Quantum Cryptographic Protocols Using Optimization Techniques
Helvetia Physica Acta, In this work, we examine Wiesner’s money scheme in the framework of generalised probabilistic theories. A 84, Statistics View Google statistics.
Their power skkora their problems. In fact, we can construct point games for the classical protocols as well using the analysis for the quantum case. Reformulating and reconstructing quantum theory.
Exponential separation of quantum and classical one-way communication complexity [ pdf ] Ziv Bar-Yossef, T.
There has been increased research activity in optimization concerning generalizing theory and algorithms for linear programming to much wider classes of optimization problems such as semidefinite programming.
In some sense, the notion of point games is dual to the notion of protocols. Massar – [PRL 11] Phys. A search for quantum coin-flipping protocols using optimization techniques.
Strong connections between quantum encodings, non-locality and quantum cryptography [ pdf ]. The information cost of quantum memoryless protocols [ pdf ]. We also derive a lower bound by constructing a bit-commitment protocol from an oblivious transfer protocol.
How to make unforgeable money in generalised probabilistic theories
Nonlocality and conflicting interest games [ pdf ]. On Crossref’s cited-by service no data on citing works was found last attempt Conditions on the existence of maximally incompatible two-outcome measurements in general probabilistic theory.
Optimal bounds for quantum bit commitment [ pdf ]. We discuss the possibility of creating money ajmie is physically impossible to counterfeit. A simpler proof of existence of quantum weak coin flipping with arbitrarily small bias [ pdf ].
Communications in Mathematical Physics, 17 3: Shortcuts to quantum network routing [ pdf ].
A simple proof of the siiora of bit-commitment in generalised probabilistic theories using cone programming. An Axiomatic Basis of Quantum Mechanics. Quantum recommendation systems [ pdf ]. Letters, Mathematical and Theoretical, 48 2: In this thesis, we strengthen this analogy by studying a family of classical coin-flipping protocols based on classical bit-commitment. Experimental plug and play quantum coin flipping [ pdf ].
Selby, “A no-go theorem for theories that decohere to quantum mechanics”, Proceedings of the Royal Society of London Series A In this sense, the history of semidefinite programming is very similar to the history of quantum computation.