Hat problem: a new strategy based on quantum stabilizer codes
From MaRDI portal
Publication:2107049
DOI10.1007/S11128-022-03451-7OpenAlexW4220854483WikidataQ114849348 ScholiaQ114849348MaRDI QIDQ2107049FDOQ2107049
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
Recommendations
Cites Work
- Error Correcting Codes in Quantum Theory
- Error detecting and error correcting codes
- Quantum computation and quantum information. 10th anniversary edition
- Title not available (Why is that?)
- Title not available (Why is that?)
- Graph-Theoretical Constructions for Graph Entropy and Network Coding Based Communications
- An Update on Quantum Cryptography
- On optimal strategies for a hat game on graphs
- A New Variation of Hat Guessing Games
- A combinatorial approach to Ebert's hat game with many colors
- The three colour hat guessing game on cycle graphs
- Hat Guessing Games
- Fast decoders for qudit topological codes
- On the hat problem on a graph
- On the Autoreducibility of Random Sequences
- Finite dynamical systems, hat games, and coding theory
- New constructions and bounds for Winkler's hat game
- The hat guessing number of graphs
- The hat problem on cycles on at least nine vertices.
- Title not available (Why is that?)
- Title not available (Why is that?)
- A more colorful hat problem
- The hat problem on a union of disjoint graphs
- 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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2107049)
