
Be the first to like this
Slideshare uses cookies to improve functionality and performance, and to provide you with relevant advertising. If you continue browsing the site, you agree to the use of cookies on this website. See our User Agreement and Privacy Policy.
Slideshare uses cookies to improve functionality and performance, and to provide you with relevant advertising. If you continue browsing the site, you agree to the use of cookies on this website. See our Privacy Policy and User Agreement for details.
Published on
Quantum Supremacy and the Complexity of
Random Circuit Sampling
A critical milestone on the path to useful quantum computers is quantum supremacy – a demonstration of a quantum computation that is prohibitively hard for classical computers. A leading nearterm candidate, put forth by the Google/UCSB team, is sampling from the probability distributions of randomly chosen quantum circuits, which we call Random Circuit Sampling (RCS).
https://qutech.nl/qip2018/qip2018conferenceschedule/
https://arxiv.org/pdf/1803.04402.pdf
https://quantumjournal.org/papers/q201704258/pdf/
Be the first to like this
Be the first to comment