Pith. sign in

REVIEW 5 minor 34 references

Path superposition plus local unitaries can teleport CNOT and CZ gates deterministically without moving the qubits.

Reviewed by Pith at T0; open to challenge. T0 means a machine referee read the full paper against a public rubric. the ladder, T0–T4 →

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

T0 review · grok-4.5

2026-07-11 15:25 UTC pith:Q4Y4TTWY

load-bearing objection Clean, self-contained design framework for path-superposition QGT of CNOT/CZ; math checks by substitution, scope limitations are stated rather than hidden.

arxiv 2607.04672 v1 pith:Q4Y4TTWY submitted 2026-07-06 quant-ph

A Path-Superposition Framework for Quantum Gate Teleportation

Santiago \'Avila , Marco Enr\'iquez This is my paper
classification quant-ph
keywords quantum gate teleportationpath superpositiondistributed quantum computingCNOTcontrolled-Zphotonic realizationmaximally entangled resource
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

This paper claims that distant parties can implement a nonlocal two-qubit gate without sending the qubits themselves, by treating path superposition as the design resource. Alice and Bob share a phase-tuned entangled pair that steers each of them into one of two local unitary operations; after they measure the control qubits and apply simple local corrections, both measurement branches map onto the same target gate up to a global phase. The authors spell out three design conditions (normalization, equal branch probability for every input, and local correctability) and show that they are satisfied by explicit operator families for CNOT and for controlled-Z. Because the same protocol architecture works for both gates once the phase and the local unitaries are chosen correctly, path superposition becomes a modular primitive for distributed quantum computing rather than a one-off construction. A sketched photonic layout using spatial paths and polarization shows that the scheme is compatible with existing linear-optics hardware.

Core claim

A general path-superposition framework teleports a chosen nonlocal two-qubit gate once the phase η of a shared maximally entangled resource and four path-dependent local unitaries are selected so that the two measurement branches are equally likely for every input and are locally correctable to the target operation. Explicit constructions realize deterministic CNOT (η=π/2) and CZ (η=0) teleportation.

What carries the argument

The three design conditions on η and the path-dependent unitaries VA1,VA2,VB1,VB2—especially the state-independent equal-probability requirement Re(e^{iη}z)=0, with z the expectation of the relative unitary W—together with the local correction maps that turn both conditional branches into the target gate.

Load-bearing premise

That there always exist local unitary families making both measurement branches equally likely for every input state while still being locally fixable to the exact target gate; this is shown only by construction for the two example gates.

What would settle it

Either exhibit a Clifford two-qubit gate for which no choice of η and local unitaries satisfies the three design conditions, or run the sketched photonic protocol and show that the measured output fidelity stays below the ideal teleported gate after the predicted local corrections.

Watch this falsifier. Get emailed when new claim-graph text bears on it.

Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit.

Referee Report

0 major / 5 minor

Summary. The manuscript introduces a general framework for deterministic quantum gate teleportation that uses path superposition of a shared maximally entangled resource |χ_ab(η)⟩ together with path-dependent local unitaries V_A1, V_A2, V_B1, V_B2. After controlled application of those unitaries, Hadamard gates on the control qubits, and computational-basis measurement, the two conditional branches (Eqs. 7–8) are required to be equally probable and locally correctable to a single target nonlocal gate (up to global phase). The equal-probability criterion is expressed as Re(e^{iη} z)=0 with z=⟨W⟩ (Eqs. 9–15). Explicit families realizing CNOT (η=π/2, operators in Eq. 19) and CZ (η=0, diagonal phases in Eq. 32) are constructed and verified by direct substitution; local Pauli/phase corrections recover the target states. A proof-of-concept linear-optical encoding that maps the control to spatial paths and the data qubits to polarization is outlined.

Significance. If the constructions hold, the paper supplies a clean, modular design procedure for gate teleportation that treats the entangled-resource phase and the path-dependent local unitaries as free design parameters. This complements existing schemes based on local CNOTs or indefinite causal order and shows that two Clifford gates can be realized inside the same interferometric architecture. The derivations are elementary and fully explicit (no hidden parameters or circular identities), and the photonic sketch demonstrates experimental compatibility with standard SPDC and wave-plate technology. The acknowledged open problem—a complete classification of admissible unitaries—is clearly scoped and does not undermine the existence claims for CNOT and CZ.

