No Arabic abstract
Consider a stabilizer state on $n$ qudits, each of dimension $D$ with $D$ being a prime or a squarefree integer, divided into three mutually disjoint sets or parts. Generalizing a result of Bravyi et al. [J. Math. Phys. textbf{47}, 062106 (2006)] for qubits (D=2), we show that up to local unitaries on the three parts the state can be written as a tensor product of unentangled single-qudit states, maximally entangled EPR pairs, and tripartite GHZ states. We employ this result to obtain a complete characterization of the properties of a class of channels associated with stabilizer error-correcting codes, along with their complementary channels.
We give a review on entanglement purification for bipartite and multipartite quantum states, with the main focus on theoretical work carried out by our group in the last couple of years. We discuss entanglement purification in the context of quantum communication, where we emphasize its close relation to quantum error correction. Various bipartite and multipartite entanglement purification protocols are discussed, and their performance under idealized and realistic conditions is studied. Several applications of entanglement purification in quantum communication and computation are presented, which highlights the fact that entanglement purification is a fundamental tool in quantum information processing.
Hard-decision renormalization group (HDRG) decoders are an important class of decoding algorithms for topological quantum error correction. Due to their versatility, they have been used to decode systems with fractal logical operators, color codes, qudit topological codes, and non-Abelian systems. In this work, we develop a method of performing HDRG decoding which combines strenghts of existing decoders and further improves upon them. In particular, we increase the minimal number of errors necessary for a logical error in a system of linear size $L$ from $Theta(L^{2/3})$ to $Omega(L^{1-epsilon})$ for any $epsilon>0$. We apply our algorithm to decoding $D(mathbb{Z}_d)$ quantum double models and a non-Abelian anyon model with Fibonacci-like fusion rules, and show that it indeed significantly outperforms previous HDRG decoders. Furthermore, we provide the first study of continuous error correction with imperfect syndrome measurements for the $D(mathbb{Z}_d)$ quantum double models. The parallelized runtime of our algorithm is $text{poly}(log L)$ for the perfect measurement case. In the continuous case with imperfect syndrome measurements, the averaged runtime is $O(1)$ for Abelian systems, while continuous error correction for non-Abelian anyons stays an open problem.
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 saturating the quantum Singleton bound for arbitrarily large $n$ and $D$ are constructed using simple graphs, except when $n$ is odd and $D$ is even. Computer searches have produced a number of codes with distances 3 and 4, some previously known and some new. The concept of a stabilizer is extended to general $D$, and shown to provide a dual representation of an additive graph code.
A quantum computer will use the properties of quantum physics to solve certain computational problems much faster than otherwise possible. One promising potential implementation is to use superconducting quantum bits in the circuit quantum electrodynamics (cQED) architecture. There, the low energy states of a nonlinear electronic oscillator are isolated and addressed as a qubit. These qubits are capacitively coupled to the modes of a microwave-frequency transmission line resonator which serves as a quantum communication bus. Microwave electrical pulses are applied to the resonator to manipulate or measure the qubit state. State control is calibrated using diagnostic sequences that expose systematic errors. Hybridization of the resonator with the qubit gives it a nonlinear response when driven strongly, useful for amplifying the measurement signal to enhance accuracy. Qubits coupled to the same bus may coherently interact with one another via the exchange of virtual photons. A two-qubit conditional phase gate mediated by this interaction can deterministically entangle its targets, and is used to generate two-qubit Bell states and three-qubit GHZ states. These three-qubit states are of particular interest because they redundantly encode quantum information. They are the basis of the quantum repetition code prototypical of more sophisticated schemes required for quantum computation. Using a three-qubit Toffoli gate, this code is demonstrated to autonomously correct either bit- or phase-flip errors. Despite observing the expected behavior, the overall fidelity is low because of decoherence. A superior implementation of cQED replaces the transmission-line resonator with a three-dimensional box mode, increasing lifetimes by an order of magnitude. In-situ qubit frequency control is enabled with control lines, which are used to fully characterize and control the system Hamiltonian.
We analyze the relationship between tripartite entanglement and genuine tripartite nonlocality for 3-qubit pure states in the GHZ class. We consider a family of states known as the generalized GHZ states and derive an analytical expression relating the 3-tangle, which quantifies tripartite entanglement, to the Svetlichny inequality, which is a Bell-type inequality that is violated only when all three qubits are nonlocally correlated. We show that states with 3-tangle less than 1/2 do not violate the Svetlichny inequality. On the other hand, a set of states known as the maximal slice states do violate the Svetlichny inequality, and exactly analogous to the two-qubit case, the amount of violation is directly related to the degree of tripartite entanglement. We discuss further interesting properties of the generalized GHZ and maximal slice states.