default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDanylo Lykov
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c7]Milan Shah, Xiaodong Yu, Sheng Di, Danylo Lykov
, Yuri Alexeev, Michela Becchi, Franck Cappello:
GPU-Accelerated Error-Bounded Compression Framework for Quantum Circuit Simulations. IPDPS 2023: 757-767- [c6]Danylo Lykov, Ruslan Shaydulin, Yue Sun, Yuri Alexeev, Marco Pistoia:
Fast Simulation of High-Depth QAOA Circuits. SC Workshops 2023: 1443-1451 - [i7]Ruslan Shaydulin, Changhao Li, Shouvanik Chakrabarti, Matthew DeCross, Dylan Herman, Niraj Kumar, Jeffrey Larson, Danylo Lykov, Pierre Minssen, Yue Sun, Yuri Alexeev, Joan M. Dreiling, John P. Gaebler, Thomas M. Gatterman, Justin A. Gerber, Kevin Gilmore, Dan Gresh, Nathan Hewitt, Chandler V. Horst, Shaohan Hu, Jacob Johansen, Mitchell Matheny, Tanner Mengle, Michael Mills, Steven A. Moses, Brian Neyenhuis, Peter Siegfried, Romina Yalovetzky, Marco Pistoia:
Evidence of Scaling Advantage for the Quantum Approximate Optimization Algorithm on a Classically Intractable Problem. CoRR abs/2308.02342 (2023) - [i6]Danylo Lykov, Ruslan Shaydulin, Yue Sun, Yuri Alexeev, Marco Pistoia:
Fast Simulation of High-Depth QAOA Circuits. CoRR abs/2309.04841 (2023) - [i5]Ankit Kulshrestha, Danylo Lykov, Ilya Safro, Yuri Alexeev:
QArchSearch: A Scalable Quantum Architecture Search Package. CoRR abs/2310.07858 (2023) - 2022
- [c5]Cameron Ibrahim, Danylo Lykov, Zichang He, Yuri Alexeev, Ilya Safro:
Constructing Optimal Contraction Trees for Tensor Network Quantum Circuit Simulation. HPEC 2022: 1-8 - [c4]Minzhao Liu, Junyu Liu, Rui Liu, Henry Makhanov, Danylo Lykov, Anuj Apte, Yuri Alexeev:
Embedding Learning in Hybrid Quantum-Classical Neural Networks. QCE 2022: 79-86 - [c3]Danylo Lykov, Roman Schutski, Alexey Galda, Valeri Vinokur, Yuri Alexeev:
Tensor Network Quantum Simulator With Step-Dependent Parallelization. QCE 2022: 582-593 - [i4]Danylo Lykov, Angela Chen, Huaxuan Chen, Kristopher Keipert, Zheng Zhang, Tom Gibbs, Yuri Alexeev:
Performance Evaluation and Acceleration of the QTensor Quantum Circuit Simulator on GPUs. CoRR abs/2204.06045 (2022) - [i3]Danylo Lykov, Jonathan Wurtz, Cody Poole, Mark Saffman, Tom Noel, Yuri Alexeev:
Sampling Frequency Thresholds for Quantum Advantage of Quantum Approximate Optimization Algorithm. CoRR abs/2206.03579 (2022) - [i2]Cameron Ibrahim, Danylo Lykov, Zichang He, Yuri Alexeev, Ilya Safro:
Constructing Optimal Contraction Trees for Tensor Network Quantum Circuit Simulation. CoRR abs/2209.02895 (2022) - 2021
- [c2]Danylo Lykov, Yuri Alexeev:
Importance of Diagonal Gates in Tensor Network Simulations. ISVLSI 2021: 447-452 - [c1]Alexey Galda, Xiaoyuan Liu, Danylo Lykov, Yuri Alexeev, Ilya Safro:
Transferability of optimal QAOA parameters between random graphs. QCE 2021: 171-180 - [i1]Danylo Lykov, Yuri Alexeev:
Importance of Diagonal Gates in Tensor Network Simulations. CoRR abs/2106.15740 (2021)
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-05-08 21:42 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:
