Zobrazeno 1 - 10
of 13 027
pro vyhledávání: '"is Faro"'
This paper explores artificial intelligence (AI) methods for the approximate compiling of unitaries, focusing on the use of fixed two-qubit gates and arbitrary single-qubit rotations typical in superconducting hardware. Our approach involves three ma
Externí odkaz:
http://arxiv.org/abs/2407.21225
In this paper we study higher even Gaussian maps of the canonical bundle on hyperelliptic curves and we determine their rank, giving explicit descriptions of their kernels. Then we use this descriptions to investigate the hyperelliptic Torelli map $j
Externí odkaz:
http://arxiv.org/abs/2406.17408
Autor:
Vishwakarma, Sanjay, Harkins, Francis, Golecha, Siddharth, Bajpe, Vishal Sharathchandra, Dupuis, Nicolas, Buratti, Luca, Kremer, David, Faro, Ismael, Puri, Ruchir, Cruz-Benito, Juan
Quantum programs are typically developed using quantum Software Development Kits (SDKs). The rapid advancement of quantum computing necessitates new tools to streamline this development process, and one such tool could be Generative Artificial intell
Externí odkaz:
http://arxiv.org/abs/2406.14712
Autor:
Dupuis, Nicolas, Buratti, Luca, Vishwakarma, Sanjay, Forrat, Aitana Viudes, Kremer, David, Faro, Ismael, Puri, Ruchir, Cruz-Benito, Juan
Code Large Language Models (Code LLMs) have emerged as powerful tools, revolutionizing the software development landscape by automating the coding process and reducing time and effort required to build applications. This paper focuses on training Cod
Externí odkaz:
http://arxiv.org/abs/2405.19495
This paper demonstrates the integration of Reinforcement Learning (RL) into quantum transpiling workflows, significantly enhancing the synthesis and routing of quantum circuits. By employing RL, we achieve near-optimal synthesis of Linear Function, C
Externí odkaz:
http://arxiv.org/abs/2405.13196
Autor:
Alexeev, Yuri, Amsler, Maximilian, Baity, Paul, Barroca, Marco Antonio, Bassini, Sanzio, Battelle, Torey, Camps, Daan, Casanova, David, Choi, Young jai, Chong, Frederic T., Chung, Charles, Codella, Chris, Corcoles, Antonio D., Cruise, James, Di Meglio, Alberto, Dubois, Jonathan, Duran, Ivan, Eckl, Thomas, Economou, Sophia, Eidenbenz, Stephan, Elmegreen, Bruce, Fare, Clyde, Faro, Ismael, Fernández, Cristina Sanz, Ferreira, Rodrigo Neumann Barros, Fuji, Keisuke, Fuller, Bryce, Gagliardi, Laura, Galli, Giulia, Glick, Jennifer R., Gobbi, Isacco, Gokhale, Pranav, Gonzalez, Salvador de la Puente, Greiner, Johannes, Gropp, Bill, Grossi, Michele, Gull, Emmanuel, Healy, Burns, Huang, Benchen, Humble, Travis S., Ito, Nobuyasu, Izmaylov, Artur F., Javadi-Abhari, Ali, Jennewein, Douglas, Jha, Shantenu, Jiang, Liang, Jones, Barbara, de Jong, Wibe Albert, Jurcevic, Petar, Kirby, William, Kister, Stefan, Kitagawa, Masahiro, Klassen, Joel, Klymko, Katherine, Koh, Kwangwon, Kondo, Masaaki, Kurkcuoglu, Doga Murat, Kurowski, Krzysztof, Laino, Teodoro, Landfield, Ryan, Leininger, Matt, Leyton-Ortega, Vicente, Li, Ang, Lin, Meifeng, Liu, Junyu, Lorente, Nicolas, Luckow, Andre, Martiel, Simon, Martin-Fernandez, Francisco, Martonosi, Margaret, Marvinney, Claire, Medina, Arcesio Castaneda, Merten, Dirk, Mezzacapo, Antonio, Michielsen, Kristel, Mitra, Abhishek, Mittal, Tushar, Moon, Kyungsun, Moore, Joel, Motta, Mario, Na, Young-Hye, Nam, Yunseong, Narang, Prineha, Ohnishi, Yu-ya, Ottaviani, Daniele, Otten, Matthew, Pakin, Scott, Pascuzzi, Vincent R., Penault, Ed, Piontek, Tomasz, Pitera, Jed, Rall, Patrick, Ravi, Gokul Subramanian, Robertson, Niall, Rossi, Matteo, Rydlichowski, Piotr, Ryu, Hoon, Samsonidze, Georgy, Sato, Mitsuhisa, Saurabh, Nishant, Sharma, Vidushi, Sharma, Kunal, Shin, Soyoung, Slessman, George, Steiner, Mathias, Sitdikov, Iskandar, Suh, In-Saeng, Switzer, Eric, Tang, Wei, Thompson, Joel, Todo, Synge, Tran, Minh, Trenev, Dimitar, Trott, Christian, Tseng, Huan-Hsin, Tureci, Esin, Valinas, David García, Vallecorsa, Sofia, Wever, Christopher, Wojciechowski, Konrad, Wu, Xiaodi, Yoo, Shinjae, Yoshioka, Nobuyuki, Yu, Victor Wen-zhe, Yunoki, Seiji, Zhuk, Sergiy, Zubarev, Dmitry
Computational models are an essential tool for the design, characterization, and discovery of novel materials. Hard computational tasks in materials science stretch the limits of existing high-performance supercomputing centers, consuming much of the
Externí odkaz:
http://arxiv.org/abs/2312.09733
Online string matching is a computational problem involving the search for patterns or substrings in a large text dataset, with the pattern and text being processed sequentially, without prior access to the entire text. Its relevance stems from appli
Externí odkaz:
http://arxiv.org/abs/2310.15711
Publikováno v:
Journal of Enterprise Information Management, 2024, Vol. 37, Issue 4, pp. 1206-1226.
Externí odkaz:
http://www.emeraldinsight.com/doi/10.1108/JEIM-10-2023-0567
The Longest Common Substring (LCS) and Longest Palindromic Substring (LPS) are classical problems in computer science, representing fundamental challenges in string processing. Both problems can be solved in linear time using a classical model of com
Externí odkaz:
http://arxiv.org/abs/2309.01250
Quantum computation represents a computational paradigm whose distinctive attributes confer the ability to devise algorithms with asymptotic performance levels significantly superior to those achievable via classical computation. Recent strides have
Externí odkaz:
http://arxiv.org/abs/2308.11758