Pith. sign in

REVIEW 2 cited by

Pauli Decomposition over Commuting Subsets: Applications in Gate Synthesis, State Preparation, and Quantum Simulations

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 1603.06867 v1 pith:EASRCEF2 submitted 2016-03-22 quant-ph

Pauli Decomposition over Commuting Subsets: Applications in Gate Synthesis, State Preparation, and Quantum Simulations

classification quant-ph
keywords quantumunitarydecompositionpauliprotocolapplicationscommutinggates
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

A key task in quantum computation is the application of a sequence of gates implementing a specific unitary operation. However, the decomposition of an arbitrary unitary operation into simpler quantum gates is a nontrivial problem. Here we propose a general and robust protocol to decompose any target unitary into a sequence of Pauli rotations. The procedure involves identifying a commuting subset of Pauli operators having a high trace overlap with the target unitary, followed by a numerical optimization of their corresponding rotation angles. The protocol is demonstrated by decomposing several standard quantum operations. The applications of the protocol for quantum state preparation and quantum simulations are also described. Finally, we describe an NMR experiment implementing a three-body quantum simulation, wherein the above decomposition technique is used for the efficient realization of propagators.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Magic Gate Teleportation: Structure, Useful Resource States, and Simpler Feedforward

    quant-ph 2026-07 accept novelty 7.0

    MGT protocols encode the input into a measurement-heralded stabilizer code then apply a logical non-Clifford gate; useful resource states are Clifford-equivalent to diagonal states, and feedforward can often be Pauli.

  2. Geometric Algebra Quantum Gate Decomposition

    quant-ph 2026-06 unverdicted novelty 6.0

    Reformulates Pauli and Clifford groups in geometric algebra with a greedy rotor decomposition algorithm for Clifford operators and geometric view of Clifford+T universality.