Aram W. Harrow
Orcid: 0000-0003-3220-7682Affiliations:
- MIT, Cambridge, USA
According to our database1,
Aram W. Harrow
authored at least 63 papers
between 2003 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on orcid.org
-
on id.loc.gov
-
on mit.edu
On csauthors.net:
Bibliography
2024
SIAM J. Math. Anal., February, 2024
2021
Quantum, 2021
2020
Adversarial Hypothesis Testing and a Quantum Stein's Lemma for Restricted Measurements.
IEEE Trans. Inf. Theory, 2020
From communication complexity to an entanglement spread area law in the ground state of gapped local Hamiltonians.
CoRR, 2020
Classical algorithms, correlation decay, and complex zeros of partition functions of quantum many-body systems.
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020
Adaptive Quantum Simulated Annealing for Bayesian Inference and Estimating Partition Functions.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020
2019
Proceedings of the 10th Innovations in Theoretical Computer Science Conference, 2019
Universality of EPR Pairs in Entanglement-Assisted Communication Complexity, and the Communication Cost of State Conversion.
Proceedings of the 34th Computational Complexity Conference, 2019
2018
IEEE Trans. Inf. Theory, 2018
2017
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017
Proceedings of the 58th IEEE Annual Symposium on Foundations of Computer Science, 2017
2016
IEEE Trans. Inf. Theory, 2016
IEEE Trans. Inf. Theory, 2016
CoRR, 2016
Simulated Quantum Annealing Can Be Exponentially Faster than Classical Simulated Annealing.
CoRR, 2016
Proceedings of the 11th Conference on the Theory of Quantum Computation, 2016
Simulated Quaotum Annealing Can Be Exponentially Faster Than Classical Simulated Annealing.
Proceedings of the IEEE 57th Annual Symposium on Foundations of Computer Science, 2016
Proceedings of the 31st Conference on Computational Complexity, 2016
2015
2014
Dimension-Free L<sub>2</sub> Maximal Inequality for Spherical Means in the Hypercube.
Theory Comput., 2014
The Quantum Reverse Shannon Theorem and Resource Tradeoffs for Simulating Quantum Channels.
IEEE Trans. Inf. Theory, 2014
Proceedings of the 55th IEEE Annual Symposium on Foundations of Computer Science, 2014
2013
J. ACM, 2013
Proceedings of the Symposium on Theory of Computing Conference, 2013
Proceedings of the Symposium on Theory of Computing Conference, 2013
2012
Proceedings of the 44th Symposium on Theory of Computing Conference, 2012
2011
A Communication-Efficient Nonlocal Measurement With Application to Communication Complexity and Bipartite Gate Capacities.
IEEE Trans. Inf. Theory, 2011
Superactivation of the Asymptotic Zero-Error Classical Capacity of a Quantum Channel.
IEEE Trans. Inf. Theory, 2011
IEEE Trans. Inf. Theory, 2011
Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011
2010
IEEE Trans. Inf. Theory, 2010
Proceedings of the IEEE International Symposium on Information Theory, 2010
An Efficient Test for Product States with Applications to Quantum Merlin-Arthur Games.
Proceedings of the 51th Annual IEEE Symposium on Foundations of Computer Science, 2010
2009
Quantum Inf. Comput., 2009
Proceedings of the String Processing and Information Retrieval, 2009
Proceedings of the Approximation, 2009
2008
Quantum Inf. Comput., 2008
An exponential separation between the entanglement and communication capacities of a bipartite unitary interaction.
Proceedings of the 2008 IEEE Information Theory Workshop, 2008
Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008
2007
Weak Fourier-Schur Sampling, the Hidden Subgroup Problem, and the Quantum Collision Problem.
Proceedings of the STACS 2007, 2007
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007
2005
2004
IEEE Trans. Inf. Theory, 2004
Electron. J. Comb., 2004
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004
2003
IEEE Trans. Inf. Theory, 2003