Related papers: Dressed quantum graphs with optical nonlinearities…
There are many possible architectures of qubit connectivity that designers of future quantum computers will need to choose between. However, the process of evaluating a particular connectivity graph's performance as a quantum architecture…
We study a set of scattering matrices of quantum graphs containing minimal number of passbands, i.e., maximal number of zero elements. The cases of even and odd vertex degree are considered. Using a solution of inverse scattering problem,…
The Quantum Approximate Optimization Algorithm (QAOA) has been proposed as a method to obtain approximate solutions for combinatorial optimization tasks. In this work, we study the underlying algebraic properties of three QAOA ans\"atze for…
We study the reciprocal of the mean quantum Fisher information (RMQFI), $\chi^2$ for general three qubit states, having graph and hypergraph states as special cases, for identifying genuine multi party entanglement characterized by $\chi^2…
The regular models of a normal logic program are a particular type of partial (i.e. 3-valued) models which correspond to stable partial models with minimal undefinedness. In this paper, we explore graphical conditions on the dependency…
Entanglement is a fundamental resource for many applications in quantum information processing. Here, we investigate how quantum transport in simple quantum graphs, modeled as controlled two-level quantum systems, can be utilized to…
We study the spectral statistics of quantum systems with finite Hilbert spaces. We derive a theorem showing that eigenlevels in such systems cannot be globally uncorrelated, even in the case of fully integrable dynamics, as a consequence of…
Quantum metrology promises precision beyond classical limits but environmental noise, unless properly controlled, reduces the quantum advantage to at most a constant improvement. A key challenge is therefore to design quantum control…
Because of the potentially large number of important applications of nonlinear optics, researchers have expended a great deal of effort to optimize the second-order molecular nonlinear-optical response, called the hyperpolarizability. The…
We show that on graphs with n vertices, the 2-dimensional Weisfeiler-Leman algorithm requires at most O(n^2/log(n)) iterations to reach stabilization. This in particular shows that the previously best, trivial upper bound of O(n^2) is…
We construct the scaling limit of the easy axis XXZ chain. This limit is a subtle combination of approaching the isotropic point, and letting the lattice spacing to zero to obtain a continuous model with a finite mass gap. We give the…
The dilute A_3 model is a solvable IRF (interaction round a face) model with three local states and adjacency conditions encoded by the Dynkin diagram of the Lie algebra A_3. It can be regarded as a solvable version of an Ising model at the…
Systems of polynomial equations over the complex or real numbers can be used to model combinatorial problems. In this way, a combinatorial problem is feasible (e.g. a graph is 3-colorable, hamiltonian, etc.) if and only if a related system…
A graph $G$ is 3-colorable if and only if it maps homomorphically to the complete 3-vertex graph $K_3$. The last condition can be checked by a $k$-consistency algorithm where the parameter $k$ has to be chosen large enough, dependent on…
Using the sum-rules, the sum-over-states expression for the diagonal term of first hyperpolarizability can be expressed as the sum of three-state interaction terms. We study the behavior of a generic three-state term to show that is…
Graph states are multi-particle entangled states that correspond to mathematical graphs, where the vertices of the graph take the role of quantum spin systems and edges represent Ising interactions. They are many-body spin states of…
The longstanding open problem of approximating all singular vertex couplings in a quantum graph is solved. We present a construction in which the edges are decoupled; an each pair of their endpoints is joined by an edge carrying a $\delta$…
Using an infinitesimal approach, this work addresses the renormalization problem to deal with the ultraviolet divergences arising in quantum field theory. Under the assumption that the action has already been renormalized to yield an…
We investigate the properties of different levels of entanglement in graph states which correspond to connected graphs. Combining the operational definition of graph states and the postulates of entanglement measures, we prove that in…
Recent developments in approximate counting have made startling progress in developing fast algorithmic methods for approximating the number of solutions to constraint satisfaction problems (CSPs) with large arities, using connections to…