default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDavid Bucher
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c4]Arnold Unterauer
, David Bucher, Matthias Knoll, Constantin Economides, Michael Lachner, Thomas Germain, Moritz Kessel, Smajo Hajdinovic, Jonas Stein:
Solving the Turbine Balancing Problem using Quantum Annealing. GECCO Companion 2024: 1972-1978- [c3]Jonas Stein, Tobias Rohe, Francesco Nappi, Julian Hager, David Bucher, Maximilian Zorn, Michael Kölle, Claudia Linnhoff-Popien:
Introducing Reduced-Width QNNs, an AI-Inspired Ansatz Design Pattern. ICAART (3) 2024: 1127-1134 - [i7]Arnold Unterauer, David Bucher, Matthias Knoll, Constantin Economides, Michael Lachner, Thomas Germain, Moritz Kessel, Smajo Hajdinovic, Jonas Stein:
Solving the Turbine Balancing Problem using Quantum Annealing. CoRR abs/2405.06412 (2024) - [i6]David Bucher, Nico Kraus, Jonas Blenninger, Michael Lachner, Jonas Stein, Claudia Linnhoff-Popien:
Towards Robust Benchmarking of Quantum Optimization Algorithms. CoRR abs/2405.07624 (2024) - [i5]Jonas Stein, Jonas Blenninger, David Bucher, Josef Peter Eder, Elif Çetiner, Maximilian Zorn, Claudia Linnhoff-Popien:
CUAOA: A Novel CUDA-Accelerated Simulation Framework for the QAOA. CoRR abs/2407.13012 (2024) - [i4]Jonas Nüßlein, Daniëlle Schuman, David Bucher, Naeimeh Mohseni, Kumar Jang Bahadur Ghosh, Corey O'Meara, Giorgio Cortiana, Claudia Linnhoff-Popien:
Towards Less Greedy Quantum Coalition Structure Generation in Induced Subgraph Games. CoRR abs/2408.04366 (2024) - 2023
- [c2]Petros Stougiannidis, Jonas Stein, David Bucher, Sebastian Zielinski, Claudia Linnhoff-Popien, Sebastian Feld:
Approximative Lookup-Tables and Arbitrary Function Rotations for Facilitating NISQ-Implementations of the HHL and Beyond. QCE 2023: 151-160 - [c1]Maximilian Balthasar Mansky, Jonas Nüßlein, David Bucher, Daniëlle Schuman, Sebastian Zielinski, Claudia Linnhoff-Popien:
Sampling problems on a Quantum Computer. QCE 2023: 485-495 - [i3]Jonas Stein, Jezer Jojo, Afrah Farea, David Bucher, Philipp Altmann, Claudia Linnhoff-Popien:
Combining the QAOA and HHL Algorithm to achieve a Substantial Quantum Speedup for the Unit Commitment Problem. CoRR abs/2305.08482 (2023) - [i2]Petros Stougiannidis, Jonas Stein, David Bucher, Sebastian Zielinski, Claudia Linnhoff-Popien, Sebastian Feld:
Approximative lookup-tables and arbitrary function rotations for facilitating NISQ-implementations of the HHL and beyond. CoRR abs/2306.05024 (2023) - [i1]Jonas Stein, Tobias Rohe, Francesco Nappi, Julian Hager, David Bucher, Maximilian Zorn, Michael Kölle, Claudia Linnhoff-Popien:
Introducing Reducing-Width-QNNs, an AI-inspired Ansatz design pattern. CoRR abs/2306.05047 (2023)
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-07 22:15 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:
