Keyword

gate complexity

Description: Gate complexity is a measure of the number of logic gates required to implement a computation, studied in circuit complexity and quantum computing.
OpenAlex ID: keywords/gate-complexity
1981 · Dias, Jump · IEEE Transactions on Computers · 324
2018 · Low, Guang Hao, Wiebe, Nathan · arXiv (Cornell University) · 307
2021 · Mario Motta, Erika Ye, et al. · npj Quantum Information · 265
2019 · Andrew M. Childs, Yuan Su · Physical Review Letters · 264
2004 · A. Reyhani-Masoleh, M.A. Hasan · IEEE Transactions on Computers · 250
2020 · Dominic W. Berry, Andrew M. Childs, et al. · Quantum · 186
2016 · Ryan Babbush, Dominic W Berry, et al. · New Journal of Physics · 171
2019 · Ryan Babbush, Dominic W. Berry, et al. · npj Quantum Information · 159
2022 · Yu Tong, Victor V. Albert, et al. · Quantum · 132
2014 · Gaurav Bansod, Nishchal Raval, et al. · IEEE Transactions on Information Forensics and Security · 132
2022 · Daan Camps, Roel Van Beeumen · IEEE International Conference on Quantum Computing and Engineering (QCE) · 123
2003 · MARKUS GRASSL, MARTIN RÖTTELER, et al. · International Journal of Foundations of Computer Science · 123
2021 · Chi-Fang Chen, Hsin-Yuan Huang, et al. · PRX Quantum · 113
2022 · Andrew M. Childs, Jiaqi Leng, et al. · Quantum · 97
2019 · Ryan Babbush, Dominic W. Berry, et al. · Physical Review A · 91
2024 · Alok Shukla, Prakash Vedula · Quantum Information Processing · 73
2022 · Abhishek Rajput, Alessandro Roggero, et al. · Quantum · 73
1998 · C. Paar, P. Fleischmann, et al. · IEEE Transactions on Computers · 73
2024 · Lorenzo Leone, Salvatore F. E. Oliviero, et al. · Physical Review A · 66
Works count: 254
Citation count: 6,402
Year
Topic
Type