Engineering Perfect State Transfer Graphs via Givens Transformations

Alejandro Ferr\'on; Omar Osenda; Pablo Serra

arxiv: 2604.02536 · v1 · submitted 2026-04-02 · 🪐 quant-ph

Engineering Perfect State Transfer Graphs via Givens Transformations

Pablo Serra , Alejandro Ferr\'on , Omar Osenda This is my paper

Pith reviewed 2026-05-13 20:39 UTC · model grok-4.3

classification 🪐 quant-ph

keywords perfect state transferGivens transformationsqubit graphsXX Hamiltonianquantum spin chainssingle-excitation dynamicstunable interactions

0 comments

The pith

Givens transformations generate families of qubit graphs that support perfect quantum state transfer.

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

The paper introduces a scheme that applies Givens transformations to the interaction matrix of qubit systems to produce graphs where a quantum state moves from sender to receiver with unit fidelity. This relaxes the standard assumption of uniform coupling strengths that often forces impractical geometries like certain linear chains or arrays. The resulting networks keep an XX-type Hamiltonian and restrict dynamics to the single-excitation subspace. Concrete short-distance examples are constructed and then extended to longer transmission distances. A sympathetic reader sees a route to engineering adjustable qubit networks that still obey the perfect-transfer timing rules of known chains.

Core claim

Givens transformations applied to the adjacency matrix of an XX spin chain produce new qubit graphs that inherit perfect state transfer while permitting non-uniform interaction strengths, thereby generating a broader class of geometries that still achieve unit-fidelity transmission at specific times.

What carries the argument

The Givens transformation, a plane rotation that modifies selected off-diagonal entries of the coupling matrix while preserving the eigenvalues and the perfect-transfer condition in the single-excitation subspace.

If this is right

Short-distance graphs obtained by one or two rotations already display perfect transfer.
Iterated application yields graphs of arbitrary length that retain the same transfer time scaling.
The construction extends from linear chains to ladders and small arrays while keeping the XX interaction structure.
Non-homogeneous couplings replace the uniform values that previously restricted experimental geometries.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

The same rotation sequence could be used to adapt existing chain designs to hardware platforms that allow site-dependent tuning.
Small fabricated instances could be used to test whether the predicted transfer times survive fabrication imperfections.
The method may connect to other matrix-factorization techniques already employed in quantum control for designing coupling patterns.

Load-bearing premise

The qubit couplings can be set independently to the exact values demanded by successive Givens rotations while the overall Hamiltonian remains of XX form and the dynamics stay confined to the single-excitation manifold.

What would settle it

Build a small graph produced by the first few Givens steps, set the couplings to the predicted values, and measure whether the excitation transfer probability reaches exactly 1 at the analytically expected time.

Figures

Figures reproduced from arXiv: 2604.02536 by Alejandro Ferr\'on, Omar Osenda, Pablo Serra.

**Figure 2.** Figure 2: The cartoon depicts the graph proposed in Referenc [PITH_FULL_IMAGE:figures/full_fig_p005_2.png] view at source ↗

**Figure 3.** Figure 3: The cartoon in the figure shows two graphs with more n [PITH_FULL_IMAGE:figures/full_fig_p006_3.png] view at source ↗

**Figure 4.** Figure 4: l(a) The cartoon shows how to generalize the graph [PITH_FULL_IMAGE:figures/full_fig_p008_4.png] view at source ↗

**Figure 5.** Figure 5: The cartoon in the figure shows a generalization of t [PITH_FULL_IMAGE:figures/full_fig_p010_5.png] view at source ↗

**Figure 6.** Figure 6: The cartoon in the figure shows another generalizat [PITH_FULL_IMAGE:figures/full_fig_p011_6.png] view at source ↗

**Figure 7.** Figure 7: The cartoon in the figure shows a graph derived from t [PITH_FULL_IMAGE:figures/full_fig_p011_7.png] view at source ↗

**Figure 8.** Figure 8: The cartoon in the figure shows a generalization of t [PITH_FULL_IMAGE:figures/full_fig_p012_8.png] view at source ↗

