| Publication | Date of Publication | Type |
|---|
Generalized Performance of Concatenated Quantum Codes—A Dynamical Systems Approach
IEEE Transactions on Automatic Control | 2017-07-27 | Paper |
Quantum walks on graphs
Proceedings of the thirty-third annual ACM symposium on Theory of computing | 2015-02-27 | Paper |
Bounded-error quantum state identification and exponential separations in communication complexity
Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing | 2014-11-25 | Paper |
Coins make quantum walks faster
(available as arXiv preprint) | 2014-10-13 | Paper |
| The hidden subgroup problem and permutation group theory | 2014-10-13 | Paper |
A quantum Lovász local lemma
Proceedings of the forty-second ACM symposium on Theory of computing | 2014-08-13 | Paper |
Parallel repetition of entangled games
Proceedings of the forty-third annual ACM symposium on Theory of computing | 2014-06-05 | Paper |
Parallel repetition of entangled games
Proceedings of the forty-third annual ACM symposium on Theory of computing | 2014-06-05 | Paper |
A quantum Lovász local lemma
Journal of the ACM | 2014-02-17 | Paper |
Hardness of approximation for quantum problems
Automata, Languages, and Programming | 2013-08-12 | Paper |
Approximation algorithms for QMA-complete problems
SIAM Journal on Computing | 2012-11-29 | Paper |
Two-source extractors secure against quantum adversaries
Theory of Computing | 2012-09-27 | Paper |
Entangled games are hard to approximate
SIAM Journal on Computing | 2011-10-18 | Paper |
Entangled games are hard to approximate
SIAM Journal on Computing | 2011-10-18 | Paper |
| Upper bounds on the noise threshold for fault-tolerant quantum computing | 2011-10-05 | Paper |
Unique games with entangled provers are easy
SIAM Journal on Computing | 2011-04-04 | Paper |
Quantum Algorithms
Quantum Information, Computation and Cryptography | 2011-02-18 | Paper |
Using entanglement in quantum multi-prover interactive proofs
Computational Complexity | 2011-02-18 | Paper |
Using entanglement in quantum multi-prover interactive proofs
Computational Complexity | 2011-02-18 | Paper |
Ion transport in inhomogeneous media based on the bipartition model for primary ions
Computers & Mathematics with Applications | 2011-02-13 | Paper |
Two-source extractors secure against quantum adversaries
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2010-09-10 | Paper |
Discrete quantum walks hit exponentially faster
Lecture Notes in Computer Science | 2010-05-26 | Paper |
Bounded-error quantum state identification and exponential separations in communication complexity
SIAM Journal on Computing | 2010-03-17 | Paper |
Exponential Separation for One-Way Quantum Communication Complexity, with Applications to Cryptography
SIAM Journal on Computing | 2009-11-06 | Paper |
The power of quantum systems on a line
Communications in Mathematical Physics | 2009-09-25 | Paper |
Adiabatic quantum computation is equivalent to standard quantum computation
SIAM Review | 2008-12-16 | Paper |
scientific article; zbMATH DE number 5320237 (Why is no real title available?)
(available as arXiv preprint) | 2008-09-03 | Paper |
Upper Bounds on the Noise Threshold for Fault-Tolerant Quantum Computing
Automata, Languages and Programming | 2008-08-28 | Paper |
Adiabatic quantum computation is equivalent to standard quantum computation
SIAM Journal on Computing | 2008-03-28 | Paper |
Permutation groups, minimal degrees and quantum computing.
Groups, Geometry, and Dynamics | 2008-02-07 | Paper |
| Quantum algorithms | 2007-12-03 | Paper |
The Complexity of the Local Hamiltonian Problem
SIAM Journal on Computing | 2006-06-01 | Paper |
Discrete quantum walks hit exponentially faster
Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete | 2005-11-02 | Paper |
FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
Lecture Notes in Computer Science | 2005-08-12 | Paper |
