Daniel Lidar

Last updated

Daniel Lidar
Born
Daniel Amihud Lidar

1968
Jerusalem
Alma mater Hebrew University of Jerusalem
Scientific career
Fields Electrical Engineering and Chemistry and Physics
Institutions UC Berkeley
University of Toronto
University of Southern California
Doctoral advisor Robert Benny Gerber
Ofer Biham

Daniel Amihud Lidar [1] (born 1968) is the holder of the Viterbi Professorship of Engineering at the University of Southern California, where he is a professor of electrical engineering, chemistry, physics & astronomy. He is the director and co-founder of the USC Center for Quantum Information Science & Technology (CQIST), the director of the USC-IBM Quantum Innovation Center, [2] as well as scientific director of the USC-Lockheed Martin Quantum Computing Center, notable for his research on control of quantum systems and quantum information processing.

Contents

Education

He is a class of 1986 graduate of the Armand Hammer United World College of the American West. He obtained his PhD from the Hebrew University of Jerusalem in 1997 under Robert Benny Gerber [3] and Ofer Biham, with a thesis entitled Structural Characterization of Disordered Systems.

Career

In 1997–2000, he was a postdoc at UC Berkeley, having been awarded Rothschild Foundation [4] and Fulbright Program fellowships (the latter of which he declined)[ citation needed ]; in 2000–2005, he was an assistant professor and then later an associate professor of chemistry at the University of Toronto, with cross-appointments in physics and mathematics. He moved to the University of Southern California in 2005, where he is a professor of electrical engineering, chemistry, and physics.

Honors

He was a 2017 Guggenheim Fellowship recipient, [5] a 2007 Fellow of the American Physical Society, [6] a 2012 Fellow of the American Association for the Advancement of Science, and 2015 Fellow of the IEEE. He is listed as one of the top 20 authors of the decade 2000–2009 in Quantum Computing by Thomson Reuters' Sciencewatch. [7] In 2009 he was elected an Outstanding Referee [8] of the American Physical Society. His early career awards include a Sloan Foundation Fellowship, the Young Explorer Award given by the Canadian Institute for Advanced Research for the top 20 researchers in Canada under age 40, and the John Charles Polanyi Prize in Chemistry awarded by the Ontario Council of Graduate Studies. [9]

Research

He has made numerous contributions to quantum computing and quantum control, and is the coeditor and coauthor of a book [10] on quantum error correction. His current work focuses on adiabatic quantum computing and quantum annealing, areas where he has made widely cited contributions to studying the capabilities of the D-Wave Systems processors. [11] His past interests include scattering theory and fractals. Lidar's research in quantum information processing has focused primarily on methods for overcoming decoherence. He wrote some of the founding papers on decoherence-free subspaces, most notably his widely cited paper "Decoherence-free subspaces for quantum computation", [12] and their generalization, noiseless subsystems. These contributions were noted in his APS Fellow citation. [13] He has also made major contributions to dynamical decoupling, in particular the invention of the concatenated dynamical decoupling (CDD) method. [14] He has made a proposal to protect adiabatic quantum computation against decoherence, using dynamical decoupling, one of the only proposals to date dealing with error correction for the adiabatic model. [15] Lidar has also worked on quantum algorithms, having written some of the pioneering papers in the subject on simulation of classical statistical mechanics [16] and quantum chemistry. [17] In his PhD work he made a widely cited observation on the limited scaling range of empirically observed fractals, [18] which led to an exchange with Benoit Mandelbrot. [19]

Patents

He holds several U.S. patents in the areas of quantum computing and optimization. [20] [21] [22] [23] [24] [25]

Publications

Related Research Articles

<span class="mw-page-title-main">Quantum computing</span> Technology that uses quantum mechanics

A quantum computer is a computer that exploits quantum mechanical phenomena. On small scales, physical matter exhibits properties of both particles and waves, and quantum computing leverages this behavior using specialized hardware. Classical physics cannot explain the operation of these quantum devices, and a scalable quantum computer could perform some calculations exponentially faster than any modern "classical" computer. Theoretically a large-scale quantum computer could break widely used encryption schemes and aid physicists in performing physical simulations; however, the current state of the art is largely experimental and impractical, with several obstacles to useful applications.

