Related papers: Dressed quantum graphs with optical nonlinearities…
A short introduction to quantum error correction is given, and it is shown that zero-dimensional quantum codes can be represented as self-dual additive codes over GF(4) and also as graphs. We show that graphs representing several such codes…
We resolve a number of long-standing open problems in online graph coloring. More specifically, we develop tight lower bounds on the performance of online algorithms for fundamental graph classes. An important contribution is that our…
In the quest to build general-purpose photonic quantum computers, fusion-based quantum computation has risen to prominence as a promising strategy. This model allows a ballistic construction of large cluster states which are universal for…
Weighted graph states are a natural generalization of graph states, which are generated by applying controlled-phase gates, instead of controlled-Z gates, to a separable state. In this paper, we show that uniformly weighted graph states on…
In part I, the formalism for the description of open quantum systems (that are embedded into a common well-defined environment) by means of a non-Hermitian Hamilton operator $\ch$ is sketched. Eigenvalues and eigenfunctions are…
We investigate a one-dimensional quantum system with a self-similar arrangement of delta-function potential barriers, exhibiting discrete scale invariance. The singular potential induces kinematically enforced symmetry breaking at $x=0$,…
Three new graph invariants are introduced which may be measured from a quantum graph state and form examples of a framework under which other graph invariants can be constructed. Each invariant is based on distinguishing a different number…
The broken and unbroken phases of PT and supersymmetry in optical systems are explored for a complex refractive index profile in the form of a Scarf potential, under the framework of supersymmetric quantum mechanics. The transition from…
Programmable quantum systems based on Rydberg atom arrays have recently emerged as a promising testbed for combinatorial optimization. Indeed, the Maximum Weighted Independent Set problem on unit-disk graphs can be efficiently mapped to…
Non-symmetric GHZ states ($n$-GHZ$_\alpha$), defined by unequal superpositions of $|00...0>$ and $|11...1>$, naturally emerge in experiments due to decoherence, control errors, and state preparation imperfections. Despite their relevance in…
We propose an ansatz for the wave function of a non-interacting quantum particle in a deterministic quasicrystalline potential. It is applicable to both continuous and discrete models and includes Sutherland's hierarchical wave function as…
In exact density functional theory (DFT) the total ground-state energy is a series of linear segments between integer electron points, a condition known as "piecewise linearity". Deviation from this condition is indicative of poor…
We study Markov chains for randomly sampling $k$-colorings of a graph with maximum degree $\Delta$. Our main result is a polynomial upper bound on the mixing time of the single-site update chain known as the Glauber dynamics for planar…
In a seminal paper, De Loera et. al introduce the algorithm NulLA (Nullstellensatz Linear Algebra) and use it to measure the difficulty of determining if a graph is not 3-colorable. The crux of this relies on a correspondence between…
One major open conjecture in the area of critical random graphs, formulated by statistical physicists, and supported by a large amount of numerical evidence over the last decade [23, 24, 28, 63] is as follows: for a wide array of random…
In this paper we explore the possibility of performing Heisenberg limited quantum metrology of a phase, without any prior, by employing only maximally entangled states. Starting from the estimator introduced by Higgins et al. in New J.…
We studied the excitation dynamics of a finite quantum system with an intense optical near field (ONF) from a perspective of light-dressed states. A simple model consisting of a single electron and a nano-sized short dipole source were…
We introduce n-particle quantum graphs with singular two-particle interactions in such a way that eigenfunctions can be given in the form of a Bethe ansatz. We show that this leads to a secular equation characterising eigenvalues of the…
Hypergraphs are useful mathematical representations of overlapping and nested subsets of interacting units, including groups of genes or brain regions, economic cartels, political or military coalitions, and groups of products that are…
The hyperbolicity of a graph, informally, measures how close a graph is (metrically) to a tree. Hence, it is intuitively similar to treewidth, but the measures are formally incomparable. Motivated by the broad study of algorithms and…