Search
Search Results
-
Engineering holography with stabilizer graph codes
The discovery of holographic codes established a surprising connection between quantum error correction and the anti-de Sitter-conformal field theory...
-
Very-large-scale integrated quantum graph photonics
Graphs have provided an expressive mathematical tool to model quantum-mechanical devices and systems. In particular, it has been recently discovered...
-
Note on graph-based BCJ relation for Berends-Giele currents
Graph-based Bern-Carasso-Johansson (BCJ) relation for Berends-Giele currents in bi-adjoint scalar (BS) theory, which is characterized by connected...
-
Graph Clustering: a graph-based clustering algorithm for the electromagnetic calorimeter in LHCb
The recent upgrade of the LHCb experiment pushes data processing rates up to 40 Tbit/s. Out of the whole reconstruction sequence, one of the most...
-
Quantum LOSR networks cannot generate graph states with high fidelity
Quantum networks lead to novel notions of locality and correlations and an important problem concerns the question of which quantum states can be...
-
Chip-based photonic graph states
Graph states are one of the most significant classes of entangled states, serving as the quantum resources for quantum technologies. Recently,...
-
Generalised Graph Laplacians and Canonical Feynman Integrals with Kinematics
To any graph with external half-edges and internal masses, we associate canonical integrals which depend non-trivially on particle masses and...
-
Quantum teleportation based on non-maximally entangled graph states
In recent years, the development of graph states has opened a bright prospect for the generation of multipartite entangled states. However, due to...
-
Shortcut to multipartite entanglement generation: A graph approach to boson subtractions
We propose a graph method for systematically searching for schemes that can generate multipartite entanglement in linear bosonic systems with...
-
Graph neural networks at the Large Hadron Collider
From raw detector activations to reconstructed particles, data at the Large Hadron Collider (LHC) are sparse, irregular, heterogeneous and highly...
-
Integral of depth zero to three basis of Modular Graph Functions
Modular Graph Functions (MGFs) are SL(2,ℤ)-invariant functions that emerge in the study of the low-energy expansion of the one-loop closed string...
-
Network Theory
Dynamical and adaptive networks are the backbone of many complex systems. Examples range from ecological prey–predator networks to the gene... -
Operator Growth Bounds from Graph Theory
Let A and B be local operators in Hamiltonian quantum systems with N degrees of freedom and finite-dimensional Hilbert space. We prove that the...
-
Modular graph forms from equivariant iterated Eisenstein integrals
The low-energy expansion of closed-string scattering amplitudes at genus one introduces infinite families of non-holomorphic modular forms called modul...
-
Frenetic Steering in a Nonequilibrium Graph
In traditional recognition tasks of neural networks a potential landscape or cost function guides the system towards patterns using a gradient...
-
Can one hear the spanning trees of a quantum graph?
Kirchhoff showed that the number of spanning trees of a graph is the spectral determinant of the combinatorial Laplacian divided by the number of...
-
Multiplicative Version of First Zagreb Index in Fuzzy Graph and its Application in Crime Analysis
The multiplicative first Zagreb index is discussed in this paper and studied for fuzzy graphs. Bounds of this index are calculated for path, cycle,...
-