Quantum Darwinism is a theory meant to explain the emergence of the classical world from the quantum world as due to a process of Darwinian natural selection induced by the environment interacting with the quantum system; where the many possible quantum states are selected against in favor of a stable pointer state. It was proposed in 2003 by Wojciech Zurek and a group of collaborators including Ollivier, Poulin, Paz and Blume-Kohout. The development of the theory is due to the integration of a number of Zurek's research topics pursued over the course of 25 years, including pointer states, einselection and decoherence.

<span class="mw-page-title-main">Seth Lloyd</span> American mechanical engineer and physicist

Seth Lloyd is a professor of mechanical engineering and physics at the Massachusetts Institute of Technology.

<span class="mw-page-title-main">Topological quantum computer</span> Hypothetical fault-tolerant quantum computer based on topological condensed matter

A topological quantum computer is a theoretical type of quantum computer proposed by Russian-American physicist Alexei Kitaev in 1997. It utilizes quasiparticles, known as anyons, in two-dimensional systems. These anyons' world lines intertwine to form braids in a three-dimensional spacetime. These braids act as the logic gates of the computer. The primary advantage of using quantum braids over trapped quantum particles is enhanced stability. While small, cumulative perturbations can cause quantum states to decohere and introduce errors in traditional quantum computations, such perturbations do not alter the topological properties of the braids. This stability is akin to the difference between cutting and reattaching a string to form a different braid versus a ball colliding with a wall.

<span class="mw-page-title-main">Nuclear magnetic resonance quantum computer</span> Proposed spin-based quantum computer implementation

Nuclear magnetic resonance quantum computing (NMRQC) is one of the several proposed approaches for constructing a quantum computer, that uses the spin states of nuclei within molecules as qubits. The quantum states are probed through the nuclear magnetic resonances, allowing the system to be implemented as a variation of nuclear magnetic resonance spectroscopy. NMR differs from other implementations of quantum computers in that it uses an ensemble of systems, in this case molecules, rather than a single pure state.

Quantum annealing (QA) is an optimization process for finding the global minimum of a given objective function over a given set of candidate solutions, by a process using quantum fluctuations. Quantum annealing is used mainly for problems where the search space is discrete with many local minima; such as finding the ground state of a spin glass or solving the traveling salesman problem. The term "quantum annealing" was first proposed in 1988 by B. Apolloni, N. Cesa Bianchi and D. De Falco as a quantum-inspired classical algorithm. It was formulated in its present form by T. Kadowaki and H. Nishimori in 1998, though an imaginary-time variant without quantum coherence had been discussed by A. B. Finnila, M. A. Gomez, C. Sebenik and J. D. Doll in 1994.

Time-bin encoding is a technique used in quantum information science to encode a qubit of information on a photon. Quantum information science makes use of qubits as a basic resource similar to bits in classical computing. Qubits are any two-level quantum mechanical system; there are many different physical implementations of qubits, one of which is time-bin encoding.

<span class="mw-page-title-main">Ofer Biham</span> Israeli physicist

Ofer Biham is a faculty member at The Racah Institute of Physics of the Hebrew University of Jerusalem in Israel. Biham received his Ph.D. for research on quasiperiodic systems at the Weizmann Institute of Science in 1988, under the supervision of David Mukamel.

Adiabatic quantum computation (AQC) is a form of quantum computing which relies on the adiabatic theorem to perform calculations and is closely related to quantum annealing.

In quantum information theory, quantum discord is a measure of nonclassical correlations between two subsystems of a quantum system. It includes correlations that are due to quantum physical effects but do not necessarily involve quantum entanglement.

The framework of noiseless subsystems has been developed as a tool to preserve fragile quantum information against decoherence. In brief, when a quantum register is subjected to decoherence due to an interaction with an external and uncontrollable environment, information stored in the register is, in general, degraded. It has been shown that when the source of decoherence exhibits some symmetries, certain subsystems of the quantum register are unaffected by the interactions with the environment and are thus noiseless. These noiseless subsystems are therefore very natural and robust tools that can be used for processing quantum information.

