For questions regarding anything related to magic states as resources for quantum computation and information. Magic (non-stabilizer) states are crucial in the state-injection model, and generate, via T-gadgets, the T-gates which are non-Clifford and make the set Clifford+T a universal gate set. On-topic includes manipulation, measurement, geometric understanding, fault-tolerance, resource, quantification, counting, simulation of these states.
Questions tagged [magic-states]
73 questions
14
votes
0 answers
What is the Generalized Quantum Stein's Lemma and why is it important?
I'm sensing a lot of buzz about potential re-proofs of the Generalized Quantum Stein's Lemma - a generalization of the quantum counterpart to the classical Stein's Lemma, which is of some importance in statistical inference and hypothesis…
Mark Spinelli
- 15,789
- 3
- 26
- 85
11
votes
1 answer
What is known about fault-tolerant computation with $T$-type magic states?
In Bravyi/Kitaev's original magic state paper, they define two types of magic states:
\begin{align}
|H\rangle\langle H| &= \frac{1}{2}\left[1+\frac{X+Z}{\sqrt{2}}\right]\\
|T\rangle\langle T| &=…
Jahan Claes
- 1,312
- 6
- 15
11
votes
1 answer
Good references to learn magic state distillation for fault tolerance
I need to learn magic state distillation procedure and their application to fault-tolerance.
One of the original paper on this subject is the following: https://arxiv.org/pdf/quant-ph/0403025.pdf
I am wondering if there are more recent and pedagogic…
Marco Fellous-Asiani
- 2,300
- 2
- 15
- 42
9
votes
0 answers
Can we distill magic states with arbitrary angle $\theta$?
There seems to be numerous work about the distillation protocol of the $T$-magic state
$$
\frac{1}{\sqrt{2}}(|0\rangle+e^{i\pi/4}|1\rangle).
$$
Similarly, I am wondering if it is possible to distill a $\theta$-magic…
Yunzhe
- 1,449
- 4
- 20
9
votes
3 answers
Universal Gate Set, Magic States, and costliness of the T gate
The usual universal gate set is $\mathcal{C} + T$ where $\mathcal{C}$ is the Clifford group and $T = \begin{pmatrix} 1 & 0 \\ 0 & e^{i\pi/4} \end{pmatrix} $ is the $\pi/8$ rotation gate. In practice we find a code that has $\mathcal{C}$ transversal…
Eric Kubischta
- 1,115
- 3
- 14
9
votes
3 answers
Magic state distillation: why is it harder to prepare the encoded $|A_{\pi/4}\rangle$ than $|0 \rangle$
My question is the following
Let's assume I am using Steane concatenated code to do error correction. I consider that the stabilizers are extracted fault-tolerantly through the Steane method. The Steane code admits transversal Clifford operations…
Marco Fellous-Asiani
- 2,300
- 2
- 15
- 42
8
votes
2 answers
Why are there eight $T$ magic state and twelve $H$ magic states?
I am learning magic state distillation.
We can define the following two states:
$$ |T\rangle \langle T | = \frac{1}{2}(I+\frac{1}{\sqrt{3}}(\sigma_x+\sigma_y+\sigma_z))$$
$$ |H\rangle \langle H | =…
Marco Fellous-Asiani
- 2,300
- 2
- 15
- 42
7
votes
1 answer
Definition of magic $T$ and $H$ states: are there different definitions for them?
I am a bit confused by the definition of magic $T$ and $H$ states and I would like to check if their name is actually not uniformly spread in the literature (or if I am not understanding something).
In the original paper about them, they are defined…
Marco Fellous-Asiani
- 2,300
- 2
- 15
- 42
6
votes
1 answer
Understanding the growth step of the magic state cultivation protocol
I'm having trouble following the description of the growth phase in the magic state cultivation protocol from Gidney2024. I would really appreciate a more detailed explanation of what's happening in Figure 9 of Gidney2024. In particular,
Do the…
BarryVu
- 61
- 1
6
votes
1 answer
Smallest distance-2 codes with non-trivial logical transversal $T$ gates
It has been shown that the $[[15, 1, 3]]$ code is the smallest distance-3 code with logical transversal $T$ gates (See arXiv:2210.14066). I say a code admits logical transversal $T$ gates if 1. The transversal physical $T^{\otimes n}$ is a logical…
Yunzhe
- 1,449
- 4
- 20
6
votes
0 answers
Universal gate set for the $ [[15,1,3]] $ code
The $ [[15,1,3]] $ triorthogonal code implements transversal $ T $. Since it is a CSS code, two blocks will also have a transversal $ CNOT $ gate. To get a universal gate set all that is required is an implementation of the Hadamard gate $ H $.
The…
Ian Gershon Teixeira
- 5,358
- 6
- 30
6
votes
1 answer
Getting intuition on the state-injection relations for the generalized $\exp(-iP \pi/8)$ $T$-gates (ideally using ZX calculus)
In Litinsky's paper, there are many circuits relations, like the one below.
The left handside represents the "rotation" $\exp(-i P \phi)$ with $\phi=\pi/8$ with similar definitions for the orange ($\phi=\pi/4$) and gray box ($\phi=\pi/2$) on the…
Marco Fellous-Asiani
- 2,300
- 2
- 15
- 42
6
votes
0 answers
Why the perfect 5-qubit code was used for magic state distillation?
I am currently trying to understand magic state distillation. So far, my understanding is that the general idea is to find a code where a non-Clifford gate is transversal (very well explained in https://arxiv.org/pdf/1612.07330.pdf on Fig. 3).
For…
Diego
- 61
- 3
5
votes
1 answer
What is the relation between magic states, contextuality and quantum advantage?
In several papers, including Wikipedia's quantum contextuality, contextuality is identified with quantum speed-up. However, due to Gottesmann-Knill theorem, for quantum speed-up we also need magic states (or some non-Clifford gate). A highly cited…
Mauricio
- 2,541
- 5
- 26
5
votes
1 answer
How many physical qubits does Magic state cultivation shave off from the "20 million physical qubits for RSA 2048" result?
Keeping everything in How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits the same ($10^{-3}$ physical error rate, 8 hours to complete the computation, same logical algorithm e.t.c) but with the only difference being that…
Victory Omole
- 2,514
- 1
- 10
- 24