Related papers: Condition for zero and non-zero discord in graph L…
The objective of this note is to provide an interpretation of the discrete version of Morse inequalities, following Witten's approach via supersymmetric quantum mechanics, adapted to finite graphs, as a particular instance of Morse-Witten…
We show a surprising link between experimental setups to realize high-dimensional multipartite quantum states and Graph Theory. In these setups, the paths of photons are identified such that the photon-source information is never created.…
Extending upon the observations of the emergence of quantum-like states from classical complex synchronized networks, this work adds mathematical rigor to the analysis of single Quantum-Like (QL) bits constructed by eigenvectors of the…
Quantum graphs without interaction which contain equilateral cycles possess "topological" bound states which do not correspond to zeroes of one of the two variants of the secular equation for quantum graphs. Instead, their eigenvalues lie…
Hypergraph states, a generalization of graph states, constitute a large class of quantum states with intriguing non-local properties and have promising applications in quantum information science and technology. In this paper, we generalize…
A number of recent papers have considered signed graph Laplacians, a generalization of the classical graph Laplacian, where the edge weights are allowed to take either sign. In the classical case, where the edge weights are all positive,…
Discordant states appear in a large number of quantum phenomena and seem to be a good indicator of divergence from classicality. While there is evidence that they are essential for a quantum algorithm to have an advantage over a classical…
We study quantum discord between two free modes of a massive scalar field in a maximally entangled state in de Sitter space. We introduce two observers, one in a global chart and the other in an open chart of de Sitter space, and the…
Recently, it was realized that quantum discord can be seen as the minimal amount of correlations which are lost when some local quantum operations are performed. Based on this formulation of quantum discord, we provide a systematical…
Quantum entanglement is widely recognized as one of the key resources for the advantages of quantum information processing, including universal quantum computation, reduction of communication complexity or secret key distribution. However,…
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,…
Quantum discord is an important measure of quantum correlations that can serve as a resource for certain types of quantum information processing. \ Like entanglement, discord is subject to destruction by external noise. The routes by which…
A causal model is an abstract representation of a physical system as a directed acyclic graph (DAG), where the statistical dependencies are encoded using a graphical criterion called `d-separation'. Recent work by Wood & Spekkens shows that…
We introduce a class of multiqubit quantum states which generalizes graph states. These states correspond to an underlying mathematical hypergraph, i.e. a graph where edges connecting more than two vertices are considered. We derive a…
The description of the dynamics of a system that may be correlated with its environment is only meaningful within the context of a specific framework. Different frameworks rely upon different assumptions about the initial system-environment…
Quantum discord is a measure of quantum correlation beyond entanglement. Computing quantum discord for simple quantum states is a basic problem. An analytical formula of quantum discord for two-qubit X states is first claimed in [Ali, Rau,…
Graph states are a class of multi-partite entangled quantum states that are ubiquitous in quantum information. We study equivalence relations between graph states under local unitaries (LU) to obtain distinguishing methods both in local and…
Quantum graphs have attracted attention from mathematicians for some time. A quantum graph is defined by having a Laplacian on each edge of a metric graph and imposing boundary conditions at the vertices to get an eigenvalue problem. A…
This article presents a novel and succinct algorithmic framework via alternating quantum walks, unifying quantum spatial search, state transfer and uniform sampling on a large class of graphs. Using the framework, we can achieve exact…
We utilize quantum discord to charecterize the correlation present in Buzek-Hillery quantum copying machine \cite{bh} (not necessarily universal quantum cloning machine). In other words we quantify the correlation present beetween the…