Aram W. Harrow mostly deals with Quantum algorithm, Quantum mechanics, Quantum computer, Topology and Quantum information. Aram W. Harrow has researched Quantum algorithm in several fields, including Operator, Quantum capacity and Linear algebra. His research in Quantum computer tackles topics such as Algorithm which are related to areas like Support vector machine, Feature vector and Kernel method.
His work carried out in the field of Quantum information brings together such families of science as Theoretical computer science, Quantum operation and Computer engineering. His Quantum operation research incorporates elements of Quantum channel and Quantum process. Aram W. Harrow interconnects Polynomial and Combinatorics in the investigation of issues within Quantum gate.
Aram W. Harrow mainly investigates Discrete mathematics, Quantum, Quantum algorithm, Quantum information and Quantum entanglement. Aram W. Harrow combines subjects such as Separable state, Combinatorics, Qubit, Quantum information science and Upper and lower bounds with his study of Discrete mathematics. Aram W. Harrow focuses mostly in the field of Quantum, narrowing it down to matters related to Statistical physics and, in some cases, Quantum annealing.
His Quantum algorithm study combines topics in areas such as Quantum computer and Quantum capacity, Quantum operation. His work on Quantum network as part of general Quantum information study is frequently linked to Information theory, therefore connecting diverse disciplines of science. His Quantum entanglement research is multidisciplinary, incorporating elements of Theoretical physics, Unitary state, Communication complexity, Ground state and Quantum state.
The scientist’s investigation covers issues in Quantum, Qubit, Quantum computer, Algorithm and Discrete mathematics. His Quantum research includes elements of Phase transition and Counting problem. His studies deal with areas such as Computation, Quantum algorithm, Polynomial and Computational problem as well as Quantum computer.
His biological study spans a wide range of topics, including Speedup and Cluster analysis. The study incorporates disciplines such as Quantum state, Partition function and Observable in addition to Algorithm. His Discrete mathematics research is multidisciplinary, incorporating perspectives in Norm, Quantum information science, Quantum capacity and Separable state.
Aram W. Harrow spends much of his time researching Quantum, Qubit, Quantum algorithm, Quantum computer and Discrete mathematics. The Quantum study combines topics in areas such as Algorithm, Parameterized complexity and Hilbert space. The concepts of his Qubit study are interwoven with issues in Dimension, Dimension and Polynomial hierarchy.
His study looks at the intersection of Quantum algorithm and topics like Quantum information with Chemical physics, Speedup, Computer engineering and Field. His Quantum computer research integrates issues from Computation and Computational problem. As part of the same scientific family, Aram W. Harrow usually focuses on Discrete mathematics, concentrating on Quantum capacity and intersecting with Property testing, Quantum phase estimation algorithm, Quantum t-design and Combinatorics.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
Quantum algorithm for linear systems of equations.
Aram W. Harrow;Avinatan Hassidim;Seth Lloyd.
Physical Review Letters (2009)
Supervised learning with quantum-enhanced feature spaces.
Vojtěch Havlíček;Vojtěch Havlíček;Antonio D. Córcoles;Kristan Temme;Aram W. Harrow.
Nature (2019)
Quantum computational supremacy
Aram W. Harrow;Ashley Montanaro.
Nature (2017)
Supervised learning with quantum enhanced feature spaces
Vojtech Havlicek;Antonio D. Córcoles;Kristan Temme;Aram W. Harrow.
arXiv: Quantum Physics (2018)
Quantum Supremacy through the Quantum Approximate Optimization Algorithm
Edward Farhi;Aram W Harrow.
arXiv: Quantum Physics (2016)
Practical scheme for quantum computation with any two-qubit entangling gate.
Michael J. Bremner;Christopher M. Dawson;Jennifer L. Dodd;Alexei Gilchrist.
Physical Review Letters (2002)
Random Quantum Circuits are Approximate 2-designs
Aram W. Harrow;Richard A. Low.
Communications in Mathematical Physics (2009)
Local Random Quantum Circuits are Approximate Polynomial-Designs
Fernando G. S. L. Brandão;Aram W. Harrow;Michał Horodecki.
Communications in Mathematical Physics (2016)
Arbitrarily accurate composite pulse sequences
Kenneth R. Brown;Aram W. Harrow;Issac L. Chuang.
Physical Review A (2005)
Quantum Reverse Shannon Theorem
Charles H. Bennett;Igor Devetak;Aram W. Harrow;Peter W. Shor.
arXiv: Quantum Physics (2009)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:
Autonomous University of Barcelona
University of Waterloo
IBM (United States)
MIT
University of Nottingham
University of Copenhagen
Harvard University
IBM (United States)
National University of Singapore
MIT
Microsoft (United States)
Simon Fraser University
Texas A&M University
Chongqing University
Stony Brook University
John Innes Centre
University of British Columbia
Cornell University
Chinese Academy of Sciences
Stanford University
University of Southern California
Drugs for Neglected Diseases Initiative
Johns Hopkins University
Harvard University
Harvard University
The University of Texas Medical Branch at Galveston