Nearest-neighbour parity gates without the determinant constraint are efficiently universal

Initializing...

Nearest-neighbour parity gates without the determinant constraint are efficiently universal · Prove2Me