Yuval Sanders's guest appearances

Yuval Sanders

meet the meQuanics - Quantum Computing Discussions

OwlTail

During this time of lockdown, the centre for quantum software and information (QSI) at the University of Technology Sydney has launched an online seminar series.  With talks once or twice a week from leading researchers in the field, meQuanics is supporting this series by mirroring the audio from each talk.  I would encourage if you listen to this episode, to visit and subscribe to the UTS:QSI YouTube page to see each of these talks with the associated slides to help it make more sense. https://youtu.be/qYuxOx4Z8Yk A growing methodological problem for practical quantum algorithms research  TITLE: Why are quantum algorithms papers so #!@*&amp;% long?  SPEAKER: Dr Yuval Sanders  AFFILIATION: Centre for Quantum Software and Information, University of Technology Sydney  ABSTRACT: In this talk I discuss the results of two of my recent quantum algorithms papers: arXiv:2007.07391 and arXiv:2110.05708. Both of these papers are 70+ pages in length and quite dense, which needs some explanation because the underlying ideas are not particularly complicated. The reason for the length is that we, the authors, are effectively compiling quantum algorithms by hand, and we are doing a very crude job of it. I will explain that increasing paper lengths are evidence for a growing methodological problem for practical quantum algorithms research. I will also explain why that methodological problem is in large part responsible to ongoing mistakes in media when attempting to articulate the real-world applications of quantum computers.    HOSTED BY: Associate Professor Troy Lee, Centre for Quantum Software and Information, University of Technology Sydney, Australia  RELATED PAPERS: https://arxiv.org/abs/2007.07391; https://arxiv.org/abs/2110.05708

During this time of lockdown, the centre for quantum software and information (QSI) at the University of Technology Sydney has launched an online seminar series.  With talks once or twice a week from leading researchers in the field, meQuanics is supporting this series by mirroring the audio from each talk.  I would encourage if you listen to this episode, to visit and subscribe to the UTS:QSI YouTube page to see each of these talks with the associated slides to help it make more sense. <a href="https://youtu.be/qYuxOx4Z8Yk" rel="nofollow" target="_blank">https://youtu.be/qYuxOx4Z8Yk</a> A growing methodological problem for practical quantum algorithms research  TITLE: Why are quantum algorithms papers so #!@*&amp;% long?  SPEAKER: Dr Yuval Sanders  AFFILIATION: Centre for Quantum Software and Information, University of Technology Sydney  ABSTRACT: In this talk I discuss the results of two of my recent quantum algorithms papers: arXiv:2007.07391 and arXiv:2110.05708. Both of these papers are 70+ pages in length and quite dense, which needs some explanation because the underlying ideas are not particularly complicated. The reason for the length is that we, the authors, are effectively compiling quantum algorithms by hand, and we are doing a very crude job of it. I will explain that increasing paper lengths are evidence for a growing methodological problem for practical quantum algorithms research. I will also explain why that methodological problem is in large part responsible to ongoing mistakes in media when attempting to articulate the real-world applications of quantum computers.    HOSTED BY: Associate Professor Troy Lee, Centre for Quantum Software and Information, University of Technology Sydney, Australia  RELATED PAPERS: <a href="https://www.youtube.com/redirect?event=video_description&amp;redir_token=QUFFLUhqbFlyZ2pTa2dmMi1BODdJWk1oTnFSUlBZWTdFZ3xBQ3Jtc0tsV21LTUE0Wm1oSE56bEtiSkFnMkEyYmJNc0tXeFBwbjR4VTEtTThLeXotX3JXajk4Tl9XemhMTnBvU3RObzU3aFBxUFA2bTVyN29DTjZIUUl0akhabENjbnk2aE5ObUIxWUlZc0JvNU9wM3d1NUtWdw&amp;q=https%3A%2F%2Farxiv.org%2Fabs%2F2007.07391%3B" rel="nofollow" target="_blank">https://arxiv.org/abs/2007.07391;</a> <a href="https://www.youtube.com/redirect?event=video_description&amp;redir_token=QUFFLUhqbnh3aEdTNHFCTmxxMGxKVXI3R0JlenpOaFhSUXxBQ3Jtc0trWGo2bWc0V2RhR3ZZdk9TWDFqZm1SRFgzWWpLU2ZHcXplOFlTdkVJLTk2MDBFTl9MbmtmcXhLbVBIRWhIc0FCM1dfaXE2ZHhCNGotdE5oVS1oVUtpYWJ4cFFkZElfaG1BRHBnaF9WYWVrV0RUd0JoZw&amp;q=https%3A%2F%2Farxiv.org%2Fabs%2F2110.05708" rel="nofollow" target="_blank">https://arxiv.org/abs/2110.05708</a>