Get started
Author

Bill Rosgen

Gemini 1.5: Unlocking multimodal understanding across millions of tokens of context
2024 · Gemini Team, Georgiev, Petko, et al. · arXiv (Cornell University) · 302
PDF
On the Hardness of Distinguishing Mixed-State Quantum Computations
2005 · B. Rosgen, J. Watrous · Proceedings - IEEE Conference on Computational Complexity/Proceedings · 66
PDF
Complexity results on graphs with few cliques
2007 · Bill Rosgen, Lorna Stewart · Discrete Mathematics & Theoretical Computer Science · 38
PDF
Additivity and distinguishability of random unitary channels
2008 · Bill Rosgen · 15
Quantum Commitments from Complexity Assumptions
2011 · André Chailloux, Iordanis Kerenidis, et al. · Lecture notes in computer science · 11
Testing Non-isometry Is QMA-Complete
2011 · Bill Rosgen · Lecture notes in computer science · 10
Computational Distinguishability of Quantum Channels
2009 · Rosgen, Bill · arXiv (Cornell University) · 9
PDF
Distinguishing Short Quantum Computations
2007 · Rosgen, Bill · arXiv (Cornell University) · 6
PDF
Imagen 3
2024 · Imagen-Team-Google, :, et al. · arXiv (Cornell University) · 4
PDF
Quantum commitments from complexity assumptions
2015 · André Chailloux, Iordanis Kerenidis, et al. · Computational Complexity · 4
Testing Quantum Circuits and Detecting Insecure Encryption
2013 · Bill Rosgen · Lecture notes in computer science · 3
Computational distinguishability of degradable and antidegradable channels
2010 · Bill Rosgen · Quantum Information and Computation · 3
PDF
Testing quantum circuits and detecting insecure encryption
2011 · Rosgen, Bill · arXiv (Cornell University) · 2
PDF
Quantum Commitments from Complexity Assumptions
2010 · Chailloux, André, Kerenidis, Iordanis, et al. · arXiv (Cornell University) · 1
PDF
The overlap number of a graph
2010 · Rosgen, Bill, Stewart, Lorna · arXiv (Cornell University) · 1
PDF
Testing non-isometry is QMA-complete
2009 · Rosgen, Bill · arXiv (Cornell University)
PDF
Works count: 21
Citation count: 539
H-index: 8
I10-index: 7
Year
Topic
Type