Pith. sign in

REVIEW 1 cited by

Quantum $\mathcal{R}$-matrices as universal qubit gates

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

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 2004.07764 v1 pith:E7XPWFWD submitted 2020-04-16 hep-th quant-ph

Nikita Kolganov , Andrey Morozov This is my paper · ORCID
classification hep-thquant-ph
keywords quantumgatesmathcalmatricessomeuniversalalgorithmapproach
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

We study the Chern-Simons approach to the topological quantum computing. We use quantum $\mathcal{R}$-matrices as universal quantum gates and study the approximations of some one-qubit operations. We make some modifications to the known Solovay-Kitaev algorithm suitable for our particular problem.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

  1. Entangling gates from cabling of knots

    quant-ph 2024-12 conditional novelty 5.0 of 10

    Braiding two-strand cables of anyons gives a two-qubit controlled-phase gate with about 99 percent probability of staying in the computational space.

Pith tools