Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies
if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the
same subfield and year (this is the minimum needed to enter the top 1%, not the average
within it), or reaches the top citation threshold in at least one of its specific research
topics.
Universal quantum computation with ideal Clifford gates and noisy ancillas
This map shows the geographic impact of Sergey Bravyi's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Sergey Bravyi with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Sergey Bravyi more than expected).
This network shows the impact of papers produced by Sergey Bravyi. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Sergey Bravyi. The network helps show where Sergey Bravyi may publish in the future.
Co-authorship network of co-authors of Sergey Bravyi
This figure shows the co-authorship network connecting the top 25 collaborators of Sergey Bravyi.
A scholar is included among the top collaborators of Sergey Bravyi based on the total number of
citations received by their joint publications. Widths of edges
represent the number of papers authors have co-authored together.
Node borders
signify the number of papers an author published with Sergey Bravyi. Sergey Bravyi is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Bravyi, Sergey, Andrew W. Cross, Jay Gambetta, et al.. (2024). High-threshold and low-overhead fault-tolerant quantum memory. Nature. 627(8005). 778–782.173 indexed citations breakdown →
Eddins, Andrew, Tanvi P. Gujarati, Sergey Bravyi, et al.. (2021). Reducing circuit size in the variational quantum eigensolver -- Part 2: Experiment. Bulletin of the American Physical Society.1 indexed citations
10.
Gujarati, Tanvi P., Andrew Eddins, Sergey Bravyi, et al.. (2021). Reducing circuit size in the variational quantum eigensolver -- Part 1: Theory. Bulletin of the American Physical Society.1 indexed citations
Bansal, Nikhil, Sergey Bravyi, & Barbara M. Terhal. (2007). A classical approximation scheme for the ground-state energy of Ising spin Hamiltonians on planar graphs. arXiv (Cornell University).2 indexed citations
18.
Bravyi, Sergey. (2006). Universal quantum computation with the nu=5/2 fractional quantum Hall state (16 pages). Physical Review A. 73(4). 42313.1 indexed citations
19.
Kitaev, Alexei & Sergey Bravyi. (2005). Universal quantum computation with ideal Clifford gates and noisy ancillas (14 pages). Physical Review A. 71(2). 22316.38 indexed citations
20.
Bravyi, Sergey. (2002). Entanglement entropy of multipartite pure state. arXiv (Cornell University).2 indexed citations
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive
bibliographic database. While OpenAlex provides broad and valuable coverage of the global
research landscape, it—like all bibliographic datasets—has inherent limitations. These include
incomplete records, variations in author disambiguation, differences in journal indexing, and
delays in data updates. As a result, some metrics and network relationships displayed in
Rankless may not fully capture the entirety of a scholar's output or impact.