REVIEW 7 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
Signed reviews
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.
Forward citations
Cited by 7 Pith papers
-
Cartan-Khaneja-Glaser decomposition of $SU(2^n)$ via involutive automorphisms
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 ...
-
Circuit Design for a Star-shaped Spin-Qubit Processor via Algebraic Decomposition and Optimal Control
A recursive Cartan-decomposition algorithm converts arbitrary unitaries into local rotations and diagonal phase gates native to central-spin NV processors, with optimized pulses reaching simulated fidelities of 0.988 ...
-
Routing Codes: High-Rate Quantum LDPC Codes with Short, Parallel Non-Local Connectivity
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.
-
Quantum simulation of massive Thirring and Gross--Neveu models for arbitrary number of flavors
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.
-
Scalable Quantum Architecture Search via Landscape Analysis
A zero-shot quantum architecture search ranks circuits by relative landscape fluctuation computed with Clifford sampling, then prunes redundant gates, reaching 50-qubit VQE simulations with fewer gates.
-
Symmetry, entanglement, and the $S$-matrix
Scattering amplitudes restricted to the span of identity and swap flavor gates are shown to commute with a diagonal SU(N) flavor symmetry and to obey exact selection rules.
-
Wess-Zumino terms in 0+1 SU(N) superspin systems
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.
Discussion (0). Continue with ORCID to comment.