Pith. sign in

REVIEW 4 cited by

Cartan Decomposition of SU(2^n), Constructive Controllability of Spin systems and Universal Quantum Computing

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

arxiv quant-ph/0010100 v1 pith:T7E7P3GA submitted 2000-10-29 quant-ph

classification quant-ph
keywords arbitraryquantumtransformationunitarycartandecompositionexplicitgates
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

In this paper we provide an explicit parameterization of arbitrary unitary transformation acting on n qubits, in terms of one and two qubit quantum gates. The construction is based on successive Cartan decompositions of the semi-simple Lie group, SU(2^n). The decomposition highlights the geometric aspects of building an arbitrary unitary transformation out of quantum gates and makes explicit the choice of pulse sequences for the implementation of arbitrary unitary transformation on $n coupled spins. Finally we make observations on the optimality of the design procedure.

Discussion (0). Sign in to comment.

Forward citations

Cited by 4 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. OpenAlex reports about 229 citations worldwide. Full citation record

  1. Cartan-Khaneja-Glaser decomposition of $SU(2^n)$ via involutive automorphisms

    quant-ph 2025-09 conditional novelty 6.0 of 10

    Reformulation of Cartan-Khaneja-Glaser decomposition for SU(2^n) via involutive automorphisms and symmetric Lie algebra decompositions yields a stable recursive factorization with open-source Python code validated on ...

  2. Routing Codes: High-Rate Quantum LDPC Codes with Short, Parallel Non-Local Connectivity

    quant-ph 2026-06 unverdicted novelty 5.0 of 10

    Routing codes are high-rate qLDPC codes with short parallel non-local couplings that achieve BB-code rates while cutting qubit overhead by a factor of ~8 versus surface codes in circuit simulations.

  3. Quantum simulation of massive Thirring and Gross--Neveu models for arbitrary number of flavors

    quant-ph 2026-02 unverdicted novelty 5.0 of 10

    Quantum simulation methods for Thirring and Gross-Neveu fermionic models with arbitrary flavors, including gate complexity bounds and ground-state preparation up to 20 qubits.

  4. Wess-Zumino terms in 0+1 SU(N) superspin systems

    cond-mat.str-el 2026-06 unverdicted novelty 3.0 of 10

    Derives local Wess-Zumino terms for SU(3) and SU(4) superspins by identifying the phase space with CP^{N-1} and building on the SU(2) coherent-state path integral.

Pith tools