Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAram W. Harrow
Person information
- affiliation: MIT, Cambridge, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j30]Yichen Huang
, Aram W. Harrow:
Improved Concentration of Laguerre and Jacobi Ensembles. SIAM J. Math. Anal. 56(1): 554-567 (2024)- 2021
- [j29]Elizabeth Crosson, Aram W. Harrow:
Rapid mixing of path integral Monte Carlo for 1D stoquastic Hamiltonians. Quantum 5: 395 (2021) - 2020
- [j28]Alexander M. Dalzell, Aram Wettroth Harrow, Dax Enshan Koh, Rolando L. La Placa:
How many qubits are needed for quantum computational supremacy? Quantum 4: 264 (2020) - [j27]Fernando G. S. L. Brandão, Aram W. Harrow, James R. Lee, Yuval Peres:
Adversarial Hypothesis Testing and a Quantum Stein's Lemma for Restricted Measurements. IEEE Trans. Inf. Theory 66(8): 5037-5054 (2020) - 2019
- [j26]Vojtech Havlícek, Antonio D. Córcoles, Kristan Temme, Aram W. Harrow, Abhinav Kandala, Jerry M. Chow, Jay M. Gambetta:
Supervised learning with quantum-enhanced feature spaces. Nat. 567(7747): 209-212 (2019) - 2018
- [j25]Anurag Anshu, Ankit Garg, Aram W. Harrow, Penghui Yao:
Expected Communication Cost of Distributed Quantum Tasks. IEEE Trans. Inf. Theory 64(11): 7395-7423 (2018) - 2017
- [j24]Aram W. Harrow, Ashley Montanaro:
Quantum computational supremacy. Nat. 549(7671): 203-209 (2017) - [j23]Dave Bacon, Steven T. Flammia, Aram W. Harrow, Jonathan Shi:
Sparse Quantum Codes From Quantum Circuits. IEEE Trans. Inf. Theory 63(4): 2464-2479 (2017) - [j22]Jeongwan Haah, Aram W. Harrow, Zhengfeng Ji, Xiaodi Wu, Nengkun Yu:
Sample-Optimal Tomography of Quantum States. IEEE Trans. Inf. Theory 63(9): 5628-5641 (2017) - 2016
- [j21]Cyril J. Stark, Aram W. Harrow:
Compressibility of Positive Semidefinite Factorizations and Quantum Models. IEEE Trans. Inf. Theory 62(5): 2867-2880 (2016) - [j20]David Sutter, Marco Tomamichel, Aram W. Harrow:
Strengthened Monotonicity of Relative Entropy via Pinched Petz Recovery Map. IEEE Trans. Inf. Theory 62(5): 2907-2913 (2016) - 2014
- [j19]Aram W. Harrow, David J. Rosenbaum:
Uselessness for an Oracle model with internal randomness. Quantum Inf. Comput. 14(7-8): 608-624 (2014) - [j18]Charles H. Bennett, Igor Devetak, Aram W. Harrow, Peter W. Shor, Andreas J. Winter:
The Quantum Reverse Shannon Theorem and Resource Tradeoffs for Simulating Quantum Channels. IEEE Trans. Inf. Theory 60(5): 2926-2959 (2014) - [j17]Aram W. Harrow, Alexandra Kolla, Leonard J. Schulman:
Dimension-Free L2 Maximal Inequality for Spherical Means in the Hypercube. Theory Comput. 10: 55-75 (2014) - 2013
- [j16]Aram W. Harrow, Ashley Montanaro:
Testing Product States, Quantum Merlin-Arthur Games and Tensor Optimization. J. ACM 60(1): 3:1-3:43 (2013) - [j15]Steven T. Flammia, Aram W. Harrow:
Counterexamples to Kalai's conjecture C. Quantum Inf. Comput. 13(1-2): 1-8 (2013) - 2012
- [j14]Aram W. Harrow:
Why now is the right time to study quantum computing. XRDS 18(3): 32-37 (2012) - [j13]Aram W. Harrow, Andreas J. Winter:
How Many Copies are Needed for State Discrimination? IEEE Trans. Inf. Theory 58(1): 1-2 (2012) - 2011
- [j12]Sergey Bravyi, Aram W. Harrow, Avinatan Hassidim:
Quantum Algorithms for Testing Properties of Distributions. IEEE Trans. Inf. Theory 57(6): 3971-3981 (2011) - [j11]Aram W. Harrow, Debbie W. Leung:
A Communication-Efficient Nonlocal Measurement With Application to Communication Complexity and Bipartite Gate Capacities. IEEE Trans. Inf. Theory 57(8): 5504-5508 (2011) - [j10]Toby S. Cubitt, Jianxin Chen, Aram W. Harrow:
Superactivation of the Asymptotic Zero-Error Classical Capacity of a Quantum Channel. IEEE Trans. Inf. Theory 57(12): 8114-8126 (2011) - 2010
- [j9]Aram W. Harrow, Peter W. Shor:
Time reversal and exchange symmetries of unitary gate capacities. IEEE Trans. Inf. Theory 56(1): 462-475 (2010) - 2009
- [j8]Matthew B. Hastings, Aram W. Harrow:
Classical and quantum tensor product expanders. Quantum Inf. Comput. 9(3&4): 336-360 (2009) - [j7]Aram W. Harrow:
Exact universality from any entangling gate without inverses. Quantum Inf. Comput. 9(9&10): 773-777 (2009) - 2008
- [j6]Aram W. Harrow:
Quantum expanders from any classical Cayley graph expander. Quantum Inf. Comput. 8(8): 715-721 (2008) - [j5]Igor Devetak, Aram W. Harrow, Andreas J. Winter:
A Resource Framework for Quantum Shannon Theory. IEEE Trans. Inf. Theory 54(10): 4587-4618 (2008) - 2005
- [j4]Aram W. Harrow, Debbie W. Leung:
Bidirectional coherent classical communication. Quantum Inf. Comput. 5(4): 380-395 (2005) - 2004
- [j3]Abraham Flaxman, Aram W. Harrow, Gregory B. Sorkin:
Strings with Maximally Many Distinct Subsequences and Substrings. Electron. J. Comb. 11(1) (2004) - [j2]Aram W. Harrow, Hoi-Kwong Lo:
A tight lower bound on the classical communication cost of entanglement dilution. IEEE Trans. Inf. Theory 50(2): 319-327 (2004) - 2003
- [j1]Charles H. Bennett, Aram W. Harrow, Debbie W. Leung, John A. Smolin:
On the capacities of bipartite Hamiltonians and unitary gates. IEEE Trans. Inf. Theory 49(8): 1895-1911 (2003)
Conference and Workshop Papers
- 2020
- [c30]Aram W. Harrow, Annie Y. Wei:
Adaptive Quantum Simulated Annealing for Bayesian Inference and Estimating Partition Functions. SODA 2020: 193-212 - [c29]Aram W. Harrow, Saeed Mehraban, Mehdi Soleimanifar:
Classical algorithms, correlation decay, and complex zeros of partition functions of quantum many-body systems. STOC 2020: 378-386 - 2019
- [c28]Matthew Coudron, Aram W. Harrow:
Universality of EPR Pairs in Entanglement-Assisted Communication Complexity, and the Communication Cost of State Conversion. CCC 2019: 20:1-20:25 - [c27]Adam Bene Watts, Aram W. Harrow, Gurtej Kanwar, Anand Natarajan:
Algorithms, Bounds, and Strategies for Entangled XOR Games. ITCS 2019: 10:1-10:18 - 2018
- [c26]Anurag Anshu, Ankit Garg, Aram W. Harrow, Penghui Yao:
Expected Communication Cost of Distributed Quantum Tasks. ISIT 2018: 806-810 - 2017
- [c25]Lior Eldar, Aram W. Harrow:
Local Hamiltonians Whose Ground States Are Hard to Approximate. FOCS 2017: 427-438 - [c24]Aram W. Harrow, Cedric Yen-Yu Lin, Ashley Montanaro:
Sequential measurements, disturbance and property testing. SODA 2017: 1598-1611 - 2016
- [c23]Aram W. Harrow, Anand Natarajan, Xiaodi Wu:
Tight SoS-Degree Bounds for Approximate Nash Equilibria. CCC 2016: 22:1-22:25 - [c22]Elizabeth Crosson, Aram W. Harrow:
Simulated Quaotum Annealing Can Be Exponentially Faster Than Classical Simulated Annealing. FOCS 2016: 714-723 - [c21]David Sutter, Marco Tomamichel, Aram W. Harrow:
Strengthened monotonicity of relative entropy via pinched Petz recovery map. ISIT 2016: 760-764 - [c20]Jeongwan Haah, Aram W. Harrow, Zheng-Feng Ji, Xiaodi Wu, Nengkun Yu:
Sample-optimal tomography of quantum states. STOC 2016: 913-925 - [c19]Anurag Anshu, Ankit Garg, Aram W. Harrow, Penghui Yao:
Lower Bound on Expected Communication Cost of Quantum Huffman Coding. TQC 2016: 3:1-3:18 - 2015
- [c18]Cyril J. Stark, Aram W. Harrow:
Compressibility of positive semidefinite factorizations and quantum models. ISIT 2015: 2777-2781 - [c17]Dave Bacon, Steven T. Flammia, Aram W. Harrow, Jonathan Shi:
Sparse Quantum Codes from Quantum Circuits. STOC 2015: 327-334 - 2014
- [c16]Dorit Aharonov, Aram W. Harrow, Zeph Landau, Daniel Nagaj, Mario Szegedy, Umesh V. Vazirani:
Local Tests of Global Entanglement and a Counterexample to the Generalized Area Law. FOCS 2014: 246-255 - [c15]Fernando G. S. L. Brandão, Aram W. Harrow, James R. Lee, Yuval Peres:
Adversarial hypothesis testing and a quantum stein's lemma for restricted measurements. ITCS 2014: 183-194 - 2013
- [c14]Fernando G. S. L. Brandão, Aram W. Harrow:
Quantum de finetti theorems under local measurements with applications. STOC 2013: 861-870 - [c13]Fernando G. S. L. Brandão, Aram W. Harrow:
Product-state approximations to quantum ground states. STOC 2013: 871-880 - 2012
- [c12]Boaz Barak, Fernando G. S. L. Brandão, Aram W. Harrow, Jonathan A. Kelner, David Steurer, Yuan Zhou:
Hypercontractivity, sum-of-squares proofs, and their applications. STOC 2012: 307-326 - 2011
- [c11]Aram W. Harrow, Ashley Montanaro, Anthony J. Short:
Limitations on Quantum Dimensionality Reduction. ICALP (1) 2011: 86-97 - 2010
- [c10]Aram W. Harrow, Ashley Montanaro:
An Efficient Test for Product States with Applications to Quantum Merlin-Arthur Games. FOCS 2010: 633-642 - [c9]Jianxin Chen, Toby S. Cubitt, Aram W. Harrow, Graeme Smith:
Super-duper-activation of the zero-error quantum capacity. ISIT 2010: 2695-2697 - [c8]Sergey Bravyi, Aram W. Harrow, Avinatan Hassidim:
Quantum Algorithms for Testing Properties of Distributions. STACS 2010: 131-142 - 2009
- [c7]Aram W. Harrow, Richard Andrew Low:
Efficient Quantum Tensor Product Expanders and k-Designs. APPROX-RANDOM 2009: 548-561 - [c6]Raphaël Clifford, Aram W. Harrow, Alexandru Popa, Benjamin Sach:
Generalised Matching. SPIRE 2009: 295-301 - 2008
- [c5]Sean Hallgren, Aram W. Harrow:
Superpolynomial Speedups Based on Almost Any Quantum Circuit. ICALP (1) 2008: 782-795 - [c4]Aram W. Harrow, Debbie W. Leung:
An exponential separation between the entanglement and communication capacities of a bipartite unitary interaction. ITW 2008: 381-385 - 2007
- [c3]Dave Bacon, Isaac L. Chuang, Aram W. Harrow:
The quantum Schur and Clebsch-Gordan transforms: I. efficient qudit circuits. SODA 2007: 1235-1244 - [c2]Andrew M. Childs, Aram W. Harrow, Pawel Wocjan:
Weak Fourier-Schur Sampling, the Hidden Subgroup Problem, and the Quantum Collision Problem. STACS 2007: 598-609 - 2004
- [c1]Igor Devetak, Aram W. Harrow, Andreas J. Winter:
A family of quantum protocols. ISIT 2004: 134
Editorship
- 2014
- [e1]Steven T. Flammia, Aram W. Harrow:
9th Conference on the Theory of Quantum Computation, Communication and Cryptography, TQC 2014, May 21-23, 2014, Singapore. LIPIcs 27, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2014, ISBN 978-3-939897-73-6 [contents]
Reference Works
- 2016
- [r1]Aram W. Harrow:
Quantum Algorithms for Systems of Linear Equations. Encyclopedia of Algorithms 2016: 1680-1683
Informal and Other Publications
- 2020
- [i22]John Napp, Rolando L. La Placa, Alexander M. Dalzell, Fernando G. S. L. Brandão, Aram W. Harrow:
Efficient classical simulation of random shallow 2D quantum circuits. CoRR abs/2001.00021 (2020) - [i21]Anurag Anshu, Aram W. Harrow, Mehdi Soleimanifar:
From communication complexity to an entanglement spread area law in the ground state of gapped local Hamiltonians. CoRR abs/2004.15009 (2020) - 2019
- [i20]Aram W. Harrow, Saeed Mehraban, Mehdi Soleimanifar:
Classical algorithms, correlation decay, and complex zeros of partition functions of quantum many-body systems. CoRR abs/1910.09071 (2019) - 2018
- [i19]Adam Bene Watts, Aram W. Harrow, Gurtej Kanwar, Anand Natarajan:
Algorithms, Bounds, and Strategies for Entangled XOR Games. CoRR abs/1801.00821 (2018) - [i18]Elizabeth Crosson, Aram W. Harrow:
Rapid mixing of path integral Monte Carlo for 1D stoquastic Hamiltonians. CoRR abs/1812.02144 (2018) - 2016
- [i17]Elizabeth Crosson, Aram W. Harrow:
Simulated Quantum Annealing Can Be Exponentially Faster than Classical Simulated Annealing. CoRR abs/1601.03030 (2016) - [i16]Aram W. Harrow, Anand Natarajan, Xiaodi Wu:
Limitations of semidefinite programs for separable states and entangled games. CoRR abs/1612.09306 (2016) - 2015
- [i15]Aram W. Harrow:
Review of Quantum Algorithms for Systems of Linear Equations. CoRR abs/1501.00008 (2015) - [i14]Aram W. Harrow:
Why now is the right time to study quantum computing. CoRR abs/1501.00011 (2015) - [i13]Aram W. Harrow, Anand Natarajan, Xiaodi Wu:
An improved semidefinite programming hierarchy for testing entanglement. CoRR abs/1506.08834 (2015) - [i12]Aram W. Harrow, Ashley Montanaro:
Extremal eigenvalues of local Hamiltonians. CoRR abs/1507.00739 (2015) - [i11]Jeongwan Haah, Aram W. Harrow, Zhengfeng Ji, Xiaodi Wu, Nengkun Yu:
Sample-optimal tomography of quantum states. CoRR abs/1508.01797 (2015) - [i10]Fernando G. S. L. Brandão, Aram W. Harrow:
Estimating operator norms using covering nets. CoRR abs/1509.05065 (2015) - 2014
- [i9]Dave Bacon, Steven T. Flammia, Aram W. Harrow, Jonathan Shi:
Sparse Quantum Codes from Quantum Circuits. CoRR abs/1411.3334 (2014) - [i8]Cyril J. Stark, Aram W. Harrow:
Compressibility of positive semidefinite factorizations and quantum models. CoRR abs/1412.7437 (2014) - 2013
- [i7]Fernando G. S. L. Brandão, Aram W. Harrow, James R. Lee, Yuval Peres:
Adversarial hypothesis testing and a quantum Stein's Lemma for restricted measurements. CoRR abs/1308.6702 (2013) - 2012
- [i6]Boaz Barak, Fernando G. S. L. Brandão, Aram W. Harrow, Jonathan A. Kelner, David Steurer, Yuan Zhou:
Hypercontractivity, Sum-of-Squares Proofs, and their Applications. CoRR abs/1205.4484 (2012) - [i5]Fernando G. S. L. Brandão, Aram W. Harrow:
Quantum de Finetti Theorems under Local Measurements with Applications. CoRR abs/1210.6367 (2012) - 2011
- [i4]David J. Rosenbaum, Aram W. Harrow:
Uselessness for an Oracle Model with Internal Randomness. CoRR abs/1111.1462 (2011) - 2009
- [i3]Toby S. Cubitt, Jianxin Chen, Aram W. Harrow:
Superactivation of the Asymptotic Zero-Error Classical Capacity of a Quantum Channel. CoRR abs/0906.2547 (2009) - [i2]Sergey Bravyi, Aram W. Harrow, Avinatan Hassidim:
Quantum algorithms for testing properties of distributions. CoRR abs/0907.3920 (2009) - [i1]Charles H. Bennett, Igor Devetak, Aram W. Harrow, Peter W. Shor, Andreas J. Winter:
Quantum Reverse Shannon Theorem. CoRR abs/0912.5537 (2009)
Coauthor Index
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-03-02 00:02 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
