Quantum advantage through the magic pentagram problem

DOI10.1007/S11128-022-03684-6MaRDI QIDQ2104768OpenAlexFDO

Authors Haesol Han, Jeonghyeon Shin, Minjin Choi, Byungchan Kim, Soojoon Lee

Publication date 7 December 2022

Published in Quantum Information Processing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2209.15188

zbMATH Keywords

quantum algorithmsquantum advantage\(\mathbf{NC^0}\)\(\mathbf{QNC^0}\)magic pentagram gamemagic pentagram problemshallow circuits

Mathematics Subject Classification ID

Quantum algorithms and complexity in the theory of computing (68Q12) Quantum computation (81P68) Quantum games (91A81)

Recommendations

• Quantum advantage of unitary Clifford circuits with magic state inputs
• Quantum advantage in deciding NP-complete problems
• Quantum magic squares: dilations and their limitations
• Quantum advantage with shallow circuits
• Quantifying magic for multi-qubit operations
• The quantum pentahedra
• The magic of universal quantum computing with permutations
• Polytope compatibility—From quantum measurements to magic squares
• Revealing advantage in a quantum network
• Magic squares: Latin, semiclassical, and quantum

Cites work

• Exponential separation between shallow quantum circuits and unbounded fan-in shallow classical circuits
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Quantum advantage with shallow circuits
• Quantum pseudo-telepathy
• Simple unified form for the major no-hidden-variables theorems

Cited in

(1)

• Exponential separation between shallow quantum circuits and unbounded fan-in shallow classical circuits

This page was built for publication: Quantum advantage through the magic pentagram problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2104768)