skip to content

Faculty of Mathematics

 

Career

  • 2010- date: Leigh Trapnell Professor of Quantum Physics, DAMTP.
  • 2019: Elected Fellow of the Royal Society.
  • 2010-2013, 2019-date: Fellow, King's College, Cambridge.
  • 1999-2009: Professor of Computer Science, University of Bristol.
  • 1994-1999: Senior Lecturer, then Professor of Mathematical Physics, University of Plymouth.
  • 1992-1993: Research Fellow, DIRO, University of Montreal.
  • 1982-1992: Post-doctoral and teaching positions at University of Oxford, McGill University, Sydney University, U.N.S.W., Adelaide University, Flinders University, RMIT Melbourne.
  • 1981:  D.Phil.(Oxon). Thesis: "Models in Categories and Twistor Theory". Supervisor: Roger Penrose.

Research

Quantum Computation, Quantum Algorithms and Computational Complexity, Quantum Information Theory.

Selected Publications

  • D. Deutsch and R. Jozsa (1992) "Rapid Solution of Problems by Quantum Computation" Proc. Roy. Soc. Lond. A439, p553-558.

  • C. Bennett, G. Brassard, C. Crepeau, R. Jozsa, A. Peres and W. Wootters (1993) "Teleporting an Unknown Quantum State via Dual Classical and EPR Channels"  Phys. Rev. Lett. 70, p1895-1899.

  • R. Jozsa, D. Robb and W. Wootters (1994) "Lower Bound for Accessible Information in Quantum Mechanics" Phys. Rev. A49, p668-677.

  • R. Jozsa and B. Schumacher (1994) "A New Proof of the Quantum Noiseless Coding Theorem"  J. Modern Optics 41, p2343-2350.

  • A. Ekert and R. Jozsa (1996) "Quantum Computation and Shor's Factoring Algorithm'' Reviews of  Modern Physics 68, p733-753.

  • R. Jozsa (1998) "Quantum Algorithms and the Fourier Transform''  Proc. Roy. Soc. Lond. A454, p323-337.

  • R. Jozsa, M. Horodecki, P. Horodecki and R. Horodecki (1998) "Universal Quantum Information Compression'' Phys. Rev. Lett. 81, p1714-1717.

  • P. Hayden, R. Jozsa, D. Petz and A. Winter (2004) “Structure of states which satisfy strong subadditivity of quantum entropy with equality”, Commun. Math. Phys. 246, p359-374.

  • R. Jozsa, B. Kraus A. Miyake, and J. Watrous (2009) “Matchgate and quantum space-bounded computations are equivalent” Proc. Roy. Soc. (Lond.) A466, p809-830.

  • M. Bremner, R. Jozsa and D. Shepherd (2011) “Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy” Proc. Roy. Soc. (Lond.) A467, p459-472.

  • R. Jozsa and M. Van den Nest (2014) “Classical simulation complexity of extended Clifford circuits” Quant. Inf. Comp. 14, p0633-0648. 

  • R. Jozsa and G. Mitchison (2015) “Symmetric polynomials in information theory: entropy and subentropy” J. Math. Phys. 56 p062201

Publications

Universal quantum information compression and degrees of prior knowledge
R Jozsa, S Presnell
(2002)
A stronger no-cloning theorem
R Jozsa
(2002)
On the role of entanglement in quantum-computational speed-up
R Jozsa, N Linden
– Proceedings of the Royal Society A
(2002)
459,
2011
Introduction to the second issue.
DJ Wineland, JI Cirac, R Jozsa
– Quantum Inf. Comput.
(2001)
1,
1
Quantum Effects in Algorithms.
R Jozsa
– QCQC
(1998)
1509,
103
Stabilization of Quantum Computations by Symmetrization.
A Barenco, A Berthiaume, D Deutsch, A Ekert, R Jozsa, C Macchiavello
– SIAM J. Comput.
(1997)
26,
1541
A Quantum Bit Commitment Scheme Provably Unbreakable by both Parties
G Brassard, C Crepeau, R Jozsa, D Langlois
– Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science
(1993)
362
Efficient classical verification of quantum computations
R Jozsa, S Strelchuk
  • <
  • 3 of 3

Research Group

Centre for Quantum Information and Foundations

Room

F0.10

Telephone

01223 760378