**Figure 9.** Figure 9: The cartoon in the figure shows a graph with maximum d [PITH_FULL_IMAGE:figures/full_fig_p013_9.png] view at source ↗

**Figure 10.** Figure 10: In the cartoon of the figure we can observe a decorat [PITH_FULL_IMAGE:figures/full_fig_p014_10.png] view at source ↗

read the original abstract

Perfect quantum state transfer is achievable in different settings, including linear qubit chains, bi-dimensional arrays, ladders, etc. The most studied case contemplates transferring arbitrary one-qubit pure states in systems with homogeneous interactions. These restrictions allow finding numerous examples of systems that show perfect transfer but in geometries that are not implementable or are very difficult to implement in actual experimental settings. Relaxing the homogeneity of the interactions and inspired by the $XX$ qubit chains that show perfect transmission, we present a simple scheme based on the Givens Transformations to analyse and obtain a class of qubit graphs that possess perfect quantum state transmission. We present some simple examples and show how it is possible to generalize them for longer transmission lengths.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

The paper gives a constructive Givens-based route to non-homogeneous PST graphs from XX chains, but the abstract leaves the explicit matrices and XX-form verification unshown.

read the letter

The core contribution is a scheme that starts with a known XX chain Hamiltonian and applies Givens rotations to produce new coupling matrices for perfect state transfer on graphs that do not require uniform interactions. This relaxes the homogeneity restriction that often forces awkward geometries in earlier work, and the authors sketch how the same steps extend from short examples to longer chains. That constructive angle is the part worth noting; it supplies a systematic way to generate candidates rather than hunting for them by hand or simulation alone. The approach stays within linear algebra on the adjacency matrix, which keeps the method simple and potentially implementable if the couplings can be tuned independently in an experiment. The examples are presented as straightforward and generalizable, which is useful for readers who want a recipe instead of existence proofs. The citation pattern looks standard, drawing on the usual homogeneous XX results without obvious circularity. The main soft spot is verification. The abstract states that examples exist and that the method works, but it does not display the resulting matrices, the explicit time-evolution operator, or the check that perfect transfer occurs at the predicted time. The stress-test point about whether the rotated matrix remains exactly the restriction of a real, symmetric XX Hamiltonian (zero diagonal, no phases or extra terms) is therefore still open; if the full text shows the matrices stay in that form, the claim holds, but without those steps the soundness stays thin. No numerical simulations or independent checks are mentioned in the available text, so the reader has to trust the construction until the details are filled in. This paper is aimed at people designing quantum networks or looking for tunable graph Hamiltonians for state transfer. A reader already familiar with the XX model and linear-algebra tools for Hamiltonians will get the most out of it and can probably reproduce or extend the examples quickly. It is worth sending to peer review so the authors can supply the missing matrices and transfer-time calculations; the idea is clear enough that referees can evaluate it on its own terms rather than desk-rejecting it outright.

Referee Report

2 major / 2 minor

Summary. The manuscript proposes a constructive scheme using Givens rotations applied to the adjacency matrix of known XX-coupled PST chains to generate new qubit graphs with inhomogeneous couplings that still support perfect state transfer. It presents explicit small-scale examples and outlines a generalization procedure for arbitrary transmission lengths, relaxing the homogeneity assumption while preserving the single-excitation XX dynamics.

Significance. If the constructions are rigorously verified to yield valid XX Hamiltonians, the method supplies an algebraic, parameter-controlled route to engineer PST graphs beyond the homogeneous case. This could aid experimental design by permitting tunable couplings in non-chain geometries while retaining exact PST at specific times. The approach is constructive and leverages standard linear-algebra tools, which is a clear strength.

major comments (2)

[§2] §2 (Givens construction): the transformed matrix must be shown to remain real, symmetric, and zero-diagonal after each rotation so that it corresponds exactly to the single-excitation restriction of an XX Hamiltonian ∑ J_{ij}(X_i X_j + Y_i Y_j). The manuscript does not explicitly verify this property for the generated examples, leaving open whether phases or non-zero diagonal entries appear.
[§3] §3 (examples): for each presented graph, the time-evolution operator U(t) = exp(-i H t) on the single-excitation subspace should be computed explicitly to confirm |⟨f|U(t_0)|i⟩| = 1 at some t_0. Only the initial and final matrices are shown; the PST condition is asserted but not demonstrated numerically or symbolically.

