Simple Quantum Coins Enable Pretty Good State Transfer on Every Hypercube

Hanmeng Zhan

REVIEW 3 major objections 6 minor 23 references

Simple Quantum Coins Enable Pretty Good State Transfer on Every Hypercube

T0 review · 3 major / 6 minor · reviewed 2026-08-10 · deepseek-v4-flash

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

Pith's one-line read A slight modification of the Grover coin, changing one arc weight per vertex, gives pretty good state transfer between antipodal vertices on every hypercube $Q_d$.

desk verdict A clean, modest extension of the prime-case result to every hypercube via a one-weight coin change; the main proof checks out, with the main caveat being a heavy but legitimate reliance on a cited number-theoretic lemma. read the letter →

arxiv 2412.20753 v1 pith:U67EN2F4 submitted 2024-12-30 math.CO cs.DMquant-ph

Hanmeng Zhan This is my paper · ORCID

classification math.COcs.DMquant-ph MSC 05C5005C25

keywords prettygoodstatetransferdiscrete-timequantumwalkhypercubeGrovercoinweightedCayleygraphKroneckerapproximationspectraltheory

verification ladder T0 review T1 audit T2 compute T3 formal

The pith

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

The reading

Pretty good state transfer means a quantum walk can be brought arbitrarily close to a target state by choosing the right time. The paper proves that every hypercube $Q_d$, for every dimension $d \ge 2$, admits such transfer between antipodal vertices, using a deliberately simple coin: a weighted Grover coin that changes the weight of only one arc per vertex. For prime $d$, the usual unweighted Grover coin already works; the new content is composite $d$, where the standard walk fails (on $Q_4$ it is periodic with maximum transfer probability $9/16$). The construction chooses the smallest positive $m$ making $2d-2+m$ a prime, and the proof reduces the transfer condition to a parity statement about integer relations among $\arccos$ values, which is forced by a number-theoretic lemma about squarefree parts. The same recipe yields a general sufficient condition for other graphs.

What carries the argument

The load-bearing objects are the walk's coin and its associated Hermitian adjacency matrix. For a weighted graph with arc weights coming from a matrix $W$, the coin is the reflection $2N_t^*N_t - I$, where $N_t$ is the weighted arc-tail incidence matrix; the associated Hermitian adjacency matrix is $H = (I \circ WW^*)^{1/2}(W \circ W^*)(I \circ WW^*)^{1/2}$, which for real positive weights has entries equal to the squared arc weights. On the hypercube the paper uses $H_m = m A_0 + 2\sum_{j \ge 1} A_j$, diagonalized by the characters $\psi_g(x) = (-1)^{\langle g,x\rangle}$ of $\mathbb{Z}_2^d$, giving eigenvalues $\lambda_g = 2d - 4\,\mathrm{wt}(g) + (-1)^{g_0}(m-2) = p - 2r$. The spectral characterization (Theorem 3.6) reduces pretty good state transfer to strong cospectrality plus a parity condition: every integer relation among the angles $\arccos \lambda$ must have even total weight on the 'minus' part of the eigenvalue support. That parity condition is enforced by Kronecker's approximation theorem together with the number-theoretic linear independence of the angles, which comes from the distinct squarefree parts of $j(p-j)$.

What would settle it

For the first composite dimension, $d=4$, the construction sets $m=1$ and $p=7$; a direct check of Theorem 3.6(ii) would settle the parity step: list the plus/minus sets for the eigenvalues $7, 5, 3, 1, -1, -3, -5, -7$ of $H_1$ and test whether every integer relation among the angles $\arccos(\lambda/7)$ has even total weight on the minus set. A simpler arithmetic falsifier also exists: compute, for all odd primes $p$ up to any bound, the squarefree parts of $j(p-j)$ for $1 \le j \le (p-1)/2$; the first repeated squarefree part would disprove the external lemma on which the angle independence rests.

Watch

Extended reading notes

Core claim

