default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndreas Bärtschi
Person information
- affiliation: Los Alamos National Laboratory, NM, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c28]Joel Rajakumar
, John K. Golden, Andreas Bärtschi, Stephan J. Eidenbenz:
Trainability Barriers in Low-Depth QAOA Landscapes. CF 2024- [c27]Christo Meriwether Keller, Stephan J. Eidenbenz, Andreas Bärtschi, Daniel O'Malley, John K. Golden, Satyajayant Misra:
Hierarchical Multigrid Ansatz for Variational Quantum Algorithms. ISC 2024: 1-11 - [i28]Joel Rajakumar, John K. Golden, Andreas Bärtschi, Stephan J. Eidenbenz:
Trainability Barriers in Low-Depth QAOA Landscapes. CoRR abs/2402.10188 (2024) - [i27]Shamminuj Aktar, Andreas Bärtschi, Diane Oyen, Stephan J. Eidenbenz, Abdel-Hameed A. Badawy:
Graph Neural Networks for Parameterized Quantum Circuits Expressibility Estimation. CoRR abs/2405.08100 (2024) - 2023
- [c26]Shamminuj Aktar, Abdel-Hameed A. Badawy, Andreas Bärtschi, Stephan J. Eidenbenz:
Scalable Experimental Bounds for Dicke and GHZ States Fidelities. CF 2023: 176-184 - [c25]John K. Golden, Andreas Bärtschi, Daniel O'Malley, Stephan J. Eidenbenz:
The Quantum Alternating Operator Ansatz for Satisfiability Problems. QCE 2023: 307-312 - [c24]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: 401-402 - [c23]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: 496-505 - [c22]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: 506-517 - [c21]John K. Golden, Andreas Bärtschi, Dan O'Malley, Elijah Pelofske, Stephan J. Eidenbenz:
JuliQAOA: Fast, Flexible QAOA Simulation. SC Workshops 2023: 1454-1459 - [c20]Elijah Pelofske, Andreas Bärtschi, Stephan J. Eidenbenz:
Quantum Annealing vs. QAOA: 127 Qubit Higher-Order Ising Problems on NISQ Computers. ISC 2023: 240-258 - [i26]Elijah Pelofske, Andreas Bärtschi, Stephan J. Eidenbenz:
Quantum Annealing vs. QAOA: 127 Qubit Higher-Order Ising Problems on NISQ Computers. CoRR abs/2301.00520 (2023) - [i25]John K. Golden, Andreas Bärtschi, Daniel O'Malley, Stephan J. Eidenbenz:
The Quantum Alternating Operator Ansatz for Satisfiability Problems. CoRR abs/2301.11292 (2023) - [i24]Elijah Pelofske, Andreas Bärtschi, John K. Golden, Stephan J. Eidenbenz:
High-Round QAOA for MAX k-SAT on Trapped Ion NISQ Devices. CoRR abs/2306.03238 (2023) - [i23]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 abs/2306.15863 (2023) - [i22]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 abs/2308.15442 (2023) - [i21]Elijah Pelofske, Andreas Bärtschi, Stephan J. Eidenbenz, Bryan Garcia, Boris Kiefer:
Probing Quantum Telecloning on Superconducting Quantum Processors. CoRR abs/2308.15579 (2023) - [i20]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 abs/2312.00733 (2023) - [i19]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 abs/2312.00997 (2023) - [i18]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 abs/2312.15048 (2023) - 2022
- [c19]Elijah Pelofske, Andreas Bärtschi, Stephan J. Eidenbenz:
Optimized Telecloning Circuits: Theory and Practice of Nine NISQ Clones. ICRC 2022: 51-56 - [c18]Andreas Bärtschi, Stephan J. Eidenbenz:
Short-Depth Circuits for Dicke State Preparation. QCE 2022: 87-96 - [c17]Elijah Pelofske, Andreas Bärtschi, Bryan Garcia, Boris Kiefer, Stephan J. Eidenbenz:
Quantum Telecloning on NISQ Computers. QCE 2022: 605-616 - [d1]Elijah Pelofske, Andreas Bärtschi, Stephan J. Eidenbenz:
Quantum Volume in Practice: What Users Can Expect from NISQ Devices Dataset. IEEE DataPort, 2022
- [i17]John K. Golden, Andreas Bärtschi, Stephan J. Eidenbenz, Daniel O'Malley:
Evidence for Super-Polynomial Advantage of QAOA over Unstructured Search. CoRR abs/2202.00648 (2022) - [i16]Elijah Pelofske, Andreas Bärtschi, Stephan J. Eidenbenz:
Quantum Volume in Practice: What Users Can Expect from NISQ Devices. CoRR abs/2203.03816 (2022) - [i15]Elijah Pelofske, Andreas Bärtschi, Bryan Garcia, Boris Kiefer, Stephan J. Eidenbenz:
Quantum Telecloning on NISQ Computers. CoRR abs/2205.00125 (2022) - [i14]Andreas Bärtschi, Stephan J. Eidenbenz:
Short-Depth Circuits for Dicke State Preparation. CoRR abs/2207.09998 (2022) - [i13]Shamminuj Aktar, Andreas Bärtschi, Abdel-Hameed A. Badawy, Stephan J. Eidenbenz:
Scalable Experimental Bounds for Entangled Quantum State Fidelities. CoRR abs/2210.03048 (2022) - [i12]Elijah Pelofske, Andreas Bärtschi, Stephan J. Eidenbenz:
Optimized Telecloning Circuits: Theory and Practice of Nine NISQ Clones. CoRR abs/2210.10164 (2022) - 2021
- [j4]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: 35-46 (2021) - [c16]John K. Golden, Andreas Bärtschi, Daniel O'Malley, Stephan J. Eidenbenz:
Threshold-Based Quantum Optimization. QCE 2021: 137-147 - [c15]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: 207-217 - [i11]John K. Golden, Andreas Bärtschi, Daniel O'Malley, Stephan J. Eidenbenz:
QAOA-based Fair Sampling on NISQ Devices. CoRR abs/2101.03258 (2021) - [i10]John K. Golden, Andreas Bärtschi, Daniel O'Malley, Stephan J. Eidenbenz:
Threshold-Based Quantum Optimization. CoRR abs/2106.13860 (2021) - [i9]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 abs/2107.06468 (2021) - [i8]Shamminuj Aktar, Andreas Bärtschi, Abdel-Hameed A. Badawy, Stephan J. Eidenbenz:
A Divide-and-Conquer Approach to Dicke State Preparation. CoRR abs/2112.12435 (2021) - 2020
- [j3]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: 2-14 (2020) - [c14]Andreas Bärtschi, Stephan J. Eidenbenz:
Grover Mixers for QAOA: Shifting Complexity from Mixer Design to State Preparation. QCE 2020: 72-82 - [c13]Jeremy Cook, Stephan J. Eidenbenz, Andreas Bärtschi:
The Quantum Alternating Operator Ansatz on Maximum k-Vertex Cover. QCE 2020: 83-92 - [c12]Stefanie Zbinden, Andreas Bärtschi, Hristo N. Djidjev, Stephan J. Eidenbenz:
Embedding Algorithms for Quantum Annealers with Chimera and Pegasus Connection Topologies. ISC 2020: 187-206 - [i7]Andreas Bärtschi, Stephan J. Eidenbenz:
Grover Mixers for QAOA: Shifting Complexity from Mixer Design to State Preparation. CoRR abs/2006.00354 (2020)
2010 – 2019
- 2019
- [c11]Andreas Bärtschi, Stephan J. Eidenbenz:
Deterministic Preparation of Dicke States. FCT 2019: 126-139 - [c10]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: 52-65 - [i6]Andreas Bärtschi, Stephan J. Eidenbenz:
Deterministic Preparation of Dicke States. CoRR abs/1904.07358 (2019) - 2018
- [c9]Andreas Bärtschi, Daniel Graf, Matús Mihalák:
Collective Fast Delivery by Energy-Efficient Agents. MFCS 2018: 56:1-56:16 - [i5]Andreas Bärtschi, Daniel Graf, Matús Mihalák:
Collective fast delivery by energy-efficient agents. CoRR abs/1809.00077 (2018) - 2017
- [c8]Andreas Bärtschi, Daniel Graf, Paolo Penna:
Truthful Mechanisms for Delivery with Agents. ATMOS 2017: 2:1-2:17 - [c7]Andreas Bärtschi, Thomas Tschager:
Energy-Efficient Fast Delivery by Mobile Agents. FCT 2017: 82-95 - [c6]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: 10:1-10:14 - [i4]Andreas Bärtschi, Daniel Graf, Paolo Penna:
Truthful Mechanisms for Delivery with Mobile Agents. CoRR abs/1702.07665 (2017) - 2016
- [c5]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: 423-434 - [c4]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: 258-274 - [i3]Andreas Bärtschi, Barbara Geissmann, Daniel Graf, Tomas Hruz, Paolo Penna, Thomas Tschager:
On computing the total displacement number via weighted Motzkin paths. CoRR abs/1606.05538 (2016) - [i2]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 abs/1608.08500 (2016) - [i1]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 abs/1610.02361 (2016) - 2015
- [c3]Andreas Bärtschi, Fabrizio Grandoni:
On Conflict-Free Multi-coloring. WADS 2015: 103-114 - 2014
- [j2]Andreas Bärtschi, Subhash Suri:
Conflict-Free Chromatic Art Gallery Coverage. Algorithmica 68(1): 265-283 (2014) - [j1]Andreas Bärtschi, Subhash Suri:
Erratum to: Conflict-Free Chromatic Art Gallery Coverage. Algorithmica 68(1): 284-285 (2014) - [c2]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: 144 - 2012
- [c1]Andreas Bärtschi, Subhash Suri:
Conflict-free Chromatic Art Gallery Coverage. STACS 2012: 160-171
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-18 20:30 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
