Pith. Sign in

REVIEW

Selective recoupling and stochastic dynamical decoupling

PaperPDF from arXiv

data files

ReviewThe objections and verdict, as JSON Paper breakdownThe authors' claims, conditions and measurements, as JSON Signed receiptProof this review has not been altered
X Bluesky LinkedIn Reddit Hacker News
O. Kern, G. Alber

Quantum Physics · Submitted 20 Feb 2006 · 22 references

Pith's reading: Embedding deterministic selective recoupling into stochastic Pauli-random decoupling with symmetrization improves the error scaling of recoupled quantum gates and converts quadratic-in-time fidelity decay to linear.

T0 · AI review

How this review was made: An AI referee (deepseek-v4-flash) read the paper on August 28, 2026 and answered a fixed list of questions about it. T0 is the starting level every paper gets. The levels describe how deeply Pith has checked the paper, never the authors.

  1. T0 AI review An AI read the paper and answered a fixed list of questions.
  2. T1 Audit Automatic checks that the references and files the paper relies on exist and match.
  3. T2 Compute The paper's code or calculations re-run with the same results.
  4. T3 Formal statement The claims written out in a formal math language a computer can read.
  5. T4 Proof Those claims proved, and the proof checked by computer.

How Pith checks papers →

· Ask about this paper · The compiled record · Read the full review →
Challenge this review Comment (0) Read on arXiv ↗
Cite ▾
arXiv IDquant-ph/0602167 (version 1)
Pith IDAB57FMRL, Pith's permanent record of this paper and its review
CitationG. Alber, O. Kern. "Selective recoupling and stochastic dynamical decoupling." arXiv:quant-ph/0602167 (2006). https://pith.science/paper/AB57FMRL
Cite this reviewBibTeX for Pith's review of this paper
Claim paper
The paper

The paper claims

Embedding deterministic selective recoupling into stochastic Pauli-random decoupling with symmetrization improves the error scaling of recoupled quantum gates and converts quadratic-in-time fidelity decay to linear.

The reading

Quantum computers made from nuclear spins in a crystal suffer from unwanted interactions between spins. These interactions cause errors that grow over time. One way to fight this is called dynamical decoupling: applying carefully timed pulses that make the unwanted effects cancel out. But to actually run a computation, you sometimes want to keep one particular interaction, so you can use it as a gate. Selective recoupling does this by using special pulse patterns that switch off all couplings except the one you need. Unfortunately, the pulses do not remove all errors; leftover small errors add up over time, and the quality of the computation drops quadratically with time.

This paper shows how to slow that error growth. The authors take the recoupling pulse pattern and embed it inside a random-pulse scheme called PAREC. Between repetitions of the recoupling pattern, they apply random combinations of Pauli pulses. Because the errors from different random choices point in random directions, they mostly cancel out. A remaining piece, however, is the same for every random choice. To fix that, they add an extra step: random pi/2 rotations on the two qubits involved in the gate, which mix up the remaining error terms so that, on average, they just shift the gate strength slightly. By adjusting the pulse timing to account for this shift, the leftover error becomes much smaller.

The result is that the error in a two-qubit gate now falls as the fifth power of the number of pulse repetitions, instead of the fourth power, and the fidelity of a longer computation falls roughly linearly with time instead of quadratically. The authors demonstrate this with simulations of a swap gate and of a quantum sawtooth-map algorithm on nine qubits.

Extended reading notes

Core claim

The central claim is that embedding the deterministic selective recoupling scheme of Yamaguchi et al. into a stochastic PAREC decoupling scheme, together with a symmetrization step using random pi/2 pulses, suppresses residual errors to fourth order in J tau / hbar. This yields an improved recoupled Hamiltonian (Eq. 13) and changes the fidelity decay of a swap gate from exp(-c / n^4) to exp(-c_rs / n^5), and the fidelity of a long computation from quadratic-in-time to linear-in-time decay. If correct, this significantly increases the time scale of reliable quantum computation with dipolar-coupled nuclear spin qubits. The paper states: 'In contrast to Eq. (9), now the effective recoupling strength is renormalized and the residual error is suppressed up to fourth-order in the small coupling parameter J tau / hbar << 1.'

Load-bearing premise

The key premise is that the stochastic decoupling error bound of Eq. (15), derived for a time-independent Hamiltonian with random pulses applied at intervals Delta t, remains valid when applied to the residual second-order AHT term of the embedded scheme. The authors replace the norm of the Hamiltonian with J(J tau / hbar)^2 and Delta t with 36 tau, yielding the n^-5 fidelity scaling. If this replacement is not justified, the predicted improvement over the deterministic scheme may be an artifact. This assumption enters in Sec. II B where the random pulses are embedded and in Sec. III where the error bound is applied to the effective residual Hamiltonian.

Original abstract

