Hat problem: a new strategy based on quantum stabilizer codes

DOI10.1007/s11128-022-03451-7OpenAlexW4220854483WikidataQ114849348 ScholiaQ114849348MaRDI QIDQ2107049

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

Pauli operatorquantum circuithat problemquantum stabilizer codewinning probability

Mathematics Subject Classification ID

Quantum coding (general) (81P70)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A combinatorial approach to Ebert's hat game with many colors
• The three colour hat guessing game on cycle graphs
• The hat guessing number of graphs
• On the hat problem on a graph
• An Update on Quantum Cryptography
• On Optimal Strategies for a Hat Game on Graphs
• Quantum Computation and Quantum Information
• A New Variation of Hat Guessing Games
• On the Autoreducibility of Random Sequences
• Error Correcting Codes in Quantum Theory
• Finite Dynamical Systems, Hat Games, and Coding Theory
• Error Detecting and Error Correcting Codes
• Fast decoders for qudit topological codes
• New Constructions and Bounds for Winkler's Hat Game
• Graph-Theoretical Constructions for Graph Entropy and Network Coding Based Communications
• Hat Guessing Games
• Standard form of qudit stabilizer groups
• 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

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