The paper's central theorem is that pretty good state transfer occurs between antipodal vertices of $Q_d$ for every $d \ge 2$, relative to a real weighted Grover coin. Concretely, set $m=2$ when $d$ is prime; when $d$ is composite, let $m$ be the smallest positive integer for which $p = 2d-2+m$ is prime. In the arc-reversal walk on $Q_d$ whose coin is the reflection built from the real weighted adjacency matrix $W_m$ — weight $\sqrt{m}$ on arcs in one coordinate direction and $\sqrt{2}$ on arcs in every other direction — the antipodal vertices enjoy pretty good state transfer. The eigenvalues of the associated Hermitian adjacency matrix $H_m$ are exactly $p - 2r$ for $r = 0, \dots, p$, and the proof verifies the two conditions of the paper's spectral characterization of pretty good state transfer: strong cospectrality of the antipodal vertices, and an even-parity condition on integer relations among the angles $\arccos((p-2r)/p)$. The parity condition is established through linear independence of those angles, which follows from a cited lemma on pairwise distinct squarefree parts of $j(p-j)$ for odd prime $p$. The paper also proves a general sufficient condition: any connected graph with a real nonnegative adjacency matrix $H$ whose spectral radius is a prime $p$, with strongly cospectral vertices whose eigenvalue support lies in $\{p-2r : 0 \le r \le p\}$ and whose plus/minus sets behave symmetrically under $\lambda \mapsto -\lambda$, admits antipodal pretty good state transfer in the walk driven by the entrywise square root $W = H^{\circ 1/2}$.

Load-bearing premise

The construction relies on a cited number-theoretic fact it does not prove: for every odd prime $p$, the numbers $j(p-j)$ for $j = 1, \dots, (p-1)/2$ must all have different squarefree parts (the factor left after removing square factors); if that fact failed, the angle-independence argument that enforces the transfer condition would collapse.

Editorial extensions

If this is right

Every hypercube, including $Q_4$ where the unmodified Grover walk is periodic with maximum antipodal transfer probability $9/16$, acquires a built-in coin that achieves pretty good state transfer.
The coins are real and modify the weight of only one arc per vertex, so the departure from the standard Grover coin is a minimal local change rather than a reweighting of the whole graph.
Theorem 5.1 gives a general recipe: a graph with prime spectral radius, eigenvalue support inside $\{p-2r\}$, strong cospectrality, and either of two $\lambda \mapsto -\lambda$ symmetries admits pretty good state transfer with real entrywise-square-root coins.
The proof ties transport properties of quantum walks to arithmetic: on hypercubes, the required parity condition holds because the squarefree parts of $j(p-j)$ are distinct for prime $p$.

Reading between the lines

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

A natural extrapolation from Theorem 5.1 is that many Cayley or distance-regular graphs whose spectra lie in an arithmetic progression of the form $p - 2r$ might admit pretty good state transfer with the same one-parameter family of real coins; the main work would be verifying strong cospectrality, which the hypercube gets for free from its characters.
The construction suggests an explicit experimental recipe: for a given dimension $d$, take the smallest prime $p \ge 2d-1$ and weight one coordinate direction by $\sqrt{p - 2d + 2}$, leaving the other directions at $\sqrt{2}$; this is a finite search that could be tested numerically on small hypercubes.
The proof splits by the parity of $d$: in even dimensions the minus set is symmetric under $\lambda \mapsto -\lambda$, while in odd dimensions it is swapped. A testable extension would be to check whether this same even/odd dichotomy controls pretty good state transfer on other bipartite graphs.

Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

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

Desk Editor's Note

read the letter

The headline here is that the paper delivers a real, modest result: pretty good state transfer between antipodal vertices on every hypercube Q_d, using weighted Grover coins that only change one arc weight per vertex. The composite-dimension case was genuinely open, and the construction is simple enough to be believable and useful.

What is new is the explicit choice of m making p = 2d-2+m prime, and the parity argument that handles even and odd d separately. I checked the chain: Lemma 4.3 gives the eigenvalues of H_m, Lemma 4.4 gives strong cospectrality and the lambda <-> -lambda pairing, and the Kronecker approximation step in Theorem 3.6 is applied correctly. The algebra is clean; the typos I spotted ('for any for any set set', 'd/2' in Lemma 4.5 for 'q/2') are trivial.

