Skip to main navigation Skip to search Skip to main content

Quantum advantage through the magic pentagram problem

  • Haesol Han
  • , Jeonghyeon Shin
  • , Minjin Choi
  • , Byung Chan Kim
  • , Soojoon Lee

Research output: Contribution to journalArticlepeer-review

Abstract

Through the two specific problems, the 2D hidden linear function problem and the 1D magic square problem, Bravyi et al. have recently shown that there exists a separation between QNC and NC, where QNC and NC are the classes of polynomial-size and constant-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 a nonlocal game. In other words, we show that the problem can be solved with certainty by a QNC circuit but not by any NC circuits.

Original languageEnglish
Article number334
JournalQuantum Information Processing
Volume21
Issue number9
DOIs
Publication statusPublished - Sept 2022

Bibliographical note

Publisher Copyright:
© 2022, The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature.

Keywords

  • Magic pentagram game
  • Magic pentagram problem
  • NC
  • QNC
  • Quantum advantage
  • Quantum algorithms
  • Shallow circuits

Fingerprint

Dive into the research topics of 'Quantum advantage through the magic pentagram problem'. Together they form a unique fingerprint.

Cite this