Dynamical decoupling (DD) is an open-loop quantum control technique employed in quantum computing to suppress decoherence by taking advantage of rapid, time-dependent control modulation. In its simplest form, DD is implemented by periodic sequences of instantaneous control pulses, whose net effect is to approximately average the unwanted system-environment coupling to zero. Different schemes exist for designing DD protocols that use realistic bounded-strength control pulses, as well as for achieving high-order error suppression, and for making DD compatible with quantum gates. In spin systems in particular, commonly used protocols for dynamical decoupling include the Carr-Purcell and the Carr-Purcell-Meiboom-Gill (CPMG) schemes. They are based on the Hahn spin echo technique of applying periodic pulses to enable refocusing and hence extend the coherence times of qubits.

The USC-Lockheed Martin Quantum Computing Center (QCC) is a joint scientific research effort between Lockheed Martin Corporation and the University of Southern California (USC). The QCC is housed at the Information Sciences Institute (ISI), a computer science and engineering research unit of the USC Viterbi School of Engineering, and is jointly operated by ISI and Lockheed Martin.

Andrew MacGregor Childs is an American computer scientist and physicist known for his work on quantum computing. He is currently a professor in the department of computer science and Institute for Advanced Computer Studies at the University of Maryland. He also co-directs the Joint Center for Quantum Information and Computer Science, a partnership between the University of Maryland and the National Institute of Standards and Technology.

Continuous-variable (CV) quantum information is the area of quantum information science that makes use of physical observables, like the strength of an electromagnetic field, whose numerical values belong to continuous intervals. One primary application is quantum computing. In a sense, continuous-variable quantum computation is "analog", while quantum computation using qubits is "digital." In more technical terms, the former makes use of Hilbert spaces that are infinite-dimensional, while the Hilbert spaces for systems comprising collections of qubits are finite-dimensional. One motivation for studying continuous-variable quantum computation is to understand what resources are necessary to make quantum computers more powerful than classical ones.

In quantum computing, a qubit is a unit of information analogous to a bit in classical computing, but it is affected by quantum mechanical properties such as superposition and entanglement which allow qubits to be in some ways more powerful than classical bits for some tasks. Qubits are used in quantum circuits and quantum algorithms composed of quantum logic gates to solve computational problems, where they are used for input/output and intermediate computations.

<span class="mw-page-title-main">Giacomo Mauro D'Ariano</span> Italian quantum physicist

Giacomo Mauro D'Ariano is an Italian quantum physicist. He is a professor of theoretical physics at the University of Pavia, where he is the leader of the QUIT group. He is a member of the Center of Photonic Communication and Computing at Northwestern University; a member of the Istituto Lombardo Accademia di Scienze e Lettere; and a member of the Foundational Questions Institute (FQXi).

Katherine Birgitta Whaley is a professor of chemistry at the University of California Berkeley and a senior faculty scientist in the Division of Chemical Sciences at Lawrence Berkeley National Laboratory. At UC Berkeley, Whaley is the director of the Berkeley Quantum Information and Computation Center, a member of the executive board for the Center for Quantum Coherent Science, and a member of the Kavli Energy Nanosciences Institute. At Lawrence Berkeley National Laboratory, Whaley is a member of the Quantum Algorithms Team for Chemical Sciences in the research area of resource-efficient algorithms.

The Eastin–Knill theorem is a no-go theorem that states: "No quantum error correcting code can have a continuous symmetry which acts transversely on physical qubits". In other words, no quantum error correcting code can transversely implement a universal gate set, where a transversal logical gate is one that can be implemented on a logical qubit by the independent action of separate physical gates on corresponding physical qubits.

