Efficient classical simulation of random shallow 2d quantum circuits

HIGHLIGHTS

SUMMARY

The authors prove that this intuition is false by showing that certain families of constant-depth, 2D random circuits can be approximately simulated on a classical computer in time only linear in the number of qubits and gates, even though the same families are capable of universal quantum computation and are hard to exactly simulate in the worst case (under standard hardness assumptions). While the proof applies to specific random circuit families, the authors demonstrate numerically that typical instances of more general families of sufficiently shallow constantdepth 2D random circuits are also efficiently simulable . . .

 



If you want to have access to all the content you need to log in!

Thanks :)

Username or E-mail:

If you don't have an account, you can create one here.