The real soft spot is the dependence on Lemma 4.6, cited from the author's own [5], which asserts that the squarefree parts of j(p-j) are pairwise distinct for j up to (p-1)/2. That lemma is the load-bearing input for the linear independence of the angles, and if it failed for some odd prime, the parity argument collapses. It is a published result, presumably proved in [5], but since it is decisive and external to this manuscript, any referee should verify that proof or ask for it to be included. This is not a fatal flaw, but it is the right thing to check.

The second soft spot is Theorem 5.1, the purported sufficient condition for other graphs. The proof is a sketch. It jumps from linear independence to conditions (a)-(c) without deriving them, and the 'otherwise' case for -p is left vague. As written, that theorem is more of a research note than a proof. Since Theorem 4.7 does not depend on it, this does not damage the main result, but it should be either fully proved or explicitly flagged as a conjecture/direction.

Overall: this is a solid contribution to the quantum walk state transfer literature. It does not reorganize the field, but it closes an open case in a natural way, and the main theorem deserves referee time. I would recommend accepting it after a moderate revision: flesh out or weaken Theorem 5.1, and either prove Lemma 4.6 in an appendix or provide a precise pointer to where it is proved. The central result is secure.

Referee Report

3 major / 6 minor

Summary. The paper proves that every hypercube Q_d admits pretty good state transfer (PGST) between antipodal vertices in a discrete-time coined quantum walk, using a specially chosen real weight matrix W_m. For prime d the known case m=2 (Grover coin) is invoked; for composite d, m is the smallest positive integer such that p = 2d - 2 + m is prime. The proof uses the spectral relation between the walk and the Hermitian adjacency matrix H_m, derives the eigenvalues explicitly (Lemma 4.3), proves strong cospectrality and the ± pairing of symmetric eigenvalues (Lemma 4.4), and reduces the parity condition of Theorem 3.6 to a rational-independence statement about the angles arccos((p-2r)/p), established via two number-theoretic lemmas from [5]. The paper also states a general sufficient condition (Theorem 5.1) for PGST on other graphs.

Significance. Theorem 4.7 is a notable extension of the prime-dimensional result of Chan and Zhan and gives an explicit, real, one-arc-per-vertex coin construction for every hypercube. The internal algebra is carefully presented: the eigenvalue formula, the strong cospectrality argument, and the even/odd parity analysis all check out. The proof is self-contained modulo Lemma 4.6 from [5], an external number-theoretic fact about distinct squarefree parts of j(p-j); this dependency is legitimate but should be kept in view. The advertised generalization in Theorem 5.1 is not proved to the same standard and requires additional hypotheses or a complete proof; this is the main gap in the manuscript as it stands.

major comments (3)

[Section 5, Theorem 5.1] The proof asserts the Q-linear independence of the angles {π} ∪ {arccos(λ/p) : λ ∈ Λ_a, 0 < λ < p} without deriving it from the hypotheses; in Theorem 4.7 this independence is obtained from Lemmas 4.5 and 4.6, which require an odd prime p and the distinct-squarefree-part property, but Theorem 5.1 states neither of these conditions and does not cite the lemmas. Consequently, the parity condition (ii) of Theorem 3.6 is not established, and the theorem as stated is unsupported.
[Section 5, proof of Theorem 5.1] The case −p ∈ Λ^-_ab is dismissed by saying that X is bipartite and that 'a similar argument to Theorem 4.7' applies, but the required linear-independence argument is not supplied for this case and the assertion of bipartiteness is not proved.
[Section 5, Theorem 5.1] The definition W = H^{∘1/2} does not make H the Hermitian adjacency matrix of the resulting quantum walk unless H has constant row sum; in general the associated Hermitian adjacency matrix is D^{1/2} H D^{1/2} with D = diag(row sums of H), so the spectral data of H cannot be used directly in Theorem 3.6. The theorem should either impose regularity or specify the correct normalization.

minor comments (6)

[Lemma 4.5(i)] The interval should be (q/2, q), not (d/2, q).
[Proof of Theorem 3.6] Delete the duplicated phrase 'for any for any set set'.
[Proof of Theorem 4.7] The symbol Λ_ab is used in the displayed congruences but is not defined; it should be Λ_a throughout.
[Introduction] The claim about Q_4 (periodicity and maximum transfer probability 9/16) should be accompanied by a reference to [5] or a brief computation.
[Corollary 3.4] The step concluding μ_λ = ±γ from the simultaneously small errors is correct but terse; an extra sentence explaining that γ/μ_λ must be real for all λ would improve readability.
[References] Reference [17] contains a corrupted author name ('Pawe/suppress l Kurzy´ nski') and should be fixed.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity: the new coin construction is explicit and the cited lemmas are independent external results.

