اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدMagic State Distillation with Low Space Overhead and Optimal Asymptotic Input Count
51
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We present an infinite family of protocols to distill magic states for $T$-gates that has a low space overhead and uses an asymptotic number of input magic states to achieve a given target error that is conjectured to be optimal. The space overhead, defined as the ratio between the physical qubits to the number of output magic states, is asymptotically constant, while both the number of input magic states used per output state and the $T$-gate depth of the circuit scale linearly in the logarithm of the target error $delta$ (up to $log log 1/delta$). Unlike other distillation protocols, this protocol achieves this performance without concatenation and the input magic states are injected at various steps in the circuit rather than all at the start of the circuit. The protocol can be modified to distill magic states for other gates at the third level of the Clifford hierarchy, with the same asymptotic performance. The protocol relies on the construction of weakly self-dual CSS codes with many logical qubits and large distance, allowing us to implement control-SWAPs on multiple qubits. We call this code the inner code. The control-SWAPs are then used to measure properties of the magic state and detect errors, using another code that we call the outer code. Alternatively, we use weakly-self dual CSS codes which implement controlled Hadamards for the inner code, reducing circuit depth. We present several specific small examples of this protocol.
قيم البحث
اقرأ أيضاً
The overhead cost of performing universal fault-tolerant quantum computation for large scale quantum algorithms is very high. Despite several attempts at alternative schemes, magic state distillation remains one of the most efficient schemes for simu
lating non-Clifford gates in a fault-tolerant way. However, since magic state distillation circuits are not fault-tolerant, all Clifford operations must be encoded in a large distance code in order to have comparable failure rates with the magic states being distilled. In this work, we introduce a new concept which we call redundant ancilla encoding. The latter combined with flag qubits allows for circuits to both measure stabilizer generators of some code, while also being able to measure global operators to fault-tolerantly prepare magic states, all using nearest neighbor interactions. In particular, we apply such schemes to a planar architecture of the triangular color code family. In addition to our scheme being suitable for experimental implementations, we show that for physical error rates near $10^{-4}$ and under a full circuit-level noise model, our scheme can produce magic states using an order of magnitude fewer qubits and space-time overhead compared to the most competitive magic state distillation schemes. Further, we can take advantage of the fault-tolerance of our circuits to produce magic states with very low logical failure rates using encoded Clifford gates with noise rates comparable to the magic states being injected. Thus, stabilizer operations are not required to be encoded in a very large distance code. Consequently, we believe our scheme to be suitable for implementing fault-tolerant universal quantum computation with hardware currently under development.
Magic state distillation protocols have a complicated non-linear nature. Analysis of protocols is therefore usually restricted to one-parameter families of states, which aids tractability. We show that if we lift this one-parameter restriction and em
brace the complexity, distillation exhibits fractal properties. By studying these fractals we demonstrate that some protocols are more effective when not restricted. Low fidelity states that are usually worthless for distillation are now usable, and fewer iterations of the protocols are needed to reach high fidelity.
Recently we proposed a family of magic state distillation protocols that obtains asymptotic performance that is conjectured to be optimal. This family depends upon several codes, called inner codes and outer codes. We presented some small examples of
these codes as well as an analysis of codes in the asymptotic limit. Here, we analyze such protocols in an intermediate size regime, using hundreds to thousands of qubits. We use BCH inner codes, combined with various outer codes. We extend our protocols by adding error correction in some cases. We present a variety of protocols in various input error regimes; in many cases these protocols require significantly fewer input magic states to obtain a given output error than previous protocols.
Magic can be distributed non-locally in many-body entangled states, such as the low energy states of condensed matter systems. Using the Bravyi-Kitaev magic state distillation protocol, we find that non-local magic is distillable and can improve the
distillation outcome. We analyze a few explicit examples and show that spin squeezing can be used to convert non-distillable states into distillable ones. Our analysis also suggests that the conventional product input states assumed by magic distillation protocols are extremely atypical among general states with distillable magic. It further justifies the need for studying a diverse range of entangled inputs that yield magic states with high probability.
Magic-state distillation (or non-stabilizer state manipulation) is a crucial component in the leading approaches to realizing scalable, fault-tolerant, and universal quantum computation. Related to non-stabilizer state manipulation is the resource th
eory of non-stabilizer states, for which one of the goals is to characterize and quantify non-stabilizerness of a quantum state. In this paper, we introduce the family of thauma measures to quantify the amount of non-stabilizerness in a quantum state, and we exploit this family of measures to address several open questions in the resource theory of non-stabilizer states. As a first application, we establish the hypothesis testing thauma as an efficiently computable benchmark for the one-shot distillable non-stabilizerness, which in turn leads to a variety of bounds on the rate at which non-stabilizerness can be distilled, as well as on the overhead of magic-state distillation. We then prove that the max-thauma can be used as an efficiently computable tool in benchmarking the efficiency of magic-state distillation and that it can outperform pervious approaches based on mana. Finally, we use the min-thauma to bound a quantity known in the literature as the regularized relative entropy of magic. As a consequence of this bound, we find that two classes of states with maximal mana, a previously established non-stabilizerness measure, cannot be interconverted in the asymptotic regime at a rate equal to one. This result resolves a basic question in the resource theory of non-stabilizer states and reveals a difference between the resource theory of non-stabilizer states and other resource theories such as entanglement and coherence.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
