| Quantum Algorithm Implementations for Beginners A Jayakumar, A Adedoyin, J Ambrosiano, P Anisimov, W Casper, ... ACM Transactions on Quantum Computing 3 (4), 18:1–18:92, 2022 | 397* | 2022 |
| Challenges and opportunities in quantum optimization A Abbas, A Ambainis, B Augustino, A Bärtschi, H Buhrman, C Coffrin, ... Nature Reviews Physics 6, 718–735, 2024 | 265 | 2024 |
| Deterministic Preparation of Dicke States A Bärtschi, S Eidenbenz 22nd International Symposium on Fundamentals of Computation Theory FCT'19 …, 2019 | 210 | 2019 |
| Grover Mixers for QAOA: Shifting Complexity from Mixer Design to State Preparation A Bärtschi, S Eidenbenz IEEE International Conference on Quantum Computing and Engineering QCE'20, 72–82, 2020 | 187 | 2020 |
| Quantum Optimization: Potential, Challenges, and the Path Forward A Abbas, A Ambainis, B Augustino, A Bärtschi, H Buhrman, C Coffrin, ... arXiv preprint, arXiv:2312.02279, 2023 | 136 | 2023 |
| The Quantum Alternating Operator Ansatz on Maximum k-Vertex Cover J Cook, S Eidenbenz, A Bärtschi IEEE International Conference on Quantum Computing and Engineering QCE'20, 83–92, 2020 | 113 | 2020 |
| Quantum Volume in Practice: What Users Can Expect from NISQ Devices E Pelofske, A Bärtschi, S Eidenbenz IEEE Transactions on Quantum Engineering 3, 3102119, 2022 | 109 | 2022 |
| Embedding Algorithms for Quantum Annealers with Chimera and Pegasus Connection Topologies S Zbinden, A Bärtschi, H Djidjev, S Eidenbenz International Conference on High Performance Computing ISC HPC'20, 187–206, 2020 | 102 | 2020 |
| Quantum Annealing vs. QAOA: 127 Qubit Higher-Order Ising Problems on NISQ Computers E Pelofske, A Bärtschi, S Eidenbenz International Conference on High Performance Computing ISC HPC'23, 240–258, 2023 | 79 | 2023 |
| Short-Depth Circuits for Dicke State Preparation A Bärtschi, S Eidenbenz IEEE International Conference on Quantum Computing and Engineering QCE'22, 87–96, 2022 | 76 | 2022 |
| A Divide-and-Conquer Approach to Dicke State Preparation S Aktar, A Bärtschi, AHA Badawy, S Eidenbenz IEEE Transactions on Quantum Engineering 3, 3101816, 2022 | 52 | 2022 |
| Short-depth QAOA circuits and quantum annealing on higher-order ising models E Pelofske, A Bärtschi, S Eidenbenz npj Quantum Information 10, 30, 2024 | 46 | 2024 |
| Numerical Evidence for Exponential Speed-up of QAOA over Unstructured Search for Approximate Constrained Optimization J Golden, A Bärtschi, S Eidenbenz, D O'Malley IEEE International Conference on Quantum Computing and Engineering QCE'23 …, 2023 | 41 | 2023 |
| Threshold-Based Quantum Optimization J Golden, A Bärtschi, D O’Malley, S Eidenbenz IEEE International Conference on Quantum Computing and Engineering QCE'21 …, 2021 | 41 | 2021 |
| Collaborative delivery with energy-constrained mobile robots A Bärtschi, J Chalopin, S Das, Y Disser, B Geissmann, D Graf, A Labourel, ... Theoretical Computer Science 810, 2–14, 2020 | 39 | 2020 |
| Energy-Efficient Delivery by Heterogeneous Mobile Agents A Bärtschi, J Chalopin, S Das, Y Disser, D Graf, J Hackfeld, P Penna 34th Symposium on Theoretical Aspects of Computer Science STACS'17, 10:1–10:14, 2017 | 36 | 2017 |
| Conflict-Free Chromatic Art Gallery Coverage A Bärtschi, S Suri Algorithmica 68 (1), 265–283, 2014 | 35 | 2014 |
| Conflict-free Chromatic Art Gallery Coverage A Bärtschi, S Suri 29th International Symposium on Theoretical Aspects of Computer Science …, 2012 | 35 | 2012 |
| Provable bounds for noise-free expectation values computed from noisy samples SV Barron, DJ Egger, E Pelofske, A Bärtschi, S Eidenbenz, ... Nature Computational Science 4, 865–875, 2024 | 34 | 2024 |
| Sampling on NISQ Devices: "Who’s the Fairest One of All?" E Pelofske, J Golden, A Bärtschi, D O’Malley, S Eidenbenz IEEE International Conference on Quantum Computing and Engineering QCE'21 …, 2021 | 30 | 2021 |
Stephan EidenbenzComputer Science, Los Alamos National LaboratoryVerified email at lanl.gov
