Faster-than-Clifford simulations of entanglement purification circuits and their full-stack optimization
Abstract 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...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Nature Portfolio
2025-01-01
|
| Series: | npj Quantum Information |
| Online Access: | https://doi.org/10.1038/s41534-024-00948-0 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832585501625810944 |
|---|---|
| author | Vaishnavi L. Addala Shu Ge Stefan Krastanov |
| author_facet | Vaishnavi L. Addala Shu Ge Stefan Krastanov |
| author_sort | Vaishnavi L. Addala |
| collection | DOAJ |
| description | Abstract 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. |
| format | Article |
| id | doaj-art-7ecafab8ae4341d8a94785cc25c7d9bd |
| institution | Kabale University |
| issn | 2056-6387 |
| language | English |
| publishDate | 2025-01-01 |
| publisher | Nature Portfolio |
| record_format | Article |
| series | npj Quantum Information |
| spelling | doaj-art-7ecafab8ae4341d8a94785cc25c7d9bd2025-01-26T12:46:19ZengNature Portfolionpj Quantum Information2056-63872025-01-0111111010.1038/s41534-024-00948-0Faster-than-Clifford simulations of entanglement purification circuits and their full-stack optimizationVaishnavi L. Addala0Shu Ge1Stefan Krastanov2Department of Electrical Engineering and Computer Science, Massachusetts Institute of TechnologyDepartment of Electrical Engineering and Computer Science, Massachusetts Institute of TechnologyDepartment of Electrical Engineering and Computer Science, Massachusetts Institute of TechnologyAbstract 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.https://doi.org/10.1038/s41534-024-00948-0 |
| spellingShingle | Vaishnavi L. Addala Shu Ge Stefan Krastanov Faster-than-Clifford simulations of entanglement purification circuits and their full-stack optimization npj Quantum Information |
| title | Faster-than-Clifford simulations of entanglement purification circuits and their full-stack optimization |
| title_full | Faster-than-Clifford simulations of entanglement purification circuits and their full-stack optimization |
| title_fullStr | Faster-than-Clifford simulations of entanglement purification circuits and their full-stack optimization |
| title_full_unstemmed | Faster-than-Clifford simulations of entanglement purification circuits and their full-stack optimization |
| title_short | Faster-than-Clifford simulations of entanglement purification circuits and their full-stack optimization |
| title_sort | faster than clifford simulations of entanglement purification circuits and their full stack optimization |
| url | https://doi.org/10.1038/s41534-024-00948-0 |
| work_keys_str_mv | AT vaishnaviladdala fasterthancliffordsimulationsofentanglementpurificationcircuitsandtheirfullstackoptimization AT shuge fasterthancliffordsimulationsofentanglementpurificationcircuitsandtheirfullstackoptimization AT stefankrastanov fasterthancliffordsimulationsofentanglementpurificationcircuitsandtheirfullstackoptimization |