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

Cambridge University Press eBooks

Unitary ordered exponentials

H. M. Fried

Published Oct 10, 2002• 0 citations
Publisher
DOI
10.1017/cbo9780511535079.010

Related papers

The Exponential Representation of Unitary Matrices

R. F. Rinehart

Mathematics Magazine•Mar 1, 1964•2 citations

Wei–Norman equations for a unitary evolution

Szymon Charzyński, Marek Kuś

The Wei-Norman technique allows to express the solution of a system of linear non-autonomous differential equations in terms of product of exponentials. In particular it enables to find a time-ordered product of exponentials by solving a set of nonlinear differential equations. The method has numerous theoretical and computational advantages, in particular in optimal control theory. We show that in the unitary case, i.e.\ when the solution of the linear system is given by a unitary evolution operator, the nonlinear system can be by an appropriate choice of ordering reduced to a hierarchy of matrix Riccati equations. Our findings have a particular significance in quantum control theory since pure quantum evolution is unitary.

arXiv:1302.2602•Journal of Physics A Mathematical and Theoretical•Jun 12, 2013•19 citations

Algebra of the Exponential Operator

Ravinder Rupchand Puri

Springer series in optical sciences/SPringer series in optical sciences•Jan 1, 2001•2 citations

High order non-unitary split-step decomposition of unitary operators

Tomaž Prosen, Iztok Pižorn

We propose a high order numerical decomposition of exponentials of Hermitian operators in terms of a product of exponentials of simple terms, following an idea which has been pioneered by M Suzuki, implementing it for complex coefficients. We outline a convenient fourth-order formula which can be written compactly for an arbitrary number of non-commuting terms in the Hamiltonian and which is superior to the optimal formula with real coefficients, both in complexity and accuracy. We show asymptotic stability of our method for a sufficiently small time step and demonstrate its efficiency and accuracy in different numerical models.

arXiv:quant-ph/0602074•Journal of Physics A Mathematical and General•May 3, 2006•13 citations

Reversing Unknown Quantum Transformations: Universal Quantum Circuit for Inverting General Unitary Operations

Marco Túlio Quintino, Qingxiuxiong Dong, Atsushi Shimbo +2 more

Given a quantum gate implementing a d-dimensional unitary operation U_{d}, without any specific description but d, and permitted to use k times, we present a universal probabilistic heralded quantum circuit that implements the exact inverse U_{d}^{-1}, whose failure probability decays exponentially in k. The protocol employs an adaptive strategy, proven necessary for the exponential performance. It requires that k≥d-1, proven necessary for the exact implementation of U_{d}^{-1} with quantum circuits. Moreover, even when quantum circuits with indefinite causal order are allowed, k≥d-1 uses are required. We then present a finite set of linear and positive semidefinite constraints characterizing universal unitary inversion protocols and formulate a convex optimization problem whose solution is the maximum success probability for given k and d. The optimal values are computed using semidefinite programing solvers for k≤3 when d=2 and k≤2 for d=3. With this numerical approach we show for the first time that indefinite causal order circuits provide an advantage over causally ordered ones in a task involving multiple uses of the same unitary operation.

arXiv:1810.06944•Physical Review Letters•Nov 21, 2019•108 citations

Unitary Transformations

Brian P. Anderson

SPIE eBooks•Sep 12, 2019•1 citation
The Wei-Norman technique allows to express the solution of a system of linear non-autonomous differential equations in terms of product of exponentials. In particular it enables to find a time-ordered product of exponentials by solving a set of nonlinear differential equations. The method has numerous theoretical and computational advantages, in particular in optimal control theory. We show that in the unitary case, i.e.\ when the solution of the linear system is given by a unitary evolution operator, the nonlinear system can be by an appropriate choice of ordering reduced to a hierarchy of matrix Riccati equations. Our findings have a particular significance in quantum control theory since pure quantum evolution is unitary.
We propose a high order numerical decomposition of exponentials of Hermitian operators in terms of a product of exponentials of simple terms, following an idea which has been pioneered by M Suzuki, implementing it for complex coefficients. We outline a convenient fourth-order formula which can be written compactly for an arbitrary number of non-commuting terms in the Hamiltonian and which is superior to the optimal formula with real coefficients, both in complexity and accuracy. We show asymptotic stability of our method for a sufficiently small time step and demonstrate its efficiency and accuracy in different numerical models.
Given a quantum gate implementing a d-dimensional unitary operation U_{d}, without any specific description but d, and permitted to use k times, we present a universal probabilistic heralded quantum circuit that implements the exact inverse U_{d}^{-1}, whose failure probability decays exponentially in k. The protocol employs an adaptive strategy, proven necessary for the exponential performance. It requires that k≥d-1, proven necessary for the exact implementation of U_{d}^{-1} with quantum circuits. Moreover, even when quantum circuits with indefinite causal order are allowed, k≥d-1 uses are required. We then present a finite set of linear and positive semidefinite constraints characterizing universal unitary inversion protocols and formulate a convex optimization problem whose solution is the maximum success probability for given k and d. The optimal values are computed using semidefinite programing solvers for k≤3 when d=2 and k≤2 for d=3. With this numerical approach we show for the first time that indefinite causal order circuits provide an advantage over causally ordered ones in a task involving multiple uses of the same unitary operation.