Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Exact matches
- Aram W. Harrow
aka: Aram Wettroth Harrow
MIT, Cambridge, USA
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 84 matches
- 2024
- Yichen Huang, Aram W. Harrow:
Improved Concentration of Laguerre and Jacobi Ensembles. SIAM J. Math. Anal. 56(1): 554-567 (2024) - 2021
- Elizabeth Crosson, Aram W. Harrow:
Rapid mixing of path integral Monte Carlo for 1D stoquastic Hamiltonians. Quantum 5: 395 (2021) - 2020
- 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) - 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) - Aram W. Harrow, Annie Y. Wei:
Adaptive Quantum Simulated Annealing for Bayesian Inference and Estimating Partition Functions. SODA 2020: 193-212 - 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 - 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) - 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
- 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) - 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 - Adam Bene Watts, Aram W. Harrow, Gurtej Kanwar, Anand Natarajan:
Algorithms, Bounds, and Strategies for Entangled XOR Games. ITCS 2019: 10:1-10:18 - 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
- 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) - Anurag Anshu, Ankit Garg, Aram W. Harrow, Penghui Yao:
Expected Communication Cost of Distributed Quantum Tasks. ISIT 2018: 806-810 - Adam Bene Watts, Aram W. Harrow, Gurtej Kanwar, Anand Natarajan:
Algorithms, Bounds, and Strategies for Entangled XOR Games. CoRR abs/1801.00821 (2018) - Elizabeth Crosson, Aram W. Harrow:
Rapid mixing of path integral Monte Carlo for 1D stoquastic Hamiltonians. CoRR abs/1812.02144 (2018) - 2017
- Aram W. Harrow, Ashley Montanaro:
Quantum computational supremacy. Nat. 549(7671): 203-209 (2017) - 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) - 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) - Lior Eldar, Aram W. Harrow:
Local Hamiltonians Whose Ground States Are Hard to Approximate. FOCS 2017: 427-438 - Aram W. Harrow, Cedric Yen-Yu Lin, Ashley Montanaro:
Sequential measurements, disturbance and property testing. SODA 2017: 1598-1611 - 2016
- Cyril J. Stark, Aram W. Harrow:
Compressibility of Positive Semidefinite Factorizations and Quantum Models. IEEE Trans. Inf. Theory 62(5): 2867-2880 (2016) - 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) - Aram W. Harrow, Anand Natarajan, Xiaodi Wu:
Tight SoS-Degree Bounds for Approximate Nash Equilibria. CCC 2016: 22:1-22:25 - Elizabeth Crosson, Aram W. Harrow:
Simulated Quaotum Annealing Can Be Exponentially Faster Than Classical Simulated Annealing. FOCS 2016: 714-723 - David Sutter, Marco Tomamichel, Aram W. Harrow:
Strengthened monotonicity of relative entropy via pinched Petz recovery map. ISIT 2016: 760-764 - Jeongwan Haah, Aram W. Harrow, Zheng-Feng Ji, Xiaodi Wu, Nengkun Yu:
Sample-optimal tomography of quantum states. STOC 2016: 913-925 - 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 - Aram W. Harrow:
Quantum Algorithms for Systems of Linear Equations. Encyclopedia of Algorithms 2016: 1680-1683 - Elizabeth Crosson, Aram W. Harrow:
Simulated Quantum Annealing Can Be Exponentially Faster than Classical Simulated Annealing. CoRR abs/1601.03030 (2016)
skipping 54 more matches
loading more results
failed to load more results, please try again later
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.
retrieved on 2024-09-11 15:41 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint