Published in: LIPIcs, Volume 124, 10th Innovations in Theoretical Computer Science Conference (ITCS 2019)
André Chailloux. A Note on the Quantum Query Complexity of Permutation Symmetric Functions. In 10th Innovations in Theoretical Computer Science Conference (ITCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 124, pp. 19:1-19:7, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{chailloux:LIPIcs.ITCS.2019.19, author = {Chailloux, Andr\'{e}}, title = {{A Note on the Quantum Query Complexity of Permutation Symmetric Functions}}, booktitle = {10th Innovations in Theoretical Computer Science Conference (ITCS 2019)}, pages = {19:1--19:7}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-095-8}, ISSN = {1868-8969}, year = {2019}, volume = {124}, editor = {Blum, Avrim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2019.19}, URN = {urn:nbn:de:0030-drops-101126}, doi = {10.4230/LIPIcs.ITCS.2019.19}, annote = {Keywords: quantum query complexity, permutation symmetric functions} }
Published in: LIPIcs, Volume 27, 9th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2014)
André Chailloux, Laura Mancinska, Giannicola Scarpa, and Simone Severini. Graph-theoretical Bounds on the Entangled Value of Non-local Games. In 9th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2014). Leibniz International Proceedings in Informatics (LIPIcs), Volume 27, pp. 67-75, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2014)
@InProceedings{chailloux_et_al:LIPIcs.TQC.2014.67, author = {Chailloux, Andr\'{e} and Mancinska, Laura and Scarpa, Giannicola and Severini, Simone}, title = {{Graph-theoretical Bounds on the Entangled Value of Non-local Games}}, booktitle = {9th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2014)}, pages = {67--75}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-73-6}, ISSN = {1868-8969}, year = {2014}, volume = {27}, editor = {Flammia, Steven T. and Harrow, Aram W.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2014.67}, URN = {urn:nbn:de:0030-drops-48074}, doi = {10.4230/LIPIcs.TQC.2014.67}, annote = {Keywords: Graph theory, non-locality, entangled games} }
Published in: LIPIcs, Volume 27, 9th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2014)
André Chailloux, Iordanis Kerenidis, Srijita Kundu, and Jamie Sikora. Optimal Bounds for Parity-Oblivious Random Access Codes with Applications. In 9th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2014). Leibniz International Proceedings in Informatics (LIPIcs), Volume 27, pp. 76-87, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2014)
@InProceedings{chailloux_et_al:LIPIcs.TQC.2014.76, author = {Chailloux, Andr\'{e} and Kerenidis, Iordanis and Kundu, Srijita and Sikora, Jamie}, title = {{Optimal Bounds for Parity-Oblivious Random Access Codes with Applications}}, booktitle = {9th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2014)}, pages = {76--87}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-73-6}, ISSN = {1868-8969}, year = {2014}, volume = {27}, editor = {Flammia, Steven T. and Harrow, Aram W.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2014.76}, URN = {urn:nbn:de:0030-drops-48084}, doi = {10.4230/LIPIcs.TQC.2014.76}, annote = {Keywords: quantum information theory, contextuality, semidefinite programming} }
Published in: LIPIcs, Volume 8, IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010)
André Chailloux, Iordanis Kerenidis, and Jamie Sikora. Lower bounds for Quantum Oblivious Transfer. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010). Leibniz International Proceedings in Informatics (LIPIcs), Volume 8, pp. 157-168, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)
@InProceedings{chailloux_et_al:LIPIcs.FSTTCS.2010.157, author = {Chailloux, Andr\'{e} and Kerenidis, Iordanis and Sikora, Jamie}, title = {{Lower bounds for Quantum Oblivious Transfer}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010)}, pages = {157--168}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-23-1}, ISSN = {1868-8969}, year = {2010}, volume = {8}, editor = {Lodaya, Kamal and Mahajan, Meena}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2010.157}, URN = {urn:nbn:de:0030-drops-28613}, doi = {10.4230/LIPIcs.FSTTCS.2010.157}, annote = {Keywords: quantum oblivious transfer, coin flipping protocol, semidefinite programming} }
Feedback for Dagstuhl Publishing