Aram W. Harrow

Orcid: 0000-0003-3220-7682

Affiliations:
  • MIT, Cambridge, USA


According to our database1, Aram W. Harrow authored at least 63 papers between 2003 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Improved Concentration of Laguerre and Jacobi Ensembles.
SIAM J. Math. Anal., February, 2024

2021
Rapid mixing of path integral Monte Carlo for 1D stoquastic Hamiltonians.
Quantum, 2021

2020
Adversarial Hypothesis Testing and a Quantum Stein's Lemma for Restricted Measurements.
IEEE Trans. Inf. Theory, 2020

How many qubits are needed for quantum computational supremacy?
Quantum, 2020

From communication complexity to an entanglement spread area law in the ground state of gapped local Hamiltonians.
CoRR, 2020

Efficient classical simulation of random shallow 2D quantum circuits.
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
Supervised learning with quantum-enhanced feature spaces.
Nat., 2019

Algorithms, Bounds, and Strategies for Entangled XOR Games.
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
Expected Communication Cost of Distributed Quantum Tasks.
IEEE Trans. Inf. Theory, 2018

2017
Sample-Optimal Tomography of Quantum States.
IEEE Trans. Inf. Theory, 2017

Sparse Quantum Codes From Quantum Circuits.
IEEE Trans. Inf. Theory, 2017

Quantum computational supremacy.
Nat., 2017

Sequential measurements, disturbance and property testing.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Local Hamiltonians Whose Ground States Are Hard to Approximate.
Proceedings of the 58th IEEE Annual Symposium on Foundations of Computer Science, 2017

2016
Quantum Algorithms for Systems of Linear Equations.
Encyclopedia of Algorithms, 2016

Strengthened Monotonicity of Relative Entropy via Pinched Petz Recovery Map.
IEEE Trans. Inf. Theory, 2016

Compressibility of Positive Semidefinite Factorizations and Quantum Models.
IEEE Trans. Inf. Theory, 2016

Limitations of semidefinite programs for separable states and entangled games.
CoRR, 2016

Simulated Quantum Annealing Can Be Exponentially Faster than Classical Simulated Annealing.
CoRR, 2016

Lower Bound on Expected Communication Cost of Quantum Huffman Coding.
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

Tight SoS-Degree Bounds for Approximate Nash Equilibria.
Proceedings of the 31st Conference on Computational Complexity, 2016

2015
An improved semidefinite programming hierarchy for testing entanglement.
CoRR, 2015

Extremal eigenvalues of local Hamiltonians.
CoRR, 2015

Review of Quantum Algorithms for Systems of Linear Equations.
CoRR, 2015

Estimating operator norms using covering nets.
CoRR, 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

Uselessness for an Oracle model with internal randomness.
Quantum Inf. Comput., 2014

Local Tests of Global Entanglement and a Counterexample to the Generalized Area Law.
Proceedings of the 55th IEEE Annual Symposium on Foundations of Computer Science, 2014

2013
Counterexamples to Kalai's conjecture C.
Quantum Inf. Comput., 2013

Testing Product States, Quantum Merlin-Arthur Games and Tensor Optimization.
J. ACM, 2013

Product-state approximations to quantum ground states.
Proceedings of the Symposium on Theory of Computing Conference, 2013

Quantum de finetti theorems under local measurements with applications.
Proceedings of the Symposium on Theory of Computing Conference, 2013

2012
How Many Copies are Needed for State Discrimination?
IEEE Trans. Inf. Theory, 2012

Why now is the right time to study quantum computing.
XRDS, 2012

Hypercontractivity, sum-of-squares proofs, and their applications.
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

Quantum Algorithms for Testing Properties of Distributions.
IEEE Trans. Inf. Theory, 2011

Limitations on Quantum Dimensionality Reduction.
Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

2010
Time reversal and exchange symmetries of unitary gate capacities.
IEEE Trans. Inf. Theory, 2010

Super-duper-activation of the zero-error quantum capacity.
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
Classical and quantum tensor product expanders.
Quantum Inf. Comput., 2009

Exact universality from any entangling gate without inverses.
Quantum Inf. Comput., 2009

Quantum Reverse Shannon Theorem.
CoRR, 2009

Generalised Matching.
Proceedings of the String Processing and Information Retrieval, 2009

Efficient Quantum Tensor Product Expanders and k-Designs.
Proceedings of the Approximation, 2009

2008
A Resource Framework for Quantum Shannon Theory.
IEEE Trans. Inf. Theory, 2008

Quantum expanders from any classical Cayley graph expander.
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

Superpolynomial Speedups Based on Almost Any Quantum Circuit.
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

The quantum Schur and Clebsch-Gordan transforms: I. efficient qudit circuits.
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

2005
Bidirectional coherent classical communication.
Quantum Inf. Comput., 2005

2004
A tight lower bound on the classical communication cost of entanglement dilution.
IEEE Trans. Inf. Theory, 2004

Strings with Maximally Many Distinct Subsequences and Substrings.
Electron. J. Comb., 2004

A family of quantum protocols.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

2003
On the capacities of bipartite Hamiltonians and unitary gates.
IEEE Trans. Inf. Theory, 2003


  Loading...