## Abstract

As increasingly sophisticated prototypes of quantum computers are being developed, a pressing challenge is to find computational problems that can be solved by an intermediate-scale quantum computer, but are beyond the capabilities of existing classical computers. Previous work in this direction has introduced computational problems that can be solved with certainty by quantum circuits of depth independent of the input size (so-called ‘shallow’ circuits) but cannot be solved with high probability by any shallow classical circuit. Here we show that such a separation in computational power persists even when the shallow quantum circuits are restricted to geometrically local gates in three dimensions and corrupted by noise. We also present a streamlined quantum algorithm that is shown to achieve a quantum advantage in a one-dimensional geometry. The latter may be amenable to experimental implementation with the current generation of quantum computers.

Original language | English |
---|---|

Pages (from-to) | 1040-1045 |

Number of pages | 6 |

Journal | Nature Physics |

Volume | 16 |

Issue number | 10 |

DOIs | |

State | Published - 1 Oct 2020 |