Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1104.1148

A method for exponential operator decomposition

Seçkin Şefi, Peter van Loock

Published Apr 6, 2011• 1 citation
arXivHTMLPDF

Abstract

Exponential operator decompositions are an important tool in many fields of physics, for example, in quantum control, quantum computation, or condensed matter physics. In this work, we present a method for obtaining such decompositions, which is efficient in terms of the required number of operators. Compared to existing schemes, our more direct approach is general, in the sense that it can be applied to various kinds of operators including nested commutation operators, and it is systematic.

DOI
10.48550/arxiv.1104.1148

Related papers

Approximating exponentials of commutators by optimized product formulas

Fernando Casas, Alejandro Escorihuela-Tomàs, Pablo A. M. Casares

Abstract Trotter product formulas constitute a cornerstone quantum Hamiltonian simulation technique. However, the efficient implementation of Hamiltonian evolution of nested commutators remains an under explored area. In this work, we construct optimized product formulas of orders 3–6 approximating the exponential of a commutator of two arbitrary operators in terms of the exponentials of the operators involved. The new schemes require a reduced number of exponentials and thus provide more efficient approximations than other previously published alternatives. They can also be used as basic methods in recursive procedures to increase the order of approximation. We expect this research will improve the efficiency of quantum control protocols, as well as quantum algorithms such as the Zassenhaus-based product formula, Magnus operator-based time-dependent simulation, and product formula schemes with modified potentials.

arXiv:2407.10533•Quantum Information Processing•Jan 31, 2025•5 citations

A new simple approach for disentangling some exponential operators

Yawei Wang

We recommend a new convenient method for disentangling some exponential operators,which can lead us to a set of new operator identities.

College Physics•Jan 1, 2012•0 citations

Physically motivated decompositions of single-qutrit gates

Aryan Iliat, Mark Byrd, Sahel Ashhab +1 more

Although only two quantum states of a physical system are often used to encode quantum information in the form of qubits, many levels can in principle be used to obtain qudits and increase the information capacity of the system. To take advantage of the additional levels, a parameterization of unitary transformations in terms of experimentally realizable operations is needed. Many parameterizations of unitary 3 * 3 matrices (U(3)) exist. One decomposition of a general unitary matrix can be expressed as the product of an exponential of a diagonal matrix and an exponential of an off-diagonal matrix. This decomposition is relevant for controlling superconducting qutrits using fixed-frequency resonant control pulses. This decomposition is numerically confirmed to allow the parameterization of any element in U(3). It is shown that a simple setting of parameter ranges of parameters can easily lead to an over-parameterization, in the sense that several different sets of values for the parameters produce the same element in U(3). This fact is demonstrated using the Walsh-Hadamard (WH) matrix as an example, which is also a special qutrit gate of practical interest. The different decompositions are shown to be related, and the relationships between them are presented using general methods. The shortest path needed for the implementation of a qutrit gate is found. Other parameterizations obtained by other analytic means, which can be advantageous for various reasons, are also discussed.

arXiv:2506.17797•Physical Review A•Jun 15, 2026•5 citations

Exponential operator methods for solving partial differential equations in quantum mechanics

Hai Shen

•Jan 1, 1991•0 citations

Optimised Trotter decompositions for classical and quantum computing

Johann Ostmeyer

Abstract Suzuki–Trotter decompositions of exponential operators like exp ( H t ) are required in almost every branch of numerical physics. Often the exponent under consideration has to be split into more than two operators H = ∑ k A k , for instance as local gates on quantum computers. We demonstrate how highly optimised schemes originally derived for exactly two operators A 1 , 2 can be applied to such generic Suzuki–Trotter decompositions, providing a formal proof of correctness as well as numerical evidence of efficiency. A comprehensive review of existing symmetric decomposition schemes up to order n ⩽ 4 is presented and complemented by a number of novel schemes, including both real and complex coefficients. We derive the theoretically most efficient unitary and non-unitary 4th order decompositions. The list is augmented by several exceptionally efficient schemes of higher order n ⩽ 8 . Furthermore we show how Taylor expansions can be used on classical devices to reach machine precision at a computational effort at which state of the art Trotterization schemes do not surpass a relative precision of 10 −4 . Finally, a short and easily understandable summary explains how to choose the optimal decomposition in any given scenario.

