There's a lot of discussion and (possibly well-deserved) hype nowadays about quantum computation and its potential for computation at speeds we simply can't reach with the classical computers we're used to today. The excitement about this has been building for years, even decades, but it's only very recently that we've really been approaching a solid … Continue reading Quantum circuits and their role in demonstrating quantum supremacy

This is the season that people are applying for postdoc positions. Unlike student and faculty hiring, which each have a fairly fixed schedule, postdoc availability can change from time to time, with new opportunities opening up all the time. So, I encourage everyone looking for a postdoc position to periodically check out https://cstheory-jobs.org/ . (For … Continue reading Looking a postdoc opportunity?

author: Beatrice Nash Abstract In this blog post, we give a broad overview of quantum walks and some quantum walks-based algorithms, including traversal of the glued trees graph, search, and element distinctness [3; 7; 1]. Quantum walks can be viewed as a model for quantum computation, providing an advantage over classical and other non-quantum walks … Continue reading Introduction to Quantum Walks

The Theory of Computing Blog Aggregator is now back online at a new website: http://cstheory-feed.org/ . There is also a twitter feed at https://twitter.com/cstheory . See this blog post by Suresh Venkatasubramanian (who, together with Arnab Bhattacharyya, is responsible for the aggregator's revival - thank you!!) for more details. This is a good opportunity to … Continue reading Theory Blog Aggregator Up!

[Guest post by Moshe Babaioff --Boaz] "Highlights Beyond EC" Session at EC 2019: Call for Nominations Committee: Mohammad Akbarpour, Moshe Babaioff, Shengwu Li and Ariel Procaccia Following a new tradition started last year, the 2019 ACM Conference on Economics and Computation (EC’19) will host a special session highlighting some of the best work in economics … Continue reading Highlights beyond EC: Call for nominations

[Guest post by Piotr Sankowski --Boaz] Call for Nominations - 4th Highlights of Algorithms conference (HALG 2019) Copenhagen, June 14-16, 2019 http://www.halgdiku.dk/ The HALG 2019 conference seeks high-quality nominations for invited talks that will highlight recent advances in algorithmic research. Similarly to previous years, there are two categories of invited talks: A. survey (60 minutes): a … Continue reading HALG 2019 Call for nominations

[Guest post by Eylon Yogev about a Chrome extension he wrote, of which I am a happy user --Boaz] Hi fellow researchers, I'm writing to share a little tool that I have developed with the ambitious goal of boosting research productivity. The tool is a Chrome extension named "Where's that paper?". Before I tell you … Continue reading Where’s that paper?

[Guest blog from Yaron Singer who is heading the selection committee for the Rabin fellowship this year. In addition to the Rabin fellowship and other postdoc opportunities, this year we also have a new postdoc opportunity in quantum computation and information via the Harvard Quantum Initiative. --Boaz.]   Michael O. Rabin Postdoctoral Fellowship in Theoretical … Continue reading Rabin postdocs ad is out

Guest post by Shuchi Chawla One of the best ways to serve the US-based TCS community is to take up a position at the NSF. Beginning as early as 2019, NSF/CCF is seeking at least one program director for the Algorithmic Foundations core program. This is a rotator position, which is generally two or three years in … Continue reading Be a program director at NSF!