minor comments (2)

Notation for the Givens rotation parameters (angles θ_k) should be introduced once and used consistently; the current text mixes θ and ϕ without a clear mapping.
Add a reference to the original PST literature (e.g., Christandl et al. 2004) when stating the homogeneous XX-chain baseline.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the careful reading and constructive comments on our manuscript. The suggestions have prompted us to strengthen the rigor of the presentation by adding explicit verifications. We address each major comment below.

read point-by-point responses

Referee: [§2] §2 (Givens construction): the transformed matrix must be shown to remain real, symmetric, and zero-diagonal after each rotation so that it corresponds exactly to the single-excitation restriction of an XX Hamiltonian ∑ J_{ij}(X_i X_j + Y_i Y_j). The manuscript does not explicitly verify this property for the generated examples, leaving open whether phases or non-zero diagonal entries appear.

Authors: We agree that an explicit verification of the preserved properties is necessary for rigor. In the revised manuscript we have inserted a short lemma in §2 establishing that real Givens rotations applied to off-diagonal pairs of a real symmetric zero-diagonal matrix yield another real symmetric zero-diagonal matrix. The proof follows from the fact that the rotation matrix is real orthogonal and acts only on the chosen (i,j) plane with i ≠ j, leaving the diagonal unchanged and preserving symmetry. We have also added an explicit check for each generated example confirming that no imaginary parts or diagonal entries appear. revision: yes
Referee: [§3] §3 (examples): for each presented graph, the time-evolution operator U(t) = exp(-i H t) on the single-excitation subspace should be computed explicitly to confirm |⟨f|U(t_0)|i⟩| = 1 at some t_0. Only the initial and final matrices are shown; the PST condition is asserted but not demonstrated numerically or symbolically.

Authors: We accept that explicit confirmation of the PST condition improves the manuscript. In the revision we have added, for every example, both a numerical evaluation of the fidelity |⟨f|U(t)|i⟩| (showing it reaches 1 at the analytically predicted time) and, for the smallest graphs, the symbolic form of the relevant matrix elements of U(t). These calculations are performed in the single-excitation subspace and are now included as a new figure and accompanying text in §3. revision: yes

Circularity Check

0 steps flagged

No circularity: Givens scheme constructs PST graphs from known XX chains via standard linear algebra

full rationale

The derivation begins with established XX qubit chains known to exhibit perfect state transfer and applies Givens transformations as ordinary orthogonal operations to generate new adjacency matrices. No equation or step in the abstract or description reduces the target transfer condition to a fitted parameter, self-definition, or self-citation chain; the output graphs are obtained constructively without presupposing the perfect-transfer property in the choice of rotations. The construction is therefore self-contained against external benchmarks of XX Hamiltonians on the single-excitation subspace.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The approach rests on the standard single-excitation subspace of the XX Hamiltonian and the algebraic properties of Givens rotations; no new physical entities are introduced.

axioms (2)

domain assumption The system evolves under a time-independent XX-type Hamiltonian restricted to the single-excitation manifold.
Standard assumption in quantum state transfer literature invoked to reduce the problem to an effective orthogonal matrix evolution.
domain assumption Givens transformations can be realized by appropriate choice of nearest-neighbor or graph-edge couplings.
The paper assumes the required rotation angles correspond to physically tunable interaction strengths.

pith-pipeline@v0.9.0 · 5408 in / 1175 out tokens · 45059 ms · 2026-05-13T20:39:52.673523+00:00 · methodology

discussion (0)

Reference graph

Works this paper leans on

40 extracted references · 40 canonical work pages

[1]

Changing v = − 3/ 2 → 3/ 2 at those times produces the perfect transfer from the ﬁrst qub it to the last one. C. Chains of superconductor Qubits with control couplings It is interesting to apply the GT procedure to graphs for which it is kn own that show perfect transmission between some of their sites. For instance, consider the decorated qubit ch ain de...

work page
[2]

The matrix in Eq

