Suivre
Andreas Bärtschi (Baertschi)
Andreas Bärtschi (Baertschi)
Adresse e-mail validée de lanl.gov - Page d'accueil
Titre
Citée par
Citée par
Année
Quantum Algorithm Implementations for Beginners
J Abhijith, A Adedoyin, J Ambrosiano, P Anisimov, W Casper, ...
ACM Transactions on Quantum Computing 3 (4), 18:1–18:92, 2022
203*2022
Deterministic Preparation of Dicke States
A Bärtschi, S Eidenbenz
22nd International Symposium on Fundamentals of Computation Theory FCT'19 …, 2019
492019
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
422020
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
38*2020
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
292020
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
282020
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
252017
Conflict-Free Chromatic Art Gallery Coverage
A Bärtschi, S Suri
Algorithmica 68 (1), 265-283, 2014
252014
Conflict-free Chromatic Art Gallery Coverage
A Bärtschi, S Suri
29th International Symposium on Theoretical Aspects of Computer Science …, 2012
252012
Improved bounds for the conflict-free chromatic art gallery problem
A Bärtschi, SK Ghosh, M Mihalák, T Tschager, P Widmayer
30th Annual Symposium on Computational Geometry SoCG'14, 144–153, 2014
162014
Energy-Efficient Fast Delivery by Mobile Agents
A Bärtschi, T Tschager
21st International Symposium on Fundamentals of Computation Theory FCT'17, 82–95, 2017
142017
Collective Fast Delivery by Energy-Efficient Agents
A Bärtschi, D Graf, M Mihalák
43rd International Symposium on Mathematical Foundations of Computer Science …, 2018
122018
Truthful Mechanisms for Delivery with Agents
A Bärtschi, D Graf, P Penna
17th Workshop on Algorithmic Approaches for Transportation Modelling …, 2017
12*2017
On Conflict-Free Multi-coloring
A Bärtschi, F Grandoni
14th International Workshop on Algorithms and Data Structures WADS'15, 103–114, 2015
92015
Efficient Delivery with Mobile Agents
A Bärtschi
ETH Zürich, Department of Computer Science, 2017
82017
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
72022
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
52022
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
52021
Evidence for Super-Polynomial Advantage of QAOA over Unstructured Search
J Golden, A Bärtschi, S Eidenbenz, D O'Malley
arXiv preprint arXiv:2202.00648, 2022
42022
On Computing the Total Displacement Number via Weighted Motzkin Paths
A Bärtschi, B Geissmann, D Graf, T Hruz, P Penna, T Tschager
27th International Workshop on Combinatorial Algorithms IWOCA'16, 423–434, 2016
42016
Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.
Articles 1–20