Andreas Bärtschi

Publication Activity (10 Years)

Years Active: 2012-2024
Publications (10 Years): 54

Top Topics

Satisfiability Problem

Top Venues

Publications

Shamminuj Aktar, Andreas Bärtschi, Diane Oyen, Stephan J. Eidenbenz, Abdel-Hameed A. Badawy
Graph Neural Networks for Parameterized Quantum Circuits Expressibility Estimation. CoRR (2024)
Joel Rajakumar, John K. Golden, Andreas Bärtschi, Stephan J. Eidenbenz
Trainability Barriers in Low-Depth QAOA Landscapes. CoRR (2024)
Joel Rajakumar, John K. Golden, Andreas Bärtschi, Stephan J. Eidenbenz
Trainability Barriers in Low-Depth QAOA Landscapes. CF (2024)
John K. Golden, Andreas Bärtschi, Dan O'Malley, Elijah Pelofske, Stephan J. Eidenbenz
JuliQAOA: Fast, Flexible QAOA Simulation. SC Workshops (2023)
Elijah Pelofske, Andreas Bärtschi, Stephan J. Eidenbenz
Quantum Annealing vs. QAOA: 127 Qubit Higher-Order Ising Problems on NISQ Computers. ISC (2023)
Elijah Pelofske, Andreas Bärtschi, Lukasz Cincio, John K. Golden, Stephan J. Eidenbenz
Scaling Whole-Chip QAOA for Higher-Order Ising Spin Glass Models on Heavy-Hex Graphs. CoRR (2023)
Shamminuj Aktar, Abdel-Hameed A. Badawy, Andreas Bärtschi, Stephan J. Eidenbenz
Scalable Experimental Bounds for Dicke and GHZ States Fidelities. CF (2023)
Christo Meriwether Keller, Stephan J. Eidenbenz, Andreas Bärtschi, Daniel O'Malley, John K. Golden, Satyajayant Misra
Hierarchical Multigrid Ansatz for Variational Quantum Algorithms. CoRR (2023)
John K. Golden, Andreas Bärtschi, Daniel O'Malley, Stephan J. Eidenbenz
The Quantum Alternating Operator Ansatz for Satisfiability Problems. CoRR (2023)
Elijah Pelofske, Andreas Bärtschi, Stephan J. Eidenbenz, Bryan Garcia, Boris Kiefer
Probing Quantum Telecloning on Superconducting Quantum Processors. CoRR (2023)
Elijah Pelofske, Andreas Bärtschi, John K. Golden, Stephan J. Eidenbenz
High-Round QAOA for MAX k-SAT on Trapped Ion NISQ Devices. CoRR (2023)
Shamminuj Aktar, Andreas Bärtschi, Abdel-Hameed A. Badawy, Diane Oyen, Stephan J. Eidenbenz
Predicting Expressibility of Parameterized Quantum Circuits Using Graph Neural Network. QCE (2023)
Naphan Benchasattabuse, Andreas Bärtschi, Luis Pedro García-Pintos, John K. Golden, Nathan Lemons, Stephan J. Eidenbenz
Lower Bounds on Number of QAOA Rounds Required for Guaranteed Approximation Ratios. CoRR (2023)
John K. Golden, Andreas Bärtschi, Daniel O'Malley, Stephan J. Eidenbenz
The Quantum Alternating Operator Ansatz for Satisfiability Problems. QCE (2023)
Elijah Pelofske, Andreas Bärtschi, John K. Golden, Stephan J. Eidenbenz
High-Round QAOA for MAX $k$-SAT on Trapped Ion NISQ Devices. QCE (2023)
Elijah Pelofske, Vincent Russo, Ryan LaRose, Andrea Mari, Dan Strano, Andreas Bärtschi, Stephan J. Eidenbenz, William J. Zeng
Increasing the Measured Effective Quantum Volume with Zero Noise Extrapolation. CoRR (2023)
Samantha V. Barron, Daniel J. Egger, Elijah Pelofske, Andreas Bärtschi, Stephan J. Eidenbenz, Matthis Lehmkuehler, Stefan Woerner
Provable bounds for noise-free expectation values computed from noisy samples. CoRR (2023)
John K. Golden, Andreas Bärtschi, Daniel O'Malley, Stephan J. Eidenbenz
Numerical Evidence for Exponential Speed-Up of QAOA over Unstructured Search for Approximate Constrained Optimization. QCE (2023)
Elijah Pelofske, Andreas Bärtschi, Stephan J. Eidenbenz
Quantum Annealing vs. QAOA: 127 Qubit Higher-Order Ising Problems on NISQ Computers. CoRR (2023)
Elijah Pelofske, Andreas Bärtschi, Bryan Garcia, Boris Kiefer, Stephan J. Eidenbenz
Quantum Telecloning on NISQ Computers. CoRR (2022)
Elijah Pelofske, Andreas Bärtschi, Stephan J. Eidenbenz
Optimized Telecloning Circuits: Theory and Practice of Nine NISQ Clones. ICRC (2022)
Elijah Pelofske, Andreas Bärtschi, Bryan Garcia, Boris Kiefer, Stephan J. Eidenbenz
Quantum Telecloning on NISQ Computers. QCE (2022)
Andreas Bärtschi, Stephan J. Eidenbenz
Short-Depth Circuits for Dicke State Preparation. CoRR (2022)
Elijah Pelofske, Andreas Bärtschi, Stephan J. Eidenbenz
Quantum Volume in Practice: What Users Can Expect from NISQ Devices. CoRR (2022)
Shamminuj Aktar, Andreas Bärtschi, Abdel-Hameed A. Badawy, Stephan J. Eidenbenz
Scalable Experimental Bounds for Entangled Quantum State Fidelities. CoRR (2022)
Elijah Pelofske, Andreas Bärtschi, Stephan J. Eidenbenz
Optimized Telecloning Circuits: Theory and Practice of Nine NISQ Clones. CoRR (2022)
Andreas Bärtschi, Stephan J. Eidenbenz
Short-Depth Circuits for Dicke State Preparation. QCE (2022)
John K. Golden, Andreas Bärtschi, Stephan J. Eidenbenz, Daniel O'Malley
Evidence for Super-Polynomial Advantage of QAOA over Unstructured Search. CoRR (2022)
Elijah Pelofske, John K. Golden, Andreas Bärtschi, Daniel O'Malley, Stephan J. Eidenbenz
Sampling on NISQ Devices: "Who's the Fairest One of All?". QCE (2021)
John K. Golden, Andreas Bärtschi, Daniel O'Malley, Stephan J. Eidenbenz
QAOA-based Fair Sampling on NISQ Devices. CoRR (2021)
Andreas Bärtschi, Evangelos Bampas, Jérémie Chalopin, Shantanu Das, Christina Karousatou, Matús Mihalák
Near-gathering of energy-constrained mobile agents. Theor. Comput. Sci. 849 (2021)
John K. Golden, Andreas Bärtschi, Daniel O'Malley, Stephan J. Eidenbenz
Threshold-Based Quantum Optimization. QCE (2021)
Elijah Pelofske, John K. Golden, Andreas Bärtschi, Daniel O'Malley, Stephan J. Eidenbenz
Sampling on NISQ Devices: "Who's the Fairest One of All?". CoRR (2021)
John K. Golden, Andreas Bärtschi, Daniel O'Malley, Stephan J. Eidenbenz
Threshold-Based Quantum Optimization. CoRR (2021)
Shamminuj Aktar, Andreas Bärtschi, Abdel-Hameed A. Badawy, Stephan J. Eidenbenz
A Divide-and-Conquer Approach to Dicke State Preparation. CoRR (2021)
Andreas Bärtschi, Jérémie Chalopin, Shantanu Das, Yann Disser, Barbara Geissmann, Daniel Graf, Arnaud Labourel, Matús Mihalák
Collaborative delivery with energy-constrained mobile robots. Theor. Comput. Sci. 810 (2020)
Stefanie Zbinden, Andreas Bärtschi, Hristo N. Djidjev, Stephan J. Eidenbenz
Embedding Algorithms for Quantum Annealers with Chimera and Pegasus Connection Topologies. ISC (2020)
Andreas Bärtschi, Stephan J. Eidenbenz
Grover Mixers for QAOA: Shifting Complexity from Mixer Design to State Preparation. CoRR (2020)
Andreas Bärtschi, Stephan J. Eidenbenz
Grover Mixers for QAOA: Shifting Complexity from Mixer Design to State Preparation. QCE (2020)
Jeremy Cook, Stephan J. Eidenbenz, Andreas Bärtschi
The Quantum Alternating Operator Ansatz on Maximum k-Vertex Cover. QCE (2020)
Andreas Bärtschi, Stephan J. Eidenbenz
Deterministic Preparation of Dicke States. FCT (2019)
Andreas Bärtschi, Evangelos Bampas, Jérémie Chalopin, Shantanu Das, Christina Karousatou, Matús Mihalák
Near-Gathering of Energy-Constrained Mobile Agents. SIROCCO (2019)
Andreas Bärtschi, Stephan J. Eidenbenz
Deterministic Preparation of Dicke States. CoRR (2019)
Andreas Bärtschi, Daniel Graf, Matús Mihalák
Collective Fast Delivery by Energy-Efficient Agents. MFCS (2018)
Andreas Bärtschi, Daniel Graf, Matús Mihalák
Collective fast delivery by energy-efficient agents. CoRR (2018)
Andreas Bärtschi, Jérémie Chalopin, Shantanu Das, Yann Disser, Daniel Graf, Jan Hackfeld, Paolo Penna
Energy-Efficient Delivery by Heterogeneous Mobile Agents. STACS (2017)
Andreas Bärtschi, Daniel Graf, Paolo Penna
Truthful Mechanisms for Delivery with Agents. ATMOS (2017)
Andreas Bärtschi, Daniel Graf, Paolo Penna
Truthful Mechanisms for Delivery with Mobile Agents. CoRR (2017)
Andreas Bärtschi, Thomas Tschager
Energy-Efficient Fast Delivery by Mobile Agents. FCT (2017)
Andreas Bärtschi, Jérémie Chalopin, Shantanu Das, Yann Disser, Barbara Geissmann, Daniel Graf, Arnaud Labourel, Matús Mihalák
Collaborative Delivery with Energy-Constrained Mobile Robots. SIROCCO (2016)
Andreas Bärtschi, Barbara Geissmann, Daniel Graf, Tomas Hruz, Paolo Penna, Thomas Tschager
On Computing the Total Displacement Number via Weighted Motzkin Paths. IWOCA (2016)
Andreas Bärtschi, Barbara Geissmann, Daniel Graf, Tomas Hruz, Paolo Penna, Thomas Tschager
On computing the total displacement number via weighted Motzkin paths. CoRR (2016)
Andreas Bärtschi, Jérémie Chalopin, Shantanu Das, Yann Disser, Daniel Graf, Jan Hackfeld, Paolo Penna
Energy-efficient Delivery by Heterogeneous Mobile Agents. CoRR (2016)
Andreas Bärtschi, Jérémie Chalopin, Shantanu Das, Yann Disser, Barbara Geissmann, Daniel Graf, Arnaud Labourel, Matús Mihalák
Collaborative Delivery with Energy-Constrained Mobile Robots. CoRR (2016)
Andreas Bärtschi, Fabrizio Grandoni
On Conflict-Free Multi-coloring. WADS (2015)
Andreas Bärtschi, Subir Kumar Ghosh, Matús Mihalák, Thomas Tschager, Peter Widmayer
Improved bounds for the conflict-free chromatic art gallery problem. SoCG (2014)
Andreas Bärtschi, Subhash Suri
Conflict-Free Chromatic Art Gallery Coverage. Algorithmica 68 (1) (2014)
Andreas Bärtschi, Subhash Suri
Erratum to: Conflict-Free Chromatic Art Gallery Coverage. Algorithmica 68 (1) (2014)
Andreas Bärtschi, Subhash Suri
Conflict-free Chromatic Art Gallery Coverage. STACS (2012)