used, i.e. qubits, qutrits, etc., which is an expected
result but that confirms its universality. We have
furthermore characterized entanglement properties of
other quantum states built upon different sequences
of numbers. From a more practical point of view, we
have developed an open-source library that diagonal-
izes matrices using floats of arbitrary precision.
We expect this novel quantum approach to Number
Theory to be fruitful in the future, as it may help us
deepen into the profound mysteries of numbers.
Acknowledgements. We thank J. Andrade, A.
Botero, J. Keating, A. LeClair, G. Mussardo, D.
P´erez-Garc´ıa and S. Ramos-Calderer for useful dis-
cussions. DGM and JIL acknowledge
CaixaBank
for its support of this work through Barcelona
Supercomputing Center’s project CaixaBank Com-
putaci´on Cu´antica. DGM and JIL are supported by
Project PGC2018-095862-B-C22, and Project Quan-
tum CAT (001- P-001644) co-funded by Generali-
tat de Catalunya and the European Union Regional
Development Fund. SC is supported by the Euro-
pean Research Council under the European Unions
Horizon 2020 research and innovation Programme
(grant agreement number 740006). GS is supported
by the Ministerio de Ciencia, Innovaci´on y Univer-
sidades (grant PGC2018-095862-B-C21), the Comu-
nidad de Madrid (grant QUITEMAD+ S2013/ICE-
2801), the Centro de Excelencia Severo Ochoa Pro-
gramme (grant SEV-2016-0597) and the CSIC Re-
search Platform on Quantum Technologies PTI-001.
References
[1] J.I. Latorre and G. Sierra, “Quantum compu-
tation of prime number functions”, Quant. Inf.
Comput. 14, 577 (2014).
[2] L.K. Grover, “A fast quantum mechanical algo-
rithm for database search”, Proc. STOC. May
1996, 212 (1996).
[3] B. Riemann, “On the Number of Prime Numbers
less than a Given Quantity”, Monatsberichte der
Berliner Akademie November 1859, 671 (1859),
English version.
[4] K. Walisch and D. Baugh, “New con-
firmed π(10
27
) prime counting func-
tion record”, Mersenne Forum (2015),
https://github.com/kimwalisch/primecount.
[5] G. Brassard, P. Høyer and A. Tapp, “Quan-
tum Counting”, Proc. 25th ICALP, LNCS 1443,
Springer-Verlag, 820 (1998).
[6] M. Rubinstein and P. Sarnak, “Chebyshev’s
Bias”, Exp. Math. 3, 173 (1994).
[7] J.I. Latorre and G. Sierra, “There is entangle-
ment in the primes”, Quant. Inf. Comput. 15,
622 (2015).
[8] G.H. Hardy and J.E. Littlewood, “Some Prob-
lems of ’Partitio Numerorum.’ III. On the Ex-
pression of a Number as a Sum of Primes”, Acta
Math. 44, 1 (1923).
[9] We consider natural bi-partitions those that sep-
arate the first m qubits and the remainder n −m
qubits, without any reordering.
[10] G. Mussardo, H. Giudici and J. Viti, “The Co-
prime Quantum Chain”, J. Stat. Mech. Theory
Exp. 2017, 033104 (2017).
[11] G. Mussardo, A. Trombettoni and Zhaon
Zhang, “Prime suspects in a Quantum Ladder”,
arXiv:2005.01758 (2020).
[12] F.V. Mendes and R.V. Ramos, “Quantum Se-
quence States”, arXiv:1408.4838 (2014).
[13] S. Carrazza, D. Garc´ıa-Mart´ın and J.I. Latorre,
Quantum-TII/qprime: Qprime v1.0.0 (May
2020). https://doi.org/10.5281/zenodo.3787043.
[14] L. Miller. “Riemann’s hypothesis and tests for
primality”, J. Comput. Sys. Sci. 13, 300 (1976);
M. O. Rabin. “Probabilistic algorithm for testing
primality”, J. Number Theory 12, 128 (1980).
[15] M. Agrawal, N. Kayal and N. Saxena, “Primes is
in P”, Ann. Math. 160, 781 (2004).
[16] T.M. Apostol, Introduction to Analytic Number
Theory, Springer-Verlag, New York (1976); G.H.
Hardy and E.M. Wright, An Introduction to the
Theory of Numbers, Oxford Universiy Press, Ox-
ford (1938).
[17] M.A. Nielsen and I.L. Chuang, Quantum Com-
putation and Quantum Information: 10th An-
niversary Edition, Cambridge University Press,
New York (2011).
[18] https://www.claymath.org/millennium-
problems.
[19] L. Schoenfeld, “Sharper bounds for the Cheby-
shev functions θ(x) and ψ(x). II”, Math. Com-
put. 30, 337 (1976).
[20] A. Kitaev, “Quantum measurements and the
Abelian stabilizer problem”, arXiv:quant-
ph/9511026 (1995); R. Cleve, A. Ekert, C.
Macchiavello and M.Mosca, “Quantum algo-
rithms revisited”, Proc. R. Soc. London A 454,
339 (1998).
[21] S. Aaronson, “Quantum Lower Bound for Ap-
proximate Counting Via Laurent Polynomials”,
arXiv:1808.02420 (2018); S. Aaronson and P.
Rall, “Quantum Approximate Counting, Simpli-
fied”, SOSA20, 24 (2020).
[22] Meissel, “
¨
Uber die Bestimmung der Primzahlen-
menge innerhalb gegebener Grenzen”, Math.
Ann. 2, 636 (1870).
[23] D.H. Lehmer, “On the exact number of primes
less than a given limit”, Illinois J. Math. 3, 381
(1959).
Accepted in Quantum 2020-11-28, click title to verify. Published under CC-BY 4.0. 14