References

  1. ↑ "USC - Viterbi School of Engineering - Viterbi Faculty Directory".
  2. ↑ "USC-IBM Quantum Innovation Center".
  3. ↑ "Robert Benny Gerber".
  4. ↑ "Rothschild Fellows | Yad Hanadiv".
  5. ↑ Guggenheim Fellow
  6. ↑ "2007 Fellows of the American Physical Society".
  7. ↑ "2010 ScienceWatch Quantum Computer interviews".
  8. ↑ "List of Outstanding Referees of the APS".
  9. ↑ "List of John Charles Polanyi prize winners". Archived from the original on July 6, 2011.
  10. ↑ Daniel A. Lidar (editor) and Todd A. Brun (editor) (2013). "Quantum Error Correction". Cambridge University Press.
  11. ↑ Ronnow, T. F. (2014). "Defining and detecting quantum speedup". Science. 345 (6195): 420–424. arXiv: 1401.2910 . Bibcode:2014Sci...345..420R. doi:10.1126/science.1252319. PMID   25061205. S2CID   5596838.
  12. ↑ Lidar, D. A.; Chuang, I. L.; Whaley, K. B. (1998). "Decoherence-Free Subspaces for Quantum Computation". Physical Review Letters. 81 (12): 2594–2597. arXiv: quant-ph/9807004 . Bibcode:1998PhRvL..81.2594L. doi:10.1103/PhysRevLett.81.2594. S2CID   13979882.
  13. ↑ "APS Fellow citation". Aps.org. July 27, 2011. Retrieved January 4, 2012.
  14. ↑ Khodjasteh, K.; Lidar, D. A. (2005). "K. Khodjasteh and D.A. Lidar, "Fault-Tolerant Quantum Dynamical Decoupling", Phys. Rev. Lett. 95, 180501 (2005)". Physical Review Letters. 95 (18): 180501. arXiv: quant-ph/0408128 . Bibcode:2005PhRvL..95r0501K. doi:10.1103/PhysRevLett.95.180501. PMID   16383882. S2CID   9754216.
  15. ↑ Lidar, Daniel A. (2008). "Daniel A. Lidar, "Towards Fault Tolerant Adiabatic Quantum Computation", Phys. Rev. Lett. 100, 160506 (2008)". Physical Review Letters. 100 (17): 179904. Bibcode:2008PhRvL.100q9904L. doi: 10.1103/PhysRevLett.100.179904 . Retrieved January 4, 2012.
  16. ↑ Lidar, Daniel A.; Biham, Ofer (February 12, 1997). "D.A. Lidar and O. Biham, "Simulating Ising Spin Glasses on a Quantum Computer", Phys. Rev. E 56, 3661 (1997)". Physical Review E. 56 (3). Link.aps.org: 3661. arXiv: quant-ph/9611038 . Bibcode:1997PhRvE..56.3661L. doi:10.1103/PhysRevE.56.3661. S2CID   3686104.
  17. ↑ Lidar, Daniel A.; Wang, Haobin (1999). "D.A. Lidar and H. Wang, "Calculating the Thermal Rate Constant with Exponential Speedup on a Quantum Computer", Phys. Rev. E 59, 2429 (1999)". Physical Review E. 59 (2): 2429. arXiv: quant-ph/9807009 . Bibcode:1999PhRvE..59.2429L. doi:10.1103/PhysRevE.59.2429. S2CID   3735955.
  18. ↑ David Avnir; Ofer Biham; Daniel Lidar; Ofer Malcai (January 2, 1998). "APPLIED MATHEMATICS:Is the Geometry of Nature Fractal?". Science. 279 (5347): 39–40. arXiv: cond-mat/9801038 . Bibcode:1998Sci...279...39A. doi:10.1126/science.279.5347.39. S2CID   3680350.
  19. ↑ Mandelbrot, B. B. (February 6, 1998). "Is Nature Fractal?". Science. 279 (5352): 783c–783. Bibcode:1998Sci...279..783M. doi:10.1126/science.279.5352.783c. S2CID   122791263 . Retrieved January 4, 2012.
  20. ↑ US 7018852,Wu, Lian-Ao; Lidar, Daniel& Blais, Alexandre,"Methods for single qubit gate teleportation",issued 2006
  21. ↑ US 7184555,Whaley, K. Birgit; Lidar, Daniel& Kempe, Julia et al.,"Quantum computation",issued 2007
  22. ↑ US 7307275,Lidar, Daniel; Wu, Lian-Ao& Blais, Alexandre,"Encoding and error suppression for superconducting quantum computers",issued 2007
  23. ↑ US 7364923,Lidar, Daniel&Wu, Lian-Ao,"Dressed qubits",issued 2008
  24. ↑ US 10296352,Lidar, Daniel; Albash, Tameem& Vinci, Walter,"Nested quantum annealing correction",issued 2019
  25. ↑ US 11308400,Lidar, Daniel&Vinci, Walter,"Optimally stopped optimization systems having heuristic optimizer and methods using the same",issued 2022
This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.