A search for quantum coin-flipping protocols using optimization techniques

DOI10.1007/S10107-015-0909-YzbMath1353.81040arXiv1403.0505OpenAlexW2126146705MaRDI QIDQ263220

Jamie Sikora, Ashwin Nayak, Tunçel, Levent

Publication date: 4 April 2016

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1403.0505

zbMATH Keywords

semidefinite programmingcomputational optimizationquantum coin-flipping

Mathematics Subject Classification ID

Semidefinite programming (90C22) Quantum computation (81P68) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Quantum cryptography (quantum-theoretic aspects) (81P94)

Related Items (1)

Unnamed Item

Uses Software

• SeDuMi

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Quantum cryptography: public key distribution and coin tossing
• Weak coin flipping with small bias
• Strong duality and minimal representations for cone optimization
• A Simpler Proof of the Existence of Quantum Weak Coin Flipping with Arbitrarily Small Bias
• Quantum bit escrow
• Unconditional security in quantum cryptography
• Optimal Counterfeiting Attacks and Generalizations for Wiesner’s Quantum Money
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Quantum Complexity Theory
• Implementation of interior point methods for mixed semidefinite and second order cone optimization problems
• Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
• Optimal Quantum Strong Coin Flipping
• A new protocol and lower bounds for quantum coin flipping
• Optimal Bounds for Quantum Bit Commitment
• Handbook of semidefinite programming. Theory, algorithms, and applications

This page was built for publication: A search for quantum coin-flipping protocols using optimization techniques