Andreas Bärtschi

Orcid: 0000-0002-9049-0984

Affiliations:
  • Los Alamos National Laboratory, NM, USA


According to our database1, Andreas Bärtschi authored at least 41 papers between 2014 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Trainability Barriers in Low-Depth QAOA Landscapes.
CoRR, 2024

2023
Hierarchical Multigrid Ansatz for Variational Quantum Algorithms.
CoRR, 2023

Scaling Whole-Chip QAOA for Higher-Order Ising Spin Glass Models on Heavy-Hex Graphs.
CoRR, 2023

Provable bounds for noise-free expectation values computed from noisy samples.
CoRR, 2023

Probing Quantum Telecloning on Superconducting Quantum Processors.
CoRR, 2023

Lower Bounds on Number of QAOA Rounds Required for Guaranteed Approximation Ratios.
CoRR, 2023

Increasing the Measured Effective Quantum Volume with Zero Noise Extrapolation.
CoRR, 2023

Quantum Annealing vs. QAOA: 127 Qubit Higher-Order Ising Problems on NISQ Computers.
Proceedings of the High Performance Computing - 38th International Conference, 2023

JuliQAOA: Fast, Flexible QAOA Simulation.
Proceedings of the SC '23 Workshops of The International Conference on High Performance Computing, 2023

High-Round QAOA for MAX $k$-SAT on Trapped Ion NISQ Devices.
Proceedings of the IEEE International Conference on Quantum Computing and Engineering, 2023

Numerical Evidence for Exponential Speed-Up of QAOA over Unstructured Search for Approximate Constrained Optimization.
Proceedings of the IEEE International Conference on Quantum Computing and Engineering, 2023

The Quantum Alternating Operator Ansatz for Satisfiability Problems.
Proceedings of the IEEE International Conference on Quantum Computing and Engineering, 2023

Predicting Expressibility of Parameterized Quantum Circuits Using Graph Neural Network.
Proceedings of the IEEE International Conference on Quantum Computing and Engineering, 2023

Scalable Experimental Bounds for Dicke and GHZ States Fidelities.
Proceedings of the 20th ACM International Conference on Computing Frontiers, 2023

2022
Quantum Volume in Practice: What Users Can Expect from NISQ Devices Dataset.
Dataset, May, 2022

Scalable Experimental Bounds for Entangled Quantum State Fidelities.
CoRR, 2022

Quantum Volume in Practice: What Users Can Expect from NISQ Devices.
CoRR, 2022

Evidence for Super-Polynomial Advantage of QAOA over Unstructured Search.
CoRR, 2022

Quantum Telecloning on NISQ Computers.
Proceedings of the IEEE International Conference on Quantum Computing and Engineering, 2022

Short-Depth Circuits for Dicke State Preparation.
Proceedings of the IEEE International Conference on Quantum Computing and Engineering, 2022

Optimized Telecloning Circuits: Theory and Practice of Nine NISQ Clones.
Proceedings of the IEEE International Conference on Rebooting Computing, 2022

2021
Near-gathering of energy-constrained mobile agents.
Theor. Comput. Sci., 2021

A Divide-and-Conquer Approach to Dicke State Preparation.
CoRR, 2021

QAOA-based Fair Sampling on NISQ Devices.
CoRR, 2021

Sampling on NISQ Devices: "Who's the Fairest One of All?".
Proceedings of the IEEE International Conference on Quantum Computing and Engineering, 2021

Threshold-Based Quantum Optimization.
Proceedings of the IEEE International Conference on Quantum Computing and Engineering, 2021

2020
Collaborative delivery with energy-constrained mobile robots.
Theor. Comput. Sci., 2020

Embedding Algorithms for Quantum Annealers with Chimera and Pegasus Connection Topologies.
Proceedings of the High Performance Computing - 35th International Conference, 2020

The Quantum Alternating Operator Ansatz on Maximum k-Vertex Cover.
Proceedings of the IEEE International Conference on Quantum Computing and Engineering, 2020

Grover Mixers for QAOA: Shifting Complexity from Mixer Design to State Preparation.
Proceedings of the IEEE International Conference on Quantum Computing and Engineering, 2020

2019
Deterministic Preparation of Dicke States.
Proceedings of the Fundamentals of Computation Theory - 22nd International Symposium, 2019

2018
Collective Fast Delivery by Energy-Efficient Agents.
Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

2017
Truthful Mechanisms for Delivery with Mobile Agents.
CoRR, 2017

Energy-Efficient Delivery by Heterogeneous Mobile Agents.
Proceedings of the 34th Symposium on Theoretical Aspects of Computer Science, 2017

Energy-Efficient Fast Delivery by Mobile Agents.
Proceedings of the Fundamentals of Computation Theory - 21st International Symposium, 2017

Truthful Mechanisms for Delivery with Agents.
Proceedings of the 17th Workshop on Algorithmic Approaches for Transportation Modelling, 2017

2016
On Computing the Total Displacement Number via Weighted Motzkin Paths.
Proceedings of the Combinatorial Algorithms - 27th International Workshop, 2016

2015
On Conflict-Free Multi-coloring.
Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015

2014
Erratum to: Conflict-Free Chromatic Art Gallery Coverage.
Algorithmica, 2014

Conflict-Free Chromatic Art Gallery Coverage.
Algorithmica, 2014

Improved bounds for the conflict-free chromatic art gallery problem.
Proceedings of the 30th Annual Symposium on Computational Geometry, 2014


  Loading...