A tree-approach Pauli decomposition algorithm with application to quantum computing (2403.11644v1)
Abstract: The Pauli matrices are 2-by-2 matrices that are very useful in quantum computing. They can be used as elementary gates in quantum circuits but also to decompose any matrix of $\mathbb{C}{2n \times 2n}$ as a linear combination of tensor products of the Pauli matrices. However, the computational cost of this decomposition is potentially very expensive since it can be exponential in $n$. In this paper, we propose an algorithm with a parallel implementation that optimizes this decomposition using a tree approach to avoid redundancy in the computation while using a limited memory footprint. We also explain how some particular matrix structures can be exploited to reduce the number of operations. We provide numerical experiments to evaluate the sequential and parallel performance of our decomposition algorithm and we illustrate how this algorithm can be applied to encode matrices in a quantum memory.
- Simulating hamiltonian dynamics with a truncated taylor series. Physical Review Letters, 114(9), 2015.
- Variational quantum linear solver. arXiv preprint arXiv:1909.05820, 2020.
- Explicit quantum circuits for block encodings of certain sparse matrices. arXiv preprint arXiv:2203.10236, 2022.
- Shantanav Chakraborty. Implementing any linear combination of unitaries on intermediate-term quantum computers. arXiv preprint arXiv:2302.13555, 2023.
- Quantum algorithm for systems of linear equations with exponentially improved dependence on precision. SIAM Journal on Computing, 46(6):1920–1950, 2017.
- Alexis De Vos and Stijn De Baerdemacker. The decomposition of an arbitrary 2w×2wsuperscript2𝑤superscript2𝑤2^{w}\times 2^{w}2 start_POSTSUPERSCRIPT italic_w end_POSTSUPERSCRIPT × 2 start_POSTSUPERSCRIPT italic_w end_POSTSUPERSCRIPT unitary matrix into signed permutation matrices. Linear Algebra and its Applications, 606:23–40, 2020.
- Eviden Quantum Lab. myQLM: Quantum Computing Framework, 2020-2024.
- The Feynman Lectures on Physics; Vol. I, volume 33. AAPT, 1965.
- Low overhead quantum computation using lattice surgery. arXiv preprint arXiv:1808.06709, 2019.
- Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics. In Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing. ACM, 2019.
- D. Gottesman. An introduction to quantum error correction and fault-tolerant quantum computation. In Proceedings of Symposia in Applied Mathematics, volume 68. American Mathematical Society, Washington, D.C., Oct 2010. arXiv:0904.2557.
- Tensorized Pauli decomposition algorithm. arXiv preprint arXiv.2310.13421, 2023.
- W. Heisenberg. Zur Theorie des Ferromagnetismus. Z. Phys., 49(9-10):619–636, 1928.
- Surface code quantum computing by lattice surgery. New Journal of Physics, 14(12):123011, 2012.
- Synthesis of quantum circuits by multiplex rotation gates. IEICE Electronics Express, 13, 02 2016.
- Quantum recommendation systems. arXiv preprint arXiv:1603.08675, 2016.
- Seth Lloyd. Universal quantum simulators. Science, 273(5278):1073–1078, 1996.
- Charles F.Van Loan. The ubiquitous Kronecker product. Journal of Computational and Applied Mathematics, 123(1):85–100, 2000. Numerical Analysis 2000. Vol. III: Linear Algebra.
- Quantum Computation and Quantum Information. Cambridge University Press, 2000.
- PennyLane. https://pennylane.ai/.
- Rocco Monteiro Nunes Pesce and Paul D. Stevenson. H2ZIXY: Pauli spin matrix decomposition of real symmetric matrices. arXiv preprint arXiv:2111.00627, 2021.
- Qiskit contributors. Qiskit: An open-source framework for quantum computing, 2023.
- Paulicomposer: Compute tensor products of pauli matrices efficiently. arXiv preprint arXiv:2301.00560, 2023.
- Optimal ancilla-free Clifford+T approximation of z-rotations. Quantum Information and Computation 16 (11-12), 16(11–12):901–953, 2016.
- The variational quantum eigensolver: A review of methods and best practices. Physics Reports, 986:1–128, 2022.
- Demonstration of a high-fidelity CNOT for fixed-frequency transmons with engineered ZZ suppression. Physical Review Letters, 127(13), 2021.
- 99.92%-fidelity CNOT gates in solids by filtering time-dependent and quantum noises. arXiv preprint arXiv:2212.02831, 2022.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Collections
Sign up for free to add this paper to one or more collections.