minor comments (5)
  1. In Sec. III the free parameters σ,τ appear in V_B1,V_B2 and later cancel into a global phase; a short remark that they may be set to zero without loss of generality would improve readability.
  2. Eq. (29) writes ac+ac¯=0 etc.; the conjugation notation is slightly non-standard and could be replaced by the usual overline or * for clarity.
  3. Fig. 2 caption is dense; labeling the two correction operators C_{±±} and C_{±∓} more explicitly on the figure itself would help the reader follow the protocol flow.
  4. Sec. V notes that nondestructive detection is required for feed-forward corrections; a brief citation or sentence on current experimental status of such detectors would strengthen the feasibility discussion.
  5. A few typographical inconsistencies appear (e.g., “Eisertet al.” missing space, occasional missing spaces around math operators); a light copy-edit pass would polish the text.

Circularity Check

0 steps flagged

No significant circularity: design conditions are derived from normalization/Born rule and operator families are verified by direct substitution.

full rationale

The paper's derivation chain is self-contained and non-circular. Section II defines the path-superposition protocol (Eqs. 2–8), introduces the operator W and expectation z (Eqs. 9–10), and obtains the equal-probability condition Re(e^{iη} z)=0 (Eq. 15) directly from the Born-rule probabilities of the two measurement branches (Eqs. 11–14). The three design conditions are therefore necessary consequences of unitarity and projective measurement, not definitions of the target gates. Sections III and IV then select explicit families (CNOT: η=π/2 with the unitaries of Eq. 19; CZ: η=0 with the diagonal phases of Eq. 32) and verify by substitution that both conditional branches (Eqs. 20–21 and 33–34) differ from the target states only by local Pauli/phase corrections, recovering the desired nonlocal gates up to global phase. No parameter is fitted to data and then re-presented as a prediction; no uniqueness theorem is imported from the authors' prior work; and the photonic outline (Sec. V) is only a conceptual encoding of the same abstract protocol. The acknowledged open problem of a complete classification of admissible unitaries (Sec. VI) is a scope limitation, not a circular reduction. Score 0 is therefore the correct assessment.

Axiom & Free-Parameter Ledger

3 free parameters · 4 axioms · 0 invented entities

The paper rests on standard quantum mechanics (unitaries, projective measurement, classical communication) plus the existence of a shared maximally entangled pair with controllable relative phase. The free parameters are the design phases that are chosen by hand to satisfy the equal-probability and correctability conditions; no data fitting occurs. No new physical entities are postulated.

free parameters (3)
  • σ, τ (CNOT Bob unitaries) = arbitrary reals
    Arbitrary real phases appearing in VB1, VB2 (Eq. 19); they cancel in the final global phase after local Rz corrections and are free design choices.
  • a,b,c,d,ψ1,ψ2 (CZ diagonal phases) = 1, −i, −i, 1, −i, i
    Unit-modulus complex phases in the diagonal local operators (Eq. 28); fixed by hand to the representative solution a=d=1, b=c=−i, ψ1=−i, ψ2=i that satisfies normalization and target-amplitude conditions.
  • η (entangled-resource phase) = π/2 (CNOT), 0 (CZ)
    Relative phase of the shared Bell pair; set to π/2 for CNOT and 0 for CZ to make the equal-probability condition reduce to Im(z)=0 or Re(z)=0 respectively.
axioms (4)
  • standard math Standard quantum mechanics: pure states, unitary evolution, projective measurement in computational/Hadamard bases, and classical communication of two bits for feed-forward corrections.
    Used throughout Secs. II–IV to derive conditional branches and corrections.
  • domain assumption Existence of a shared maximally entangled two-qubit resource with controllable relative phase η that can be prepared and distributed without decoherence.
    Eq. (2) and the photonic SPDC sketch; ideal closed-system assumption stated in Sec. VI.
  • domain assumption Local path-dependent unitaries VA1,VA2,VB1,VB2 can be applied coherently without introducing which-path information that collapses the superposition.
    Implicit in the controlled operations (4)–(5) and the photonic wave-plate placement; required for the interference that produces the two branches.
  • domain assumption Ideal, noiseless channels and perfect measurements; no decoherence, loss, or imperfect feed-forward.
    Explicitly restricted to ideal conditions in Sec. VI; the design conditions are derived under this assumption.