full rationale

The central new result is Theorem 4.7 for composite d. The proof constructs W_m explicitly from m defined as the smallest positive integer making p = 2d-2+m prime; m is not fitted to any data, and no 'prediction' is extracted from a fitted parameter. The derivation reduces the parity condition in Theorem 3.6 to the Q-linear independence of the angles {π} ∪ {arccos(λ/p)}, which is obtained from Lemmas 4.5 and 4.6. Both lemmas are cited from [5], co-authored by the present author, but they are pure number-theoretic statements (distinct squarefree parts of j(p-j)) that do not presuppose pretty good state transfer or the conclusion of Theorem 4.7; they are externally checkable and are not equivalent to the target result. The prime case is imported from [5, Theorem 7.7] as a published prior result, but the new content is the composite case, which is proved in this paper from the explicit coin and the cited independent lemmas. There is therefore no definitional equivalence, no fitted-input-called-prediction step, and no uniqueness claim smuggled in via self-citation. The only concern is a correctness risk: Lemma 4.6 is unproved here, but that is a dependence on external mathematics, not circularity.

Assumptions & free parameters 1 free parameters · 5 assumptions · 0 invented entities

The construction depends on the external framework of [5] (quantum walk spectral correspondence), standard character theory of Cayley graphs over Z_2^d, Kronecker's approximation theorem, and two number-theoretic lemmas from [5] asserting rational independence of the relevant angles. One free parameter m is chosen to make the spectral radius prime; it is not fitted to data but is essential to the argument. No new physical entities are introduced.

free parameters (1)

m = smallest positive integer with 2d-2+m prime for composite d; m=2 for prime d
Chosen to make the spectral radius p=2d-2+m prime so that Lemmas 4.5 and 4.6 apply; the coin weights sqrt(m) and sqrt(2) depend on it. Existence is guaranteed by Euclid/Bertrand, but the construction does not work for arbitrary m.

assumptions (5)

domain assumption Quantum walk spectral framework of [5]: H=N_t R N_t^* and the eigenvalue/eigenprojection correspondence in Theorem 2.1.
Assumed as the working model for coined walks; it is the foundation of Corollary 3.2 and Theorem 3.6.
standard math Kronecker's approximation theorem (Theorem 3.5, [9]).
Used to convert the limit-point condition into the linear congruence parity condition in Theorem 3.6.
standard math Character theory of Cayley graphs over Z_2^d (Lemma 4.2, [8]).
Provides the simultaneous eigenvectors and eigenvalues of H_m.
domain assumption Lemmas 4.5 and 4.6 from [5] asserting the rational independence of angles arccos((p-2r)/p) when p is prime.
Load-bearing for the parity argument in Theorem 4.7; cited, not re-proved.
standard math Perron-Frobenius theorem for nonnegative matrices (used in Theorem 5.1).
Used to locate the spectral radius eigenvalue in the plus set.

how reviews work

0 comments

Cite this review

Pith. "Pith review of Simple Quantum Coins Enable Pretty Good State Transfer on Every Hypercube." pith.science (2026). https://pith.science/paper/U67EN2F4

@misc{pith2026241220753,
  author       = {Pith},
  title        = {Pith review of: Simple Quantum Coins Enable Pretty Good State Transfer on Every Hypercube},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/U67EN2F4}},
  note         = {Machine review of arXiv:2412.20753}
}

abstract

We consider pretty good state transfer in coined quantum walks between antipodal vertices on the hypercube $Q_d$. When $d$ is a prime, this was proven to occur in the arc-reversal walk with Grover coins. We extend this result by constructing weighted Grover coins that enable pretty good state transfer on every $Q_d$. Our coins are real, and require modification of the weight on only one arc per vertex. We also generalize our approach and establish a sufficient condition for pretty good state transfer to occur on other graphs.

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

23 extracted references · 21 canonical work pages

[5]

16, 165305, Publisher: IOP Publishing

