相关论文: FeynCraft: A Game of Feynman Diagrams

Motivated by non-local games and quantum coloring problems, we introduce a graph homomorphism game between quantum graphs and classical graphs. This game is naturally cast as a "quantum-classical game"--that is, a non-local game of two…

The Decodoku project seeks to let users get hands-on with cutting-edge quantum research through a set of simple puzzle games. The design of these games is explicitly based on the problem of decoding qudit variants of surface codes. This…

Feynman's diagrammatic series is a common language for a formally exact theoretical description of systems of infinitely-many interacting quantum particles, as well as a foundation for precision computational techniques. Here we introduce a…

We provide a detailed exposition of the connections between Boltzmann machines commonly utilized in machine learning problems and the ideas already well known in quantum statistical mechanics through Feynman's description of the same. We…

This thesis examines the correspondence between models of statistical physics and Feynman graphs of quantum field theories (QFTs) by a common property: integrability. We review integrable structures for periodic boundary conditions on both…

Crowdscience games may hold unique potentials as learning opportunities compared to games made for fun or education. They are part of an actual science problem solving process: By playing, players help scientists, and thereby interact with…

Objective: To figure out the underlying physics of QFTs by following the Feynman heuristics lore: I think equation guessing might be the best method to proceed to obtain the laws for the part of physics which is presently unknown.…

Machine learning techniques have recently been adopted in various applications in medicine, biology, chemistry, and material engineering. An important task is to predict the properties of molecules, which serves as the main subroutine in…

We develop and implement two realizations of quantum graph neural networks (QGNN), applied to the task of particle interaction simulation. The first QGNN is a speculative quantum-classical hybrid learning model that relies on the ability to…

An alternating graph is a directed graph whose vertex set is partitioned into two classes, existential and universal. This forms the basic arena for a plethora of infinite duration two-player games where Player~$\square$ and~$\ocircle$…

Nuclear and particle physics are the core components of most undergraduate and postgraduate physics courses worldwide. While few fundamental concepts like particle counting and detector characterisation are taught in tandem with laboratory…

This course on Feynman integrals starts from the basics, requiring only knowledge from special relativity and undergraduate mathematics. Topics from quantum field theory and advanced mathematics are introduced as they are needed. The course…

Quantum games represent the really 21st century branch of game theory, tightly linked to the modern development of quantum computing and quantum technologies. The main accent in these developments so far was made on stationary or repeated…

With increasing game size, a problem of computational complexity arises. This is especially true in real world problems such as in social systems, where there is a significant population of players involved in the game, and the complexity…

Large graphs can be found in a wide array of scientific fields ranging from sociology and biology to scientometrics and computer science. Their analysis is by no means a trivial task due to their sheer size and complex structure. Such…

Feynman's light microscope invites us to reconsider what we thought we knew about quantum reality. Rather than invoking wavefunction collapse to predict the loss of fringes in a monitored interferometer, Feynman analyzes the problem in…

Normal-form games (NFGs) are the fundamental model of strategic interaction. We study their representation using neural networks. We describe the inherent equivariance of NFGs -- any permutation of strategies describes an equivalent game --…

We investigate quantum circuits for graph representation learning, and propose equivariant quantum graph circuits (EQGCs), as a class of parameterized quantum circuits with strong relational inductive bias for learning over graph-structured…

As we begin to reach the limits of classical computing, quantum computing has emerged as a technology that has captured the imagination of the scientific world. While for many years, the ability to execute quantum algorithms was only a…

Freehand sketching is an inherently sequential process. Yet, most approaches for hand-drawn sketch recognition either ignore this sequential aspect or exploit it in an ad-hoc manner. In our work, we propose a recurrent neural network…