8th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)
@Proceedings{severini_et_al:LIPIcs.TQC.2013, title = {{LIPIcs, Volume 22, TQC'13, Complete Volume}}, booktitle = {8th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2013)}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2013}, URN = {urn:nbn:de:0030-drops-43480}, doi = {10.4230/LIPIcs.TQC.2013}, annote = {Keywords: Data Encryption, Coding and Information Theory, Theory of Computation} }
8th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 22, pp. i-x, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)
@InProceedings{severini_et_al:LIPIcs.TQC.2013.i, author = {Severini, Simone and Brandao, Fernando}, title = {{Frontmatter, Table of Contents, Preface, Conference Organization}}, booktitle = {8th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2013)}, pages = {i--x}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2013.i}, URN = {urn:nbn:de:0030-drops-43081}, doi = {10.4230/LIPIcs.TQC.2013.i}, annote = {Keywords: Frontmatter, Table of Contents, Preface, Conference Organization} }
Kerem Halil Shah and Daniel K.L. Oi. Ancilla Driven Quantum Computation with Arbitrary Entangling Strength. In 8th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 22, pp. 1-19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)
@InProceedings{halilshah_et_al:LIPIcs.TQC.2013.1, author = {Halil Shah, Kerem and Oi, Daniel K.L.}, title = {{Ancilla Driven Quantum Computation with Arbitrary Entangling Strength}}, booktitle = {8th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2013)}, pages = {1--19}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2013.1}, URN = {urn:nbn:de:0030-drops-43094}, doi = {10.4230/LIPIcs.TQC.2013.1}, annote = {Keywords: Ancilla, weak measurement, quantum computation, entanglement, random walks} }
Greg Kuperberg. Another Subexponential-time Quantum Algorithm for the Dihedral Hidden Subgroup Problem. In 8th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 22, pp. 20-34, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)
@InProceedings{kuperberg:LIPIcs.TQC.2013.20, author = {Kuperberg, Greg}, title = {{Another Subexponential-time Quantum Algorithm for the Dihedral Hidden Subgroup Problem}}, booktitle = {8th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2013)}, pages = {20--34}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2013.20}, URN = {urn:nbn:de:0030-drops-43213}, doi = {10.4230/LIPIcs.TQC.2013.20}, annote = {Keywords: quantum algorithm, hidden subgroup problem, sieve, subexponential time} }
Joel Klassen, Jianxin Chen, and Bei Zeng. Universal Entanglers for Bosonic and Fermionic Systems. In 8th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 22, pp. 35-49, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)
@InProceedings{klassen_et_al:LIPIcs.TQC.2013.35, author = {Klassen, Joel and Chen, Jianxin and Zeng, Bei}, title = {{Universal Entanglers for Bosonic and Fermionic Systems}}, booktitle = {8th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2013)}, pages = {35--49}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2013.35}, URN = {urn:nbn:de:0030-drops-43223}, doi = {10.4230/LIPIcs.TQC.2013.35}, annote = {Keywords: Universal Entangler, Bosonic States, Fermionic States} }
Andrew M. Childs, Robin Kothari, Maris Ozols, and Martin Roetteler. Easy and Hard Functions for the Boolean Hidden Shift Problem. In 8th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 22, pp. 50-79, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)
@InProceedings{childs_et_al:LIPIcs.TQC.2013.50, author = {Childs, Andrew M. and Kothari, Robin and Ozols, Maris and Roetteler, Martin}, title = {{Easy and Hard Functions for the Boolean Hidden Shift Problem}}, booktitle = {8th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2013)}, pages = {50--79}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2013.50}, URN = {urn:nbn:de:0030-drops-43203}, doi = {10.4230/LIPIcs.TQC.2013.50}, annote = {Keywords: Boolean hidden shift problem, quantum algorithms, query complexity, Fourier transform, bent functions} }
Alessandro Cosentino, Robin Kothari, and Adam Paetznick. Dequantizing Read-once Quantum Formulas. In 8th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 22, pp. 80-92, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)
@InProceedings{cosentino_et_al:LIPIcs.TQC.2013.80, author = {Cosentino, Alessandro and Kothari, Robin and Paetznick, Adam}, title = {{Dequantizing Read-once Quantum Formulas}}, booktitle = {8th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2013)}, pages = {80--92}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2013.80}, URN = {urn:nbn:de:0030-drops-43197}, doi = {10.4230/LIPIcs.TQC.2013.80}, annote = {Keywords: formulas, dequantization, circuit complexity} }
Nathaniel Johnston. The Minimum Size of Qubit Unextendible Product Bases. In 8th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 22, pp. 93-105, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)
@InProceedings{johnston:LIPIcs.TQC.2013.93, author = {Johnston, Nathaniel}, title = {{The Minimum Size of Qubit Unextendible Product Bases}}, booktitle = {8th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2013)}, pages = {93--105}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2013.93}, URN = {urn:nbn:de:0030-drops-43173}, doi = {10.4230/LIPIcs.TQC.2013.93}, annote = {Keywords: unextendible product basis; quantum entanglement; graph factorization} }
Christopher E. Granade, Christopher Ferrie, Nathan Wiebe, and D. G. Cory. Robust Online Hamiltonian Learning. In 8th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 22, pp. 106-125, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)
@InProceedings{granade_et_al:LIPIcs.TQC.2013.106, author = {Granade, Christopher E. and Ferrie, Christopher and Wiebe, Nathan and Cory, D. G.}, title = {{Robust Online Hamiltonian Learning}}, booktitle = {8th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2013)}, pages = {106--125}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2013.106}, URN = {urn:nbn:de:0030-drops-43185}, doi = {10.4230/LIPIcs.TQC.2013.106}, annote = {Keywords: Quantum information, sequential Monte Carlo, Bayesian, experiment design, parameter estimation} }
Kevin C. Zatloukal. Classical and Quantum Algorithms for Testing Equivalence of Group Extensions. In 8th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 22, pp. 126-145, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)
@InProceedings{zatloukal:LIPIcs.TQC.2013.126, author = {Zatloukal, Kevin C.}, title = {{Classical and Quantum Algorithms for Testing Equivalence of Group Extensions}}, booktitle = {8th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2013)}, pages = {126--145}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2013.126}, URN = {urn:nbn:de:0030-drops-43164}, doi = {10.4230/LIPIcs.TQC.2013.126}, annote = {Keywords: quantum computing, algorithms, computational group theory} }
Andris Ambainis and Janis Iraids. Provable Advantage for Quantum Strategies in Random Symmetric XOR Games. In 8th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 22, pp. 146-156, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)
@InProceedings{ambainis_et_al:LIPIcs.TQC.2013.146, author = {Ambainis, Andris and Iraids, Janis}, title = {{Provable Advantage for Quantum Strategies in Random Symmetric XOR Games}}, booktitle = {8th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2013)}, pages = {146--156}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2013.146}, URN = {urn:nbn:de:0030-drops-43156}, doi = {10.4230/LIPIcs.TQC.2013.146}, annote = {Keywords: Random Symmetric XOR games, Entanglement} }
Mark M. Wilde, Olivier Landon-Cardinal, and Patrick Hayden. Towards Efficient Decoding of Classical-Quantum Polar Codes. In 8th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 22, pp. 157-177, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)
@InProceedings{wilde_et_al:LIPIcs.TQC.2013.157, author = {Wilde, Mark M. and Landon-Cardinal, Olivier and Hayden, Patrick}, title = {{Towards Efficient Decoding of Classical-Quantum Polar Codes}}, booktitle = {8th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2013)}, pages = {157--177}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2013.157}, URN = {urn:nbn:de:0030-drops-43141}, doi = {10.4230/LIPIcs.TQC.2013.157}, annote = {Keywords: classical-quantum channel, classical-quantum polar codes, quantum likelihood ratio, quantum successive cancellation decoder} }
Giulio Chiribella, Giacomo Mauro D'Ariano, and Martin Roetteler. On the Query Complexity of Perfect Gate Discrimination. In 8th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 22, pp. 178-191, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)
@InProceedings{chiribella_et_al:LIPIcs.TQC.2013.178, author = {Chiribella, Giulio and D'Ariano, Giacomo Mauro and Roetteler, Martin}, title = {{On the Query Complexity of Perfect Gate Discrimination}}, booktitle = {8th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2013)}, pages = {178--191}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2013.178}, URN = {urn:nbn:de:0030-drops-43133}, doi = {10.4230/LIPIcs.TQC.2013.178}, annote = {Keywords: quantum gate identification, unambiguous discrimination, minimum error discrimination, query complexity} }
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.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} }
Gonzalo de la Torre, Chirag Dhara, and Antonio Acin. Certifying the Absence of Apparent Randomness under Minimal Assumptions. In 8th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 22, pp. 207-219, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)
@InProceedings{delatorre_et_al:LIPIcs.TQC.2013.207, author = {de la Torre, Gonzalo and Dhara, Chirag and Acin, Antonio}, title = {{Certifying the Absence of Apparent Randomness under Minimal Assumptions}}, booktitle = {8th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2013)}, pages = {207--219}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2013.207}, URN = {urn:nbn:de:0030-drops-43112}, doi = {10.4230/LIPIcs.TQC.2013.207}, annote = {Keywords: randomness, Bell nonlocality, free choice} }
Yuxiang Yang and Giulio Chiribella. Is Global Asymptotic Cloning State Estimation?. In 8th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 22, pp. 220-234, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)
@InProceedings{yang_et_al:LIPIcs.TQC.2013.220, author = {Yang, Yuxiang and Chiribella, Giulio}, title = {{Is Global Asymptotic Cloning State Estimation?}}, booktitle = {8th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2013)}, pages = {220--234}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2013.220}, URN = {urn:nbn:de:0030-drops-43100}, doi = {10.4230/LIPIcs.TQC.2013.220}, annote = {Keywords: quantum cloning, quantum estimation} }
Guillaume Duclos-Cianci and Krysta M. Svore. Distillation of Non-Stabilizer States for Universal Quantum Computation. In 8th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 22, pp. 235-243, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)
@InProceedings{ducloscianci_et_al:LIPIcs.TQC.2013.235, author = {Duclos-Cianci, Guillaume and Svore, Krysta M.}, title = {{Distillation of Non-Stabilizer States for Universal Quantum Computation}}, booktitle = {8th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2013)}, pages = {235--243}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2013.235}, URN = {urn:nbn:de:0030-drops-43233}, doi = {10.4230/LIPIcs.TQC.2013.235}, annote = {Keywords: quantum computing, resource estimation, magic state distillation} }
Akira SaiToh. Realistic Cost for the Model of Coherent Computing. In 8th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 22, pp. 244-253, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)
@InProceedings{saitoh:LIPIcs.TQC.2013.244, author = {SaiToh, Akira}, title = {{Realistic Cost for the Model of Coherent Computing}}, booktitle = {8th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2013)}, pages = {244--253}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2013.244}, URN = {urn:nbn:de:0030-drops-43249}, doi = {10.4230/LIPIcs.TQC.2013.244}, annote = {Keywords: Reliability, Laser-network computing, Computational complexity} }
Carl A. Miller and Yaoyun Shi. Optimal Robust Self-Testing by Binary Nonlocal XOR Games. In 8th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 22, pp. 254-262, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)
@InProceedings{miller_et_al:LIPIcs.TQC.2013.254, author = {Miller, Carl A. and Shi, Yaoyun}, title = {{Optimal Robust Self-Testing by Binary Nonlocal XOR Games}}, booktitle = {8th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2013)}, pages = {254--262}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2013.254}, URN = {urn:nbn:de:0030-drops-43253}, doi = {10.4230/LIPIcs.TQC.2013.254}, annote = {Keywords: self-testing, quantum cryptography, random number generation, nonlocal games} }
Andris Ambainis, Janis Iraids, and Juris Smotrovs. Exact Quantum Query Complexity of EXACT and THRESHOLD. In 8th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 22, pp. 263-269, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)
@InProceedings{ambainis_et_al:LIPIcs.TQC.2013.263, author = {Ambainis, Andris and Iraids, Janis and Smotrovs, Juris}, title = {{Exact Quantum Query Complexity of EXACT and THRESHOLD}}, booktitle = {8th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2013)}, pages = {263--269}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2013.263}, URN = {urn:nbn:de:0030-drops-43261}, doi = {10.4230/LIPIcs.TQC.2013.263}, annote = {Keywords: Quantum query algorithms, Complexity of Boolean functions} }
Noah Linden, Frantisek Matus, Mary Beth Ruskai, and Andreas Winter. The Quantum Entropy Cone of Stabiliser States. In 8th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 22, pp. 270-284, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)
@InProceedings{linden_et_al:LIPIcs.TQC.2013.270, author = {Linden, Noah and Matus, Frantisek and Ruskai, Mary Beth and Winter, Andreas}, title = {{The Quantum Entropy Cone of Stabiliser States}}, booktitle = {8th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2013)}, pages = {270--284}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2013.270}, URN = {urn:nbn:de:0030-drops-43278}, doi = {10.4230/LIPIcs.TQC.2013.270}, annote = {Keywords: Entropy inequalities, Stabiliser states, Ingleton inequality} }
Guillaume Duclos-Cianci and David Poulin. Kitaev's Z_d-Codes Threshold Estimates. In 8th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 22, pp. 285-293, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)
@InProceedings{ducloscianci_et_al:LIPIcs.TQC.2013.285, author = {Duclos-Cianci, Guillaume and Poulin, David}, title = {{Kitaev's Z\underlined-Codes Threshold Estimates}}, booktitle = {8th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2013)}, pages = {285--293}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2013.285}, URN = {urn:nbn:de:0030-drops-43280}, doi = {10.4230/LIPIcs.TQC.2013.285}, annote = {Keywords: Quantum error-correction threshold, Topological stabilizer codes, Qudit stabilizer codes} }
David J. Rosenbaum. Optimal Quantum Circuits for Nearest-Neighbor Architectures. In 8th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 22, pp. 294-307, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)
@InProceedings{rosenbaum:LIPIcs.TQC.2013.294, author = {Rosenbaum, David J.}, title = {{Optimal Quantum Circuits for Nearest-Neighbor Architectures}}, booktitle = {8th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2013)}, pages = {294--307}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2013.294}, URN = {urn:nbn:de:0030-drops-43290}, doi = {10.4230/LIPIcs.TQC.2013.294}, annote = {Keywords: 2D, Nearest Neighbor, Quantum Architecture, Quantum Complexity, Quantum Computation} }
Anne Marin, Damian Markham, and Simon Perdrix. Access Structure in Graphs in High Dimension and Application to Secret Sharing. In 8th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 22, pp. 308-324, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)
@InProceedings{marin_et_al:LIPIcs.TQC.2013.308, author = {Marin, Anne and Markham, Damian and Perdrix, Simon}, title = {{Access Structure in Graphs in High Dimension and Application to Secret Sharing}}, booktitle = {8th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2013)}, pages = {308--324}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2013.308}, URN = {urn:nbn:de:0030-drops-43306}, doi = {10.4230/LIPIcs.TQC.2013.308}, annote = {Keywords: Quantum Secret Sharing, Graph State, Multigraph, Access structure} }