HIGHLIGHTS
- What: The authors show that any instantaneous quantum polynomial-time (IQP) circuit has an LAQCC implementation. Using this notion of complexity the authors show that any state preparable by an LAQCC* circuit is also preparable by a PostQPoly circuit, the class of circuits of polynomial depth with an additional post-selection gate. The authors provide a constant-depth LAQCC circuit below their conjectured bound already for constant k. The authors show show that there exist LAQCC circuits that can not be weakly simulated in Section 3.4.
- Who: Harry Buhrman et al. from the , and . . .
If you want to have access to all the content you need to log in!
Thanks :)
If you don't have an account, you can create one here.