Pith. Sign in

REVIEW

Applications of coherent classical communication and the Schur transform to quantum information theory

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
Aram W. Harrow

Quantum Physics · Submitted 30 Dec 2005 · 184 references

Pith's verdict: A real thesis with two solid contributions: the polynomial Schur transform circuit and the coherent-communication resource calculus; the soft spots are the explicitly labelled conjectures, not the main claims.

T0 · AI review

How this review was made: An AI referee (selfhosted/deepseek-v4.1-flash) read the paper on November 11, 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 →

· 1 major objection · 6 minor · Ask about this paper · The compiled record · Read the full review →
Challenge this review Comment (0) Read on arXiv ↗
Cite ▾
arXiv IDquant-ph/0512255 (version 1)
Pith IDP6FJ3SHM, Pith's permanent record of this paper and its review
CitationAram W. Harrow. "Applications of coherent classical communication and the Schur transform to quantum information theory." arXiv:quant-ph/0512255 (2005). https://pith.science/paper/P6FJ3SHM
Cite this reviewBibTeX for Pith's review of this paper
Claim paper

Why Pith says this

Highlight any text to comment on it.

Referee report

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

The paper

The paper claims

The thesis claims that coherent classical communication unifies quantum Shannon-theoretic protocols and that the Schur transform has a polynomial-size quantum circuit.

The reading

This thesis sets out to show that two abstract tools can do real work across quantum information theory. The first is coherent classical communication: a classical message sent through a unitary interaction while the sender keeps the purifying half, so the message can remain entangled with the rest of the protocol; the thesis argues this 'cobit' is a natural resource that turns many classical-quantum coding arguments into purely quantum ones and yields optimal tradeoff curves between two noiseless resources. The second is the Schur transform, the basis change on $(mathbb{C}^d)^{otimes n}$ that simultaneously diagonalizes the permutation action of $S_n$ and the collective rotation action of $U_d$; the thesis claims a quantum circuit of size polynomial in $n$, $d$, and $log(1/varepsilon)$ approximates it to error $varepsilon$. If correct, the Schur transform becomes an efficient subroutine for quantum communication protocols and representation-theoretic algorithms, while coherent communication supplies a reusable calculus for proving capacity regions rather than one-off coding theorems.

What carries the argument

The load-bearing object in the second half is Schur-Weyl duality: the commuting actions of $S_n$ and $U_d$ on $(mathbb{C}^d)^{otimes n}$ decompose the space into irreducible representation blocks labeled by partitions $lambda$, and the Schur basis labels those blocks together with multiplicity and vector indices. The circuit is assembled from Clebsch-Gordan transforms, which combine two irreducible representations into their allowed sums; the thesis makes these efficient using subgroup-adapted bases and a recursive reduced Wigner operator. In the first half the load-bearing object is the coherent channel $Delta_d$ (the 'cobit'), a unitary version of a classical channel with feedback, together with resource inequalities, decoupling, and the cancellation lemma that let classical coding theorems be lifted into coherent quantum protocols.

Extended reading notes

Core claim

The central technical claim is that the Schur transform is efficiently computable. The thesis reduces it to a sequence of Clebsch-Gordan transforms, gives subgroup-adapted bases to organize the reduction, and supplies a recursive circuit for the Clebsch-Gordan transform built on the Wigner-Eckart theorem; the resulting circuit is claimed to run in time polynomial in $n$, $d$, and $log(1/varepsilon)$. In parallel, the thesis claims that coherent classical communication—sending a classical label through an isometry $|xranglemapsto|xrangle|xrangle$ rather than through a dephasing channel—is an asymptotic resource that can be substituted into classical-quantum protocols without losing coherence. Using it, the thesis derives and unifies optimal two-dimensional tradeoff curves for noisy super-dense coding, entanglement distillation, noisy teleportation, entanglement-assisted classical and quantum communication, and related tasks.

Load-bearing premise

