default search action
Ammar Daskin
Person information
- affiliation: Istanbul Medeniyet University, Turkey
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i25]Ammar Daskin:
Federated learning with distributed fixed design quantum chips and quantum channels. CoRR abs/2401.13421 (2024) - [i24]Ammar Daskin:
A unifying primary framework for quantum graph neural networks from quantum graph states. CoRR abs/2402.13001 (2024) - [i23]Ammar Daskin:
A quantum compiler design method by using linear combinations of permutations. CoRR abs/2404.18226 (2024) - [i22]Ammar Daskin:
Quantum Kolmogorov-Arnold networks by combining quantum signal processing circuits. CoRR abs/2410.04218 (2024) - 2023
- [i21]Ammar Daskin:
On the explainability of quantum neural networks based on variational quantum circuits. CoRR abs/2301.05549 (2023) - [i20]Ammar Daskin, Rishabh Gupta, Sabre Kais:
Dimension reduction and redundancy removal through successive Schmidt decompositions. CoRR abs/2302.04801 (2023) - [i19]Ammar Daskin:
A Simple Quantum Blockmodeling with Qubits and Permutations. CoRR abs/2311.07726 (2023) - 2022
- [i18]Ammar Daskin:
A walk through of time series analysis on quantum computers. CoRR abs/2205.00986 (2022) - [i17]Ammar Daskin:
Quantum implementation of circulant matrices and its use in quantum string processing. CoRR abs/2206.09364 (2022) - 2021
- [j9]Ammar Daskin
:
Combinatorial optimization through variational quantum power method. Quantum Inf. Process. 20(10): 336 (2021) - 2020
- [j8]Ammar Daskin
The quantum version of the shifted power method and its application in quadratic binary optimization. Turkish J. Electr. Eng. Comput. Sci. 28(4): 2088-2095 (2020)
2010 – 2019
- 2019
- [j7]Ammar Daskin
Context-aware quantum simulation of a matrix stored in quantum memory. Quantum Inf. Process. 18(12): 357 (2019) - 2018
- [j6]Ammar Daskin
A generalized circuit for the Hamiltonian dynamics through the truncated series. Quantum Inf. Process. 17(12): 328 (2018) - [c1]Ammar Daskin
A Simple Quantum Neural Net with a Periodic Activation Function. SMC 2018: 2887-2891 - [i16]Ammar Daskin, Sabre Kais:
A Generalized Circuit for the Hamiltonian Dynamics Through the Truncated Series. CoRR abs/1801.09720 (2018) - [i15]Ammar Daskin:
A Simple Quantum Neural Net with a Periodic Activation Function. CoRR abs/1804.07633 (2018) - 2017
- [j5]Ammar Daskin
An ancilla-based quantum simulation framework for non-unitary matrices. Quantum Inf. Process. 16(1): 33 (2017) - [i14]Ammar Daskin, Sabre Kais:
Direct Application of the Phase Estimation Algorithm to Find the Eigenvalues of the Hamiltonians. CoRR abs/1703.03597 (2017) - [i13]Ammar Daskin:
Quantum Spectral Clustering through a Biased Phase Estimation Algorithm. CoRR abs/1703.05568 (2017) - [i12]Ammar Daskin:
A Quantum Approach to Subset-Sum and Similar Problems. CoRR abs/1707.08730 (2017) - 2016
- [j4]Ammar Daskin
Obtaining a linear combination of the principal components of a matrix on quantum computers. Quantum Inf. Process. 15(10): 4013-4027 (2016) - [i11]Ammer Daskin, Sabre Kais:
An Ancilla Based Quantum Simulation Framework for Non-Unitary Matrices. CoRR abs/1606.04315 (2016) - [i10]Ammar Daskin:
A Quantum Implementation Model for Artificial Neural Networks. CoRR abs/1609.05884 (2016) - 2015
- [j3]Katherine L. Brown, Anmer Daskin
Reducing the number of ancilla qubits and the gate count required for creating large controlled operations. Quantum Inf. Process. 14(3): 891-899 (2015) - [i9]Anmer Daskin:
A Modified Phase Estimation Algorithm to Compute the Eigenvalue of a Matrix with a Positive Eigenvector. CoRR abs/1505.02984 (2015) - [i8]Anmer Daskin:
Quantum IsoRank: Efficient Alignment of Multiple PPI Networks. CoRR abs/1506.05905 (2015) - [i7]Anmer Daskin:
Principal Component Analysis on Quantum Computers. CoRR abs/1512.02109 (2015) - 2014
- [b1]Ammar Daskin:
Quantum circuit design methods and applications. Purdue University, USA, 2014 - [j2]Anmer Daskin
A universal quantum circuit scheme for finding complex eigenvalues. Quantum Inf. Process. 13(2): 333-353 (2014) - [j1]Anmer Daskin
Multiple network alignment on quantum computers. Quantum Inf. Process. 13(12): 2653-2666 (2014) - [i6]Anmer Daskin, Ananth Grama, Sabre Kais:
Quantum Random State Generation with Predefined Entanglement Constraint. CoRR abs/1403.0270 (2014) - 2013
- [i5]Anmer Daskin, Ananth Grama, Sabre Kais:
A Universal Quantum Circuit Scheme For Finding Complex Eigenvalues of Non-unitary Matrices. CoRR abs/1302.0579 (2013) - [i4]Anmer Daskin, Ananth Grama, Sabre Kais:
Multiple Network Alignment on Quantum Computers. CoRR abs/1307.7220 (2013) - 2012
- [i3]Anmer Daskin, Ananth Grama, Giorgios Kollias, Sabre Kais:
Universal Programmable Quantum Circuit Schemes to Emulate an Operator. CoRR abs/1204.3600 (2012) - 2010
- [i2]Anmer Daskin, Sabre Kais:
Group Leaders Optimization Algorithm. CoRR abs/1004.2242 (2010) - [i1]Anmer Daskin, Sabre Kais:
Decomposition of Unitary Matrices for Finding Quantum Circuits. CoRR abs/1009.5625 (2010)
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-12-01 01:13 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: