Zobrazeno 1 - 10
of 5 957
pro vyhledávání: '"P. Żak"'
Autor:
A. Garbacz-Klempka, M. Piękoś, M. Perek-Nowak, J. Kozana, P. Żak, A. Fijołek, P. Silska, M. Stróżyk
Publikováno v:
Archives of Metallurgy and Materials, Vol vol. 67, Iss No 3, Pp 1125-1136 (2022)
One of the most interesting categories of artifacts for archaeometallurgical research includes deposits of bronze items, so-called “metallurgists hoards”. They contain, aside of final products, many fragments of raw material and, moreover, metall
Externí odkaz:
https://doaj.org/article/95f758d5646d47cf9fa9d7f24311fac9
Semantic representations are integral to natural language processing, psycholinguistics, and artificial intelligence. Although often derived from internet text, recent years have seen a rise in the popularity of behavior-based (e.g., free association
Externí odkaz:
http://arxiv.org/abs/2412.04936
Autor:
Szczepanik, Michal, Zak, Emil
We present a new method for state preparation using the Unitary Vibrational Coupled-Cluster (UVCC) technique. Our approach utilizes redundancies in the Hilbert space in the direct mapping of vibrational modes into qubits. By eliminating half of the q
Externí odkaz:
http://arxiv.org/abs/2412.03955
Autor:
Deka, Konrad, Zak, Emil
In fault-tolerant quantum computing, the cost of calculating Hamiltonian eigenvalues using the quantum phase estimation algorithm is proportional to the constant scaling the Hamiltonian matrix block-encoded in a unitary circuit. We present a method t
Externí odkaz:
http://arxiv.org/abs/2412.01338
Computational analysis of whole slide images (WSIs) has seen significant research progress in recent years, with applications ranging across important diagnostic and prognostic tasks such as survival or cancer subtype prediction. Many state-of-the-ar
Externí odkaz:
http://arxiv.org/abs/2411.18225
Autor:
Mohseni, Masoud, Scherer, Artur, Johnson, K. Grace, Wertheim, Oded, Otten, Matthew, Aadit, Navid Anjum, Bresniker, Kirk M., Camsari, Kerem Y., Chapman, Barbara, Chatterjee, Soumitra, Dagnew, Gebremedhin A., Esposito, Aniello, Fahim, Farah, Fiorentino, Marco, Khalid, Abdullah, Kong, Xiangzhou, Kulchytskyy, Bohdan, Li, Ruoyu, Lott, P. Aaron, Markov, Igor L., McDermott, Robert F., Pedretti, Giacomo, Gajjar, Archit, Silva, Allyson, Sorebo, John, Spentzouris, Panagiotis, Steiner, Ziv, Torosov, Boyan, Venturelli, Davide, Visser, Robert J., Webb, Zak, Zhan, Xin, Cohen, Yonatan, Ronagh, Pooya, Ho, Alan, Beausoleil, Raymond G., Martinis, John M.
In the span of four decades, quantum computation has evolved from an intellectual curiosity to a potentially realizable technology. Today, small-scale demonstrations have become possible for quantum algorithmic primitives on hundreds of physical qubi
Externí odkaz:
http://arxiv.org/abs/2411.10406
Autor:
Silva, Allyson, Scherer, Artur, Webb, Zak, Khalid, Abdullah, Kulchytskyy, Bohdan, Kramer, Mia, Nguyen, Kevin, Kong, Xiangzhou, Dagnew, Gebremedhin A., Wang, Yumeng, Nguyen, Huy Anh, Olfert, Katiemarie, Ronagh, Pooya
We propose a novel technique for optimizing a modular fault-tolerant quantum computing architecture, taking into account any desired space-time trade--offs between the number of physical qubits and the fault-tolerant execution time of a quantum algor
Externí odkaz:
http://arxiv.org/abs/2411.04270
Autor:
Saul, Rebecca, Liu, Chang, Fleischmann, Noah, Zak, Richard, Micinski, Kristopher, Raff, Edward, Holt, James
Binary analysis is a core component of many critical security tasks, including reverse engineering, malware analysis, and vulnerability detection. Manual analysis is often time-consuming, but identifying commonly-used or previously-seen functions can
Externí odkaz:
http://arxiv.org/abs/2410.22677
We investigate the effect of a Heaviside cut-off on the front propagation dynamics of the so-called Burgers-FisherKolmogoroff-Petrowskii-Piscounov (Burgers-FKPP) advection-reaction-diffusion equation. We prove the existence and uniqueness of a travel
Externí odkaz:
http://arxiv.org/abs/2410.08763
Recent work showing the existence of conflict-free almost-perfect hypergraph matchings has found many applications. We show that, assuming certain simple degree and codegree conditions on the hypergraph $ \mathcal{H} $ and the conflicts to be avoided
Externí odkaz:
http://arxiv.org/abs/2407.18144