تقرير
Optimally generating $\mathfrak{su}(2^N)$ using Pauli strings
| العنوان: | Optimally generating $\mathfrak{su}(2^N)$ using Pauli strings |
|---|---|
| المؤلفون: | Smith, Isaac D., Cautrès, Maxime, Stephen, David T., Nautrup, Hendrik Poulsen |
| سنة النشر: | 2024 |
| المجموعة: | Quantum Physics |
| مصطلحات موضوعية: | Quantum Physics |
| الوصف: | Any quantum computation consists of a sequence of unitary evolutions described by a finite set of Hamiltonians. When this set is taken to consist of only products of Pauli operators, we show that the minimal such set generating $\mathfrak{su}(2^{N})$ contains $2N+1$ elements. We provide a number of examples of such generating sets and furthermore provide an algorithm for producing a sequence of rotations corresponding to any given Pauli rotation, which is shown to have optimal complexity. Comment: 6+12 pages, comments welcome! |
| نوع الوثيقة: | Working Paper |
| URL الوصول: | http://arxiv.org/abs/2408.03294 |
| رقم الأكسشن: | edsarx.2408.03294 |
| قاعدة البيانات: | arXiv |
| الوصف غير متاح. |