Construction and local equivalence of dual-unitary operators: from dynamical maps to quantum combinatorial designs
Suhail Ahmad Rather, S. Aravinda, Arul Lakshminarayan

TL;DR
This paper analyzes the construction and properties of dual-unitary operators in quantum circuits, introduces new methods for generating them, and extends classical combinatorial designs to quantum ones, with a focus on two-qubit systems.
Contribution
It provides an analytical study of a nonlinear map for constructing dual-unitary operators, introduces stochastic variants, and extends classical combinatorial designs to quantum designs for dual-unitary operators.
Findings
Analytical description of basins of attraction for dual-unitary operators in two-qubit systems
Explicit construction of new dual and 2-unitary operators using nonlinear and stochastic maps
Extension of classical Latin square designs to quantum designs for dual-unitary operators
Abstract
While quantum circuits built from two-particle dual-unitary (maximally entangled) operators serve as minimal models of typically nonintegrable many-body systems, the construction and characterization of dual-unitary operators themselves are only partially understood. A nonlinear map on the space of unitary operators was proposed in PRL.~125, 070501 (2020) that results in operators being arbitrarily close to dual unitaries. Here we study the map analytically for the two-qubit case describing the basins of attraction, fixed points, and rates of approach to dual unitaries. A subset of dual-unitary operators having maximum entangling power are 2-unitary operators or perfect tensors, and are equivalent to four-party absolutely maximally entangled states. It is known that they only exist if the local dimension is larger than . We use the nonlinear map, and introduce stochastic variants…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Information and Cryptography
