Related papers: Determination of stabilizer states
We show that measuring pairs of qubits in the Bell basis can be used to obtain a simple quantum algorithm for efficiently identifying an unknown stabilizer state of n qubits. The algorithm uses O(n) copies of the input state and fails with…
We define a multi-partite entanglement measure for stabilizer states, which can be computed efficiently from a set of generators of the stabilizer group. Our measure applies to qubits, qudits and continuous variables.
The class of entangled $N$-qubit states known as graph states, and the corresponding stabilizer groups of $N$-qubit Pauli observables, have found a wide range of applications in quantum information processing and the foundations of quantum…
We develop a method for visualizing the internal structure of multipartite entanglement in pure stabilizer states. Our algorithm graphically organizes the many-body correlations in a hierarchical structure. This provides a rich taxonomy…
Decoherence represents a major obstacle towards realizing reliable quantum technologies. Identifying states that can be uphold against decoherence by purely coherent means, i.e., {\it stabilizable states}, for which the dissipation-induced…
Having protected quantum information is essential to perform quantum computations. One possibility is to reduce the number of particles needing to be protected from noise and instead use systems with more states, so called qudit quantum…
How entangled is a randomly chosen bipartite stabilizer state? We show that if the number of qubits each party holds is large the state will be close to maximally entangled with probability exponentially close to one. We provide a similar…
We propose to characterize multipartite entanglement of pure states as local unitary transformations acting on some parts of a system that can be undone by local unitary transformations acting on other parts. This leads to a definition of…
Quantum states are very delicate, so it is likely some sort of quantum error correction will be necessary to build reliable quantum computers. The theory of quantum error-correcting codes has some close ties to and some striking differences…
We explore set-stabilizability by constrained controls, and both controllability and stabilizability can be regarded as the special case of set-stabilizability. We not only clarify how to define an equilibrium point of Schr$\ddot{o}$dinger…
Improving the simulation of quantum circuits on classical computers is important for understanding quantum advantage and increasing development speed. In this paper, we explore a new way to express stabilizer states and further improve the…
There is a connection between classical codes, highly entangled pure states (called k-uniform or absolutely maximally entangled (AME) states), and quantum error correcting codes (QECCs). This leads to a systematic method to construct…
Graph states are generalized from qubits to collections of $n$ qudits of arbitrary dimension $D$, and simple graphical methods are used to construct both additive and nonadditive quantum error correcting codes. Codes of distance 2…
Discrete coherent states for a system of $n$ qubits are introduced in terms of eigenstates of the finite Fourier transform. The properties of these states are pictured in phase space by resorting to the discrete Wigner function
We extend an operational characterization of entanglement in terms of stabilizer groups from pure states to mixed states. For a density matrix $\rho_{AB}$, a stabilizer is a factorized unitary matrix $u_A \otimes u_B$ that, under…
Quantification of coherence lies at the heart of quantum information processing and fundamental physics. Exact evaluation of coherence measures generally needs a full reconstruction of the density matrix, which becomes intractable for…
We study the stability of superpositions of macroscopically distinct quantum states under decoherence. We introduce a class of quantum states with entanglement features similar to Greenberger-Horne-Zeilinger (GHZ) states, but with an…
The states of three-qubit systems split into two inequivalent types of genuine tripartite entanglement, namely the Greenberger-Horne-Zeilinger (GHZ) type and the $W$ type. A state belonging to one of these classes can be stochastically…
A complex projective $t$-design is a configuration of vectors which is ``evenly distributed'' on a sphere in the sense that sampling uniformly from it reproduces the moments of Haar measure up to order $2t$. We show that the set of all…
A fundamental problem in quantum information is to describe efficiently multipartite quantum states. An efficient representation in terms of graphs exists for several families of quantum states (graph, cluster, stabilizer states),…