Related papers: Generalized Graph States Based on Hadamard Matrice…
Graph states and hypergraph states are of wide interest in quantum information processing and foundational studies. Efficient verification of these states is a key to various applications. Here we propose a simple method for verifying…
We study the mathematical structures and relations among some quantities in the theory of quantum entanglement, such as separability, weak Schmidt decompositions, Hadamard matrices etc.. We provide an operational method to identify the…
Large-scale quantum computation is likely to require massive quantum error correction (QEC). QEC codes and circuits are described via the stabilizer formalism, which represents stabilizer states by keeping track of the operators that…
Characterizing large noisy multiparty quantum states using genuine multiparty entanglement is a challenging task. In this paper, we calculate lower bounds of genuine multiparty entanglement localized over a chosen multiparty subsystem of…
In this paper we give a method to associate a graph with an arbitrary density matrix referred to a standard orthonormal basis in the Hilbert space of a finite dimensional quantum system. We study the related issues like classification of…
We introduce a graphical representation of stabilizer states and translate the action of Clifford operators on stabilizer states into graph operations on the corresponding stabilizer-state graphs. Our stabilizer graphs are constructed of…
As a fundamental metric for quantifying quantum advantage in non-local games, the quantum chromatic number reveals the power of entanglement in distributed tasks. In this paper, we investigate this parameter for $q$-ary Hamming graphs and a…
We provide a unified graphical calculus for all Gaussian pure states, including graph transformation rules for all local and semi-local Gaussian unitary operations, as well as local quadrature measurements. We then use this graphical…
Entangled states, such as the Bell and GHZ states, are generated from separable states using matrices known to satisfy the Yang-Baxter equation and its generalization. This remarkable fact hints at the possibility of using braiding…
We propose a systematic scheme for the construction of graphs associated with binary stabilizer codes. The scheme is characterized by three main steps: first, the stabilizer code is realized as a codeword-stabilized (CWS) quantum code;…
We propose a universal decomposition of unitary maps over a tensorial power of C^2, introducing the key concept of "phase maps", and investigate how this decomposition can be used to implement unitary maps directly in the measurement-based…
Critical to the construction of large scale quantum networks, i.e. a quantum internet, is the development of fast algorithms for managing entanglement present in the network. One fundamental building block for a quantum internet is the…
Circle graph states are a structurally important family of graph states. The family's entanglement is a priori high enough to allow for universal measurement-based quantum computation (MBQC); however, MBQC on circle graph states is actually…
Recently, substantial amount of activity in Quantum General Relativity (QGR) has focussed on the semiclassical analysis of the theory. In this paper we want to comment on two such developments: 1) Polymer-like states for Maxwell theory and…
This work studies how a suitably-designed classical system generates with a quantum-like (QL) state space mediated by a graph. The graph plays a special dual role by directing the topology of the classical network and defining a state space…
Entanglement has evolved from an enigmatic concept of quantum physics to a key ingredient of quantum technology. It explains correlations between measurement outcomes that contradict classical physics, and has been widely explored with…
A general method for the study of the entanglement evolution of graph states under the action of Pauli was recently proposed in [Cavalcanti, et al., Phys. Rev. Lett. 103, 030502 (2009)]. This method is based on lower and upper bounds on the…
Efficient simulation of quantum computers relies on understanding and exploiting the properties of quantum states. This is the case for methods such as tensor networks, based on entanglement, and the tableau formalism, which represents…
We propose an extension to the Pauli stabiliser formalism that includes fractional $2\pi/N$ rotations around the $Z$ axis for some integer $N$. The resulting generalised stabiliser formalism - denoted the XP stabiliser formalism - allows…
For any graph consisting of $k$ vertices and $m$ edges we construct an ensemble of random pure quantum states which describe a system composed of $2m$ subsystems. Each edge of the graph represents a bi-partite, maximally entangled state.…