Related papers: Verification of colorable hypergraph states with s…
In this work, we present a novel method to express the stabilizer of a k-uniform complete hypergraph state as a linear combination of local operators. Quantum hypergraph states generalize graph states and exhibit properties that are not…
Ionicioiu and Spiller [Phys. Rev. A 85, 062313 (2012)] have recently presented an axiomatic framework for mapping graphs to quantum states of a suitable physical system. Based on their study, we first extend the axiomatic framework to…
Local unitary stabilizer subgroups constitute powerful invariants for distinguishing various types of multipartite entanglement. In this paper, we show how stabilizers can be used as a basis for entanglement verification protocols on…
Using the measurement-based quantum computation model, we construct interactive proofs with non-communicating quantum provers and a classical verifier. Our construction gives interactive proofs for all languages in BQP with a polynomial…
Stabilizer states along with Clifford manipulations (unitary transformations and measurements) thereof -- despite being efficiently simulable on a classical computer -- are an important tool in quantum information processing, with…
Hypergraph states as real equally weighted pure states are important resources for quantum codes of non-local stabilizer. Using local Pauli equivalence and permutational symmetry, we reduce the 32768 four qubit real equally weighted pure…
Fathoming out quantum state space is a challenging endeavor due to its exponentially growing dimensionality. At the expense of being bound in its expressiveness, the discrete and finite subspace of graph states is easier to investigate via…
Quantum state verification (QSV) is the task of relying on local measurements only to verify that a given quantum device does produce the desired target state. Up to now, certain types of entangled states can be verified efficiently or even…
Bosonic fault tolerant quantum computing requires preparations of Bosonic code states like cat states and GKP states with high fidelity and reliable quantum certification of these states. Although many proposals on preparing these states…
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…
Scalable graph states are essential for measurement-based quantum computation and many entanglement-assisted applications in quantum technologies. Generation of these multipartite entangled states requires a controllable and efficient…
Stabilizer states form an important class of states in quantum information, and are of central importance in quantum error correction. Here, we provide an algorithm for deciding whether one stabilizer (target) state can be obtained from…
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.
Extracting information from quantum devices has long been a crucial problem in the field of quantum mechanics. By performing elaborate measurements, quantum state tomography, an important and fundamental tool in quantum science and…
Hypergraph states of many quantum bits share the rich interplay between simple combinatorial description and nontrivial entanglement properties enjoyed by the graph states that they generalize. In this paper, we consider hypergraph states…
A set of necessary and sufficient conditions are derived for the equivalence of an arbitrary pure state and a graph state on n qubits under stochastic local operations and classical communication (SLOCC), using the stabilizer formalism.…
Multi-qubit graph states generated by the action of controlled phase shift operators on a separable quantum state of a system, in which all the qubits are in arbitrary identical states, are examined. The geometric measure of entanglement of…
Typical stabilizer codes aim to solve the general problem of fault-tolerance without regard for the structure of a specific system. By incorporating a broader representation-theoretic perspective, we provide a generalized framework that…
Graph states are key resources for measurement-based quantum computing, which is particularly promising for photonic systems. Fusions are probabilistic Bell state measurements, measuring pairs of parity operators of two qubits. Fusions can…
Perturbation theories provide valuable insights on quantum many-body systems. Systems of interacting particles, like electrons, are often treated perturbatively around exactly solvable Gaussian points. Systems of interacting qubits have…