Dorit Aharonov

Dorit Aharonov
Dorit Aharonov
Born 1970
Residence Jerusalem, Israel
Fields quantum computing
Institutions Hebrew University
Alma mater Hebrew University (B.Sc., Ph.D.)
Weizmann Institute of Science (M.Sc.)
Princeton University (post-doctorate)
University of California Berkeley (post-doctorate)
Notable awards Krill Prize for Excellence in Scientific Research

Dorit Aharonov (Hebrew: דורית אהרונוב‎; born 1970) is an Israeli computer scientist specializing in quantum computing.

Aharonov graduated from Hebrew University of Jerusalem with a BSc in Mathematics and Physics in 1994. She then graduated from Weizmann Institute of Science with an MSc in Physics. She received her doctorate for Computer Science in 1999 from the Hebrew University of Jerusalem, and her thesis was entitled "Noisy Quantum Computation." She also did her post-doctorate in the mathematics department of Princeton University, and in the computer science department of University of California Berkeley.[1]

In 2005, Aharonov was profiled by the journal Nature as one of four "young theorists... who are making waves in their chosen fields.", and in the following year, she then received the Krill Prize for Excellence in Scientific Research.

Dorit Aharonov is the niece of physicist Yakir Aharonov.

Research

Aharonov's research is mainly about quantum information processes, which includes:[1][2]

  • quantum algorithms
  • quantum cryptography and computational complexity
  • quantum error corrections and fault tolerance
  • connections between quantum computation and quantum Markov chains and lattices
  • quantum Hamiltonian complexity and its connections to condensed matter physics
  • transition from quantum to classical physics
  • understanding entanglement by studying quantum complexity

External links

References



Wikimedia Foundation. 2010.

Игры ⚽ Нужно сделать НИР?

Look at other dictionaries:

  • Aharonov — is a surname, and may refer to:* the physicist Yakir Aharonov, best known as co discoverer of the Aharonov Bohm effect, or to * his niece, the computer scientist Dorit Aharonov …   Wikipedia

  • Aharonov — bezeichnet: Yakir Aharonov (* 1932) israelischer Physiker den u. a. nach ihm benannten Aharonov Bohm Effekt Dorit Aharonov [* 1970) israelische Informatikerin Diese Seite ist eine Begriffsklärung zur Un …   Deutsch Wikipedia

  • Aharonov — puede referirse a: Yakir Aharonov Efecto Aharonov Bohm Dorit Aharonov Esta página de desambiguación cataloga artículos relacionados con el mismo título. Si llegaste aquí a través de …   Wikipedia Español

  • Perimeter Institute for Theoretical Physics — Perimeter Institute of Theoretical Physics Abbreviation PI Formation 1999 Type Research institute …   Wikipedia

  • Quantum error correction — is used in quantum computing to protect quantum information from errors due to decoherence and other quantum noise. Quantum error correction is essential if one is to achieve fault tolerant quantum computation that can deal not only with noise on …   Wikipedia

  • Quantenfehlerkorrektur — wird in der Quanteninformatik benutzt um Quanteninformation von Fehlern infolge von Dekohärenz und Quantenrauschen zu schützen. Quantenfehlerkorrekturen sind grundlegend beim Ausführen von fehlertoleranten Quantenberechnungen, welche nicht nur… …   Deutsch Wikipedia

  • Simulador cuántico universal — Un simulador cuántico universal es un tipo de computador cuántico que fue propuesto por Richard Feynman en 1982, extendiendo las ideas de la computación analógica a los sistemas descritos por la mecánica cuántica.[1] Feynman mostró que una… …   Wikipedia Español

  • QMA — В теории сложности, QMA  это квантовый аналог NP в классической теории сложности и аналог MA в вероятностной. Он связан с BQP также, как NP связан с P, или MA связан с BPP. Неформально  это множество языков для принадлежности к которым… …   Википедия

  • Rokdim Im Kokhavim — Format Talent Show Developed by BBC Presented by Avi Kushnir Hilla Nachshon …   Wikipedia

  • Lattice problem — In computer science, lattice problems are a class of optimization problems on lattices. The conjectured intractability of such problems is central to construction of secure lattice based cryptosystems. For applications in such cryptosystems,… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”