Richard Jozsa

Computer Science · Physical Sciences

38h-index27.7kcitations101works0.02yr avg
OpenAlex↗ORCID↗Google Scholar↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Quantum Computing Algorithms and Architecture(66), Quantum Information and Cryptography(60), Quantum Mechanics and Applications(46), Computability, Logic, AI Algorithms(14), Statistical Mechanics and Entropy(5)

Publications100 total

IQP computations with intermediate measurements
arXiv (Cornell University)·2024Open Access
Computational power of matchgates with supplementary resources
Physical review. A/Physical review, A·2020· 18 citedOpen Access
All Pure Fermionic Non-Gaussian States Are Magic States for Matchgate Computations
Physical Review Letters·2019· 39 citedOpen Access
On verifying validity of quantum computations for BQP
arXiv (Cornell University)·2017Open Access
Efficient classical verification of quantum computations
arXiv (Cornell University)·2017· 3 citedOpen Access
Quantum conditional query complexity
Quantum Information and Computation·2017Open Access
Symmetric polynomials in information theory: Entropy and subentropy
Journal of Mathematical Physics·2015Open Access
Jordan-Wigner formalism for arbitrary 2-input 2-output matchgates and their classical simulation
Quantum Information and Computation·2015· 10 citedOpen Access
Properties of subentropy
Journal of Mathematical Physics·2014· 19 citedOpen Access
Classical simulation complexity of extended clifford circuits
Quantum Information and Computation·2014· 39 cited
Classical simulation complexity of extended Clifford circuits
Quantum Information and Computation·2014· 32 cited
Jordan-Wigner formalism for arbitrary 2-input 2-output matchgates and their classical simulation
arXiv (Cornell University)·2013Open Access
Jordan-Wigner formalism for arbitrary 2-input 2-output matchgates and\n their classical simulation
arXiv (Cornell University)·2013Open Access
Jordan-Wigner formalism for classical simulation beyond binary matchgates
arXiv (Cornell University)·2013· 3 citedOpen Access
Entropy, subentropy and the elementary symmetric functions
arXiv (Cornell University)·2013· 2 citedOpen Access
Classical simulation complexity of extended Clifford circuits
arXiv (Cornell University)·2013· 2 citedOpen Access
Classical Simulation and Complexity of Quantum Computations
Lecture notes in computer science·2010· 2 cited
Embedding classical into quantum computation
arXiv (Cornell University)·2008· 6 citedOpen Access
Invited Talk: Embedding Classical into Quantum Computation
Lecture notes in computer science·2008· 9 cited
Generalized Clifford groups and simulation of associated quantum circuits
Quantum Information and Computation·2008· 21 cited
page 1 of 5Next →

Frequent Co-authors

David Deutsch(8), Artur Ekert(8), Sandu Popescu(7), William K. Wootters(6), Chiara Macchiavello(5), Benjamin Schumacher(5), Noah Linden(5), Gilles Brassard(4), Adriano Barenco(4), André Berthiaume(4), Claude Crépeau(3), Asher Peres(3), Graeme Mitchison(3), Charles H. Bennett(2), Anna Sanpera(2), Howard Barnum(2), Carlton M. Caves(2), Christopher A. Fuchs(2), Masahide Sasaki(2), M. Van den Nest(2)