We present the decomposition of G∗ 5 in ﬁve GTs in Appendix B. The matrix in Eq. 35 resembles the OHM of a linear XX chain, but it is not centrosymmetric. So, while it is true that asking for the OHM of the equivalent linear XX chain, obtained after applying the GT to the OHM of the graph, to fulﬁl Eq. (6) was instrumental on constructing graphs with PT i...

work page
[3]

W. Xie, A. Kay, and C. Tamon, Breaking the speed limit for p erfect quantum state transfer, Phys. Rev. A 108, 012408 (2023)

work page 2023
[4]

Maleki and A

Y. Maleki and A. M. Zheltikov, Perfect swap and transfer o f arbitrary quantum states, Optics Communications 496, 126870 (2021)

work page 2021
[5]

Mograby, M

G. Mograby, M. Derevyagin, G. V. Dunne, and A. Teplyaev, S pectra of perfect state transfer hamiltonians on fractal-l ike graphs, Journal of Physics A: Mathematical and Theoretical 54, 125301 (2021)

work page 2021
[6]

Christandl, N

M. Christandl, N. Datta, A. Ekert, and A. J. Landahl, Perf ect state transfer in quantum spin networks, Phys. Rev. Lett. 92, 187902 (2004)

work page 2004
[7]

X. Li, Y. Ma, J. Han, T. Chen, Y. Xu, W. Cai, H. Wang, Y. Song, Z.-Y. Xue, Z.-q. Yin, and L. Sun, Perfect quantum state transfer in a superconducting qubit chain with parametrica lly tunable couplings, Phys. Rev. Appl. 10, 054009 (2018)

work page 2018
[8]

Bayat, Arbitrary perfect state transfer in d-level spin chains, Phys

A. Bayat, Arbitrary perfect state transfer in d-level spin chains, Phys. Rev. A 89, 062302 (2014)

work page 2014
[9]

Bose, Quantum communication through an unmodulated s pin chain, Phys

S. Bose, Quantum communication through an unmodulated s pin chain, Phys. Rev. Lett. 91, 207901 (2003)

work page 2003
[10]

Bose, Quantum communication through spin chain dynam ics: an introductory overview, Contemporary Physics 48, 13 (2007), https://doi.org/10.1080/00107510701342313

S. Bose, Quantum communication through spin chain dynam ics: an introductory overview, Contemporary Physics 48, 13 (2007), https://doi.org/10.1080/00107510701342313

work page doi:10.1080/00107510701342313 2007
[11]

Serra, A

P. Serra, A. Ferr´ on, and O. Osenda, Exact solution of a fa mily of staggered heisenberg chains with conclusive pretty good quantum state transfer, Journal of Physics A: Mathematical and Theoretical 55, 405302 (2022)

work page 2022
[12]

C. Wang, L. Li, J. Gong, and Y.-x. Liu, Arbitrary entangl ed state transfer via a topological qubit chain, Phys. Rev. A 106, 052411 (2022)

work page 2022
[13]

Yousefjani and A

R. Yousefjani and A. Bayat, Parallel entangling gate op erations and two-way quantum communication in spin chains, Quantum 5, 460 (2021)

work page 2021
[14]

Zwick, G

A. Zwick, G. A. Alvarez, J. Stolze, and O. Osenda, Quantu m state transfer in disordered spin chains: How much enginee ring is reasonable?, Quantum Information & Computation 15, 0582 (2015)

work page 2015
[15]

Serra, A

P. Serra, A. Ferr´ on, and O. Osenda, Perfect, pretty goo d and optimised quantum state transfer in transmon qubit cha ins, Physics Letters A 25, 239 (2025)

work page 2025
[16]

C. D. Godsil, Periodic graphs, The Electronic Journal o f Combinatorics 18, P23 (2011)

work page 2011
[17]

Fan and C

X. Fan and C. Godsil, Pretty good state transfer on doubl e stars, Linear Algebra and its Applications 438, 2346 (2013)

work page 2013
[18]

Kempton, G

M. Kempton, G. Lippner, and S.-T. Yau, Perfect state tra nsfer on graphs with a potential, Quantum Info. Comput. 17, 303–327 (2017)

work page 2017
[19]

Cheung and C

