magic state distillation

Magic state distillation is a method for creating more accurate quantum states from multiple noisy ones, which is important{{cite journal |last1=Campbell |first1=Earl T. |last2=Terhal |first2=Barbara M. |last3=Vuillot |first3=Christophe |title=Roads towards fault-tolerant universal quantum computation |journal=Nature |date=14 September 2017 |volume=549 |issue=7671 |pages=172–179 |doi=10.1038/nature23460|pmid=28905902 |arxiv=1612.07330 |bibcode=2017Natur.549..172C |s2cid=4446310 |url=http://eprints.whiterose.ac.uk/121343/1/1612.07330.pdf }} for building fault tolerant quantum computers. It has also been linked{{cite journal |last1=Howard |first1=Mark |last2=Wallman |first2=Joel |last3=Veitch |first3=Victor |last4=Emerson |first4=Joseph |title=Contextuality supplies the 'magic' for quantum computation |journal=Nature |date=11 June 2014 |volume=510 |issue=7505 |pages=351–355 |doi=10.1038/nature13460|pmid=24919152 |arxiv=1401.4174 |bibcode=2014Natur.510..351H |s2cid=4463585 }} to quantum contextuality, a concept thought to contribute to quantum computers' power.{{cite journal |last1=Bartlett |first1=Stephen D. |title=Powered by magic |journal=Nature |date=11 June 2014 |volume=510 |issue=7505 |pages=345–347 |doi=10.1038/nature13504|pmid=24919151 |doi-access=free }}

The technique was first proposed by Emanuel Knill in 2004,{{cite journal |last1=Knill |first1=E.|title = Fault-Tolerant Postselected Quantum Computation: Schemes |year=2004 |arxiv=quant-ph/0402171 |bibcode=2004quant.ph..2171K }}

and further analyzed by Sergey Bravyi and Alexei Kitaev the same year.

Thanks to the Gottesman–Knill theorem, it is known that some quantum operations (operations in the Clifford group) can be perfectly simulated in polynomial time on a classical computer. In order to achieve universal quantum computation, a quantum computer must be able to perform operations outside this set. Magic state distillation achieves this, in principle, by concentrating the usefulness of imperfect resources, represented by mixed states, into states that are conducive for performing operations that are difficult to simulate classically.

A variety of qubit magic state distillation routines{{Cite journal | arxiv = 1209.2426 |last1 = Bravyi|first1=Sergey |last2=Haah |first2=Jeongwan |title = Magic state distillation with low overhead|year = 2012 |journal=Physical Review A |volume=86 |issue = 5|pages=052329 |doi=10.1103/PhysRevA.86.052329| bibcode=2012PhRvA..86e2329B | s2cid=4399674 }}{{Cite journal | arxiv = 1204.4221 |last1 = Meier|first1=Adam |last2=Eastin |first2=Bryan |last3= Knill |first3=Emanuel |title = Magic-state distillation with the four-qubit code|year = 2013 |journal=Quantum Information & Computation |volume=13 |number=3–4 |pages=195–209| doi=10.26421/QIC13.3-4-2 | s2cid=27799877 }} and distillation routines for qubits{{cite journal |last1=Campbell |first1=Earl T. |last2=Anwar |first2=Hussain |last3=Browne |first3=Dan E. |title=Magic-State Distillation in All Prime Dimensions Using Quantum Reed-Muller Codes |journal=Physical Review X |date=27 December 2012 |volume=2 |issue=4 |pages=041021 |doi=10.1103/PhysRevX.2.041021|arxiv=1205.3104 |bibcode=2012PhRvX...2d1021C |doi-access=free }}{{cite journal |last1=Campbell |first1=Earl T. |title=Enhanced Fault-Tolerant Quantum Computing in d -Level Systems |journal=Physical Review Letters |date=3 December 2014 |volume=113 |issue=23 |pages=230501 |doi=10.1103/PhysRevLett.113.230501|pmid=25526106 |arxiv=1406.3055 |bibcode=2014PhRvL.113w0501C |s2cid=24978175 |url=https://refubium.fu-berlin.de/handle/fub188/17541 }}{{cite journal |last1=Prakash |first1=Shiroman |title=Magic state distillation with the ternary Golay code |journal=Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences |date=September 2020 |volume=476 |issue=2241 |pages=20200187 |doi=10.1098/rspa.2020.0187|pmid=33071576 | pmc=7544352 |arxiv=2003.02717 |bibcode=2020RSPSA.47600187P }} with various advantages have been proposed.

Stabilizer formalism

The Clifford group consists of a set of $n$ -qubit operations generated by the gates {{math|{H, S, CNOT} }} (where H is Hadamard and S is $\begin{bmatrix} 1 & 0 \\ 0 & i \end{bmatrix}$ ) called Clifford gates. The Clifford group generates stabilizer states which can be efficiently simulated classically, as shown by the Gottesman–Knill theorem. This set of gates with a non-Clifford operation is universal for quantum computation.{{Cite journal | arxiv = quant-ph/0403025 |last1 = Bravyi|first1=Sergey |last2=Kitaev | first2=Alexei|title =Universal quantum computation with ideal Clifford gates and noisy ancillas|year = 2005 |journal=Physical Review A |volume=71 |issue = 2|pages=022316 |doi=10.1103/PhysRevA.71.022316| bibcode=2005PhRvA..71b2316B | s2cid=17504370 }}

Magic states

Magic states are purified from $n$ copies of a mixed state $\rho$ . These states are typically provided via an ancilla to the circuit. A magic state for the $\pi/6$ rotation operator is $|M\rangle = \cos(\beta/2)|0\rangle + e^{i\frac{\pi}{4}}\sin(\beta/2)|1\rangle$ where $\beta = \arccos\left(\frac{1}{\sqrt 3}\right)$ . A non-Clifford gate can be generated by combining (copies of) magic states with Clifford gates. Since a set of Clifford gates combined with a non-Clifford gate is universal for quantum computation, magic states combined with Clifford gates are also universal.

Purification algorithm for distilling |''M''〉

The first magic state distillation algorithm, invented by Sergey Bravyi and Alexei Kitaev, is as follows.

: Input: Prepare 5 imperfect states.

: Output: An almost pure state having a small error probability.

: repeat

:: Apply the decoding operation of the five-qubit error correcting code and measure the syndrome.

:: If the measured syndrome is $|0000\rangle$ , the distillation attempt is successful.

:: else Get rid of the resulting state and restart the algorithm.

: until The states have been distilled to the desired purity.

References

Category:Quantum computing

Category:Algorithms