Compressive Gate Set Tomography
Flexible characterization techniques that provide a detailed picture of the experimental imperfections under realistic assumptions are crucial to gain actionable advice in the development of quantum computers. Gate set tomography self-consistently extracts a complete tomographic description of the i...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
American Physical Society
2023-03-01
|
| Series: | PRX Quantum |
| Online Access: | http://doi.org/10.1103/PRXQuantum.4.010325 |
| _version_ | 1811154940083568640 |
|---|---|
| author | Raphael Brieger Ingo Roth Martin Kliesch |
| author_facet | Raphael Brieger Ingo Roth Martin Kliesch |
| author_sort | Raphael Brieger |
| collection | DOAJ |
| description | Flexible characterization techniques that provide a detailed picture of the experimental imperfections under realistic assumptions are crucial to gain actionable advice in the development of quantum computers. Gate set tomography self-consistently extracts a complete tomographic description of the implementation of an entire set of quantum gates, as well as the initial state and measurement, from experimental data. It has become a standard tool for this task but comes with high requirements on the number of sequences and their design, making it already experimentally challenging for only two qubits. In this work, we show that low-rank approximations of gate sets can be obtained from significantly fewer gate sequences and that it is sufficient to draw them at random. This coherent noise characterization however still contains the crucial information for improving the implementation. To this end, we formulate the data processing problem of gate set tomography as a rank-constrained tensor completion problem. We provide an algorithm to solve this problem while respecting the usual positivity and normalization constraints of quantum mechanics. For this purpose, we combine methods from Riemannian optimization and machine learning and develop a saddle-free second-order geometrical optimization method on the complex Stiefel manifold. Besides the reduction in sequences, we numerically demonstrate that the algorithm does not rely on structured gate sets or an elaborate circuit design to robustly perform gate set tomography. Therefore, it is more flexible than traditional approaches. We also demonstrate how coherent errors in shadow estimation protocols can be mitigated using estimates from gate set tomography. |
| first_indexed | 2024-04-10T04:24:35Z |
| format | Article |
| id | doaj.art-057e431a013b4989b67847f7647a95dc |
| institution | Directory Open Access Journal |
| issn | 2691-3399 |
| language | English |
| last_indexed | 2024-04-10T04:24:35Z |
| publishDate | 2023-03-01 |
| publisher | American Physical Society |
| record_format | Article |
| series | PRX Quantum |
| spelling | doaj.art-057e431a013b4989b67847f7647a95dc2023-03-10T15:04:21ZengAmerican Physical SocietyPRX Quantum2691-33992023-03-014101032510.1103/PRXQuantum.4.010325Compressive Gate Set TomographyRaphael BriegerIngo RothMartin KlieschFlexible characterization techniques that provide a detailed picture of the experimental imperfections under realistic assumptions are crucial to gain actionable advice in the development of quantum computers. Gate set tomography self-consistently extracts a complete tomographic description of the implementation of an entire set of quantum gates, as well as the initial state and measurement, from experimental data. It has become a standard tool for this task but comes with high requirements on the number of sequences and their design, making it already experimentally challenging for only two qubits. In this work, we show that low-rank approximations of gate sets can be obtained from significantly fewer gate sequences and that it is sufficient to draw them at random. This coherent noise characterization however still contains the crucial information for improving the implementation. To this end, we formulate the data processing problem of gate set tomography as a rank-constrained tensor completion problem. We provide an algorithm to solve this problem while respecting the usual positivity and normalization constraints of quantum mechanics. For this purpose, we combine methods from Riemannian optimization and machine learning and develop a saddle-free second-order geometrical optimization method on the complex Stiefel manifold. Besides the reduction in sequences, we numerically demonstrate that the algorithm does not rely on structured gate sets or an elaborate circuit design to robustly perform gate set tomography. Therefore, it is more flexible than traditional approaches. We also demonstrate how coherent errors in shadow estimation protocols can be mitigated using estimates from gate set tomography.http://doi.org/10.1103/PRXQuantum.4.010325 |
| spellingShingle | Raphael Brieger Ingo Roth Martin Kliesch Compressive Gate Set Tomography PRX Quantum |
| title | Compressive Gate Set Tomography |
| title_full | Compressive Gate Set Tomography |
| title_fullStr | Compressive Gate Set Tomography |
| title_full_unstemmed | Compressive Gate Set Tomography |
| title_short | Compressive Gate Set Tomography |
| title_sort | compressive gate set tomography |
| url | http://doi.org/10.1103/PRXQuantum.4.010325 |
| work_keys_str_mv | AT raphaelbrieger compressivegatesettomography AT ingoroth compressivegatesettomography AT martinkliesch compressivegatesettomography |