W.-C. Cheung and C. Godsil, Perfect state transfer in cu belike graphs, Linear Algebra and its Applications 435, 2468 (2011), special Issue in Honor of Dragos Cvetkovic

work page 2011
[20]

Y. GE, B. GREENBERG, O. PEREZ, and C. TAMON, Perfect stat e transfer, graph products and equitable partitions, International Journal of Quantum Information 09, 823 (2011), https://doi.org/10.1142/S021974991100747 2

work page doi:10.1142/s021974991100747 2011
[21]

Coutinho, C

G. Coutinho, C. Godsil, E. Juliano, and C. M. van Bommel, Quantum walks do not like bridges, Linear Algebra and its Applications 652, 155 (2022)

work page 2022
[22]

A. E. Brouwer and W. H. Haemers, Spectra of Graphs (Springer, New York, NY, 2012)

work page 2012
[23]

of Waterloo, Cs 860: Eigenvalues and polynomials (20 22)

U. of Waterloo, Cs 860: Eigenvalues and polynomials (20 22)

work page
[24]

Serra, A

P. Serra, A. Ferr´ on, and O. Osenda, The scaling law of the arrival time of spin systems that present pretty good trans mission, Journal of Physics A: Mathematical and Theoretical 57, 015304 (2023)

work page 2023
[25]

Coutinho and H

G. Coutinho and H. Liu, No laplacian perfect state trans fer in trees, SIAM Journal on Discrete Mathematics 29, 2179 (2015), https://doi.org/10.1137/140989510

work page doi:10.1137/140989510 2015
[26]

Himmel, M

J. Himmel, M. Ehrhardt, M. Heinrich, S. Weidemann, T. A. W. Wolterink, M. R¨ ontgen, P. Schmelcher, and A. Szameit, State transfer in latent-symmetric networks (2025), arXiv :2501.12185 [quant-ph]

work page arXiv 2025
[27]

Himmel, M

J. Himmel, M. Ehrhardt, M. Heinrich, M. R¨ ontgen, A. Sza meit, and T. A. W. Wolterink, Eigenmodes of latent-symmetric quantum photonic networks (2025), arXiv:2501.13029 [physics.optics]

work page arXiv 2025
[28]

Bravyi, O

S. Bravyi, O. Dial, J. M. Gambetta, D. Gil, and Z. Nazario , The future of quan- tum computing with superconducting qubits, Journal of Appl ied Physics 132, 160902 (2022), https://pubs.aip.org/aip/jap/article-pdf/doi/10.1063/5.0082975/20034201/160902 1 5.0082975.pdf

work page doi:10.1063/5.0082975/20034201/160902 2022
[29]

Nation, H

P. Nation, H. Paik, A. Cross, and Z. Nazario, The ibm quan tum heavy hex lattice (2022)

work page 2022
[30]

Kattem¨ olle and S

J. Kattem¨ olle and S. Hariharan, Line-graph qubit rout ing, ACM Transactions on Quantum Computing 6, 10.1145/3733842 (2025)

work page doi:10.1145/3733842 2025
[31]

Karbach and J

P. Karbach and J. Stolze, Spin chains as perfect quantum state mirrors, Phys. Rev. A 72, 030301 (2005)

work page 2005
[32]

Albanese, M

C. Albanese, M. Christandl, N. Datta, and A. Ekert, Mirr or inversion of quantum states in linear registers, Phys. Rev. Lett. 93, 230502 (2004)

work page 2004
[33]

Venkateshan and P

S. Venkateshan and P. Swaminathan, Chapter 2 - solution of linear equations, in Computational Methods in Engineering , edited by S. Venkateshan and P. Swaminathan (Academic Press , Boston, 2014) pp. 19–103

work page 2014
[34]

Anderson, Z

E. Anderson, Z. Bai, C. Bischof, S. Blackford, J. Demmel , J. Dongarra, J. Du Croz, A. Greenbaum, S. Hammarling, A. McKenney, and D. Sorensen, LAPACK Users’ Guide, 3rd ed. (Society for Industrial and Applied Mathematics, P hiladel- phia, PA, 1999). 22

work page 1999
[35]

