Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userThe stabilizer dimension of graph states
152
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
The entanglement properties of a multiparty pure state are invariant under local unitary transformations. The stabilizer dimension of a multiparty pure state characterizes how many types of such local unitary transformations existing for the state. We find that the stabilizer dimension of an $n$-qubit ($nge 2$) graph state is associated with three specific configurations in its graph. We further show that the stabilizer dimension of an $n$-qubit ($nge 3$) graph state is equal to the degree of irreducible two-qubit correlations in the state.
rate research
Read More
Stabilizer states are eigenvectors of maximal commuting sets of operators in a finite Heisenberg group. States that are far from being stabilizer states include magic states in quantum computation, MUB-balanced states, and SIC vectors. In prime dimensions the latter two fall under the umbrella of Minimum Uncertainty States (MUS) in the sense of Wootters and Sussman. We study the correlation between two ways in which the notion of far from being a stabilizer state can be quantified, and give detailed results for low dimensions. In dimension 7 we identify the MUB-balanced states as being antipodal to the SIC vectors within the set of MUS, in a sense that we make definite. In dimension 4 we show that the states that come closest to being MUS with respect to all the six stabilizer MUBs are the fiducial vectors for Alltop MUBs.
The generation and verification of large-scale entanglement are essential to the development of quantum technologies. In this paper, we present an efficient scheme to generate genuine multipartite entanglement of a large number of qubits by using the Heisenberg interaction. This method can be conveniently implemented in various physical platforms, including superconducting, trapped-ion, and cold-atom systems. In order to characterize the entanglement of the output quantum state, we generalize the stabilizer formalism and develop an entanglement witness method. In particular, we design a generic searching algorithm to optimize entanglement witness with a minimal number of measurement settings under a given noise level. From the perspective of practical applications, we numerically study the trade-off between the experiment efficiency and the detection robustness.
A fundamental problem in quantum computation and quantum information is finding the minimum quantum dimension needed for a task. For tasks involving state preparation and measurements, this problem can be addressed using only the input-output correlations. This has been applied to Bell, prepare-and-measure, and Kochen-Specker contextuality scenarios. Here, we introduce a novel approach to quantum dimension witnessing for scenarios with one preparation and several measurements, which uses the graphs of mutual exclusivity between sets of measurement events. We present the concepts and tools needed for graph-theoretic quantum dimension witnessing and illustrate their use by identifying novel quantum dimension witnesses, including a family that can certify arbitrarily high quantum dimensions with few events.
We present an algorithm for manipulating quantum information via a sequence of projective measurements. We frame this manipulation in the language of stabilizer codes: a quantum computation approach in which errors are prevented and corrected in part by repeatedly measuring redundant degrees of freedom. We show how to construct a set of projective measurements which will map between two arbitrary stabilizer codes. We show that this process preserves all quantum information. It can be used to implement Clifford gates, braid extrinsic defects, or move between codes in which different operations are natural.
We give necessary and sufficient conditions for the existence of stabilizer codes $[[n,k,3]]$ of distance 3 for qubits: $n-kge lceillog_2(3n+1)rceil+epsilon_n$ where $epsilon_n=1$ if $n=8frac{4^m-1}3+{pm1,2}$ or $n=frac{4^{m+2}-1}3-{1,2,3}$ for some integer $mge1$ and $epsilon_n=0$ otherwise. Or equivalently, a code $[[n,n-r,3]]$ exists if and only if $nleq (4^r-1)/3, (4^r-1)/3-n otinlbrace 1,2,3rbrace$ for even $r$ and $nleq 8(4^{r-3}-1)/3, 8(4^{r-3}-1)/3-n ot=1$ for odd $r$. Given an arbitrary length $n$ we present an explicit construction for an optimal quantum stabilizer code of distance 3 that saturates the above bound.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
