• Corpus ID: 231924481

Interactive quantum advantage with noisy, shallow Clifford circuits

  title={Interactive quantum advantage with noisy, shallow Clifford circuits},
  author={Daniel Grier and Nathan Ju and Luke Schaeffer},
Recent work by Bravyi et al. constructs a relation problem that a noisy constant-depth quantum circuit (QNC) can solve with near certainty (probability 1 − o(1)), but that any bounded fan-in constant-depth classical circuit (NC) fails with some constant probability. We show that this robustness to noise can be achieved in the other low-depth quantum/classical circuit separations in this area. In particular, we show a general strategy for adding noise tolerance to the interactive protocols of… 
3 Citations

Figures from this paper

Quantum Advantage with Shallow Circuits under Arbitrary Corruption

It is shown that even in this model, quantum circuits can still solve in constant depth computational problems that require logarithmic depth to solve with bounded fan-in classical circuits, which gives another compelling evidence of the computational power of quantum shallow circuits.

On the power of interleaved low-depth quantum and classical circuits

This thesis tackles the question of characterizing the computational power of interleaved low-depth quantum and classical circuits by combining existing techniques from quantum fan-out constructions, teleportationbased quantum computation, and Clifford + T circuit synthesis and shows several results regarding the power of variants of constant- depth quantum circuits.

Long-range data transmission in a fault-tolerant quantum bus architecture

The conservative analytical estimates are surprisingly optimistic, suggesting that the scheme is suited for long-range entanglement generation both in and between near-term quantum computing devices.

Interactive shallow Clifford circuits: Quantum advantage against NC¹ and beyond

This work gives a two-round interactive task which is solved by a constant-depth quantum circuit, but such that any classical solution would necessarily solve -hard problems, and proves hardness results for weaker complexity classes under more restrictive circuit topologies.

Average-case quantum advantage with shallow circuits

  • F. Gall
  • Computer Science
    Computational Complexity Conference
  • 2019
This paper constructs a computational task that can be solved on all inputs by a quantum circuit of constant depth with bounded-fanin gates (a "shallow" quantum circuit) and shows that any classical circuit solving this problem on a non-negligible fraction of the inputs must have logarithmic depth.

Exponential separation between shallow quantum circuits and unbounded fan-in shallow classical circuits

The Parity Halving Problem is constructed by constructing a new problem in QNC^0, which is easier to work with, and it is proved that AC^0 lower bounds for this problem are proved, and that it reduces to the 2D HLF problem.

Quantum advantage with noisy shallow circuits

It is shown 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, which prevents quantum computers from running deep algorithms and outperforming classical machines.

Trading Locality for Time: Certifiable Randomness from Low-Depth Circuits

A protocol for exponential certified randomness expansion using a single quantum device and relies on the physical assumption that the adversarial device being tested implements a circuit of sub-logarithmic depth to be able to be easily verified in classical linear time.

Quantum advantage with shallow circuits

It is shown that parallel quantum algorithms running in a constant time period are strictly more powerful than their classical counterparts; they are provably better at solving certain linear algebra problems associated with binary quadratic forms.

Constant Overhead Quantum Fault-Tolerance with Quantum Expander Codes

We prove that quantum expander codes can be combined with quantum fault-tolerance techniques to achieve constant overhead: the ratio between the total number of physical qubits required for a quantum

Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy

  • M. BremnerR. JozsaD. Shepherd
  • Computer Science, Mathematics
    Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences
  • 2010
The class post-IQP of languages decided with bounded error by uniform families of IQP circuits with post-selection is introduced, and it is proved first that post- IQP equals the classical class PP, and that if the output distributions of uniform IQP circuit families could be classically efficiently sampled, then the infinite tower of classical complexity classes known as the polynomial hierarchy would collapse to its third level.

A theorem on probabilistic constant depth Computations

Stockmeyer [St] showed that probabilistic bounded depth circuits can approximate the exact number of ones in the input with very low probability of error.

Characterizing quantum supremacy in near-term devices

A critical question for quantum computing in the near future is whether quantum devices without error correction can perform a well-defined computational task beyond the capabilities of