Determining the best attainable threshold for qudit magic state distillation is directly related to the question of whether or not contextuality is sufficient for universal quantum computation. We show that the performance of a qudit correcting code for magic state distillation is captured by its complete weight enumerator. For the qutrit strange state -- a maximally magic non-stabilizer state -- the performance of a code is captured by its simple weight enumerator. This result allows us to carry out an extensive search for high-threshold magic state distillation routines for the strange state. Our search covers all $[[n,1]]_3$ qutrit stabilizer codes with a complete set of transversal Clifford gates for $n\leq 23$, and all $[[n,1]]_3$ stabilizer codes with a transversal $H^2$ gate with $n \leq 9$ qudits. For $n=23$, we find over 600 CSS codes that can distill the qutrit strange state with cubic noise suppression. While none of these codes surpass the threshold of the 11-qutrit Golay code, their existence suggests that, for large codes, the ability to distill the qutrit strange state is somewhat generic.
We investigate the entanglement properties of a three--parameter family of states that are part of the magic simplex of two qutrits, which is a simplex of states that are mixtures of maximally entangled two--qutrit Bell states. Using entanglement witnesses we reveal large regions of bound entangled and separable states.
Non-stabilizer eigenstates of Clifford operators are natural candidates for endpoints of magic state distillation routines. We provide an explicit bestiary of all inequivalent non-stabilizer Clifford eigenstates for qutrits and ququints. For qutrits, there are four non-degenerate eigenstates, and two families of degenerate eigenstates. For ququints, there are eight non-degenerate eigenstates, and three families of degenerate eigenstates. Of these states, a simultaneous eigenvector of all Clifford symplectic rotations known as the qutrit strange state is distinguished as both the most magic qut…
The ternary Golay code -- one of the first and most beautiful classical error-correcting codes discovered -- naturally gives rise to an 11-qutrit quantum error correcting code. We apply this code to magic state distillation, a leading approach to fault-tolerant quantum computing. We find that the 11-qutrit Golay code can distill the "most magic" qutrit state -- an eigenstate of the qutrit Fourier transform known as the strange state -- with cubic error-suppression and a remarkably high threshold. It also distills the "second-most magic" qutrit state, the Norell state, with quadratic error-supp…
Magic state distillation (MSD) is a purification protocol that plays a central role in fault tolerant quantum computation. Repeated iteration of the steps of a MSD protocol, generates pure single non-stabilizer states, or magic states, from multiple copies of a mixed resource state using stabilizer operations only. Thus mixed resource states promote the stabilizer operations to full universality. Magic state distillation was introduced for qubit-based quantum computation, but little has been known concerning MSD in higher dimensional qudit-based computation. Here, we describe a general approac…
Realization of a fast triple-magic all-optical qutrit in strontium-88
Max-Planck-Institut für Quantenoptik（马克斯·普朗克量子光学研究所）；Munich Center for Quantum Science and Technology (MCQST)（慕尼黑量子科学与技术中心）；Fakultät für Physik, Ludwig-Maximilians-Universität（路德维希-马克西米利安大学物理学院）
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 investigate the state space of bipartite qutrits. We construct an analog to the "magic" tetrahedron for bipartite qubits--a magic simplex W. It is formed by all convex combination of nine Bell states which are constructed using the Weyl operators. Due to the high symmetry it is enough to consider certain typical slices through W. Via optimal entanglement witnesses we find regions of bound entangled states inside W.
We investigate the state space of bipartite qutrits. For states which are locally maximally mixed we obtain an analog of the ``magic'' tetrahedron for bipartite qubits--a magic simplex W. This is obtained via the Weyl group which is a kind of ``quantization'' of classical phase space. We analyze how this simplex W is embedded in the whole state space of two qutrits and discuss symmetries and equivalences inside the simplex W. Because we are explicitly able to construct optimal entanglement witnesses we obtain the border between separable and entangled states. With our method we find also the t…
A popular universal gate set for quantum computing with qubits is Clifford+T, as this can be readily implemented on many fault-tolerant architectures. For qutrits, there is an equivalent T gate, that, like its qubit analogue, makes Clifford+T approximately universal, is injectable by a magic state, and supports magic state distillation. However, it was claimed that a better gate set for qutrits might be Clifford+R, where R=diag(1,1,-1) is the metaplectic gate, as certain protocols and gates could more easily be implemented using the R gate than the T gate. In this paper we show that when we ha…
We obtain formulas (bot. p. 12)--including $\frac{2}{121}$ and $\frac{4 \left(242 \sqrt{3} π-1311\right)}{9801}$--for the eight atoms (Fig. 11), summing to 1, which span a 256-dimensional three-set (P, S, PPT) entanglement-probability boolean algebra for the two-qutrit Hiesmayr-Loffler states. PPT denotes positive partial transpose, while P and S provide the Li-Qiao necessary and}sufficient conditions for entanglement. The constraints ensuring entanglement are $s> \frac{16}{9} \approx 1.7777$ and $p> \frac{2^{27}}{3^{18} \cdot 7^{15} \cdot13} \approx 5.61324 \cdot 10^{-15}$. Here, $s$ is the s…
We show that the cost of strong simulation of quantum circuits using $t$ $T$ gate magic states exhibits non-trivial reductions on its upper bound for $t=1$, $t=2$, $t=3$, and $t=6$ with odd-prime-qudits. This agrees with previous numerical bounds found for qubits. We define simulation cost by the number of terms that require Gaussian elimination of a $t \times t$ matrix and so capture the cost of simulation methods that proceed by computing stabilizer inner products or evaluating quadratic Gauss sums. Prior numerical searchs for qubits were unable to converge beyond $t=7$. We effectively incre…
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…
Magic state distillation is a resource intensive sub-routine for quantum computation. The ratio of noisy input states to output states with error rate at most $ε$ scales as $O(\log^γ(1/ε))$ (Bravyi and Haah, PRA 2012). In a breakthrough paper, Hastings and Haah (PRL 2018) showed that it is possible to construct distillation routines with sub-logarithmic overhead, achieving $γ\approx 0.6779$ and falsifying a conjecture that $γ$ is lower bounded by $1$. They then ask whether $γ$ can be made arbitrarily close to $0$. We answer this question in the affirmative for magic state distillation routines…
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…
Magic state distillation is a critical component in leading proposals for fault-tolerant quantum computation. Relatively little is known, however, about how to construct a magic state distillation routine or, more specifically, which stabilizer codes are suitable for the task. While transversality of a non-Clifford gate within a code often leads to efficient distillation routines, it appears to not be a necessary condition. Here we have examined a number of small stabilizer codes and highlight a handful of which displaying interesting, albeit inefficient, distillation behaviour. Many of these …
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.
Identifying necessary and sufficient conditions for universal quantum computing is a long-standing open problem for which contextuality is, perhaps, the only promising solution [Howard et al., Nature 510, 351 (2014)]. To justify this conjecture, Howard et al. showed that contextuality is equivalent to Wigner negativity for qudits, and is therefore necessary and possibly sufficient for qudit magic state distillation. Here, we reformulate magic state distillation in the language of discrete phase space, to show that any finite qudit magic state distillation routine contains bound states outside …
Invariant Theory, Magic State Distillation, and Bounds on Classical Codes
Institute for Quantum Computing, and David R. Cheriton School of Computer Science University of Waterloo（滑铁卢大学量子计算研究所与大卫·R·切里顿计算机科学学院）；Perimeter Institute for Theoretical Physics（理论物理珀尔默特研究所）；Department of Physics and Computer Science, Dayalbagh Educational Institute（戴阿尔巴格教育学院物理与计算机科学系）
