Steven T. Flammia and Aram W. Harrow. LIPIcs, Volume 27, TQC'14, Complete Volume. In 9th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2014). Leibniz International Proceedings in Informatics (LIPIcs), Volume 27, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2014)
@Proceedings{flammia_et_al:LIPIcs.TQC.2014, title = {{LIPIcs, Volume 27, TQC'14, Complete Volume}}, booktitle = {9th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2014)}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2014}, URN = {urn:nbn:de:0030-drops-48241}, doi = {10.4230/LIPIcs.TQC.2014}, annote = {Keywords: Data Encryption, Coding and Information Theory, Theory of Computation} }
Steven T. Flammia and Aram W. Harrow. Front Matter, Table of Contents, Preface, Conference Organization. In 9th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2014). Leibniz International Proceedings in Informatics (LIPIcs), Volume 27, pp. i-xiv, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2014)
@InProceedings{flammia_et_al:LIPIcs.TQC.2014.i, author = {Flammia, Steven T. and Harrow, Aram W.}, title = {{Front Matter, Table of Contents, Preface, Conference Organization}}, booktitle = {9th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2014)}, pages = {i--xiv}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2014.i}, URN = {urn:nbn:de:0030-drops-48197}, doi = {10.4230/LIPIcs.TQC.2014.i}, annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization} }
Jean-Daniel Bancal and Valerio Scarani. More Randomness From Noisy Sources. In 9th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2014). Leibniz International Proceedings in Informatics (LIPIcs), Volume 27, pp. 1-6, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2014)
@InProceedings{bancal_et_al:LIPIcs.TQC.2014.1, author = {Bancal, Jean-Daniel and Scarani, Valerio}, title = {{More Randomness From Noisy Sources}}, booktitle = {9th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2014)}, pages = {1--6}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2014.1}, URN = {urn:nbn:de:0030-drops-48015}, doi = {10.4230/LIPIcs.TQC.2014.1}, annote = {Keywords: Randomness, Bell inequalities, Trusted provider assumption} }
Gilles Brassard, Luc Devroye, and Claude Gravel. Exact Classical Simulation of the GHZ Distribution. In 9th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2014). Leibniz International Proceedings in Informatics (LIPIcs), Volume 27, pp. 7-23, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2014)
@InProceedings{brassard_et_al:LIPIcs.TQC.2014.7, author = {Brassard, Gilles and Devroye, Luc and Gravel, Claude}, title = {{Exact Classical Simulation of the GHZ Distribution}}, booktitle = {9th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2014)}, pages = {7--23}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2014.7}, URN = {urn:nbn:de:0030-drops-48025}, doi = {10.4230/LIPIcs.TQC.2014.7}, annote = {Keywords: Entanglement simulation, Greenberger-Horne-Zeilinger (GHZ) state, Multiparty entanglement, von Neumann's rejection algorithm, Knuth-Yao's sampling alg} }
Harry Buhrman, Serge Fehr, and Christian Schaffner. On the Parallel Repetition of Multi-Player Games: The No-Signaling Case. In 9th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2014). Leibniz International Proceedings in Informatics (LIPIcs), Volume 27, pp. 24-35, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2014)
@InProceedings{buhrman_et_al:LIPIcs.TQC.2014.24, author = {Buhrman, Harry and Fehr, Serge and Schaffner, Christian}, title = {{On the Parallel Repetition of Multi-Player Games: The No-Signaling Case}}, booktitle = {9th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2014)}, pages = {24--35}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2014.24}, URN = {urn:nbn:de:0030-drops-48034}, doi = {10.4230/LIPIcs.TQC.2014.24}, annote = {Keywords: Parallel repetition, non-signaling value, multi-player non-local games} }
Juan Miguel Arrazola and Norbert Lütkenhaus. Quantum Communication Complexity with Coherent States and Linear Optics. In 9th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2014). Leibniz International Proceedings in Informatics (LIPIcs), Volume 27, pp. 36-47, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2014)
@InProceedings{arrazola_et_al:LIPIcs.TQC.2014.36, author = {Arrazola, Juan Miguel and L\"{u}tkenhaus, Norbert}, title = {{Quantum Communication Complexity with Coherent States and Linear Optics}}, booktitle = {9th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2014)}, pages = {36--47}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2014.36}, URN = {urn:nbn:de:0030-drops-48044}, doi = {10.4230/LIPIcs.TQC.2014.36}, annote = {Keywords: Quantum Communication Complexity, Quantum Optics} }
Toby Cubitt, Laura Mancinska, David Roberson, Simone Severini, Dan Stahlke, and Andreas Winter. Bounds on Entanglement Assisted Source-channel Coding Via the Lovász Theta Number and Its Variants. In 9th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2014). Leibniz International Proceedings in Informatics (LIPIcs), Volume 27, pp. 48-51, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2014)
@InProceedings{cubitt_et_al:LIPIcs.TQC.2014.48, author = {Cubitt, Toby and Mancinska, Laura and Roberson, David and Severini, Simone and Stahlke, Dan and Winter, Andreas}, title = {{Bounds on Entanglement Assisted Source-channel Coding Via the Lov\'{a}sz Theta Number and Its Variants}}, booktitle = {9th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2014)}, pages = {48--51}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2014.48}, URN = {urn:nbn:de:0030-drops-48054}, doi = {10.4230/LIPIcs.TQC.2014.48}, annote = {Keywords: source-channel coding, zero-error capacity, Lov\'{a}sz theta} }
Mark M. Wilde and Andreas Winter. Strong Converse for the Quantum Capacity of the Erasure Channel for Almost All Codes. In 9th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2014). Leibniz International Proceedings in Informatics (LIPIcs), Volume 27, pp. 52-66, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2014)
@InProceedings{wilde_et_al:LIPIcs.TQC.2014.52, author = {Wilde, Mark M. and Winter, Andreas}, title = {{Strong Converse for the Quantum Capacity of the Erasure Channel for Almost All Codes}}, booktitle = {9th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2014)}, pages = {52--66}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2014.52}, URN = {urn:nbn:de:0030-drops-48068}, doi = {10.4230/LIPIcs.TQC.2014.52}, annote = {Keywords: strong converse, quantum erasure channel, quantum capacity} }
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.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} }
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.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} }
Milán Mosonyi. Convexity Properties of the Quantum Rényi Divergences, with Applications to the Quantum Stein's Lemma. In 9th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2014). Leibniz International Proceedings in Informatics (LIPIcs), Volume 27, pp. 88-98, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2014)
@InProceedings{mosonyi:LIPIcs.TQC.2014.88, author = {Mosonyi, Mil\'{a}n}, title = {{Convexity Properties of the Quantum R\'{e}nyi Divergences, with Applications to the Quantum Stein's Lemma}}, booktitle = {9th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2014)}, pages = {88--98}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2014.88}, URN = {urn:nbn:de:0030-drops-48094}, doi = {10.4230/LIPIcs.TQC.2014.88}, annote = {Keywords: Quantum R\'{e}nyi divergences, Stein's lemma, composite null-hypothesis, second-order asymptotics} }
Alex Monras and Andreas Winter. Quantum Learning of Classical Stochastic Processes: The Completely-Positive Realization Problem. In 9th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2014). Leibniz International Proceedings in Informatics (LIPIcs), Volume 27, pp. 99-109, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2014)
@InProceedings{monras_et_al:LIPIcs.TQC.2014.99, author = {Monras, Alex and Winter, Andreas}, title = {{Quantum Learning of Classical Stochastic Processes: The Completely-Positive Realization Problem}}, booktitle = {9th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2014)}, pages = {99--109}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2014.99}, URN = {urn:nbn:de:0030-drops-48100}, doi = {10.4230/LIPIcs.TQC.2014.99}, annote = {Keywords: quantum instrument, hidden Markov model, machine learning, quantum measurement} }
Wim van Dam and Siladitya Dey. Hidden Subgroup Quantum Algorithms for a Class of Semi-Direct Product Groups. In 9th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2014). Leibniz International Proceedings in Informatics (LIPIcs), Volume 27, pp. 110-117, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2014)
@InProceedings{vandam_et_al:LIPIcs.TQC.2014.110, author = {van Dam, Wim and Dey, Siladitya}, title = {{Hidden Subgroup Quantum Algorithms for a Class of Semi-Direct Product Groups}}, booktitle = {9th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2014)}, pages = {110--117}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2014.110}, URN = {urn:nbn:de:0030-drops-48117}, doi = {10.4230/LIPIcs.TQC.2014.110}, annote = {Keywords: quantum algorithms, quantum complexity theory, computational group theory} }
Niel de Beaudrap. Difficult Instances of the Counting Problem for 2-quantum-SAT are Very Atypical. In 9th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2014). Leibniz International Proceedings in Informatics (LIPIcs), Volume 27, pp. 118-140, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2014)
@InProceedings{debeaudrap:LIPIcs.TQC.2014.118, author = {de Beaudrap, Niel}, title = {{Difficult Instances of the Counting Problem for 2-quantum-SAT are Very Atypical}}, booktitle = {9th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2014)}, pages = {118--140}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2014.118}, URN = {urn:nbn:de:0030-drops-48129}, doi = {10.4230/LIPIcs.TQC.2014.118}, annote = {Keywords: Frustration-free, Hamiltonian, quantum, counting, satisfiability} }
Gorjan Alagic, Stacey Jeffery, and Stephen Jordan. Circuit Obfuscation Using Braids. In 9th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2014). Leibniz International Proceedings in Informatics (LIPIcs), Volume 27, pp. 141-160, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2014)
@InProceedings{alagic_et_al:LIPIcs.TQC.2014.141, author = {Alagic, Gorjan and Jeffery, Stacey and Jordan, Stephen}, title = {{Circuit Obfuscation Using Braids}}, booktitle = {9th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2014)}, pages = {141--160}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2014.141}, URN = {urn:nbn:de:0030-drops-48135}, doi = {10.4230/LIPIcs.TQC.2014.141}, annote = {Keywords: obfuscation, cryptography, universality, quantum} }
Gorjan Alagic, Aniruddha Bapat, and Stephen Jordan. Classical Simulation of Yang-Baxter Gates. In 9th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2014). Leibniz International Proceedings in Informatics (LIPIcs), Volume 27, pp. 161-175, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2014)
@InProceedings{alagic_et_al:LIPIcs.TQC.2014.161, author = {Alagic, Gorjan and Bapat, Aniruddha and Jordan, Stephen}, title = {{Classical Simulation of Yang-Baxter Gates}}, booktitle = {9th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2014)}, pages = {161--175}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2014.161}, URN = {urn:nbn:de:0030-drops-48143}, doi = {10.4230/LIPIcs.TQC.2014.161}, annote = {Keywords: Quantum, Yang-Baxter, Braid, Anyon} }
Theodoros Kapourniotis, Elham Kashefi, and Animesh Datta. Blindness and Verification of Quantum Computation with One Pure Qubit. In 9th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2014). Leibniz International Proceedings in Informatics (LIPIcs), Volume 27, pp. 176-204, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2014)
@InProceedings{kapourniotis_et_al:LIPIcs.TQC.2014.176, author = {Kapourniotis, Theodoros and Kashefi, Elham and Datta, Animesh}, title = {{Blindness and Verification of Quantum Computation with One Pure Qubit}}, booktitle = {9th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2014)}, pages = {176--204}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2014.176}, URN = {urn:nbn:de:0030-drops-48151}, doi = {10.4230/LIPIcs.TQC.2014.176}, annote = {Keywords: Delegated Computing, Verification, Measurement-based Model} }
Jan Bouda, Marcin Pawlowski, Matej Pivoluska, and Martin Plesch. Device-independent Randomness Extraction for Arbitrarily Weak Min-entropy Source. In 9th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2014). Leibniz International Proceedings in Informatics (LIPIcs), Volume 27, pp. 205-211, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2014)
@InProceedings{bouda_et_al:LIPIcs.TQC.2014.205, author = {Bouda, Jan and Pawlowski, Marcin and Pivoluska, Matej and Plesch, Martin}, title = {{Device-independent Randomness Extraction for Arbitrarily Weak Min-entropy Source}}, booktitle = {9th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2014)}, pages = {205--211}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2014.205}, URN = {urn:nbn:de:0030-drops-48164}, doi = {10.4230/LIPIcs.TQC.2014.205}, annote = {Keywords: Randomness Extraction, Device Independence} }
Laura Mancinska and David Roberson. Graph Homomorphisms for Quantum Players. In 9th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2014). Leibniz International Proceedings in Informatics (LIPIcs), Volume 27, pp. 212-216, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2014)
@InProceedings{mancinska_et_al:LIPIcs.TQC.2014.212, author = {Mancinska, Laura and Roberson, David}, title = {{Graph Homomorphisms for Quantum Players}}, booktitle = {9th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2014)}, pages = {212--216}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2014.212}, URN = {urn:nbn:de:0030-drops-48179}, doi = {10.4230/LIPIcs.TQC.2014.212}, annote = {Keywords: graph homomorphism, nonlocal game, Lov\'{a}sz theta, quantum chromatic number, entanglement} }
Niel de Beaudrap and Martin Roetteler. Quantum Linear Network Coding as One-way Quantum Computation. In 9th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2014). Leibniz International Proceedings in Informatics (LIPIcs), Volume 27, pp. 217-233, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2014)
@InProceedings{debeaudrap_et_al:LIPIcs.TQC.2014.217, author = {de Beaudrap, Niel and Roetteler, Martin}, title = {{Quantum Linear Network Coding as One-way Quantum Computation}}, booktitle = {9th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2014)}, pages = {217--233}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2014.217}, URN = {urn:nbn:de:0030-drops-48189}, doi = {10.4230/LIPIcs.TQC.2014.217}, annote = {Keywords: Network coding, quantum computing, measurement-based computation, simulation} }
Feedback for Dagstuhl Publishing