Related papers: Calibrated hypergraph states: II calibrated hyperg…
A graph state and a graph code respectively are defined based on a mathematical simple graph. In this work, we examine a relation between a graph state and a graph code both obtained from the same graph, and show that a graph state is a…
Coherent manipulation of an increasing number of qubits for the generation of entangled states has been an important goal and benchmark in the emerging field of quantum information science. The multiparticle entangled states serve as…
The Pauli groups are ubiquitous in quantum information theory because of their usefulness in describing quantum states and operations and their readily understood symmetry properties. In addition, the most well-understood quantum error…
Graph representations of solid state materials that encode only interatomic distance lack geometrical resolution, resulting in degenerate representations that may map distinct structures to equivalent graphs. Here we propose a hypergraph…
In this work, we present a comprehensive exploration of the entanglement and graph connectivity properties of graph states. We quantify the entanglement in pseudo graph states using the entanglement distance, a recently introduced measure…
Quantum networks are important for quantum communication, enabling tasks such as quantum teleportation, quantum key distribution, quantum sensing, and quantum error correction, often utilizing graph states, a specific class of multipartite…
We discuss representations and colorings of orthogonality hypergraphs in terms of their two-valued states interpretable as classical truth assignments. Such hypergraphs, if they allow for a faithful orthogonal representation, have quantum…
The measurement-based architecture is a paradigm of quantum computing, relying on the entanglement of a cluster of qubits and the measurements of a subset of it, conditioning the state of the unmeasured output qubits. While methods to map…
General purpose quantum computers can, in principle, entangle a number of noisy physical qubits to realise composite qubits protected against errors. Architectures for measurement-based quantum computing intrinsically support…
Standard Bell inequalities hold when distant parties are not allowed to communicate. Barrett et al. found correlations from Pauli measurements on certain network graphs refute a local hidden variable (LHV) description even allowing some…
Graph embeddings, wherein the nodes of the graph are represented by points in a continuous space, are used in a broad range of Graph ML applications. The quality of such embeddings crucially depends on whether the geometry of the space…
Stabilizer states, which are also known as the Clifford states, have been commonly utilized in quantum information, quantum error correction, and quantum circuit simulation due to their simple mathematical structure. In this work, we apply…
Generalized coherent states for shape invariant potentials are constructed using an algebraic approach based on supersymmetric quantum mechanics. We show this generalized formalism is able to: a) supply the essential requirements necessary…
Verification is a task to check whether a given quantum state is close to an ideal state or not. In this paper, we show that a variety of many-qubit quantum states can be verified with only sequential single-qubit measurements of Pauli…
The cluster state model for quantum computation [Phys. Rev. Lett. 86, 5188] outlines a scheme that allows one to use measurement on a large set of entangled quantum systems in what is known as a cluster state to undertake quantum…
Graph states and their entanglement properties are pivotal for the development of quantum computing and technologies. For qubits, local complementation, a graphical rule that connects all the equivalent states under Local Clifford (LC)…
We develop an algebraic and operational framework for quantum isomorphisms of hypergraphs, using tools from compact quantum group theory. We introduce a new synchronous version of the hypergraph isomorphism game whose game algebra uniformly…
In this work, we generalize the graph-theoretic techniques used for the holographic entropy cone to study hypergraphs and their analogously-defined entropy cone. This allows us to develop a framework to efficiently compute entropies and…
We construct multipartite graph states whose dimension is the power of a prime number. This is realized by the finite field, as well as the generalized controlled-NOT quantum circuit acting on two qudits. We propose the standard form of…
The quantum circuit model is the default for encoding an algorithm intended for a NISQ computer or a quantum computing simulator. A simple graph and through it, a graph state - quantum state physically manifesting an abstract graph…