REVIEW 5 cited by
Recursive Cartan decompositions for unitary synthesis
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
abstract
Recursive Cartan decompositions (CDs) provide a way to exactly factorize quantum circuits into smaller components, making them a central tool for unitary synthesis. Here we present a detailed overview of recursive CDs, elucidating their mathematical structure, demonstrating their algorithmic utility, and implementing them numerically at large scales. We adapt, extend, and unify existing mathematical frameworks for recursive CDs, allowing us to gain new insights and streamline the construction of new circuit decompositions. Based on this, we show that several leading synthesis techniques from the literature-the Quantum Shannon, Block-ZXZ, and Khaneja-Glaser decompositions-implement the same recursive CD. We also present new recursive CDs based on the orthogonal and symplectic groups, and derive parameter-optimal decompositions. Furthermore, we aggregate numerical tools for CDs from the literature, put them into a common context, and complete them to allow for numerical implementations of all possible classical CDs in canonical form. As an application, we efficiently compile fast-forwardable Hamiltonian time evolution to fixed-depth circuits, compiling the transverse-field XY model on $10^3$ qubits into $2\times10^6$ gates in 22 seconds on a laptop.
Forward citations
Cited by 5 Pith papers
-
Particle-preserving fermionic shadows with mode-independent sample complexity
Derives improved mode-independent sample complexity bounds O(η log η) for fermionic classical shadows on particle-preserving operators and Slater determinant overlaps.
-
Classical shadows over symmetric spaces
Classical shadow protocols using uniform sampling over compact symmetric spaces admit a unifying theory and yield slight sample-complexity improvements over standard schemes for certain observable distributions.
-
GULPS: Two-Qubit Gate Synthesis via Linear Programming for Heterogeneous Instruction Sets
GULPS partitions two-qubit unitary synthesis into depth-2 segments solved via linear programming over Littlewood-Richardson inequalities followed by least-squares optimization, yielding faster and lower-cost decomposi...
-
On the KAK Decomposition and Equivalence Classes
For SU(4), local equivalence classes under SU(2)⊗SU(2) multiplication are not geometrically represented by the Weyl chamber; that chamber appears only under projective-local equivalence that ignores global phases.
-
Quantum phase estimation with optimal confidence interval using three control qubits
A DPSS control state for optimal-confidence quantum phase estimation can be approximated by a bond-dimension-4 matrix product state and prepared with only three recycling control qubits.
Discussion (0). Sign in to comment.