Pith. sign in

REVIEW 3 cited by

Universal Refocusing of Systematic Quantum Noise

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 1602.07963 v1 pith:LWYBYTO5 submitted 2016-02-25 quant-ph

classification quant-ph
keywords quantumpulsesrefocusingsystemachievedapplicationevolutionmethods
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
abstract

Refocusing of a quantum system in NMR and quantum information processing can be achieved by application of short pulses according to the methods of spin echo and dynamical decoupling. However, these methods are strongly limited by the requirement that the evolution of the system between pulses be suitably small. Here we show how refocusing may be achieved for arbitrary (but time-independent) evolution of the system between pulses. We first illustrate the procedure with one-qubit systems, and then generalize to $d$-dimensional quantum systems. We also give an application of this result to quantum computation, proving a new version of the Solovay-Kitaev theorem that does not require inverse gates.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

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

  1. Optimal complex conjugation of unknown isometry channels

    quant-ph 2026-07 accept novelty 7.0 of 10

    The optimal n-use fidelity for complex conjugating an unknown isometry C^d→C^D is derived in closed form, with parallel protocols proven optimal among all general quantum superchannels.

  2. Sequential quantum processes with group symmetries

    quant-ph 2025-10 conditional novelty 7.0 of 10

    A canonical streaming circuit decomposition for (G×H)-invariant quantum combs is derived, and numerical optimization suggests a deterministic 7-query transposition protocol for qutrits that is reported as exact.

  3. Probabilistic exact universal quantum circuits for transforming unitary operations

    quant-ph 2019-09 conditional novelty 7.0 of 10

    The paper derives optimal success probabilities and no-go thresholds for probabilistically transforming unknown unitary operations into their transpose, complex conjugate, or inverse, and proves adaptive circuits give...

Pith tools