Ada Chan and Hanmeng Zhan, Pretty good state transfer in discrete- time quantum walks , Journal of Physics A: Mathematical and Theoret- ical 56 (2023), no. 16, 165305, Publisher: IOP Publishing

work page 2023
[1]

Andris Ambainis, Eric Bach, Ashwin Nayak, Ashvin Vishwanath, and John Watrous, One-dimensional quantum walks , Proceedings of the thirty-third annual ACM symposium on Theory of computing - STOC ’01 (New York, New York, USA), ACM Press, 2001, pp. 37–49

work page 2001
[2]

K. Barr, T. Proctor, D. Allen, and V. Kendon, Periodicity and perfect state transfer in quantum walks on variants of cycles , Quantum Infor- mation & Computation (2014), 417–438

work page 2014
[3]

[4] , Periodicity and perfect state transfer of Grover walks on quadratic unitary Cayley graphs , August 2024, arXiv:2408.08715

Koushik Bhakta and Bikash Bhattacharjya, Grover walks on unitary Cayley graphs and integral regular graphs , June 2024, arXiv:2405.01020. [4] , Periodicity and perfect state transfer of Grover walks on quadratic unitary Cayley graphs , August 2024, arXiv:2408.08715

arXiv 2024
[6]

10, 105120 (en), Pub- lisher: IOP Publishing

Qiuting Chen, Periodicity of bipartite walk on biregular graphs with con- ditional spectra, Physica Scripta 99 (2024), no. 10, 105120 (en), Pub- lisher: IOP Publishing. 15

work page 2024
[7]

Qiuting Chen, Chris Godsil, Mariia Sobchuk, and Hanmeng Zhan, Hamiltonians of Bipartite Walks , The Electronic Journal of Combina- torics (2024), P4.10–P4.10 (en)

work page 2024
[8]

Chris Godsil, Algebraic combinatorics, Chapman & Hall, 1993

work page 1993
[9]

Gonek and Hugh L

Steven M. Gonek and Hugh L. Montgomery, Kronecker’s approximation theorem, Indagationes Mathematicae 27 (2016), no. 2, 506–523, Pub- lisher: Elsevier

work page 2016

Show all 23 references

[10]

Lov K. Grover, A fast quantum mechanical algorithm for database search, Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC ’96 (New York, New York, USA), ACM Press, 1996, pp. 212–219

1996
[11]

3, 713– 747 (fr)

Krystal Guo and Vincent Schmeits, Perfect state transfer in quantum walks on orientable maps , Algebraic Combinatorics 7 (2024), no. 3, 713– 747 (fr). [12] , State transfer in discrete-time quantum walks via projecte d tran- sition matrices, November 2024, arXiv:2411.05560 [math]

2024 arXiv
[13]

Naoharu Ito, Toyoki Matsuyama, and Tatsuya Tsurii, Periodicity of Grover walks on complete graphs with self-loops , Linear Algebra and its Applications 599 (2020), 121–132

2020
[14]

Vivien Kendon and Christino Tamon, Perfect state transfer in quantum walks on graphs , Quantum Information & Computation 14 (2014), 417– 438

2014
[15]

Sho Kubota and Etsuo Segawa, Perfect state transfer in Grover walks between states associated to vertices of a graph , Linear Algebra and its Applications 646 (2022), 238–251

2022
[16]

Sho Kubota and Kiyoto Yoshino, Circulant graphs with valency up to 4 that admit perfect state transfer in Grover walks , November 2024, arXiv:2402.17341

2024 arXiv
[17]

6, 062315

Pawe/suppress l Kurzy´ nski and Antoni W´ ojcik,Discrete-time quantum walk ap- proach to state transfer , Physical Review A - Atomic, Molecular, and Optical Physics 83 (2011), no. 6, 062315. 16

2011
[18]

Lovett, Sally Cooper, Matthew Everitt, Matthew Treve rs, and Viv Kendon, Universal quantum computation using the discrete time quantum walk , 180501 (2009), 9, ISBN: 1050-2947

Neil B. Lovett, Sally Cooper, Matthew Everitt, Matthew Treve rs, and Viv Kendon, Universal quantum computation using the discrete time quantum walk , 180501 (2009), 9, ISBN: 1050-2947