The load-bearing premise is that the Schur transform really can be built from polynomially many efficiently implementable Clebsch-Gordan steps, with no hidden super-polynomial cost in the number of representations or in precision, and that the classical messages used in the coherent protocols can be made independent of the rest of the state at no extra cost.

Editorial extensions

If this is right

  • The Schur transform can be called as a polynomial-size subroutine in protocols that need the Schur basis, instead of remaining an existence statement from representation theory.
  • Coherent classical communication gives a single derivation of optimal tradeoff curves for several noisy-resource protocols, including noisy super-dense coding, entanglement distillation, and noisy teleportation.
  • Classical communication through a unitary gate is not equivalent to ordinary cbits: the thesis proves $C_+(U)le E(U)$ and uses coherent communication to show asymptotic capacity equivalences such as $langlemathrm{swap}rangle=2langlemathrm{cnot}rangle=langlemathrm{dcnot}rangle$.
  • The Schur transform and the $S_n$ quantum Fourier transform are algorithmically interconvertible: generalized phase estimation uses the QFT to measure in the Schur basis, and a variant of the $S_n$ QFT can be derived from one Schur transform.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • If the circuit's constants are reasonable, the Schur transform could become a standard preprocessing step in quantum algorithms that exploit permutation symmetry, much as the Fourier transform is for abelian symmetry.
  • The coherent-communication recipe suggests a general compiler: any classical-quantum protocol whose classical messages are decoupled can be lifted to a quantum protocol, which may expose new capacity regions without reproving converses from scratch.
  • The tradeoff-curve method is likely to hit the same wall the thesis notes for bidirectional communication: when messages interfere, the one-way resource calculus no longer gives a rectangular rate region, so new composition rules would be needed.
  • A useful test would be to instantiate the Schur transform for small $n,d$ and measure gate counts against the claimed polynomial, or to search for a gate whose coherent capacity pair violates the proposed tradeoff region.
Original abstract

Quantum mechanics has led not only to new physical theories, but also a new understanding of information and computation. Quantum information began by yielding new methods for achieving classical tasks such as factoring and key distribution but also suggests a completely new set of quantum problems, such as sending quantum information over quantum channels or efficiently performing particular basis changes on a quantum computer. This thesis contributes two new, purely quantum, tools to quantum information theory--coherent classical communication in the first half and an efficient quantum circuit for the Schur transform in the second half.

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, 2,992 input tokens.

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

The abstract, sentence by sentence

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

Quantum mechanics has led not only to new physical theories, but also a new understanding of information and computation. Quantum information began by yielding new methods for achieving classical tasks such as factoring and key distribution but also suggests a completely new set of quantum problems, such as sending quantum information over quantum channels or efficiently performing particular basis changes on a quantum computer. This thesis contributes two new, purely quantum, tools to quantum information theory--coherent classical communication in the first half and an efficient quantum circuit for the Schur transform in the second half.

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 Quantum mechanics has led not only to new physical theories, but also a new understanding of information and computation. background 1.00 0.03 0.03 asserted 1.00
s1 Quantum information began by yielding new methods for achieving classical tasks such as factoring and key distribution but also suggests a completely new set of quantum problems, such as sending quantum information over quantum channels or efficiently performing particular basis changes on a quantum computer. background 1.00 0.04 0.04 asserted 0.55
s2 This thesis contributes two new, purely quantum, tools to quantum information theory--coherent classical communication in the first half and an efficient quantum circuit for the Schur transform in the second half. contribution 1.00 0.95 0.72 asserted 1.00

