most citedAn Introduction to Cartan's KAK Decomposition for QC Programmers

48 citations · 64 across the 6 of their papers we have counts for

collaborators
Showing quant-phShow all

8 papers · 1 filter

quant-ph20051 cited

Replacing Two Controlled-U's with Two CNOTs

Robert R. Tucci

We give a simple, closed-form formula, what we call the Deflation Identity, for converting any 2-qubit circuit with exactly two controlled-U's (and some 1-qubit rotations) into an…

quant-ph200548 cited

An Introduction to Cartan's KAK Decomposition for QC Programmers

Robert R. Tucci

This paper presents no new results; its goals are purely pedagogical. A special case of the Cartan Decomposition has found much utility in the field of quantum computing, especiall…

quant-ph20041 cited

Quantum Compiling with Approximation of Multiplexors

Robert R. Tucci

A quantum compiling algorithm is an algorithm for decomposing ("compiling") an arbitrary unitary matrix into a sequence of elementary operations (SEO). Suppose is an $\nb$

quant-ph20048 cited

Quantum Fast Fourier Transform Viewed as a Special Case of Recursive Application of Cosine-Sine Decomposition

Robert R. Tucci

A quantum compiler is a software program for decomposing ("compiling") an arbitrary unitary matrix into a sequence of elementary operations (SEO). Coppersmith showed that the $\nb$

quant-ph20046 cited

Qubiter Algorithm Modification, Expressing Unstructured Unitary Matrices with Fewer CNOTs

Robert R. Tucci

A quantum compiler is a software program for decomposing ("compiling") an arbitrary unitary matrix into a sequence of elementary operations (SEO). The author of this paper is also…

quant-ph2004

QC Paulinesia

Robert R. Tucci

My goal in producing this document was to create a collection of qubit circuit identities that are used in Quantum Computing. Mathematicians and Physicists may consider it as being…