Aram Harrow
#41,015
Most Influential Person Now
Quantum physicist
Aram Harrow's AcademicInfluence.com Rankings
Download Badge
Physics
Aram Harrow's Degrees
- PhD Physics University of Oxford
Why Is Aram Harrow Influential?
(Suggest an Edit or Addition)According to Wikipedia, Aram Wettroth Harrow is a professor of physics in the Massachusetts Institute of Technology's Center for Theoretical Physics. Harrow works in quantum information science and quantum computing. Together with Avinatan Hassidim and Seth Lloyd, he designed a quantum algorithm for linear systems of equations, which in some cases exhibits an exponential advantage over the best classical algorithms. The algorithm has wide application in quantum machine learning.
Aram Harrow's Published Works
Number of citations in a given year to any of this author's works
Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author
Published Works
- Quantum algorithm for linear systems of equations. (2008) (1736)
- Supervised learning with quantum-enhanced feature spaces (2018) (923)
- Quantum computational supremacy (2017) (569)
- Quantum Supremacy through the Quantum Approximate Optimization Algorithm (2016) (384)
- Random Quantum Circuits are Approximate 2-designs (2008) (250)
- A Resource Framework for Quantum Shannon Theory (2005) (191)
- Sample-Optimal Tomography of Quantum States (2015) (191)
- Hypercontractivity, sum-of-squares proofs, and their applications (2012) (190)
- Practical scheme for quantum computation with any two-qubit entangling gate. (2002) (182)
- The Quantum Reverse Shannon Theorem and Resource Tradeoffs for Simulating Quantum Channels (2014) (175)
- Efficient distributed quantum computing (2012) (167)
- Superdense coding of quantum states. (2003) (144)
- Quantum algorithm for solving linear systems of equations (2010) (143)
- Quantum dynamics as a physical resource (2002) (129)
- A family of quantum protocols (2003) (123)
- On the capacities of bipartite Hamiltonians and unitary gates (2002) (117)
- Efficient quantum circuits for Schur and Clebsch-Gordan transforms. (2004) (114)
- Quantum de Finetti Theorems Under Local Measurements with Applications (2012) (111)
- Robustness of quantum gates in the presence of noise (2003) (110)
- Testing Product States, Quantum Merlin-Arthur Games and Tensor Optimization (2010) (110)
- Efficient discrete approximations of quantum gates (2001) (109)
- The Church of the Symmetric Subspace (2013) (107)
- Applications of coherent classical communication and the schur transform to quantum information theory (2005) (103)
- Simulating Large Quantum Circuits on a Small Quantum Computer. (2019) (97)
- Approximate Unitary t-Designs by Short Random Quantum Circuits Using Nearest-Neighbor and Long-Range Gates (2018) (97)
- Low-Depth Gradient Measurements Can Improve Convergence in Variational Hybrid Quantum-Classical Algorithms. (2019) (94)
- Superactivation of the Asymptotic Zero-Error Classical Capacity of a Quantum Channel (2009) (92)
- Simulated Quantum Annealing Can Be Exponentially Faster Than Classical Simulated Annealing (2016) (88)
- Adaptive versus nonadaptive strategies for quantum channel discrimination (2009) (82)
- Quantum Conditional Mutual Information, Reconstructed States, and State Redistribution. (2014) (75)
- Coherent communication of classical messages. (2003) (74)
- Nonzero Kronecker Coefficients and What They Tell us about Spectra (2007) (72)
- How many qubits are needed for quantum computational supremacy? (2018) (71)
- Product-state approximations to quantum ground states (2013) (69)
- Strengthened monotonicity of relative entropy via pinched Petz recovery map (2015) (68)
- Efficient classical simulation of random shallow 2D quantum circuits (2019) (68)
- Classical and quantum tensor product expanders (2008) (65)
- Local Random Quantum Circuits are Approximate Polynomial-Designs (2016) (63)
- Quantum expanders from any classical Cayley graph expander (2007) (63)
- Quantum Reverse Shannon Theorem (2009) (58)
- Local Hamiltonians Whose Ground States Are Hard to Approximate (2015) (54)
- Quantum algorithms for jet clustering (2019) (50)
- Quantum computing at the frontiers of biological sciences (2019) (47)
- Counterexamples to Additivity of Minimum Output p-Rényi Entropy for p Close to 0 (2007) (46)
- An Efficient Test for Product States with Applications to Quantum Merlin-Arthur Games (2010) (41)
- Quantum Algorithms for Testing Properties of Distributions (2009) (40)
- Efficient Quantum Pseudorandomness. (2016) (39)
- Efficient Quantum Tensor Product Expanders and k-Designs (2008) (39)
- Small quantum computers and large classical data sets (2020) (34)
- Strings with Maximally Many Distinct Subsequences and Substrings (2004) (33)
- A tight lower bound on the classical communication cost of entanglement dilution (2002) (33)
- Sparse Quantum Codes From Quantum Circuits (2014) (32)
- The Quantum Schur Transform: I. Efficient Qudit Circuits (2005) (31)
- An Improved Semidefinite Programming Hierarchy for Testing Entanglement (2015) (29)
- On Nonzero Kronecker Coefficients and their Consequences for Spectra (2005) (29)
- Separation of Out-Of-Time-Ordered Correlation and Entanglement (2019) (28)
- Local Tests of Global Entanglement and a Counterexample to the Generalized Area Law (2014) (28)
- The quantum Schur and Clebsch-Gordan transforms: I. efficient qudit circuits (2007) (27)
- Classical algorithms, correlation decay, and complex zeros of partition functions of Quantum many-body systems (2019) (27)
- Product-State Approximations to Quantum States (2016) (26)
- Limitations on Quantum Dimensionality Reduction (2010) (26)
- Weak Fourier-Schur Sampling, the Hidden Subgroup Problem, and the Quantum Collision Problem (2006) (26)
- Sequential measurements, disturbance and property testing (2016) (26)
- Adaptive Quantum Simulated Annealing for Bayesian Inference and Estimating Partition Functions (2019) (26)
- Universal quantum data compression via nondestructive tomography (2004) (24)
- How Many Copies are Needed for State Discrimination? (2006) (23)
- Adversarial Hypothesis Testing and a Quantum Stein’s Lemma for Restricted Measurements (2013) (22)
- Rapid mixing of path integral Monte Carlo for 1D stoquastic Hamiltonians (2018) (21)
- Entanglement spread and clean resource inequalities (2009) (20)
- Random Tensor Theory: Extending Random Matrix Theory to Mixtures of Random Product States (2009) (20)
- Erratum: Arbitrarily accurate composite pulse sequences [Phys. Rev. A 70, 052318 (2004)] (2005) (19)
- Limitations of Semidefinite Programs for Separable States and Entangled Games (2016) (17)
- The Mathematics of Entanglement (2016) (17)
- Generalised Matching (2009) (17)
- Universal Refocusing of Systematic Quantum Noise (2016) (17)
- Superpolynomial Speedups Based on Almost Any Quantum Circuit (2008) (16)
- Arbitrarily accurate composite pulse sequences (4 pages) (2004) (15)
- Compressibility of Positive Semidefinite Factorizations and Quantum Models (2014) (14)
- Bidirectional coherent classical communication (2004) (13)
- Time Reversal and Exchange Symmetries of Unitary Gate Capacities (2005) (13)
- Uselessness for an Oracle model with internal randomness (2011) (12)
- Dimension-Free L2 Maximal Inequality for Spherical Means in the Hypercube (2012) (12)
- A Communication-Efficient Nonlocal Measurement With Application to Communication Complexity and Bipartite Gate Capacities (2008) (12)
- Extremal eigenvalues of local Hamiltonians (2015) (12)
- Why now is the right time to study quantum computing (2012) (12)
- Estimating operator norms using covering nets (2015) (11)
- An efficient test for product states (2010) (11)
- Exact universality from any entangling gate without inverses (2008) (10)
- Maximal entanglement velocity implies dual unitarity (2022) (10)
- Arbitrarily accurate composite pulses (2004) (9)
- Algorithms, Bounds, and Strategies for Entangled XOR Games (2018) (8)
- Using Spectral Graph Theory to Map Qubits onto Connectivity-limited Devices (2019) (8)
- Entanglement can completely defeat quantum noise. (2011) (8)
- From communication complexity to an entanglement spread area law in the ground state of gapped local Hamiltonians (2020) (7)
- Quantum bit commitment with misaligned reference frames (2006) (6)
- Instability of localization in translation-invariant systems (2019) (6)
- Quantum Algorithms for Systems of Linear Equations (2014) (5)
- Coherent Classical Communication (2003) (5)
- Tight SoS-Degree Bounds for Approximate Nash Equilibria (2016) (4)
- A tight lower bound on the classical communication cost of entanglement dilution (2003) (4)
- Quantum de Finetti Theorems Under Local Measurements with Applications (2017) (4)
- Quantum blackjack: Advantages offered by quantum strategies in communication-limited games (2020) (4)
- Lower Bound on Expected Communication Cost of Quantum Huffman Coding (2016) (4)
- Universality of EPR pairs in entanglement-assisted communication complexity, and the communication cost of state conversion (2019) (3)
- An exponential separation between the entanglement and communication capacities of a bipartite unitary interaction (2008) (3)
- Quantum bit commitment with misaligned reference frames (5 pages) (2006) (3)
- Review of Quantum Algorithms for Systems of Linear Equations (2015) (3)
- Super-duper-activation of the zero-error quantum capacity (2010) (3)
- Local Hamiltonians with No Low-energy Trivial States (2015) (3)
- Entanglement spread area law in gapped ground states (2022) (2)
- Counterexamples to Kalai's conjecture C (2012) (2)
- Random and free observables saturate the Tsirelson bound for CHSH inequality (2015) (2)
- Nonlinear Bell inequality for macroscopic measurements (2019) (2)
- Expected Communication Cost of Distributed Quantum Tasks (2016) (1)
- Strings with maximally manydistin t subsequen es and substringsAbraham (2004) (1)
- J ul 2 00 2 Efficient Discrete Approximations of Quantum Gates (2002) (1)
- Proc. 51st Annual Symp. Foundations of Computer Science (2010) (1)
- The cryptographic power of misaligned reference frames (2005) (1)
- Expected Communication Cost of Distributed Quantum Tasks (2018) (1)
- Strings with Maximum Numbers of Distinct Subsequences and Substrings (2003) (0)
- Limitations of Sum of Squares for 2-to-4 norm , Separability , and Entangled Games (2016) (0)
- J an 2 01 0 An efficient test for product states (2010) (0)
- Sunday Tuesday (continued) Abstracts (in Alphabetic Order by Speaker Surname) (2015) (0)
- C C ] 1 6 N ov 2 01 4 Hypercontractivity , Sum-of-Squares Proofs , and their Applications (2014) (0)
- Tight Bounds on Discrete Approximations of Quantum Gates (2001) (0)
- Proceedings of ICALP'11 (2011) (0)
- Quantum entropy thermalization (2023) (0)
- Supervised learning with quantum-enhanced feature spaces (2019) (0)
- Random Tensor Theory: Extending Random Matrix Theory to Mixtures of Random Product States (2012) (0)
- 8.06 Spring 2015 Lecture Notes 5. Quantum Computing (2016) (0)
- A Counterexample to Kalai's Conjecture C (2021) (0)
- N ov 2 01 2 Efficient Distributed Quantum Computing (2012) (0)
- A Resource Framework for (2008) (0)
- Improved concentration of Laguerre and Jacobi ensembles (2022) (0)
- O ct 2 01 3 Entanglement spread and clean resource inequalities (2018) (0)
- Saturation of the Tsirelson bound for the Clauser-Horne-Shimony-Holt inequality with random and free observables (2017) (0)
- Quantum computing at the frontiers of biological sciences (2021) (0)
- Time-dependent approximation methods (2016) (0)
- Quantum Blackjack or Can MIT Bring Down the House Again? (2019) (0)
- Rolf Landauer and Charles H. Bennett Award talk on the mathematics of quantum information, and the development of new algorithmic primitives for quantum computers (2018) (0)
- 8 . 06 Spring 2016 Lecture Notes 3 . Entanglement , density matrices and decoherence (2016) (0)
- ec 2 00 5 A family of quantum protocols (2009) (0)
- An Improved Semidefinite Programming Hierarchy for Testing Entanglement (2017) (0)
- C C ] 21 M ay 2 01 2 Hypercontractivity , Sum-of-Squares Proofs , and their Applications (2018) (0)
- On the Capacities of Bipartite Hamiltonians and (2003) (0)
- QuEST: Robust Quantum Gadgets (2013) (0)
- Geometry and Optimization in Quantum Information (2022) (0)
- 3 : 2 Lower Bound on Expected Communication Cost of Quantum Huffman Coding 1 (2016) (0)
- Approximate methods for time-independent Hamiltonians Aram Harrow (2016) (0)
- Product-State Approximations to Quantum States (2016) (0)
- Thermalization without eigenstate thermalization (2022) (0)
- Lecture notes for COMS 21102: Software engineering Fall 2006 semester Week 3: Probability (2007) (0)
- Tensor norms, separable states and semi-definite relaxations (2012) (0)
- Ja n 20 03 How robust is a quantum gate in the presence of noise ? (2022) (0)
- Applications of the Schur Basis to Quantum Algorithms (2011) (0)
- Limitations of Semidefinite Programs for Separable States and Entangled Games (2019) (0)
- Universal quantum data compression via nondestructive tomography (4 pages) (2006) (0)
- Front Matter, Table of Contents, Preface, Conference Organization (2014) (0)
This paper list is powered by the following services:
Other Resources About Aram Harrow
What Schools Are Affiliated With Aram Harrow?
Aram Harrow is affiliated with the following schools:
