<p>Generating quantum entanglement is plagued by decoherence. Distillation and error-correction are employed against such noise, but designing a good distillation circuit, especially on today’s imperfect hardware, is challenging. We develop a simulation algorithm for distillation circuits with per-gate complexity of <InlineEquation ID="IEq1"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="41534_2024_948_Article_IEq1.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="36" /> </InlineMediaObject> <EquationSource Format="TEX">\({\mathcal{O}}(1)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi class="MJX-tex-caligraphic" mathvariant="script">O</mi> <mrow> <mo>(</mo> <mrow> <mn>1</mn> </mrow> <mo>)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation>, drastically faster than <InlineEquation ID="IEq2"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="41534_2024_948_Article_IEq2.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="43" /> </InlineMediaObject> <EquationSource Format="TEX">\({\mathcal{O}}(N)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi class="MJX-tex-caligraphic" mathvariant="script">O</mi> <mrow> <mo>(</mo> <mrow> <mi>N</mi> </mrow> <mo>)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> Clifford simulators or <InlineEquation ID="IEq3"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="41534_2024_948_Article_IEq3.gif" Format="GIF" Height="21" Rendition="HTML" Resolution="72" Type="Linedraw" Width="47" /> </InlineMediaObject> <EquationSource Format="TEX">\({\mathcal{O}}({2}^{N})\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi class="MJX-tex-caligraphic" mathvariant="script">O</mi> <mrow> <mo>(</mo> <mrow> <msup> <mrow> <mn>2</mn> </mrow> <mrow> <mi>N</mi> </mrow> </msup> </mrow> <mo>)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> wavefunction simulators over <i>N</i> qubits. This simulator made it possible to optimize distillation circuits much larger than previously feasible. We design distillation circuits from <i>n</i> raw Bell pairs to <i>k</i> purified pairs and study the use of these circuits in the teleportation of logical qubits. The resulting purification circuits are the best-known for finite-size noisy hardware and can be fine-tuned for specific error-models. Furthermore, we design purification circuits that shape the correlations of errors in the purified pairs such that the performance of potential error-correcting codes is greatly improved.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Faster-than-Clifford simulations of entanglement purification circuits and their full-stack optimization

  • Vaishnavi L. Addala,
  • Shu Ge,
  • Stefan Krastanov

摘要

Generating quantum entanglement is plagued by decoherence. Distillation and error-correction are employed against such noise, but designing a good distillation circuit, especially on today’s imperfect hardware, is challenging. We develop a simulation algorithm for distillation circuits with per-gate complexity of \({\mathcal{O}}(1)\) O ( 1 ) , drastically faster than \({\mathcal{O}}(N)\) O ( N ) Clifford simulators or \({\mathcal{O}}({2}^{N})\) O ( 2 N ) wavefunction simulators over N qubits. This simulator made it possible to optimize distillation circuits much larger than previously feasible. We design distillation circuits from n raw Bell pairs to k purified pairs and study the use of these circuits in the teleportation of logical qubits. The resulting purification circuits are the best-known for finite-size noisy hardware and can be fine-tuned for specific error-models. Furthermore, we design purification circuits that shape the correlations of errors in the purified pairs such that the performance of potential error-correcting codes is greatly improved.