pith-pipeline@v1.1.0-grok45 · 16220 in / 2880 out tokens · 42804 ms · 2026-07-11T15:25:59.761072+00:00 · methodology

0 comments
Cite this review

Pith. "Pith review of A Path-Superposition Framework for Quantum Gate Teleportation." pith.science (2026). https://pith.science/paper/Q4Y4TTWY

@misc{pith2026260704672,
  author       = {Pith},
  title        = {Pith review of: A Path-Superposition Framework for Quantum Gate Teleportation},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/Q4Y4TTWY}},
  note         = {Machine review of arXiv:2607.04672}
}
Share X Bluesky LinkedIn Reddit HN
read the original abstract

Quantum gate teleportation enables distant parties to implement nonlocal quantum operations without physically transferring the participating qubits, making it a promising primitive for distributed quantum computing. We introduce a general framework for deterministic quantum gate teleportation based on path superposition, in which the target nonlocal operation is specified through the phase of a preshared maximally entangled resource and a suitable family of path-dependent local unitary operators. The framework establishes general design conditions that guarantee deterministic teleportation after measurement of the control qubits and the application of local correction operations. As representative realizations, we construct teleportation protocols for controlled-NOT (CNOT) and controlled-Z (CZ) gates, demonstrating that different nonlocal operations can be implemented within the same protocol architecture through appropriate choices of the design parameters. We further outline a proof-of-concept photonic realization based on spatial-path and polarization degrees of freedom. The proposed framework identifies path superposition as a versatile resource for quantum gate teleportation and distributed quantum information processing.

Figures

Figures reproduced from arXiv: 2607.04672 by Marco Enr\'iquez, Santiago \'Avila.

