default search action
8. TQC 2013: Guelph, Canada
- Simone Severini, Fernando G. S. L. Brandão:
8th Conference on the Theory of Quantum Computation, Communication and Cryptography, TQC 2013, May 21-23, 2013, Guelph, Canada. LIPIcs 22, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2013, ISBN 978-3-939897-55-2 - Frontmatter, Table of Contents, Preface, Conference Organization.
- Kerem Halil Shah, Daniel K. L. Oi:
Ancilla Driven Quantum Computation with Arbitrary Entangling Strength. 1-19 - Greg Kuperberg:
Another Subexponential-time Quantum Algorithm for the Dihedral Hidden Subgroup Problem. 20-34 - Joel Klassen, Jianxin Chen, Bei Zeng:
Universal Entanglers for Bosonic and Fermionic Systems. 35-49 - Andrew M. Childs, Robin Kothari, Maris Ozols, Martin Roetteler:
Easy and Hard Functions for the Boolean Hidden Shift Problem. 50-79 - Alessandro Cosentino, Robin Kothari, Adam Paetznick:
Dequantizing Read-once Quantum Formulas. 80-92 - Nathaniel Johnston:
The Minimum Size of Qubit Unextendible Product Bases. 93-105 - Christopher E. Granade, Christopher Ferrie, Nathan Wiebe, David G. Cory:
Robust Online Hamiltonian Learning. 106-125 - Kevin C. Zatloukal:
Classical and Quantum Algorithms for Testing Equivalence of Group Extensions. 126-145 - Andris Ambainis, Janis Iraids:
Provable Advantage for Quantum Strategies in Random Symmetric XOR Games. 146-156 - Mark M. Wilde, Olivier Landon-Cardinal, Patrick M. Hayden:
Towards Efficient Decoding of Classical-Quantum Polar Codes. 157-177 - Giulio Chiribella, Giacomo Mauro D'Ariano, Martin Roetteler:
On the Query Complexity of Perfect Gate Discrimination. 178-191 - Salman Beigi, Jianxin Chen, Markus Grassl, Zhengfeng Ji, Qiang Wang, Bei Zeng:
Symmetries of Codeword Stabilized Quantum Codes. 192-206 - Gonzalo de la Torre, Chirag Dhara, Antonio Acín:
Certifying the Absence of Apparent Randomness under Minimal Assumptions. 207-219 - Yuxiang Yang, Giulio Chiribella:
Is Global Asymptotic Cloning State Estimation?. 220-234 - Guillaume Duclos-Cianci, Krysta M. Svore:
Distillation of Non-Stabilizer States for Universal Quantum Computation. 235-243 - Akira SaiToh:
Realistic Cost for the Model of Coherent Computing. 244-253 - Carl A. Miller, Yaoyun Shi:
Optimal Robust Self-Testing by Binary Nonlocal XOR Games. 254-262 - Andris Ambainis, Janis Iraids, Juris Smotrovs:
Exact Quantum Query Complexity of EXACT and THRESHOLD. 263-269 - Noah Linden, Frantisek Matús, Mary Beth Ruskai, Andreas J. Winter:
The Quantum Entropy Cone of Stabiliser States. 270-284 - Guillaume Duclos-Cianci, David Poulin:
Kitaev's Z_d-Codes Threshold Estimates. 285-293 - David J. Rosenbaum:
Optimal Quantum Circuits for Nearest-Neighbor Architectures. 294-307 - Anne Marin, Damian Markham, Simon Perdrix:
Access Structure in Graphs in High Dimension and Application to Secret Sharing. 308-324
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.