We provide generalizations of known two-qubit entanglement distillation protocols for arbitrary Hilbert space dimensions. The protocols, which are analogues of the hashing and breeding procedures, are adapted to bipartite quantum states which are diagonal in a basis of maximally entangled states. We show that the obtained rates are optimal, and thus equal to the distillable entanglement, for a (d-1) parameter family of rank deficient states. Methods to improve the rates for other states are discussed. In particular, for isotropic states it is shown that the rate can be improved such that it approaches the relative entropy of entanglement in the limit of large dimensions.
We propose a scheme for both distilling and quantifying entanglement, applicable to individual copies of an arbitrary unknown two-qubit state. It is realized in a usual two-qubit interferometry with local filtering. Proper filtering operation for the maximal distillation of the state is achieved, by erasing single-qubit interference, and then the concurrence of the state is determined directly from the visibilities of two-qubit interference. We compare the scheme with full state tomography.
Entanglement distillation is a procedure for extracting from one or more pairs of entangled qubits a smaller number of pairs with a higher degree of entanglement that is essential for many applications in quantum information science. Schmidt projection is a unique distillation method that can be applied to more than two pairs of entangled qubits at the same time with high efficiency. We implement the Schmidt projection protocol by applying single-photon two-qubit quantum logic to a partially hyperentangled four-qubit input state. The basic elements of the procedure are characterized and we con…
Logic-qubit entanglement has attracted much attention in both quantum communication and quantum computation. Here, we present an efficient protocol to distill the logic-qubit entanglement with the help of cross-Kerr nonlinearity. This protocol not only can purify the logic bit-flip error and logic phase-flip error, but also can correct the physical bit-flip error completely. We use cross-Kerr nonlinearity to construct quantum nondemolition detectors. Our distillation protocol for logic-qubit entanglement may be useful for the practical applications in quantum information, especially in long-di…
The distillation of magic states is an often-cited technique for enabling universal quantum computing once the error probability for a special subset of gates has been made negligible by other means. We present a routine for magic-state distillation that reduces the required overhead for a range of parameters of practical interest. Each iteration of the routine uses a four-qubit error-detecting code to distill the +1 eigenstate of the Hadamard gate at a cost of ten input states per two improved output states. Use of this routine in combination with the 15-to-1 distillation routine described by…
Many proposals for fault-tolerant quantum computation require injection of 'magic states' to achieve a universal set of operations. Some qubit states are above a threshold fidelity, allowing them to be converted into magic states via 'magic state distillation', a process based on stabilizer codes from quantum error correction. We define quantum weight enumerators that take into account the sign of the stabilizer operators. These enumerators completely describe the magic state distillation behavior when distilling T-type magic states. While it is straightforward to calculate them directly by co…
We experimentally demonstrate optimal entanglement distillation from two forms of two-qubit mixed states under local filtering operations according to the constructive method intruduced by F. Verstraete et al. [Phys. Rev. A 64, 010101(R) (2001)]. In principle, our set-up can be easily applied to distilling entanglement from arbitrary two-qubit partially mixed states. We also test the violation of the Clauser-Horne-Shinmony-Holt (CHSH) inequality for the distilled state from the first form of mixed state to show its "hidden non-locality".
Quantum universality can be achieved using classically controlled stabilizer operations and repeated preparation of certain ancilla states. Which ancilla states suffice for universality? This "magic states distillation" question is closely related to quantum fault tolerance. Lower bounds on the noise tolerable on the ancilla help give lower bounds on the tolerable noise rate threshold for fault-tolerant computation. Upper bounds show the limits of threshold upper-bound arguments based on the Gottesman-Knill theorem. We extend the range of single-qubit mixed states that are known to give univer…
The quantum states corresponding to a secret key are characterized using the so-called private states, where the key part consisting of a secret key is shielded by the additional systems. Based on the construction, it was shown that a secret key can be distilled from bound entangled states. In this work, I consider the shielded two-qubit states in a key-distillation scenario and derive the conditions under which a secret key can be distilled using the recurrence protocol or the two-way classical distillation, advantage distillation together with one-way postprocessing. From the security condit…
Magic state distillation uses special codes to suppress errors in input states, which are often tailored to a Clifford-twirled error model. We present detailed measurement sequences for magic state distillation protocols which can suppress arbitrary errors on any part of a protocol, assuming the independence of errors across qubits. Provided with input magic states, our protocol operates on a two-dimensional square grid by measurements of $ZZ$ on horizontal pairs of qubits, $XX$ on vertical pairs, and $Z,X$ on single qubits.
For certain quantum architectures and algorithms, most of the required resources are consumed during the distillation of one-qubit magic states for use in performing Toffoli gates. I show that the overhead for magic-state distillation can be reduced by merging distillation with the implementation of Toffoli gates. The resulting routine distills 8 one-qubit magic states directly to a Toffoli state, which can be used without further magic to perform a Toffoli gate.
Despite significant overhead reductions since its first proposal, magic state distillation is often considered to be a very costly procedure that dominates the resource cost of fault-tolerant quantum computers. The goal of this work is to demonstrate that this is not true. By writing distillation circuits in a form that separates qubits that are capable of error detection from those that are not, most logical qubits used for distillation can be encoded at a very low code distance. This significantly reduces the space-time cost of distillation, as well as the number of qubits. In extreme cases,…
We present a general algorithm to achieve local operators which can produce the GHZ state for an arbitrary given three-qubit state. Thus the distillation process of the state can be realized optimally. The algorithm is shown to be sufficient for the three-qubit state on account of the fact that any state for which this distillation algorithm is invalid cannot be distilled to the GHZ state by any local actions. Moreover, an analytical result of distillation operations is achieved for the general state of three qubits.
A mixed quantum state shared between two parties is said to be distillable if, by means of a protocol involving only local quantum operations and classical communication, the two parties can transform some number of copies of that state into a single shared pair of qubits having high fidelity with a maximally entangled state state. In this paper it is proved that there exist states that are distillable, but for which an arbitrarily large number of copies is required before any distillation procedure can produce a shared pair of qubits with even a small amount of entanglement. Specifically, for…
Unfolded distillation: very low-cost magic state preparation for biased-noise qubits
Alice & Bob；Laboratoire de Physique de l’École Normale Supérieure, École Normale Supérieure, Centre Automatique et Systèmes, Mines Paris, Université PSL, CNRS, Inria（巴黎高等师范学院物理实验室，巴黎高等师范学院，自动与系统中心，巴黎矿业学院，PSL大学，法国国家科学研究中心，法国国家信息与自动化研究所）
We discuss a specific entanglement distillation scheme under the constraint of finite samples of entangled qubit pairs. It is shown that an iterative process can be explicitly formulated. The average fidelity of this process can be enhanced by introducing conditional storing of entangled qubit pairs in each step of the iteration. We investigate the corresponding limitations on the size and the initial fidelity of the sample.
A key ingredient of quantum repeaters is entanglement distillation, i.e., the generation of high-fidelity entangled qubits from a larger set of pairs with lower fidelity. Here, we present entanglement distillation protocols based on qubit couplings that originate from exchange interaction. First, we make use of asymmetric bilateral two-qubit operations generated from anisotropic exchange interaction and show how to distill entanglement using two input pairs. We furthermore consider the case of three input pairs coupled through isotropic exchange. Here, we characterize a set of protocols which …
A set of stabilizer operations augmented by some special initial states known as 'magic states', gives the possibility of universal fault-tolerant quantum computation. However, magic state preparation inevitably involves nonideal operations that introduce noise. The most common method to eliminate the noise is magic state distillation (MSD) by stabilizer operations. Here we propose a hybrid MSD protocol by connecting a four-qubit H-type MSD with a five-qubit T-type MSD, in order to overcome some disadvantages of the previous MSD protocols. The hybrid MSD protocol further integrates distillable…
Some of the asymmetric three qubit $W$ states are used for perfect teleportation, superdense coding and quantum information splitting. We present the protocols for the optimal distillation of the asymmetric as well as the symmetric $W$ states from a single copy of any three qubit $W$ class pure state.
Fourier states are multi-qubit registers that facilitate phase rotations in fault-tolerant quantum computing. We propose distillation protocols for constructing the fundamental, $n$-qubit Fourier state with error $O(2^{-n})$ at a cost of $O(n \log n)$ Toffoli gates and Clifford gates, or any arbitrary Fourier state using $O(n^2)$ gates. We analyze these protocols with methods from digital signal processing. These results suggest that phase kickback, which uses Fourier states, could be the current lowest-overhead method for generating arbitrary phase rotations.
Quantum algorithms for quantum chemistry map the dynamics of electrons in a molecule to the dynamics of a coupled spin system. To reach chemical accuracy for interesting molecules, a large number of quantum gates must be applied which implies the need for quantum error correction and fault-tolerant quantum computation. Arbitrary fault-tolerant operations can be constructed from a small, universal set of fault-tolerant operations by gate compilation. Quantum chemistry algorithms are compiled by decomposing the dynamics of the coupled spin-system using a Trotter formula, synthesizing the decompo…
Magic state distillation is one of the leading candidates for implementing universal fault-tolerant logical gates. However, the distillation circuits themselves are not fault-tolerant, so there is additional cost to first implement encoded Clifford gates with negligible error. In this paper we present a scheme to fault-tolerantly and directly prepare magic states using flag qubits. One of these schemes uses a single extra ancilla, even with noisy Clifford gates. We compare the physical qubit and gate cost of this scheme to the magic state distillation protocol of Meier, Eastin, and Knill, whic…
Quantum information processing in a modular architecture requires the distribution, stabilization and distillation of entanglement in a qubit network. We present autonomous entanglement stabilization protocols between two superconducting qubits that are coupled to distant cavities. The coupling between cavities is mediated and controlled via a three-wave mixing device that generates either a two-mode squeezed state or a delocalized mode between the remote cavities depending on the pump applied to the mixer. Local drives on the qubits and the cavities steer and maintain the system to the desire…
We study several properties of distillation protocols to purify multilevel qubit states (qudits) when applied to a certain family of initial mixed bipartite states. We find that it is possible to use qudits states to increase the stability region obtained with the flow equations to distill qubits. In particular, for qutrits we get the phase diagram of the distillation process with a rich structure of fixed points. We investigate the large-$D$ limit of qudits protocols and find an analytical solution in the continuum limit. The general solution of the distillation recursion relations is present…
Hardware-Tailored Resource Estimation for Magic-State Distillation on Silicon Spin Qubits
Cavendish Lab., Department of Physics, Univ. of Cambridge（剑桥大学卡文迪什实验室物理系）；Hitachi Cambridge Lab.（日立剑桥实验室）；Department of Computer Science and Technology, Univ. of Cambridge（剑桥大学计算机科学与技术系）
We propose a scheme of multipartite entanglement distillation driven by a complementary pair of stabilizer measurements, to distill directly a wider range of states beyond the stabilizer code states (such as the Greenberger-Horne-Zeilinger states). We make our idea explicit by constructing a recurrence protocol for the 3-qubit W state. Noisy W states resulting from typical decoherence can be directly purified in a few steps, if their initial fidelity is larger than a threshold. For general input mixed states, we observe distillations to hierarchical fixed points, i.e., not only to the W state …
An important task required to build a scalable, fault-tolerant quantum computer is to efficiently represent an arbitrary single-qubit rotation by fault-tolerant quantum operations. Traditionally, the method for decomposing a single-qubit unitary into a discrete set of gates is Solovay-Kitaev decomposition, which in practice produces a sequence of depth O(\log^c(1/ε)), where c~3.97 is the state-of-the-art. The proven lower bound is c=1, however an efficient algorithm that saturates this bound is unknown. In this paper, we present an alternative to Solovay-Kitaev decomposition employing state di…
Graduate School of Engineering Science, Osaka University（大阪大学工学研究科）；Graduate School of Informatics, Kyoto University（京都大学信息学研究科）；Quantum Laboratory, Fujitsu Research, Fujitsu Limited（富士通研究院量子实验室）；Nanofiber Quantum Technologies, Inc. (NanoQT)（纳米纤维量子技术股份有限公司（NanoQT））；Fujitsu Quantum Computing Joint Research Division, Center for Quantum Information and Quantum Biology, Osaka University（大阪大学量子信息与量子生物学中心富士通量子计算联合研究部）；RIKEN Center for Quantum Computing (RQC)（理化学研究所量子计算中心）
Universal, unambiguous concentration and distillation of Bell pairs
HUN-REN Wigner Research Centre for Physics（匈牙利科学院维格纳物理研究中心）；Faculty of Nuclear Sciences and Physical Engineering, Czech Technical University in Prague（布拉格捷克理工大学核科学与物理工程学院）
Magic state distillation is a crucial component in the leading approaches to implementing universal fault tolerant quantum computation, with existing protocols for both qubit and higher dimensional systems. Early work focused on determining the region of distillable states for qubit protocols, yet comparatively little is known about which states can be distilled and with what distillable region for d>2. Here we focus on d=3 and present new four-qutrit distillation schemes that improve upon the known distillable region, and achieve distillation tight to the boundary of undistillable states for …
We propose families of protocols for magic state distillation -- important components of fault tolerance schemes --- for systems of odd prime dimension. Our protocols utilize quantum Reed-Muller codes with transversal non-Clifford gates. We find that, in higher dimensions, small and effective codes can be used that have no direct analogue in qubit (two-dimensional) systems. We present several concrete protocols, including schemes for three-dimensional (qutrit) and five-dimensional (ququint) systems. The five-dimensional protocol is, by many measures, the best magic state distillation scheme ye…
Provable entanglement has been shown to be a necessary precondition for unconditionally secure key generation in the context of quantum cryptographic protocols. We estimate the maximal threshold disturbance up to which the two legitimate users can prove the presence of quantum correlations in their data, in the context of the four- and six-state quantum key-distribution protocols, under the assumption of coherent attacks. Moreover, we investigate the conditions under which an eavesdropper can saturate these bounds, by means of incoherent and two-qubit coherent attacks. A direct connection betw…
The potential impact of future quantum networks hinges on high-quality quantum entanglement shared between network nodes. Unavoidable real-world imperfections necessitate means to improve remote entanglement by local quantum operations. Here we realize entanglement distillation on a quantum network primitive of distant electron-nuclear two-qubit nodes. We demonstrate the heralded generation of two copies of a remote entangled state through single-photon-mediated entangling of the electrons and robust storage in the nuclear spins. After applying local two-qubit gates, single-shot measurements h…
Given stabilizer operations and the ability to repeatedly prepare a single-qubit mixed state rho, can we do universal quantum computation? As motivation for this question, "magic state" distillation procedures can reduce the general fault-tolerance problem to that of performing fault-tolerant stabilizer circuits. We improve the procedures of Bravyi and Kitaev in the Hadamard "magic" direction of the Bloch sphere to achieve a sharp threshold between those rho allowing universal quantum computation, and those for which any calculation can be efficiently classically simulated. As a corollary, the…
We develop a distillation protocol for multilevel qubits (qudits) using generalized beam splitters like in the proposal of Pan et al. for ordinary qubits. We find an acceleration with respect to the scheme of Bennet et al. when extended to qudits. It is also possible to distill entangled pairs of photons carrying orbital angular momenta (OAM) states that conserves the total angular momenta as those produced in recent experiments.
We analyse the problem of distillation of entanglement of mixed states in higher dimensional compound systems. Employing the positive maps method [M. Horodecki et al., Phys. Lett. A 223 1 (1996)] we introduce and analyse a criterion of separability which relates the structures of the total density matrix and its reductions. We show that any state violating the criterion can be distilled by suitable generalization of the two-qubit protocol which distills any inseparable two-qubit state. Conversely, all the states which can be distilled by such a protocol must violate the criterion. The proof in…
We consider distillation of entanglement from two qubit states which are mixtures of three mutually orthogonal states: two pure entangled states and one pure product state. We distill entanglement from such states by projecting n copies of the state on permutationally invariant subspace and then applying one-way hashing protocol. We find analytical expressions for the rate of the protocol. We also generalize this method to higher dimensional systems. To get analytical expression for two qubit case, we faced a mathematical problem of diagonalizing a family of matrices enjoying some symmetries w…
We present new algorithms for mixed-state multi-copy entanglement distillation for pairs of qubits. Our algorithms perform significantly better than the best known algorithms. Better algorithms can be derived that are tuned for specific initial states. The new algorithms are based on a characterization of the group of all locally realizable permutations of the 4^n possible tensor products of n Bell states.
We put forward a method for optimized distillation of partly entangled pairs of qubits into a smaller number of more entangled pairs by recurrent local unitary operations and projections. Optimized distillation is achieved by minimization of a cost function with up to 30 real parameters, which is chosen to be sensitive to the fidelity and the projection probability at each step. We show that in many cases this approach can significantly improve the distillation efficiency in comparison to the present methods.
The aim of this work is to examine the exponential rates at which entanglement distillation occur in three-qubits systems. The approach we will follow to elucidate the entanglement concentration is based on the Schur-Weyl decomposition and the Keyl-Werner theorem. In order to clearly state the main results of this work we will have to introduce the notion of SLOCC equivalence and the covariant algebra which will allow us to classify states in different \emph{entanglement classes}. Our main results comprehend the asymptotic rates for the probability of being in an invariant subspace in the Wedd…
