Apr 2, 2019 · We construct a relation problem which can be solved with near certainty using a noisy constant-depth quantum circuit composed of geometrically ...

This work constructs a relation problem which can be solved with near certainty using a noisy constant-depth quantum circuit composed of geometrically local ...

We construct a relation problem which can be solved with near certainty using a noisy constant- depth quantum circuit composed of geometrically local gates in ...

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 ...

Dec 14, 2023 · We present a computational problem with the following properties: (i) Every instance can be solved with near-certainty by a constant-depth quantum circuit.

Uncorrected noise prevents quantum computers from running deep algorithms and outperforming classical machines. A method is now reported that allows noisy ...

We construct a relation problem which can be solved with near certainty using a noisy constant-depth quantum circuit composed of geometrically local gates in ...

A colossal advantage: 3D-local noisy shallow quantum circuits defeat unbounded fan-in classical circuits · L. CahaXavier Coiteux-RoyRobert Koenig. Computer ...

Jan 6, 2020 · Quantum advantage with noisy shallow circuits in 3D for QIP 2020 by Sergey Bravyi et al.

Jul 21, 2020 · An international team of researchers proves that imperfect devices can provide a quantum advantage by showing that noisy quantum computers can outperform ...