REVIEW 1 cited by
Controlled Gates in the Clifford Hierarchy
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
Controlled Gates in the Clifford Hierarchy
read the original abstract
In this note we prove a necessary set of conditions which must be satisfied by any controlled gate in the qubit Clifford Hierarchy. These conditions are straightforward to derive yet quite restricting. We also extend our proofs to gates composed of certain direct sums of unitaries. Finally, we provide some evidence that these conditions are also sufficient.
Forward citations
Cited by 1 Pith paper
-
Efficient simulation of logical magic state preparation protocols
A classical simulation method that propagates circuit-level Pauli noise to a Clifford error makes logical magic-state preparation protocols simulable in time polynomial in qubits and the target state's stabilizer rank.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.