Hat problem: a new strategy based on quantum stabilizer codes

DOI10.1007/S11128-022-03451-7MaRDI QIDQ2107049zbMATH OpenOpenAlexWikidataFDO

Authors Yanyan Li

Publication date 29 November 2022

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

Full work available at URL https://doi.org/10.1007/s11128-022-03451-7

zbMATH Keywords

quantum circuitPauli operatorhat problemquantum stabilizer codewinning probability

Mathematics Subject Classification ID

Quantum coding (general) (81P70)

Recommendations

• Yet another hat game
• A more colorful hat problem
• On the hat problem, its variations, and their applications
• New constructions and bounds for Winkler's hat game
• A modified hat problem

Cites work

• scientific article; zbMATH DE number 6020480 (Why is no real title available?)
• scientific article; zbMATH DE number 5759522 (Why is no real title available?)
• scientific article; zbMATH DE number 1024657 (Why is no real title available?)
• scientific article; zbMATH DE number 1759420 (Why is no real title available?)
• A New Variation of Hat Guessing Games
• A combinatorial approach to Ebert's hat game with many colors
• A more colorful hat problem
• An Update on Quantum Cryptography
• Error Correcting Codes in Quantum Theory
• Error detecting and error correcting codes
• Fast decoders for qudit topological codes
• Finite dynamical systems, hat games, and coding theory
• Graph-Theoretical Constructions for Graph Entropy and Network Coding Based Communications
• Hat Guessing Games
• New constructions and bounds for Winkler's hat game
• On optimal strategies for a hat game on graphs
• On the Autoreducibility of Random Sequences
• On the hat problem on a graph
• Quantum Key‐Distribution Protocols Based on a Quantum Version of the Monty Hall Game
• Quantum Version of a Generalized Monty Hall Game and Its Possible Applications to Quantum Secure Communications
• Quantum computation and quantum information. 10th anniversary edition
• Standard form of qudit stabilizer groups
• The hat guessing number of graphs
• The hat problem on a union of disjoint graphs
• The hat problem on cycles on at least nine vertices.
• The three colour hat guessing game on cycle graphs

This page was built for publication: Hat problem: a new strategy based on quantum stabilizer codes

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