English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Through the two specific problems, the 2D hidden linear function problem andthe 1D magic square problem, Bravyi et al. have recently shown that thereexists a separation between $\mathbf{QNC^0}$ and $\mathbf{NC^0}$, where$\mathbf{QNC^0}$ and $\mathbf{NC^0}$ are the classes of polynomial-size andconstant-depth quantum and classical circuits with bounded fan-in gates,respectively. In this paper, we present another problem with the same property,the magic pentagram problem based on the magic pentagram game, which is anonlocal game. In other words, we show that the problem can be solved withcertainty by a $\mathbf{QNC^0}$ circuit but not by any $\mathbf{NC^0}$circuits.

Quantum advantage through the magic pentagram problem