default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDElijah Pelofske
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j7]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. Nat. Comput. Sci. 4(11): 865-875 (2024)- [j6]Elijah Pelofske:
Analysis of a Programmable Quantum Annealer as a Random Number Generator. IEEE Trans. Inf. Forensics Secur. 19: 3636-3643 (2024) - [i44]Elijah Pelofske, Vincent Urias, Lorie M. Liebrock:
Automated Multi-Language to English Machine Translation Using Generative Pre-Trained Transformers. CoRR abs/2404.14680 (2024) - [i43]Elijah Pelofske, Vincent Urias, Lorie M. Liebrock:
Automated Creation of Source Code Variants of a Cryptographic Hash Function Implementation Using Generative Pre-Trained Transformer Models. CoRR abs/2404.15681 (2024) - [i42]Elijah Pelofske:
An Efficient All-to-All GCD Algorithm for Low Entropy RSA Key Factorization. CoRR abs/2405.03166 (2024) - [i41]Kyle Henke, Elijah Pelofske, Garrett T. Kenyon, Georg Hahn:
Comparing Quantum Annealing and Spiking Neuromorphic Computing for Sampling Binary Sparse Coding QUBO Problems. CoRR abs/2405.20525 (2024) - [i40]Elijah Pelofske, Vincent Urias, Lorie M. Liebrock:
Automated Software Vulnerability Static Code Analysis Using Generative Pre-Trained Transformer Models. CoRR abs/2408.00197 (2024) - [i39]Elijah Pelofske:
Analysis of a Programmable Quantum Annealer as a Random Number Generator. IACR Cryptol. ePrint Arch. 2024: 212 (2024) - [i38]Elijah Pelofske, Vincent Urias, Lorie M. Liebrock:
Automated Creation of Source Code Variants of a Cryptographic Hash Function Implementation Using Generative Pre-Trained Transformer Models. IACR Cryptol. ePrint Arch. 2024: 689 (2024) - [i37]Elijah Pelofske:
An Efficient All-to-All GCD Algorithm for Low Entropy RSA Key Factorization. IACR Cryptol. ePrint Arch. 2024: 699 (2024) - [i36]Elijah Pelofske, Vincent Urias, Lorie M. Liebrock:
Automated Software Vulnerability Static Code Analysis Using Generative Pre-Trained Transformer Models. IACR Cryptol. ePrint Arch. 2024: 1228 (2024) - 2023
- [j5]Georg Hahn, Elijah Pelofske, Hristo N. Djidjev:
Posiform planting: generating QUBO instances for benchmarking. Frontiers Comput. Sci. 5 (2023) - [j4]Elijah Pelofske, Georg Hahn, Hristo N. Djidjev:
Solving larger maximum clique problems using parallel quantum annealing. Quantum Inf. Process. 22(5): 219 (2023) - [c16]Kyle Henke, Elijah Pelofske, Georg Hahn, Garrett T. Kenyon:
Sampling binary sparse coding QUBO models using a spiking neuromorphic processor. ICONS 2023: 38:1-38:5 - [c15]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 - [c14]John K. Golden, Andreas Bärtschi, Dan O'Malley, Elijah Pelofske, Stephan J. Eidenbenz:
JuliQAOA: Fast, Flexible QAOA Simulation. SC Workshops 2023: 1454-1459 - [c13]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 - [d2]Elijah Pelofske:
Dataset for Comparing Three Generations of D-Wave Quantum Annealers for Minor Embedded Combinatorial Optimization Problems. IEEE DataPort, 2023
- [i35]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) - [i34]Elijah Pelofske:
Comparing Three Generations of D-Wave Quantum Annealers for Minor Embedded Combinatorial Optimization Problems. CoRR abs/2301.03009 (2023) - [i33]Elijah Pelofske:
4-clique network minor embedding for quantum annealers. CoRR abs/2301.08807 (2023) - [i32]Elijah Pelofske, Lorie M. Liebrock, Vincent Urias:
Cybersecurity Threat Hunting and Vulnerability Analysis Using a Neo4j Graph Database of Open Source Intelligence. CoRR abs/2301.12013 (2023) - [i31]Elijah Pelofske, Georg Hahn, Hristo N. Djidjev:
Initial state encoding via reverse quantum annealing and h-gain features. CoRR abs/2303.13748 (2023) - [i30]Kyle Henke, Elijah Pelofske, Georg Hahn, Garrett T. Kenyon:
Sampling binary sparse coding QUBO models using a spiking neuromorphic processor. CoRR abs/2306.01940 (2023) - [i29]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) - [i28]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) - [i27]Elijah Pelofske:
Analysis of a Programmable Quantum Annealer as a Random Number Generator. CoRR abs/2307.02573 (2023) - [i26]Georg Hahn, Elijah Pelofske, Hristo N. Djidjev:
Posiform Planting: Generating QUBO Instances for Benchmarking. CoRR abs/2308.05859 (2023) - [i25]Elijah Pelofske, Andreas Bärtschi, Stephan J. Eidenbenz, Bryan Garcia, Boris Kiefer:
Probing Quantum Telecloning on Superconducting Quantum Processors. CoRR abs/2308.15579 (2023) - [i24]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) - [i23]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) - 2022
- [j3]Elijah Pelofske, Georg Hahn, Hristo N. Djidjev:
Inferring the Dynamics of the State Evolution During Quantum Annealing. IEEE Trans. Parallel Distributed Syst. 33(2): 310-321 (2022) - [c12]Elijah Pelofske, Andreas Bärtschi, Stephan J. Eidenbenz:
Optimized Telecloning Circuits: Theory and Practice of Nine NISQ Clones. ICRC 2022: 51-56 - [c11]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 - [i22]Elijah Pelofske, Andreas Bärtschi, Stephan J. Eidenbenz:
Quantum Volume in Practice: What Users Can Expect from NISQ Devices. CoRR abs/2203.03816 (2022) - [i21]Elijah Pelofske, Andreas Bärtschi, Bryan Garcia, Boris Kiefer, Stephan J. Eidenbenz:
Quantum Telecloning on NISQ Computers. CoRR abs/2205.00125 (2022) - [i20]Elijah Pelofske, Georg Hahn, Hristo N. Djidjev:
Solving Larger Optimization Problems Using Parallel Quantum Annealing. CoRR abs/2205.12165 (2022) - [i19]Elijah Pelofske, Georg Hahn, Hristo N. Djidjev:
Noise Dynamics of Quantum Annealers: Estimating the Effective Noise Using Idle Qubits. CoRR abs/2209.05648 (2022) - [i18]Elijah Pelofske, Andreas Bärtschi, Stephan J. Eidenbenz:
Optimized Telecloning Circuits: Theory and Practice of Nine NISQ Clones. CoRR abs/2210.10164 (2022) - [i17]Elijah Pelofske:
Mapping state transition susceptibility in reverse annealing. CoRR abs/2210.16513 (2022) - 2021
- [j2]Aaron Barbosa, Elijah Pelofske, Georg Hahn, Hristo N. Djidjev:
Using Machine Learning for Quantum Annealing Accuracy Prediction. Algorithms 14(6): 187 (2021) - [j1]Elijah Pelofske, Georg Hahn, Hristo N. Djidjev:
Decomposition Algorithms for Solving NP-hard Problems on a Quantum Annealer. J. Signal Process. Syst. 93(4): 405-420 (2021) - [c10]Elijah Pelofske, Georg Hahn, Hristo N. Djidjev:
Reducing quantum annealing biases for solving the graph partitioning problem. CF 2021: 133-139 - [c9]Elijah Pelofske, Georg Hahn, Daniel O'Malley, Hristo N. Djidjev, Boian S. Alexandrov:
Boolean Hierarchical Tucker Networks on Quantum Annealers. LSSC 2021: 351-358 - [c8]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 - [i16]Elijah Pelofske, Georg Hahn, Hristo N. Djidjev:
Reducing quantum annealing biases for solving the graph partitioning problem. CoRR abs/2103.04963 (2021) - [i15]Elijah Pelofske, Georg Hahn, Daniel O'Malley, Hristo N. Djidjev, Boian S. Alexandrov:
Boolean Hierarchical Tucker Networks on Quantum Annealers. CoRR abs/2103.07399 (2021) - [i14]Aaron Barbosa, Elijah Pelofske, Georg Hahn, Hristo N. Djidjev:
Using machine learning for quantum annealing accuracy prediction. CoRR abs/2106.00065 (2021) - [i13]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) - [i12]Elijah Pelofske, Georg Hahn, Daniel O'Malley, Hristo N. Djidjev, Boian S. Alexandrov:
Quantum Annealing Algorithms for Boolean Tensor Networks. CoRR abs/2107.13659 (2021) - [i11]Elijah Pelofske, Lorie M. Liebrock, Vincent Urias:
An Enhanced Machine Learning Topic Classification Methodology for Cybersecurity. CoRR abs/2109.02473 (2021) - [i10]Elijah Pelofske, Georg Hahn, Hristo N. Djidjev:
Parallel Quantum Annealing. CoRR abs/2111.05995 (2021) - 2020
- [c7]Elijah Pelofske, Georg Hahn, Hristo N. Djidjev:
Advanced unembedding techniques for quantum annealers. ICRC 2020: 34-41 - [c6]Aaron Barbosa, Elijah Pelofske, Georg Hahn, Hristo N. Djidjev:
Optimizing Embedding-Related Quantum Annealing Parameters for Reducing Hardware Bias. PAAP 2020: 162-173 - [c5]Elijah Pelofske, Georg Hahn, Hristo N. Djidjev:
Advanced anneal paths for improved quantum annealing. QCE 2020: 256-266 - [i9]Elijah Pelofske, Georg Hahn, Hristo N. Djidjev:
Advanced anneal paths for improved quantum annealing. CoRR abs/2009.05008 (2020) - [i8]Elijah Pelofske, Georg Hahn, Hristo N. Djidjev:
Advanced unembedding techniques for quantum annealers. CoRR abs/2009.05028 (2020) - [i7]Elijah Pelofske, Georg Hahn, Hristo N. Djidjev:
Inferring the Dynamics of the State Evolution During Quantum Annealing. CoRR abs/2009.06387 (2020) - [i6]Elijah Pelofske, Georg Hahn, Hristo N. Djidjev:
Decomposition algorithms for solving NP-hard problems on a quantum annealer. CoRR abs/2009.06726 (2020) - [i5]Aaron Barbosa, Elijah Pelofske, Georg Hahn, Hristo N. Djidjev:
Optimizing embedding-related quantum annealing parameters for reducing hardware bias. CoRR abs/2011.00719 (2020)
2010 – 2019
- 2019
- [c4]Elijah Pelofske, Georg Hahn, Hristo N. Djidjev:
Solving large minimum vertex cover problems on a quantum annealer. CF 2019: 76-84 - [c3]Elijah Pelofske, Georg Hahn, Hristo N. Djidjev:
Optimizing the Spin Reversal Transform on the D-Wave 2000Q. ICRC 2019: 63-70 - [c2]Elijah Pelofske, Georg Hahn, Hristo N. Djidjev:
Peering Into the Anneal Process of a Quantum Annealer. PDCAT 2019: 184-189 - [i4]Elijah Pelofske, Georg Hahn, Hristo N. Djidjev:
Solving large Maximum Clique problems on a quantum annealer. CoRR abs/1901.07657 (2019) - [i3]Elijah Pelofske, Georg Hahn, Hristo N. Djidjev:
Solving large Minimum Vertex Cover problems on a quantum annealer. CoRR abs/1904.00051 (2019) - [i2]Elijah Pelofske, Georg Hahn, Hristo N. Djidjev:
Optimizing the spin reversal transform on the D-Wave 2000Q. CoRR abs/1906.10955 (2019) - [i1]Elijah Pelofske, Georg Hahn, Hristo N. Djidjev:
Peering into the Anneal Process of a Quantum Annealer. CoRR abs/1908.02691 (2019) - 2017
- [c1]Elijah Pelofske, Georg Hahn, Hristo N. Djidjev:
Solving Large Maximum Clique Problems on a Quantum Annealer. QTOP@NetSys 2017: 123-135
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 2025-01-20 23:01 CET 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:
