Zobrazeno 1 - 10
of 1 865
pro vyhledávání: '"Rall P"'
A $(1,1,2,2)$-coloring of a graph is a partition of its vertex set into four sets two of which are independent and the other two are $2$-packings. In this paper, we prove that every claw-free cubic graph admits a $(1,1,2,2)$-coloring. This implies th
Externí odkaz:
http://arxiv.org/abs/2409.15455
Given a graph $G$ and a family of graphs $\cal F$, an $\cal F$-isolating set, as introduced by Caro and Hansberg, is any set $S\subset V(G)$ such that $G - N[S]$ contains no member of $\cal F$ as a subgraph. In this paper, we introduce a game in whic
Externí odkaz:
http://arxiv.org/abs/2409.14180
In the realm of industrial manufacturing, Artificial Intelligence (AI) is playing an increasing role, from automating existing processes to aiding in the development of new materials and techniques. However, a significant challenge arises in smaller,
Externí odkaz:
http://arxiv.org/abs/2409.10104
Quantum error mitigation (QEM) can recover accurate expectation values from a noisy quantum computer by trading off bias for variance, such that an averaged result is more accurate but takes longer to converge. Probabilistic error cancellation (PEC)
Externí odkaz:
http://arxiv.org/abs/2409.04401
Autor:
Martyn, John M., Rall, Patrick
Quantum signal processing (QSP) provides a systematic framework for implementing a polynomial transformation of a linear operator, and unifies nearly all known quantum algorithms. In parallel, recent works have developed randomized compiling, a techn
Externí odkaz:
http://arxiv.org/abs/2409.03744
In this paper, we introduce the gauge-fixed QLDPC surgery scheme, an improved logical measurement scheme based on the construction of Cohen et al.~(Sci.~Adv.~8, eabn1717). Our scheme leverages expansion properties of the Tanner graph to substantially
Externí odkaz:
http://arxiv.org/abs/2407.18393
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, Emanuel, 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
Publikováno v:
Future Generation Computer Systems, Volume 160, November 2024, Pages 666-710
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
Publikováno v:
Proceedings of the 2023 7th International Conference on Cloud and Big Data Computing 34-39
Recent AI research has significantly reduced the barriers to apply AI, but the process of setting up the necessary tools and frameworks can still be a challenge. While AI-as-a-Service platforms have emerged to simplify the training and deployment of
Externí odkaz:
http://arxiv.org/abs/2311.04518
Motivated by the success of domination games and by a variation of the coloring game called the indicated coloring game, we introduce a version of domination games called the indicated domination game. It is played on an arbitrary graph $G$ by two pl
Externí odkaz:
http://arxiv.org/abs/2310.14647
Autor:
Henning, Michael A., Rall, Douglas F.
A vertex $u$ in a graph $G$ totally dominates a vertex $v$ if $u$ is adjacent to $v$ in $G$. A total dominating set of $G$ is a set $S$ of vertices of $G$ such that every vertex of $G$ is totally dominated by a vertex in $S$. The indicated total domi
Externí odkaz:
http://arxiv.org/abs/2310.03506