Related papers: Dressed quantum graphs with optical nonlinearities…
Hypergraph states are multi-qubit states that form a subset of the locally maximally entangleable states and a generalization of the well--established notion of graph states. Mathematically, they can conveniently be described by a…
We describe a construction that maps any connected graph G on three or more vertices into a larger graph, H(G), whose independence number is strictly smaller than its Lov\'asz number which is equal to its fractional packing number. The…
The $sl_q(2)$-quantum group invariant spin 1/2 XXZ-Heisenberg model with open boundary conditions is investigated by means of the Bethe ansatz. As is well known, quantum groups for $q$ equal to a root of unity possess a finite number of…
Adaptive quantum circuits, leveraging measurements and classical feedback, significantly expand the landscape of realizable quantum states compared to their non-adaptive counterparts, enabling the preparation of long-range entangled states…
Quantum hypergraph states form a generalisation of the graph state formalism that goes beyond the pairwise (dyadic) interactions imposed by remaining inside the Gaussian approximation. Networks of such states are able to achieve…
Consider an interacting particle system indexed by the vertices of a (possibly random) locally finite graph whose vertices and edges are equipped with marks representing parameters of the model such as the environment and initial…
A graph is $k$-planar if it can be drawn in the plane such that no edge is crossed more than $k$ times. While for $k=1$, optimal $1$-planar graphs, i.e., those with $n$ vertices and exactly $4n-8$ edges, have been completely characterized,…
Any quantum algorithm can be implemented by an adaptive sequence of single node measurements on an entangled cluster of qubits in a square lattice topology. Photons are a promising candidate for encoding qubits but assembling a photonic…
Entanglement has evolved from an enigmatic concept of quantum physics to a key ingredient of quantum technology. It explains correlations between measurement outcomes that contradict classical physics, and has been widely explored with…
Many important results in extremal graph theory can be roughly summarised as "if a triangle-free graph $G$ has certain properties, then it has a homomorphism to a triangle-free graph $\Gamma$ of bounded size". For example, bounds on…
An embedding $i \mapsto p_i\in \mathbb{R}^d$ of the vertices of a graph $G$ is called universally completable if the following holds: For any other embedding $i\mapsto q_i~\in \mathbb{R}^{k}$ satisfying $q_i^T q_j = p_i^T p_j$ for $i = j$…
We obtain the following new coloring results: * A 3-colorable graph on $n$ vertices with maximum degree~$\Delta$ can be colored, in polynomial time, using $O((\Delta \log\Delta)^{1/3} \cdot\log{n})$ colors. This slightly improves an…
We study the problem of constructing a (near) random proper $q$-colouring of a simple k-uniform hypergraph with n vertices and maximum degree \Delta. (Proper in that no edge is mono-coloured and simple in that two edges have maximum…
We consider graph states of arbitrary number of particles undergoing generic decoherence. We present methods to obtain lower and upper bounds for the system's entanglement in terms of that of considerably smaller subsystems. For an…
We solve the nuclear two-body and three-body bound states via quantum simulations of pionless effective field theory on a lattice in position space. While the employed lattice remains small, the usage of local Hamiltonians including two-…
Graph neural networks (GNN) are very popular methods in machine learning and have been applied very successfully to the prediction of the properties of molecules and materials. First-order GNNs are well known to be incomplete, i.e., there…
We show that a behaviour analogous to degenerate hyperbolicity can occur in nearest-neighbour cellular automata (CA) with three states. We construct a 3-state rule by "lifting" elementary CA rule 140. Such "lifted" rule is equivalent to…
The $\boldsymbol{\beta}$-model for random graphs is commonly used for representing pairwise interactions in a network with degree heterogeneity. Going beyond pairwise interactions, Stasi et al. (2014) introduced the hypergraph…
Static electric response properties of atoms and molecules are reported within the real-space Cartesian grid implementation of pseudopotential Kohn-Sham (KS) density functional theory (DFT). A detailed systematic investigation is made for a…
Graph-based linear scaling electronic structure theory for quantum-mechanical molecular dynamics simulations is adapted to the most recent shadow potential formulations of extended Lagrangian Born-Oppenheimer molecular dynamics, including…