An embedded selective recoupling method is proposed which is based on the idea of embedding the recently proposed deterministic selective recoupling scheme of Yamaguchi et al. [quant-ph/0411099] into a stochastic dynamical decoupling method, such as the recently proposed Pauli-random-error-correction-(PAREC) scheme [Eur. Phys. J. D 32, 153, quant-ph/0407262]. The recoupling scheme enables the implementation of elementary quantum gates in a quantum information processor by partial suppression of the unwanted interactions. The random dynamical decoupling method cancels a significant part of the residual interactions. Thus the time scale of reliable quantum computation is increased significantly. Numerical simulations are presented for a conditional two-qubit swap gate and for a complex iterative quantum algorithm.

The compiled record

The paper's own sentences, arranged, kept beside the review and separate from it. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.

Compiled by classifier-1.13.0 via TypeSafe API, question bank abstract-p1-20260923, 2026-09-23: 1 request, 4,900 input tokens.

What the abstract itself states, as probabilities: claims first 0.06 · states limitation 0.07 · human participants 0.01 · controlled comparison 0.08 · randomized assignment 0.05 · states quantitative result 0.06 · compares with prior results 0.54 · mentions code or data availability 0.03.

The abstract, sentence by sentence

arXiv listing abstract v1. Results and the main claim are underlined; .

An embedded selective recoupling method is proposed which is based on the idea of embedding the recently proposed deterministic selective recoupling scheme of Yamaguchi et al. [quant-ph/0411099] into a stochastic dynamical decoupling method, such as the recently proposed Pauli-random-error-correction-(PAREC) scheme [Eur. Phys. J. D 32, 153, quant-ph/0407262]. The recoupling scheme enables the implementation of elementary quantum gates in a quantum information processor by partial suppression of the unwanted interactions. The random dynamical decoupling method cancels a significant part of the residual interactions. Thus the time scale of reliable quantum computation is increased significantly. Numerical simulations are presented for a conditional two-qubit swap gate and for a complex iterative quantum algorithm.

background contribution method result interpretation main claim

What the classifier reports for each sentence. The number is the probability it gave the label.
#sentencerolethe authors' own workstates the main conclusionstrength
s0 An embedded selective recoupling method is proposed which is based on the idea of embedding the recently proposed deterministic selective recoupling scheme of Yamaguchi et al. [quant-ph/0411099] into a stochastic dynamical decoupling method, such as the recently proposed Pauli-random-error-correction-(PAREC) scheme [Eur. contribution 0.92 0.70 0.07 asserted 0.99
s1 Phys. J. D 32, 153, quant-ph/0407262]. background 0.93 0.05 0.03 unclear 0.98
s2 The recoupling scheme enables the implementation of elementary quantum gates in a quantum information processor by partial suppression of the unwanted interactions. method 0.49 0.34 0.11 asserted 0.98
s3 The random dynamical decoupling method cancels a significant part of the residual interactions. result 0.57 0.57 0.11 asserted 0.99
s4 Thus the time scale of reliable quantum computation is increased significantly. interpretation 0.65 0.56 0.63 asserted 1.00
s5 Numerical simulations are presented for a conditional two-qubit swap gate and for a complex iterative quantum algorithm. method 0.44 0.92 0.05 asserted 0.98

What kind of paper the classifier reports this is: method or tool 1.00 · evidence from simulation or computation 1.00.

What was examined, and what was not

sources read
  • arXiv listing abstract v1
not examined
  • full text
  • figures and tables
  • references and citing sentences
  • relations to other papers
levels run
  • P abstract
not run
  • S sections
  • T body sentences
  • C citations
  • R cross-paper relations

Every quoted sentence on this record is the authors'. Every label is from Pith's closed vocabulary, with the probability shown beside it. Every number in the measurements table is the authors', checked by code. Record as JSON

Figures
Figure 1. FIG. 1: Schematic representation of the unitary
Figure 2. FIG. 2: Schematic representation of a conditional two-qubi
Figure 3. FIG. 3: The fidelity (
Figure 4. FIG. 4: Quantum gates of the
Figure 7. FIG. 7: Logarithmic fidelity plots of the quantum sawtooth
Figure 8. FIG. 8: Husimi-distributions of the quantum states resulti

Showing 6 of the paper's 8 figures. See all figures in the PDF ↗ Figures reproduced from arXiv:quant-ph/0602167 by the authors.

Human review

How Pith checks papers → · Full audit of this paper →

References
How the literature uses it

1 arXiv paper cite this in 3 sentences

Each citing sentence is taken from the citing paper's LaTeX source and typed by Pith's classifier. A label appears at probability 0.8 or more (0.95 for support), a contest at 0.7 or more; the quoted words are the citing authors'. How each label was checked · JSON

Papers citing it · 1 sentence without a confident label

Builds on it 1 paper

Discussion

Disagree with the review, or know something it missed? Leave a comment, highlight any passage above to comment on it, or challenge this review formally.