Eidenbenz, Stephan

Quantum Algorithm Implementations for Beginners

J., A., Adedoyin, A., Ambrosiano, J., Anisimov, P., Casper, W., Chennupati, G., Coffrin, C., Djidjev, H., Gunter, D., Karra, S., et al. (2018) · arXiv

Quantum Computing Algorithms and ArchitectureQuantum Information and Cryptography

Cited by 256

Deterministic Preparation of Dicke States

Bärtschi, A., & Eidenbenz, S. (2019) · Lecture Notes in Computer Science

Quantum Computing Algorithms and ArchitectureQuantum Information and Cryptography

Cited by 127

Grover Mixers for QAOA: Shifting Complexity from Mixer Design to State Preparation

Bartschi, A., & Eidenbenz, S. (2020) · 2020 IEEE International Conference on Quantum Computing and Engineering (QCE)

Quantum Computing Algorithms and ArchitectureMetaheuristic Optimization Algorithms Research

Cited by 122

Quantum Annealing vs. QAOA: 127 Qubit Higher-Order Ising Problems on NISQ Computers

Pelofske, E., Bärtschi, A., & Eidenbenz, S. (2023) · Lecture Notes in Computer Science

Quantum Computing Algorithms and ArchitectureQuantum Information and Cryptography

Cited by 47

Provable bounds for noise-free expectation values computed from noisy samples

Barron, S. V., Egger, D. J., Pelofske, E., Bärtschi, A., Eidenbenz, S., Lehmkuehler, M., & Woerner, S. (2024) · Nature Computational Science

Quantum Computing Algorithms and ArchitectureQuantum Information and Cryptography

Cited by 25

High-Round QAOA for MAX $k$-SAT on Trapped Ion NISQ Devices

Pelofske, E., Bärtschi, A., Golden, J., & Eidenbenz, S. (2023) · 2023 IEEE International Conference on Quantum Computing and Engineering (QCE)

Quantum Computing Algorithms and ArchitectureQuantum many-body systems

Cited by 15

The Quantum Alternating Operator Ansatz for Satisfiability Problems

Golden, J., Bärtschi, A., O'Malley, D., & Eidenbenz, S. (2023) · 2023 IEEE International Conference on Quantum Computing and Engineering (QCE)

Quantum Computing Algorithms and ArchitectureQuantum many-body systems

Cited by 13