Published in: LIPIcs, Volume 261, 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)
Minglong Qin and Penghui Yao. Decidability of Fully Quantum Nonlocal Games with Noisy Maximally Entangled States. In 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 261, pp. 97:1-97:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{qin_et_al:LIPIcs.ICALP.2023.97, author = {Qin, Minglong and Yao, Penghui}, title = {{Decidability of Fully Quantum Nonlocal Games with Noisy Maximally Entangled States}}, booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)}, pages = {97:1--97:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-278-5}, ISSN = {1868-8969}, year = {2023}, volume = {261}, editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.97}, URN = {urn:nbn:de:0030-drops-181499}, doi = {10.4230/LIPIcs.ICALP.2023.97}, annote = {Keywords: Fully quantum nonlocal games, Fourier analysis, Dimension reduction} }
Published in: LIPIcs, Volume 137, 34th Computational Complexity Conference (CCC 2019)
Matthew Coudron and William Slofstra. Complexity Lower Bounds for Computing the Approximately-Commuting Operator Value of Non-Local Games to High Precision. In 34th Computational Complexity Conference (CCC 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 137, pp. 25:1-25:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{coudron_et_al:LIPIcs.CCC.2019.25, author = {Coudron, Matthew and Slofstra, William}, title = {{Complexity Lower Bounds for Computing the Approximately-Commuting Operator Value of Non-Local Games to High Precision}}, booktitle = {34th Computational Complexity Conference (CCC 2019)}, pages = {25:1--25:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-116-0}, ISSN = {1868-8969}, year = {2019}, volume = {137}, editor = {Shpilka, Amir}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2019.25}, URN = {urn:nbn:de:0030-drops-108478}, doi = {10.4230/LIPIcs.CCC.2019.25}, annote = {Keywords: Quantum complexity theory, Non-local game, Multi-prover interactive proof, Entanglement} }
Published in: LIPIcs, Volume 22, 8th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2013)
Salman Beigi, Jianxin Chen, Markus Grassl, Zhengfeng Ji, Qiang Wang, and Bei Zeng. Symmetries of Codeword Stabilized Quantum Codes. In 8th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 22, pp. 192-206, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)
@InProceedings{beigi_et_al:LIPIcs.TQC.2013.192, author = {Beigi, Salman and Chen, Jianxin and Grassl, Markus and Ji, Zhengfeng and Wang, Qiang and Zeng, Bei}, title = {{Symmetries of Codeword Stabilized Quantum Codes}}, booktitle = {8th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2013)}, pages = {192--206}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-55-2}, ISSN = {1868-8969}, year = {2013}, volume = {22}, editor = {Severini, Simone and Brandao, Fernando}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2013.192}, URN = {urn:nbn:de:0030-drops-43129}, doi = {10.4230/LIPIcs.TQC.2013.192}, annote = {Keywords: CWS Codes, Union Stabilizer Codes, Permutation Symmetry, Toric Code} }
Feedback for Dagstuhl Publishing