arXiv:2211.02691•Journal of Physics A Mathematical and Theoretical•Jun 15, 2023•54 citations

Higher-Order Decomposition Theory of Exponential Operators and Its Applications to QMC and Nonlinear Dynamics

Masuo Suzuki, Ken Umeno

Springer proceedings in physics•Jan 1, 1993•28 citations
Exponential operator decompositions are an important tool in many fields of physics, for example, in quantum control, quantum computation, or condensed matter physics. In this work, we present a method for obtaining such decompositions, which is efficient in terms of the required number of operators. Compared to existing schemes, our more direct approach is general, in the sense that it can be applied to various kinds of operators including nested commutation operators, and it is systematic.
Abstract Trotter product formulas constitute a cornerstone quantum Hamiltonian simulation technique. However, the efficient implementation of Hamiltonian evolution of nested commutators remains an under explored area. In this work, we construct optimized product formulas of orders 3–6 approximating the exponential of a commutator of two arbitrary operators in terms of the exponentials of the operators involved. The new schemes require a reduced number of exponentials and thus provide more efficient approximations than other previously published alternatives. They can also be used as basic methods in recursive procedures to increase the order of approximation. We expect this research will improve the efficiency of quantum control protocols, as well as quantum algorithms such as the Zassenhaus-based product formula, Magnus operator-based time-dependent simulation, and product formula schemes with modified potentials.
Although only two quantum states of a physical system are often used to encode quantum information in the form of qubits, many levels can in principle be used to obtain qudits and increase the information capacity of the system. To take advantage of the additional levels, a parameterization of unitary transformations in terms of experimentally realizable operations is needed. Many parameterizations of unitary 3 * 3 matrices (U(3)) exist. One decomposition of a general unitary matrix can be expressed as the product of an exponential of a diagonal matrix and an exponential of an off-diagonal matrix. This decomposition is relevant for controlling superconducting qutrits using fixed-frequency resonant control pulses. This decomposition is numerically confirmed to allow the parameterization of any element in U(3). It is shown that a simple setting of parameter ranges of parameters can easily lead to an over-parameterization, in the sense that several different sets of values for the parameters produce the same element in U(3). This fact is demonstrated using the Walsh-Hadamard (WH) matrix as an example, which is also a special qutrit gate of practical interest. The different decompositions are shown to be related, and the relationships between them are presented using general methods. The shortest path needed for the implementation of a qutrit gate is found. Other parameterizations obtained by other analytic means, which can be advantageous for various reasons, are also discussed.
Abstract Suzuki–Trotter decompositions of exponential operators like exp ( H t ) are required in almost every branch of numerical physics. Often the exponent under consideration has to be split into more than two operators H = ∑ k A k , for instance as local gates on quantum computers. We demonstrate how highly optimised schemes originally derived for exactly two operators A 1 , 2 can be applied to such generic Suzuki–Trotter decompositions, providing a formal proof of correctness as well as numerical evidence of efficiency. A comprehensive review of existing symmetric decomposition schemes up to order n ⩽ 4 is presented and complemented by a number of novel schemes, including both real and complex coefficients. We derive the theoretically most efficient unitary and non-unitary 4th order decompositions. The list is augmented by several exceptionally efficient schemes of higher order n ⩽ 8 . Furthermore we show how Taylor expansions can be used on classical devices to reach machine precision at a computational effort at which state of the art Trotterization schemes do not surpass a relative precision of 10 −4 . Finally, a short and easily understandable summary explains how to choose the optimal decomposition in any given scenario.