Figure 1
Figure 1. Figure 1: FIG. 1. Schematic diagram depicting distribution of qubits [PITH_FULL_IMAGE:figures/full_fig_p002_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: FIG. 2. Schematic representation of the full teleportation protocol. Coherent control is illustrated by showing the two possible [PITH_FULL_IMAGE:figures/full_fig_p004_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: FIG. 3. Proof-of-concept photonic realization of the proposed framework. A BBO-based SPDC source generates a polarization [PITH_FULL_IMAGE:figures/full_fig_p007_3.png] view at source ↗

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

34 extracted references · 2 linked inside Pith

  1. [1]

    The conditional states are properly normalized

  2. [2]

    Both measurement branches occur with equal prob- ability

  3. [3]

    Suitable local corrections transform both condi- tional branches into the same target nonlocal gate, up to an overall physically irrelevant global phase. The first two design conditions can be analyzed by in- troducing the operator W=V † A1 VA2 ⊗V † B1 VB2 ,(9) and its expectation value z=⟨ψ A|⟨ψB|W|ψ A⟩|ψB⟩.(10) Thus, the normalization factors become N±±...

  4. [4]

    Teleporting an unknown quantum state via dual classical and Einstein-Podolsky- Rosen channels,

    C. H. Bennett, G. Brassard, C. Cr´ epeau, R. Jozsa, A. Peres, and W. K. Wootters, “Teleporting an unknown quantum state via dual classical and Einstein-Podolsky- Rosen channels,” Phys. Rev. Lett.70, 1895 (1993)

    1993

  5. [5]

    Communication via one- and two-particle operators on Einstein-Podolsky- Rosen states,

    C. H. Bennett and S. J. Wiesner, “Communication via one- and two-particle operators on Einstein-Podolsky- Rosen states,” Phys. Rev. Lett.69, 2881–2884 (1992)

    1992

  6. [6]

    Optimal local implementation of nonlocal quantum gates,

    J. Eisert, K. Jacobs, P. Papadopoulos, and M. B. Ple- nio, “Optimal local implementation of nonlocal quantum gates,” Phys. Rev. A62, 052317 (2000)

    2000

  7. [7]

    Quantum gate teleportation with the superposition of causal order,

    W.-Q. Liu and H.-R. Wei, “Quantum gate teleportation with the superposition of causal order,” Phys. Rev. Appl. 23, 014064 (2025)

    2025

  8. [8]

    Distributed quantum computing across an optical network link,

    D. Main, P. Drmota, D. P. Nadlinger, E. M. Ainley, A. Agrawal, B. C. Nichol, R. Srinivas, G. Araneda, and D. M. Lucas, “Distributed quantum computing across an optical network link,” Nature638, 383–388 (2025)

    2025

  9. [9]

    Quantum computing: vision and chal- lenges,

    S. S. Gillet al., “Quantum computing: vision and chal- lenges,” inQuantum Computing(Elsevier, 2025), pp. 19– 42

    2025

  10. [10]

    Quantum Internet: Net- 9 working Challenges in Distributed Quantum Comput- ing,

    A. S. Cacciapuoti, M. Caleffi, F. Tafuri, F. S. Cataliotti, S. Gherardini, and G. Bianchi, “Quantum Internet: Net- 9 working Challenges in Distributed Quantum Comput- ing,” IEEE Network34, 137–143 (2020)

    2020

  11. [11]

    Polynomial-Time Algorithms for Prime Fac- torization and Discrete Logarithms on a Quantum Com- puter,

    P. W. Shor, “Polynomial-Time Algorithms for Prime Fac- torization and Discrete Logarithms on a Quantum Com- puter,” SIAM J. Comput.26, 1484–1509 (1997)

    1997

  12. [12]

    How to build a quantum super- computer: Scaling from hundreds to millions of qubits,

    M. Mohseniet al., “How to build a quantum super- computer: Scaling from hundreds to millions of qubits,” arXiv preprint arXiv:2411.10406 (2024)

    Pith/arXiv arXiv 2024

  13. [13]

    Distributed quantum com- puting: A survey,

    M. Caleffi, M. Amoretti, D. Ferrari, J. Illiano, A. Manza- lini, and A. S. Cacciapuoti, “Distributed quantum com- puting: A survey,” Comput. Netw.254, 110672 (2024)

    2024

  14. [14]

    The Path to Scalable Distributed Quantum Computing,

    R. Van Meter and S. J. Devitt, “The Path to Scalable Distributed Quantum Computing,” Computer49, 31–42 (2016)

    2016

  15. [15]

    Trapped-ion quantum computing: Progress and challenges,

    C. D. Bruzewicz, J. Chiaverini, R. McConnell, and J. M. Sage, “Trapped-ion quantum computing: Progress and challenges,” Appl. Phys. Rev.6(2019)

    2019

  16. [16]

    Optimizing quantum gates towards the scale of logical qubits,

    P. V. Klimovet al., “Optimizing quantum gates towards the scale of logical qubits,” Nat. Commun.15(2024)

    2024

  17. [17]

    Distributed quantum computation over noisy channels,

    J. I. Cirac, A. K. Ekert, S. F. Huelga, and C. Mac- chiavello, “Distributed quantum computation over noisy channels,” Phys. Rev. A59, 4249–4254 (1999)

    1999

  18. [18]

    Superconducting quantum computers: who is leading the future?,

    M. AbuGhanem, “Superconducting quantum computers: who is leading the future?,” EPJ Quantum Technology 12, 102 (2025)

    2025

  19. [19]

    Quantum cor- relations with no causal order,

    O. Oreshkov, F. Costa, and ˇC. Brukner, “Quantum cor- relations with no causal order,” Nat. Commun.3, 1092 (2012)

    2012

  20. [20]

    Quantum computations without definite causal structure,

    G. Chiribella, G. M. D’Ariano, P. Perinotti, and B. Val- iron, “Quantum computations without definite causal structure,” Phys. Rev. A88, 022318 (2013)

    2013

  21. [21]

    Path superposition as resource for perfect quantum teleportation with sepa- rable states,

    S. Mondal, P. Ghosh, and U. Sen, “Path superposition as resource for perfect quantum teleportation with sepa- rable states,” arXiv:2505.11398 [quant-ph] (2025)

    arXiv 2025

  22. [22]

    Experimen- tal quantum communication enhancement by superpos- ing trajectories,

    G. Rubino, L. A. Rozema, D. Ebler, H. Kristj´ ansson, S. Salek, P. Allard Gu´ erin, A. A. Abbott, C. Branciard, ˇC. Brukner, G. Chiribella, and P. Walther, “Experimen- tal quantum communication enhancement by superpos- ing trajectories,” Phys. Rev. Research3(2021)

    2021

  23. [23]

    Quantum Shannon theory with superpositions of trajectories,

    G. Chiribella and H. Kristj´ ansson, “Quantum Shannon theory with superpositions of trajectories,” Proc. R. Soc. A475, 20180903 (2019)

    2019

  24. [24]

    Er- ror filtration and entanglement purification for quantum communication,

    N. Gisin, N. Linden, S. Massar, and S. Popescu, “Er- ror filtration and entanglement purification for quantum communication,” Phys. Rev. A72(2005)

    2005

  25. [25]

    Diagonal gates in the Clifford hierarchy,

    S. X. Cui, D. Gottesman, and A. Krishna, “Diagonal gates in the Clifford hierarchy,” Phys. Rev. A95(2017)

    2017

  26. [26]

    Diagonal quantum circuits: Their computational power and applications,

    Y. Nakata and M. Murao, “Diagonal quantum circuits: Their computational power and applications,” Eur. Phys. J. Plus129(2014)

    2014

  27. [27]

    EfficientZgates for quantum comput- ing,

    D. C. McKay, C. J. Wood, S. Sheldon, J. M. Chow, and J. M. Gambetta, “EfficientZgates for quantum comput- ing,” Phys. Rev. A96(2017)

    2017

  28. [28]

    Virtual-ZGates and Symmetric Gate Compilation,

    A. Vezvaee, V. Tripathi, D. Kowsari, E. Levenson-Falk, and D. A. Lidar, “Virtual-ZGates and Symmetric Gate Compilation,” PRX Quantum6(2025)

    2025

  29. [29]

    Experimental superpo- sition of orders of quantum gates,

    L. M. Procopio, A. Moqanaki, M. Ara´ ujo, F. Costa, I. Alonso Calafell, E. G. Dowd, D. R. Hamel, L. A. Rozema, ˇC. Brukner, and P. Walther, “Experimental superpo- sition of orders of quantum gates,” Nat. Commun.6 (2015)

    2015

  30. [30]

    Experimental en- tanglement of temporal order,

    G. Rubino, L. A. Rozema, F. Massa, M. Ara´ ujo, M. Zych, ˇC. Brukner, and P. Walther, “Experimental en- tanglement of temporal order,” Quantum6, 621 (2022)

    2022

  31. [31]

    Quantum hyper- entanglement and its applications in quantum informa- tion processing,

    F.-G. Deng, B.-C. Ren, and X.-H. Li, “Quantum hyper- entanglement and its applications in quantum informa- tion processing,” arXiv:1610.09896 [quant-ph] (2017)

    Pith/arXiv arXiv 2017

  32. [32]

    Nondestructive detection of photonic qubits,

    D. Niemietz, P. Farrera, S. Langenfeld, and G. Rempe, “Nondestructive detection of photonic qubits,” Nature 591, 570–574 (2021)

    2021

  33. [33]

    Ultrabright source of polarization- entangled photons,

    P. G. Kwiat, E. Waks, A. G. White, I. Appelbaum, and P. H. Eberhard, “Ultrabright source of polarization- entangled photons,” Phys. Rev. A60, R773(R)–R776(R) (1999)

    1999

  34. [34]

    Minimal three-component SU(2) gadget for polarization optics,

    R. Simon and N. Mukunda, “Minimal three-component SU(2) gadget for polarization optics,” Phys. Lett. A143, 165–169 (1990)

    1990