W. H. Press, B. P. Flannery, S. A. Teukolsky, and W. T. Vet terling, Numerical Recipes in FORTRAN 77 , 1st ed., Vol. 1 (Cambridge University Press, Cambridge, UK, 1992)

work page 1992
[36]

X. Ma, X. Chu, Z. Yang, Y. Lin, X. Gao, and J. Zhao, Paramet er eﬃcient quasi-orthogonal ﬁne-tuning via givens rotatio n, in Proceedings of the 41st International Conference on Machin e Learning, ICML’24 (JMLR.org, 2024)

work page 2024
[37]

Cybenko, Reducing Quantum Computations to Elementa ry Unitary Operations , Computing in Science & Engineering 3, 27 (2001)

G. Cybenko, Reducing Quantum Computations to Elementa ry Unitary Operations , Computing in Science & Engineering 3, 27 (2001)

work page 2001
[38]

Coutinho, Tridiagonalization of a symmetric matrix on a square array of mesh-connected processors, The Electronic Journal of Combinatorics 23, 46 (2016)

G. Coutinho, Tridiagonalization of a symmetric matrix on a square array of mesh-connected processors, The Electronic Journal of Combinatorics 23, 46 (2016)

work page 2016
[39]

A. Kay, Perfect, eﬃcient, state transfer and its applic ation as a cconstructive tool, International Journal of Quantum Information 08, 641 (2010), https://doi.org/10.1142/S021974991000651 4

work page doi:10.1142/s021974991000651 2010
[40]

Kay, The perfect state transfer graph limbo (2018), a rXiv:1808.00696 [quant-ph]

A. Kay, The perfect state transfer graph limbo (2018), a rXiv:1808.00696 [quant-ph]

work page arXiv 2018

[1] [1]

Changing v = − 3/ 2 → 3/ 2 at those times produces the perfect transfer from the ﬁrst qub it to the last one. C. Chains of superconductor Qubits with control couplings It is interesting to apply the GT procedure to graphs for which it is kn own that show perfect transmission between some of their sites. For instance, consider the decorated qubit ch ain de...

work page

[2] [2]

The matrix in Eq

We present the decomposition of G∗ 5 in ﬁve GTs in Appendix B. The matrix in Eq. 35 resembles the OHM of a linear XX chain, but it is not centrosymmetric. So, while it is true that asking for the OHM of the equivalent linear XX chain, obtained after applying the GT to the OHM of the graph, to fulﬁl Eq. (6) was instrumental on constructing graphs with PT i...

work page

[3] [3]

W. Xie, A. Kay, and C. Tamon, Breaking the speed limit for p erfect quantum state transfer, Phys. Rev. A 108, 012408 (2023)

work page 2023

[4] [4]

Maleki and A

Y. Maleki and A. M. Zheltikov, Perfect swap and transfer o f arbitrary quantum states, Optics Communications 496, 126870 (2021)

work page 2021

[5] [5]

Mograby, M

G. Mograby, M. Derevyagin, G. V. Dunne, and A. Teplyaev, S pectra of perfect state transfer hamiltonians on fractal-l ike graphs, Journal of Physics A: Mathematical and Theoretical 54, 125301 (2021)

work page 2021

[6] [6]

Christandl, N

M. Christandl, N. Datta, A. Ekert, and A. J. Landahl, Perf ect state transfer in quantum spin networks, Phys. Rev. Lett. 92, 187902 (2004)

work page 2004

[7] [7]

X. Li, Y. Ma, J. Han, T. Chen, Y. Xu, W. Cai, H. Wang, Y. Song, Z.-Y. Xue, Z.-q. Yin, and L. Sun, Perfect quantum state transfer in a superconducting qubit chain with parametrica lly tunable couplings, Phys. Rev. Appl. 10, 054009 (2018)

work page 2018

[8] [8]

Bayat, Arbitrary perfect state transfer in d-level spin chains, Phys

A. Bayat, Arbitrary perfect state transfer in d-level spin chains, Phys. Rev. A 89, 062302 (2014)

work page 2014

[9] [9]

Bose, Quantum communication through an unmodulated s pin chain, Phys

S. Bose, Quantum communication through an unmodulated s pin chain, Phys. Rev. Lett. 91, 207901 (2003)

