Richard Jozsa

from Wikipedia, the free encyclopedia

Richard Jozsa (* around 1954 ) is an Australian mathematician who specializes in applied mathematics and quantum information theory. He is Leigh Trapnell Professor of Quantum Physics at Cambridge University .

Jozsa received his Masters degree ( Applications of Sheaf Cohomology in Twistor Theory ) from Oxford University in 1976 and received his PhD there in 1981 with Roger Penrose ( Models in Categories and Twistor Theory ). Both papers deal with the application of algebraic geometry in Twistor theory. He was a post-doctoral student at Oxford, McGill University , the University of Sydney , the University of New South Wales , the University of Adelaide , Flinders University and RMIT University in Melbourne. In 1992/93 he did research at the University of Montreal in the Department of Computer Science (DIRO) and in 1994 he became Senior Lecturer and 1997 Professor in Mathematics at the University of Plymouth . In 1999 he became Professor of Computer Science at the University of Bristol and since 2010 he has been Professor of Quantum Physics at the Institute for Theoretical Physics and Applied Mathematics (DAMTP) in Cambridge.

The Deutsch-Jozsa algorithm of quantum informatics is named after him and David Deutsch . He is also the co-author of the seminal article on quantum teleportation . He has dealt intensively with the question of which mechanism the quantum speed-up is based on, which (presumably) allows quantum computers to solve problems exponentially faster than is possible with conventional computers. In particular, he analyzed the role of entanglement in quantum computers and showed that a speed-up requires an increase in entanglement (with the number of input qubits). In the same context, there are analyzes of restricted quantum computer models, such as the extended Clifford circuits and the Matchgate circuits (both of which can be simulated efficiently, i.e. do not provide any speed-up) as well as the model of commuting quantum computation , where he found strong clues from the theory of complexity , that it cannot be simulated efficiently.

In 2004 he received the Naylor Prize . In 2016 he was elected a member of the Academia Europaea and in 2019 a member of the Royal Society .

Fonts

Web links

Individual evidence

  1. ↑ Online on the Twistor Web in Oxford
  2. ↑ German, Jozsa Rapid Solution of Problems by Quantum Computation , Proc. Royal Society A, Vol. 439, 1992, pp. 553-558
  3. ↑ Charles Bennett , Gilles Brassard , Claude Crépeau , Jozsa, Asher Peres , William Wootters Teleporting an unknown quantum state via dual classical and EPR channels , Physical Review Letters, Volume 70, 1993, pp. 1895-1899
  4. ^ Noah Linden: On the role of entanglement in quantum-computational speed-up . In: Proc. R. Soc. A . tape 459 , 2003, p. 2011–2032 , doi : 10.1098 / rspa.2002.1097 , arxiv : quant-ph / 0201143 .
  5. ↑ Jozsa, M. Van den Nest: Classical simulation complexity of extended Clifford circuits . 2013, arxiv : 1305.6190 .
  6. ↑ Michael J. Bremner, Richard Jozsa, Dan J. Shepherd: Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy . In: Proc. R. Soc. A . tape 467 , 2010, p. 301 , doi : 10.1098 / rspa.2010.0301 , arxiv : 1005.1407 .
  7. ↑ Richard Jozsa. Academia Europaea, accessed April 17, 2019 .
  8. ↑ The Royal Society announces election of new Fellows 2019. University of Cambridge, April 17, 2019, accessed April 17, 2019 .
personal data
SURNAME Jozsa, Richard
BRIEF DESCRIPTION Australian mathematician
DATE OF BIRTH around 1954