What kind of paper the classifier reports this is: method or tool 1.00 · evidence from proof or derivation 0.93.

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 0. 1: Dependencies between different chapters of this
Figure 1. 1: The sliding protocol. We would like to simulate
Figure 2. 1: Example of a possible achievable rate region CC(
Figure 3. 1: Schematic diagrams for Pn and P ′ n . (a) A given protocol Pn for two-way classical communication. The output is a superposition (over all a ′ , b′ ) of the depicted states, with most of the weight in the (a ′ , b′ ) = (a, b) term. The unlabeled output systems in the state |γ a,b a′ ,b′ i are A2, B2. (b) The same protocol with the inputs copied to local ancillas A0, B0 before Pn. If |γ a,b a,b i is independent of a, b, two-way coherent classical communication is achieved. (c) The five steps of P ′ n. Steps (1)-(4) are shown in solid lines. Again, the inputs are copied to local…
Figure 4. 1: A general protocol for noisy super-dense coding
Figure 5. 1: The Schur transform. Notice how the direct sum ov
Figure 6. 2: The quantum channel U ⊗n N is decomposed in the Schur basis with teleportation replacing the Sn CG transform. Here the intermediate state |αi belongs to (PλA ⊗ PλB ⊗ PλE ) Sn , the box labeled √ DAhΦλA | represents projecting onto the maximally entangled state |ΦλA i and normalization requires multiplying the residual state by √ DA, where DA := dim PλA . • Define Ten N (ǫ) := {(λA, λB, λE) : ∃ψ ABE ∈ R(N ) s.t. Tr(ΠA λA ⊗ ΠB λB ⊗ ΠE λE )ψ ⊗n ≥ ǫ}. This set tells us which (λA, λB, λE) we need to consider when working with purified outputs of U ⊗n N . To see this note that i
Figure 7. 4: The reduced Wigner transform Tˆ[d] can be expressed as a d×d rotation whose coefficients are controlled by µ and µ ′ + ej ′ . We have now reduced the problem of performing the CG transform U [d] CG to the problem of com￾puting reduced Wigner coefficients Tˆµ,j,µ′ ,j′ . 7.3.3 Efficient Circuit for the Reduced Wigner Operator The method of Biedenharn and Louck[BL68] allows us to compute reduced Wigner coefficients for the cases we are interested in. This will allow us to construct an efficient circuit to implement the controlled-Tˆ operator to accuracy ǫ using an overhead which sca
Figure 8. 2: Performing Cˆ ρ combines Vµ and Vν to form Vλ and splits V ∗ µ into V ∗ λ and Vν. Here Vµ ⊗ V ∗ µ and Vλ ⊗ V ∗ λ come from the decomposition of C[G] and Vν comes from the decomposition of V . We can verify the two maps separately by replacing Cˆ ρ in Eq. (8.26) with UCG or U † CG acting on the appropriate registers and checking that the representation matrices transform appropriately. There are two details here which still need to be explained. First, our description of the CG transform has not accounted for the multiplicity spaces that are generated. Second, we have not

Figures reproduced from arXiv:quant-ph/0512255 by the authors.

References
How later papers used it

65 later papers cite it

Evidence: substantial. 60 of the citing papers share no author with it, and 22 of those carry a confident label from Pith's citation classifier.

Pith read 19 of the 145 citing sentences, choosing only those whose citation markers point at this paper alone, and wrote the paraphrases from them. The summary, the counts, the evidence level, the links and the quotes come from code; the summary counts the papers listed below. A later paper is listed under a label when Pith's citation classifier gives one of its sentences that label at probability 0.8 or more (0.95 for support), Pith's reading finds that the citing paper itself did it, and a second check confirms the paraphrase against the sentence. This section lists uses only. It does not list criticism or disagreement, so their absence here says nothing about how the paper has been received. Papers that share an author with this one are listed apart, under "By the same authors". A quote is the citing authors' own sentence, shown when their paper's licence is CC BY, CC BY-SA or CC0. JSON

Uses its method or tool 3 of 23 papers with this label · 1 by the same authors

By the same authors

  • Followed this paper's treatment of the mathematics behind Schur duality.

    Quantum Reverse Shannon Theorem (2009) (same authors) · 0.95 · paraphrased: the licence does not allow quoting

Compares with it 1 of 2 papers with this label
How the literature uses it

68 arXiv papers cite this in 149 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 · 81 sentences without a confident label

Uses its method or tool 24 papers
Compares with it 2 papers
Cites it as background 22 papers

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.