work page 2003

[10] [10]

Bose, Quantum communication through spin chain dynam ics: an introductory overview, Contemporary Physics 48, 13 (2007), https://doi.org/10.1080/00107510701342313

S. Bose, Quantum communication through spin chain dynam ics: an introductory overview, Contemporary Physics 48, 13 (2007), https://doi.org/10.1080/00107510701342313

work page doi:10.1080/00107510701342313 2007

[11] [11]

Serra, A

P. Serra, A. Ferr´ on, and O. Osenda, Exact solution of a fa mily of staggered heisenberg chains with conclusive pretty good quantum state transfer, Journal of Physics A: Mathematical and Theoretical 55, 405302 (2022)

work page 2022

[12] [12]

C. Wang, L. Li, J. Gong, and Y.-x. Liu, Arbitrary entangl ed state transfer via a topological qubit chain, Phys. Rev. A 106, 052411 (2022)

work page 2022

[13] [13]

Yousefjani and A

R. Yousefjani and A. Bayat, Parallel entangling gate op erations and two-way quantum communication in spin chains, Quantum 5, 460 (2021)

work page 2021

[14] [14]

Zwick, G

A. Zwick, G. A. Alvarez, J. Stolze, and O. Osenda, Quantu m state transfer in disordered spin chains: How much enginee ring is reasonable?, Quantum Information & Computation 15, 0582 (2015)

work page 2015

[15] [15]

Serra, A

P. Serra, A. Ferr´ on, and O. Osenda, Perfect, pretty goo d and optimised quantum state transfer in transmon qubit cha ins, Physics Letters A 25, 239 (2025)

work page 2025

[16] [16]

C. D. Godsil, Periodic graphs, The Electronic Journal o f Combinatorics 18, P23 (2011)

work page 2011

[17] [17]

Fan and C

X. Fan and C. Godsil, Pretty good state transfer on doubl e stars, Linear Algebra and its Applications 438, 2346 (2013)

work page 2013

[18] [18]

Kempton, G

M. Kempton, G. Lippner, and S.-T. Yau, Perfect state tra nsfer on graphs with a potential, Quantum Info. Comput. 17, 303–327 (2017)

work page 2017

[19] [19]

Cheung and C

W.-C. Cheung and C. Godsil, Perfect state transfer in cu belike graphs, Linear Algebra and its Applications 435, 2468 (2011), special Issue in Honor of Dragos Cvetkovic

work page 2011

[20] [20]

Y. GE, B. GREENBERG, O. PEREZ, and C. TAMON, Perfect stat e transfer, graph products and equitable partitions, International Journal of Quantum Information 09, 823 (2011), https://doi.org/10.1142/S021974991100747 2

work page doi:10.1142/s021974991100747 2011

[21] [21]

Coutinho, C

G. Coutinho, C. Godsil, E. Juliano, and C. M. van Bommel, Quantum walks do not like bridges, Linear Algebra and its Applications 652, 155 (2022)

work page 2022

[22] [22]

A. E. Brouwer and W. H. Haemers, Spectra of Graphs (Springer, New York, NY, 2012)

work page 2012

[23] [23]

of Waterloo, Cs 860: Eigenvalues and polynomials (20 22)

U. of Waterloo, Cs 860: Eigenvalues and polynomials (20 22)

work page

[24] [24]

Serra, A

P. Serra, A. Ferr´ on, and O. Osenda, The scaling law of the arrival time of spin systems that present pretty good trans mission, Journal of Physics A: Mathematical and Theoretical 57, 015304 (2023)

work page 2023

[25] [25]

Coutinho and H

G. Coutinho and H. Liu, No laplacian perfect state trans fer in trees, SIAM Journal on Discrete Mathematics 29, 2179 (2015), https://doi.org/10.1137/140989510

work page doi:10.1137/140989510 2015

[26] [26]

Himmel, M

J. Himmel, M. Ehrhardt, M. Heinrich, S. Weidemann, T. A. W. Wolterink, M. R¨ ontgen, P. Schmelcher, and A. Szameit, State transfer in latent-symmetric networks (2025), arXiv :2501.12185 [quant-ph]