2009
[19]

22, 225302, Publisher: IOP Publishing

Iskender Yal¸ cınkaya and Zafer Gedik,Qubit state transfer via discrete- time quantum walks , Journal of Physics A: Mathematical and Theoret- ical 48 (2015), no. 22, 225302, Publisher: IOP Publishing

2015
[20]

6, 1305–1321, Pub- lisher: Springer

Yusuke Yoshie, Periodicities of Grover Walks on Distance-Regular Graphs, Graphs and Combinatorics 35 (2019), no. 6, 1305–1321, Pub- lisher: Springer

2019
[21]

8, 316 (en)

, Odd-periodic Grover Walks , Quantum Information Processing 22 (2023), no. 8, 316 (en)

2023
[22]

12, 1–26, Publisher: Springer New York LLC

Hanmeng Zhan, An inﬁnite family of circulant graphs with perfect state transfer in discrete quantum walks , Quantum Information Processing 18 (2019), no. 12, 1–26, Publisher: Springer New York LLC

2019
[23]

ˇStefaˇ n´ ak and S

M. ˇStefaˇ n´ ak and S. Skoup´ y,Perfect state transfer by means of discrete- time quantum walk search algorithms on highly symmetric gra phs, Phys- ical Review A 94 (2016), no. 2, 022301, Publisher: American Physical Society

2016
[24]

3, 72 (en)

, Perfect state transfer by means of discrete-time quantum wa lk on complete bipartite graphs , Quantum Information Processing 16 (2017), no. 3, 72 (en)

2017
[25]

10, 104003 (en), Publisher: IOP Publishing

Martin ˇStefaˇ n´ ak and Stanislav Skoup´ y,Quantum walk state transfer on a hypercube, Physica Scripta 98 (2023), no. 10, 104003 (en), Publisher: IOP Publishing. 17

2023

Pith tools

Reviewed August 10, 2026 · model on record in the stance chip above.

[1] [5]

16, 165305, Publisher: IOP Publishing

Ada Chan and Hanmeng Zhan, Pretty good state transfer in discrete- time quantum walks , Journal of Physics A: Mathematical and Theoret- ical 56 (2023), no. 16, 165305, Publisher: IOP Publishing

work page 2023

[2] [1]

Andris Ambainis, Eric Bach, Ashwin Nayak, Ashvin Vishwanath, and John Watrous, One-dimensional quantum walks , Proceedings of the thirty-third annual ACM symposium on Theory of computing - STOC ’01 (New York, New York, USA), ACM Press, 2001, pp. 37–49

work page 2001

[3] [2]

K. Barr, T. Proctor, D. Allen, and V. Kendon, Periodicity and perfect state transfer in quantum walks on variants of cycles , Quantum Infor- mation & Computation (2014), 417–438

work page 2014

[4] [3]

[4] , Periodicity and perfect state transfer of Grover walks on quadratic unitary Cayley graphs , August 2024, arXiv:2408.08715

Koushik Bhakta and Bikash Bhattacharjya, Grover walks on unitary Cayley graphs and integral regular graphs , June 2024, arXiv:2405.01020. [4] , Periodicity and perfect state transfer of Grover walks on quadratic unitary Cayley graphs , August 2024, arXiv:2408.08715

arXiv 2024

[5] [6]

10, 105120 (en), Pub- lisher: IOP Publishing

Qiuting Chen, Periodicity of bipartite walk on biregular graphs with con- ditional spectra, Physica Scripta 99 (2024), no. 10, 105120 (en), Pub- lisher: IOP Publishing. 15

work page 2024

[6] [7]

Qiuting Chen, Chris Godsil, Mariia Sobchuk, and Hanmeng Zhan, Hamiltonians of Bipartite Walks , The Electronic Journal of Combina- torics (2024), P4.10–P4.10 (en)

work page 2024

[7] [8]

Chris Godsil, Algebraic combinatorics, Chapman & Hall, 1993

work page 1993

[8] [9]

Gonek and Hugh L

Steven M. Gonek and Hugh L. Montgomery, Kronecker’s approximation theorem, Indagationes Mathematicae 27 (2016), no. 2, 506–523, Pub- lisher: Elsevier

work page 2016