Sublinear Classical and Quantum Algorithms for General Matrix Games

Authors: Tongyang Li, Chunhao Wang, Shouvanik Chakrabarti, Xiaodi Wu8465-8473

AAAI 2021 | Conference PDF | Archive PDF | Plain Text | LLM Run Details

Reproducibility Variable Result LLM Response
Research Type Theoretical This work is purely theoretical.
Researcher Affiliation Academia 1Joint Center for Quantum Information and Computer Science, Department of Computer Science, and Institute for Advanced Computer Studies, University of Maryland 2Center for Theoretical Physics, Massachusetts Institute of Technology 3Department of Computer Science and Engineering, Pennsylvania State University 4Department of Computer Science, University of Texas at Austin
Pseudocode Yes Algorithm 1: A sublinear algorithm for ℓq-ℓ1 games. Algorithm 2: Prepare an ℓq-pure state given an oracle to its coefficients.
Open Source Code No The paper does not provide a link to a source code repository or explicitly state that source code for the described methodology is publicly available.
Open Datasets No The paper focuses on theoretical algorithm design and analysis and does not describe the use of any specific dataset for training or evaluation.
Dataset Splits No The paper is theoretical and does not describe experimental validation on datasets, thus no dataset splits for training, validation, or testing are mentioned.
Hardware Specification No The paper is purely theoretical and does not describe any empirical experiments, therefore no hardware specifications are mentioned.
Software Dependencies No The paper is theoretical and does not describe software implementations or specific dependencies with version numbers.
Experiment Setup No The paper is purely theoretical and does not describe any empirical experiments, therefore no experimental setup details like hyperparameters or training configurations are provided.