Related papers: Dressed quantum graphs with optical nonlinearities…
Entanglement is a crucial resource for quantum information processing, and so protocols to generate high fidelity entangled states on various hardware platforms are in demand. While spin chains have been extensively studied to generate…
We derive a bound on the ability of a linear optical network to estimate a linear combination of independent phase shifts by using an arbitrary non-classical but unentangled input state, thereby elucidating the quantum resources required to…
We study the entanglement properties of randomized mixed hypergraph states, extending the concept of randomized mixed graph states to encompass hypergraph-based quantum states. In our model, imperfect generalized multi-qubit gates are…
We demonstrate that higher-order electric susceptibilities in crystals can be enhanced and understood through nontrivial topological invariants and quantum geometry, using one-dimensional $\pi$-conjugated chains as representative model…
We explore a variational Ansatz for lattice quantum systems -- named long-range entangled-plaquette state -- in which pairs of clusters of adjacent lattice sites are correlated at any distance. The explicit scale-free structure of…
For any fixed integer $R \geq 2$ we characterise the typical structure of undirected graphs with vertices $1, ..., n$ and maximum degree $R$, as $n$ tends to infinity. The information is used to prove that such graphs satisfy a labelled…
We develop an algorithm to apply the Dalgarno-Lewis (DL) perturbation theory to quantum graphs with multiple, connected edges. We use it to calculate the nonlinear optical hyperpolarizability tensors for graphs and show that it replicates…
The most efficient automated way to construct a large class of quantum photonic experiments is via abstract representation of graphs with certain properties. While new directions were explored using Artificial intelligence and SAT solvers…
Density functional theory (DFT) has greatly expanded our ability to affordably compute and understand electronic ground states, by replacing intractable {\em ab initio} calculations by models based on paradigmatic physics from high- and…
Ionicioiu and Spiller [Phys. Rev. A 85, 062313 (2012)] have recently presented an axiomatic framework for mapping graphs to quantum states of a suitable physical system. Based on their study, we first extend the axiomatic framework to…
The rapid development of neural quantum states (NQS) has established it as a promising framework for studying quantum many-body systems. In this work, by leveraging the cutting-edge transformer-based architectures and developing highly…
Graph states are the key resources for measurement- and fusion-based quantum computing with photons, yet their creation is experimentally challenging. We optimize a hybrid graph-state generation scheme using a single quantum emitter and…
A wide array of random graph models have been postulated to understand properties of observed networks. Typically these models have a parameter $t$ and a critical time $t_c$ when a giant component emerges. It is conjectured that for a large…
Given $k\ge 2$ and two $k$-graphs ($k$-uniform hypergraphs) $F$ and $H$, an \emph{$F$-factor} in $H$ is a set of vertex disjoint copies of $F$ that together covers the vertex set of $H$. Lenz and Mubayi studied the $F$-factor problems in…
Models for generating simple graphs are important in the study of real-world complex networks. A well established example of such a model is the erased configuration model, where each node receives a number of half-edges that are connected…
Graph states (or cluster states) are the entanglement resource that enables one-way quantum computing. They can be grown by projective measurements on the component qubits. Such measurements typically carry a significant failure…
In spite of the extensive studies of the 3-coloring problem with respect to several basic parameters, the complexity status of the 3-coloring problem on graphs with small diameter, i.e. with diameter 2 or 3, has been a longstanding and…
We demonstrate that absolutely maximally entangled (AME) states consisting of $N=4n$ qudits with $n\in\{1,2,3,...\}$, each of even local dimension, cannot be realized as graph states. This result imposes strong constraints on AME states in…
Classical ground states (global energy-minimizing configurations) of many-particle systems are typically unique crystalline structures, implying zero enumeration entropy of distinct patterns (aside from trivial symmetry operations). By…
A fundamental problem in Quantum Information Processing is the discrimination amongst a set of quantum states of a system. In this paper, we address this problem on an open quantum system described by a graph, whose evolution is defined by…