work page arXiv 2025

[27] [27]

Himmel, M

J. Himmel, M. Ehrhardt, M. Heinrich, M. R¨ ontgen, A. Sza meit, and T. A. W. Wolterink, Eigenmodes of latent-symmetric quantum photonic networks (2025), arXiv:2501.13029 [physics.optics]

work page arXiv 2025

[28] [28]

Bravyi, O

S. Bravyi, O. Dial, J. M. Gambetta, D. Gil, and Z. Nazario , The future of quan- tum computing with superconducting qubits, Journal of Appl ied Physics 132, 160902 (2022), https://pubs.aip.org/aip/jap/article-pdf/doi/10.1063/5.0082975/20034201/160902 1 5.0082975.pdf

work page doi:10.1063/5.0082975/20034201/160902 2022

[29] [29]

Nation, H

P. Nation, H. Paik, A. Cross, and Z. Nazario, The ibm quan tum heavy hex lattice (2022)

work page 2022

[30] [30]

Kattem¨ olle and S

J. Kattem¨ olle and S. Hariharan, Line-graph qubit rout ing, ACM Transactions on Quantum Computing 6, 10.1145/3733842 (2025)

work page doi:10.1145/3733842 2025

[31] [31]

Karbach and J

P. Karbach and J. Stolze, Spin chains as perfect quantum state mirrors, Phys. Rev. A 72, 030301 (2005)

work page 2005

[32] [32]

Albanese, M

C. Albanese, M. Christandl, N. Datta, and A. Ekert, Mirr or inversion of quantum states in linear registers, Phys. Rev. Lett. 93, 230502 (2004)

work page 2004

[33] [33]

Venkateshan and P

S. Venkateshan and P. Swaminathan, Chapter 2 - solution of linear equations, in Computational Methods in Engineering , edited by S. Venkateshan and P. Swaminathan (Academic Press , Boston, 2014) pp. 19–103

work page 2014

[34] [34]

Anderson, Z

E. Anderson, Z. Bai, C. Bischof, S. Blackford, J. Demmel , J. Dongarra, J. Du Croz, A. Greenbaum, S. Hammarling, A. McKenney, and D. Sorensen, LAPACK Users’ Guide, 3rd ed. (Society for Industrial and Applied Mathematics, P hiladel- phia, PA, 1999). 22

work page 1999

[35] [35]

W. H. Press, B. P. Flannery, S. A. Teukolsky, and W. T. Vet terling, Numerical Recipes in FORTRAN 77 , 1st ed., Vol. 1 (Cambridge University Press, Cambridge, UK, 1992)

work page 1992

[36] [36]

X. Ma, X. Chu, Z. Yang, Y. Lin, X. Gao, and J. Zhao, Paramet er eﬃcient quasi-orthogonal ﬁne-tuning via givens rotatio n, in Proceedings of the 41st International Conference on Machin e Learning, ICML’24 (JMLR.org, 2024)

work page 2024

[37] [37]

Cybenko, Reducing Quantum Computations to Elementa ry Unitary Operations , Computing in Science & Engineering 3, 27 (2001)

G. Cybenko, Reducing Quantum Computations to Elementa ry Unitary Operations , Computing in Science & Engineering 3, 27 (2001)

work page 2001

[38] [38]

Coutinho, Tridiagonalization of a symmetric matrix on a square array of mesh-connected processors, The Electronic Journal of Combinatorics 23, 46 (2016)

G. Coutinho, Tridiagonalization of a symmetric matrix on a square array of mesh-connected processors, The Electronic Journal of Combinatorics 23, 46 (2016)

work page 2016

[39] [39]

A. Kay, Perfect, eﬃcient, state transfer and its applic ation as a cconstructive tool, International Journal of Quantum Information 08, 641 (2010), https://doi.org/10.1142/S021974991000651 4

work page doi:10.1142/s021974991000651 2010

[40] [40]

Kay, The perfect state transfer graph limbo (2018), a rXiv:1808.00696 [quant-ph]

A. Kay, The perfect state transfer graph limbo (2018), a rXiv:1808.00696 [quant-ph]

work page arXiv 2018