iweb visitor

Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revision Previous revision
Next revision
Previous revision
members:atulsingharora [2019/12/04 11:48]
atulsingharora [Publications/preprints]
members:atulsingharora [2019/12/04 11:50]
atulsingharora [Research]
Line 46: Line 46:
 //End of 2017.// Found protocols with ε tending to 1/10. The technique we used was insufficient was for going beyond this limit.\\ //End of 2017.// Found protocols with ε tending to 1/10. The technique we used was insufficient was for going beyond this limit.\\
 //End of 2018.// Constructed a numerical algorithm which can provably find a numerical description of any protocol from its point game description. Effectively,​ this allows one to construct explicit (although numerical) protocols with arbitrarily small biases (in the absence of noise). \\ //End of 2018.// Constructed a numerical algorithm which can provably find a numerical description of any protocol from its point game description. Effectively,​ this allows one to construct explicit (although numerical) protocols with arbitrarily small biases (in the absence of noise). \\
-//End of 2019.// ​We are now trying to find the analytic expressions for the unitaries corresponding to Mochon'​s constructions which yield arbitrarily small bias. This will hopefully result in the complete description of an explicit weak coin flipping protocol with ε tending to zero. \\+//End of 2019.// ​Found analytic expressions for the unitaries corresponding to Mochon'​s constructions which yield arbitrarily small bias. \\
  
 I hope to be able to switch gears soon and study communication/​query complexity. I hope to be able to switch gears soon and study communication/​query complexity.
Line 56: Line 56:
    - Speaker. //Quantum Weak Coin Flipping, where weakness is a virtue.// Boulder, Colorado, USA. Quantum Information Processing (**QIP**) 2019. [ [[https://​www.youtube.com/​watch?​v=eNK6X7BlG5U&​list=PLGdMsPGuoD25wLgnY7RBoTAxsnQEMsNA0&​index=12|video]],​ [[https://​github.com/​AtulSinghArora/​QR/​raw/​master/​WCF/​Coin_flipping%2C_where_weakness_is_a_virtue_pdfOptimised.pdf|pdf]],​ [[ https://​github.com/​AtulSinghArora/​QR/​raw/​master/​WCF/​Coin_flipping%2C_where_weakness_is_a_virtue.pptx|pptx]] ]    - Speaker. //Quantum Weak Coin Flipping, where weakness is a virtue.// Boulder, Colorado, USA. Quantum Information Processing (**QIP**) 2019. [ [[https://​www.youtube.com/​watch?​v=eNK6X7BlG5U&​list=PLGdMsPGuoD25wLgnY7RBoTAxsnQEMsNA0&​index=12|video]],​ [[https://​github.com/​AtulSinghArora/​QR/​raw/​master/​WCF/​Coin_flipping%2C_where_weakness_is_a_virtue_pdfOptimised.pdf|pdf]],​ [[ https://​github.com/​AtulSinghArora/​QR/​raw/​master/​WCF/​Coin_flipping%2C_where_weakness_is_a_virtue.pptx|pptx]] ]
 ====Publications/​preprints==== ====Publications/​preprints====
-   ​- ​Quantum Weak Coin Flipping. A.S.A., J. Roland, C. Vlachou (2019). \\ [[https://​arxiv.org/​abs/​1911.13283|arXiv:​1911.13283]]. (Submitted.)+   ​- ​Explicit quantum weak coin flipping protocols with arbitrarily small bias. A.S.A., J. Roland, C. Vlachou (2019). \\ [[https://​arxiv.org/​abs/​1911.13283|arXiv:​1911.13283]]. (Submitted.)
    - A simple proof of uniqueness of the KCBS inequality. K. Bharti, A.S.A., L. C. Kwek, J. Roland (2018).\\ [[https://​arxiv.org/​abs/​1811.05294|arXiv:​1811.05294]]. (Submitted.)    - A simple proof of uniqueness of the KCBS inequality. K. Bharti, A.S.A., L. C. Kwek, J. Roland (2018).\\ [[https://​arxiv.org/​abs/​1811.05294|arXiv:​1811.05294]]. (Submitted.)
-   - Quantum Weak Coin Flipping. A.S.A., J. Roland, S. Weis (2018, conference version 2019). \\ [[https://​arxiv.org/​abs/​1811.02984|arXiv:​1811.02984]]. [[http://​dx.doi.org/​10.1145/​3313276.3316306|51st ACM Symposium on Theory of Computing (STOC'​19),​ pages 205-216, 2019.]] [[https://​atulsingharora.github.io/​WCF| Web.]] +   - Quantum Weak Coin Flipping. A.S.A., J. Roland, S. Weis (2018, conference version 2019). \\ [[https://​arxiv.org/​abs/​1811.02984|arXiv:​1811.02984]]. [[http://​dx.doi.org/​10.1145/​3313276.3316306|51st ACM Symposium on Theory of Computing (STOC'​19),​ pages 205-216, 2019]][[https://​atulsingharora.github.io/​WCF| Web]]. 
-   - Revisiting the admissibility of non-contextual hidden variable models in quantum mechanics. A.S.A., K. Bharti, Arvind (2016, revised 2018).\\ [[https://​arxiv.org/​abs/​1607.03498|arXiv:​1607.03498]][[https://​doi.org/​10.1016/​j.physleta.2018.11.049|Physics Letters A (Nov 2018)]]. +   - Revisiting the admissibility of non-contextual hidden variable models in quantum mechanics. A.S.A., K. Bharti, Arvind (2016, revised 2018).\\ [[https://​arxiv.org/​abs/​1607.03498|arXiv:​1607.03498]][[https://​doi.org/​10.1016/​j.physleta.2018.11.049|Physics Letters A (Nov 2018)]]. 
-   - Proposal for a macroscopic test of local realism with phase-space measurements. A.S.A., A. Asadian (2015).\\ [[https://​arxiv.org/​abs/​1508.04588|arXiv:​1508.04588]][[https://​doi.org/​10.1103/​PhysRevA.92.062107|Phys. Rev. A 92, 062107]]+   - Proposal for a macroscopic test of local realism with phase-space measurements. A.S.A., A. Asadian (2015).\\ [[https://​arxiv.org/​abs/​1508.04588|arXiv:​1508.04588]][[https://​doi.org/​10.1103/​PhysRevA.92.062107|Phys. Rev. A 92, 062107]]
  
 ====References==== ====References====
    - Quantum weak coin flipping with arbitrarily small bias. C. Mochon (2007). [[https://​arxiv.org/​abs/​0711.4114|arXiv:​0711.4114]]    - Quantum weak coin flipping with arbitrarily small bias. C. Mochon (2007). [[https://​arxiv.org/​abs/​0711.4114|arXiv:​0711.4114]]
    - A large family of quantum weak coin-flipping protocols. C. Mochon (2005). [[https://​arxiv.org/​abs/​quant-ph/​0502068|DOI:​10.1103/​PhysRevA.72.022341]]    - A large family of quantum weak coin-flipping protocols. C. Mochon (2005). [[https://​arxiv.org/​abs/​quant-ph/​0502068|DOI:​10.1103/​PhysRevA.72.022341]]