Automated Synthesis of Fault-Tolerant State Preparation Circuits for Quantum Error-Correction Codes
A central ingredient in fault-tolerant quantum algorithms is the initialization of a logical state for a given quantum error-correcting code from a set of noisy qubits. A scheme that has demonstrated promising results for small code instances that are realizable on currently available hardware compo...
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
American Physical Society
2025-05-01
|
| Series: | PRX Quantum |
| Online Access: | http://doi.org/10.1103/PRXQuantum.6.020330 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1849329663337299968 |
|---|---|
| author | Tom Peham Ludwig Schmid Lucas Berent Markus Müller Robert Wille |
| author_facet | Tom Peham Ludwig Schmid Lucas Berent Markus Müller Robert Wille |
| author_sort | Tom Peham |
| collection | DOAJ |
| description | A central ingredient in fault-tolerant quantum algorithms is the initialization of a logical state for a given quantum error-correcting code from a set of noisy qubits. A scheme that has demonstrated promising results for small code instances that are realizable on currently available hardware composes a non-fault-tolerant state preparation circuit with a verification circuit that checks for spreading errors. Known circuit constructions of this scheme are mostly obtained manually, and no algorithmic techniques for constructing depth- or gate-optimal circuits exist. As a consequence, the current state-of-the-art exploits this scheme only for specific code instances and mostly for the special case of distance d=3 codes only. In this work, we propose an automated approach for synthesizing fault-tolerant state preparation circuits for arbitrary CSS codes. We utilize methods based on satisfiability solving (SAT) to construct fault-tolerant state preparation circuits consisting of depth- and gate-optimal preparation and verification circuits. We also provide heuristics that can synthesize fault-tolerant state preparation circuits for code instances where no optimal solution can be obtained in an adequate time. Moreover, we give a general construction for nondeterministic state preparation circuits for codes beyond distance 3. Numerical evaluations using d=3, d=5, and d=7 codes confirm that the generated circuits exhibit the desired scaling of the logical error rates. The resulting methods are publicly available as part of the Munich Quantum Toolkit (MQT) at https://github.com/cda-tum/mqt-qecc. Such methods are an important step in providing fault-tolerant circuit constructions that can aid in near-term demonstrations of fault-tolerant quantum computing. |
| format | Article |
| id | doaj-art-f992d7f44ece476688ef83867e4eaf77 |
| institution | Kabale University |
| issn | 2691-3399 |
| language | English |
| publishDate | 2025-05-01 |
| publisher | American Physical Society |
| record_format | Article |
| series | PRX Quantum |
| spelling | doaj-art-f992d7f44ece476688ef83867e4eaf772025-08-20T03:47:12ZengAmerican Physical SocietyPRX Quantum2691-33992025-05-016202033010.1103/PRXQuantum.6.020330Automated Synthesis of Fault-Tolerant State Preparation Circuits for Quantum Error-Correction CodesTom PehamLudwig SchmidLucas BerentMarkus MüllerRobert WilleA central ingredient in fault-tolerant quantum algorithms is the initialization of a logical state for a given quantum error-correcting code from a set of noisy qubits. A scheme that has demonstrated promising results for small code instances that are realizable on currently available hardware composes a non-fault-tolerant state preparation circuit with a verification circuit that checks for spreading errors. Known circuit constructions of this scheme are mostly obtained manually, and no algorithmic techniques for constructing depth- or gate-optimal circuits exist. As a consequence, the current state-of-the-art exploits this scheme only for specific code instances and mostly for the special case of distance d=3 codes only. In this work, we propose an automated approach for synthesizing fault-tolerant state preparation circuits for arbitrary CSS codes. We utilize methods based on satisfiability solving (SAT) to construct fault-tolerant state preparation circuits consisting of depth- and gate-optimal preparation and verification circuits. We also provide heuristics that can synthesize fault-tolerant state preparation circuits for code instances where no optimal solution can be obtained in an adequate time. Moreover, we give a general construction for nondeterministic state preparation circuits for codes beyond distance 3. Numerical evaluations using d=3, d=5, and d=7 codes confirm that the generated circuits exhibit the desired scaling of the logical error rates. The resulting methods are publicly available as part of the Munich Quantum Toolkit (MQT) at https://github.com/cda-tum/mqt-qecc. Such methods are an important step in providing fault-tolerant circuit constructions that can aid in near-term demonstrations of fault-tolerant quantum computing.http://doi.org/10.1103/PRXQuantum.6.020330 |
| spellingShingle | Tom Peham Ludwig Schmid Lucas Berent Markus Müller Robert Wille Automated Synthesis of Fault-Tolerant State Preparation Circuits for Quantum Error-Correction Codes PRX Quantum |
| title | Automated Synthesis of Fault-Tolerant State Preparation Circuits for Quantum Error-Correction Codes |
| title_full | Automated Synthesis of Fault-Tolerant State Preparation Circuits for Quantum Error-Correction Codes |
| title_fullStr | Automated Synthesis of Fault-Tolerant State Preparation Circuits for Quantum Error-Correction Codes |
| title_full_unstemmed | Automated Synthesis of Fault-Tolerant State Preparation Circuits for Quantum Error-Correction Codes |
| title_short | Automated Synthesis of Fault-Tolerant State Preparation Circuits for Quantum Error-Correction Codes |
| title_sort | automated synthesis of fault tolerant state preparation circuits for quantum error correction codes |
| url | http://doi.org/10.1103/PRXQuantum.6.020330 |
| work_keys_str_mv | AT tompeham automatedsynthesisoffaulttolerantstatepreparationcircuitsforquantumerrorcorrectioncodes AT ludwigschmid automatedsynthesisoffaulttolerantstatepreparationcircuitsforquantumerrorcorrectioncodes AT lucasberent automatedsynthesisoffaulttolerantstatepreparationcircuitsforquantumerrorcorrectioncodes AT markusmuller automatedsynthesisoffaulttolerantstatepreparationcircuitsforquantumerrorcorrectioncodes AT robertwille automatedsynthesisoffaulttolerantstatepreparationcircuitsforquantumerrorcorrectioncodes |