Related papers: Quantum chromatic numbers via operator systems
Tensor networks representations of many-body quantum systems can be described in terms of quantum channels. We focus on channels associated with the Multi-scale Entanglement Renormalization Ansatz (MERA) tensor network that has been…
The understanding of complex quantum many-body systems has been vastly boosted by tensor network (TN) methods. Among others, excitation spectrum and long-range interacting systems can be studied using TNs, where one however confronts the…
We elaborate on the notion of generalized tomograms, both in the classical and quantum domains. We construct a scheme of star-products of thick tomographic symbols and obtain in explicit form the kernels of classical and quantum generalized…
Based on earlier work on regular quantum graphs we show that a large class of scaling quantum graphs with arbitrary topology are explicitly analytically solvable. This is surprising since quantum graphs are excellent models of quantum chaos…
Quantum contextual sets have been recognized as resources for universal quantum computation, quantum steering and quantum communication. Therefore, we focus on engineering the sets that support those resources and on determining their…
In this letter, we investigate the quantum optical properties of driven-dissipative nonlinear systems in a cascade configuration. We show that pumping a nonlinear system with a state having a noncoherent statistics, can improve the…
We analyze few-body quantum states with particular correlation properties imposed by the requirement of maximal bipartite entanglement for selected partitions of the system into two complementary parts. A novel framework to treat this…
An alternative model to describe the electronic and thermal properties of quantum dot based on triangle geometry is proposed. The model predicts characteristics and limitations of the system by controlling the magnetic field and…
We establish the connection between a recent new construction technique for quantum error correcting codes, based on graphs, and the so-called stabilizer codes: Each stabilizer code can be realized as a graph code and vice versa.
To execute quantum circuits on a quantum processor, they must be modified to meet the physical constraints of the quantum device. This process, called quantum circuit mapping, results in a gate/circuit depth overhead that depends on both…
We describe a quantum scheme to ``color-code'' a set of objects in order to record which one is which. In the classical case, N distinct colors are required to color-code N objects. We show that in the quantum case, only N/e distinct…
We analyze the nonlinear optics of quasi one-dimensional quantum graphs and manipulate their topology and geometry to generate for the first time nonlinearities in a simple system approaching the fundamental limits of the first and second…
Chromatic maps for spherical tensor categories are instrumental tools to construct (non semisimple) invariants of 3-manifolds and their extension to (non compact) (2+1)-TQFTs. In this paper, we introduce left and right chromatic maps for…
Graph states play an important role in quantum information theory through their connection to measurement-based computing and error correction. Prior work has revealed elegant connections between the graph structure of these states and…
We explore the main processes involved in the evolution of general quantum systems by means of Diagrams of States, a novel method to graphically represent and analyze how quantum information is elaborated during computations performed by…
Quantum computing provides a powerful framework for tackling computational problems that are classically intractable. The goal of this paper is to explore the use of quantum computers for solving relevant problems in systems and control…
We introduce a Sinkhorn-type algorithm for producing quantum permutation matrices encoding symmetries of graphs. Our algorithm generates square matrices whose entries are orthogonal projections onto one-dimensional subspaces satisfying a…
The {\em chromatic gap} is the difference between the chromatic number and the clique number of a graph. Here we investigate $\gap(n)$, the maximum chromatic gap over graphs on $n$ vertices. Can the extremal graphs be explored? While…
Quantum kernels are reproducing kernel functions built using quantum-mechanical principles and are studied with the aim of outperforming their classical counterparts. The enthusiasm for quantum kernel machines has been tempered by recent…
We introduce an alternative way to understand the decomposition of a quantum system into interacting parts and show that it is natural in several physical models. This enables us to define a reduced density operator for a working system…