Fetching the paper…
Reading the bibliography…
We consider the question of what quantum spin chains naturally encode in their Hilbert space.
Y. Umeno, M. Shiroishi, and M. Wadati, “Fermionic r-operator for the fermion chain model,” Journal of the Physical Society of Japan
1935
Earlier work this paper cites.
J. W. Cooley and J. W. Tukey, “An algorithm for the machine calculation of complex fourier series,” Mathematics of computation
1965
Earlier work this paper cites.
E. Olmedilla, M. Wadati, and Y. Akutsu, “Yang-baxter relations for spin models and fermion models,” Journal of the Physical Society of Japan
1987
Earlier work this paper cites.
C. Vafa, “Topological mirrors and quantum rings,” 1991
1991
Earlier work this paper cites.
K. INTRILIGATOR, “Fusion residues,” Modern Physics Letters A
1991
Earlier work this paper cites.
I. Gelfand, D. Krob, A. Lascoux, B. Leclerc, V. S. Retakh, and J. Y. Thibon, “Noncommutative symmetric functions,” 1994
1994
Earlier work this paper cites.
A. Bertram, “Towards a schubert calculus for maps from a riemann surface to a grassmannian,” 1994
1994
Earlier work this paper cites.
B. Siebert and G. Tian, “On quantum cohomology rings of fano manifolds and a formula of vafa and intriligator,” 1994
1994
Earlier work this paper cites.
Oxford university press, 1998
I. G. Macdonald, Symmetric functions and Hall polynomials · 1998
Earlier work this paper cites.
S. Fomin and C. Greene, “Noncommutative schur functions and their applications,” Discrete Mathematics
1998
Earlier work this paper cites.
Cambridge Studies in Advanced Mathematics. Cambridge University Press, 1999
R. Stanley and S. Fomin, Enumerative Combinatorics: Volume 2 · 1999
Earlier work this paper cites.
R. P. Stanley, “Positivity problems and conjectures in algebraic combinatorics,” Mathematics: Frontiers and Perspectives: Frontiers and Perspectives
2000
Earlier work this paper cites.
K. Rietsch, “Quantum cohomology of grassmannians and total positivity,” 2001
2001
Earlier work this paper cites.
Springer, 2006
R. P. Stanley, “Some combinatorial aspects of the schubert calculus,” in Combinatoire et Représentation du Groupe Symétrique: Actes de la Table Ronde du CNRS tenue à l’Université Louis-Pasteur de Strasbourg, 26 au 30 avril 1976 · 2006
Earlier work this paper cites.
H. Narayanan, “On the complexity of computing kostka numbers and littlewood-richardson coefficients,” Journal of Algebraic Combinatorics
2006
Earlier work this paper cites.
2008
Earlier work this paper cites.
P. Zinn-Justin, “Integrability and combinatorics: selected topics,” Les Houches lecture notes, http://www. lpthe. jussieu. fr/
2008
Earlier work this paper cites.
2008
Cited alongside, same era.
P. Bürgisser and C. Ikenmeyer, “The complexity of computing kronecker coefficients,” Discrete Mathematics & Theoretical Computer Science
2008
Cited alongside, same era.
2009
Cited alongside, same era.
N. Nekrasov and S. Shatashvili, “Quantum integrability and supersymmetric vacua,” Progress of Theoretical Physics Supplement
2009
Cited alongside, same era.
P. Zinn-Justin, “Littlewood–richardson coefficients and integrable tilings,” 2009
2009
Cited alongside, same era.
A. M. Childs, D. Maslov, Y. Nam, N. J. Ross, and Y. Su, “Toward the first quantum simulation with quantum speedup,” Proceedings of the National Academy of Sciences
2018
Later among the works it cites.
American Mathematical Soc., 2019
E. S. Egge, An introduction to symmetric functions and their combinatorics · 2019
Later among the works it cites.
Oxford University Press, 2019
H.-P. Eckle, Models of Quantum Matter: A First Course on Integrability and the Bethe Ansatz · 2019
Later among the works it cites.
N. Fischer and C. Ikenmeyer, “The computational complexity of plethysm coefficients,” 2020
2020
Later among the works it cites.
J. S. Van Dyke, G. S. Barron, N. J. Mayhall, E. Barnes, and S. E. Economou, “Preparing bethe ansatz eigenstates on a quantum computer,” PRX Quantum
2021
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
A. M. Childs and W. Van Dam, “Quantum algorithms for algebraic problems,” Reviews of Modern Physics
2010
Cited alongside, same era.
S. Aaronson and A. Arkhipov, “The computational complexity of linear optics,” 2010
2010
Cited alongside, same era.
M. J. Bremner, R. Jozsa, and D. J. Shepherd, “Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy,” Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences
2010
Cited alongside, same era.
D. Maulik and A. Okounkov, “Quantum groups and quantum cohomology,” arXiv preprint arXiv:1211.1287
2012
Cited alongside, same era.
Springer Science & Business Media, 2013
B. E. Sagan, The symmetric group: representations, combinatorial algorithms, and symmetric functions · 2013
Cited alongside, same era.
P. Bürgisser and C. Ikenmeyer, “Deciding positivity of littlewood-richardson coefficients,” 2013
2013
Cited alongside, same era.
A. Montanaro, “Quantum algorithms: an overview,” npj Quantum Information
2016
Cited alongside, same era.
J. S. Van Dyke, E. Barnes, S. E. Economou, and R. I. Nepomechie, “Preparing exact eigenstates of the open xxz chain on a quantum computer,” Journal of Physics A: Mathematical and Theoretical
2022
Later among the works it cites.
A. Sopena, M. H. Gordon, D. García-Martín, G. Sierra, and E. López, “Algebraic bethe circuits,” Quantum
2022
Later among the works it cites.
L. Colmenarejo, R. Orellana, F. Saliola, A. Schilling, and M. Zabrocki, “The mystery of plethysm coefficients,” 2022
2022
Later among the works it cites.
C. Ikenmeyer, I. Pak, and G. Panova, “Positivity of the symmetric group characters is as hard as the polynomial time hierarchy,” 2022
2022
Later among the works it cites.
2023
Later among the works it cites.
N. Jain, J. Landman, N. Mathur, and I. Kerenidis, “Quantum fourier networks for solving parametric pdes,” 2023
2023
Later among the works it cites.
R. Ruiz, A. Sopena, M. H. Gordon, G. Sierra, and E. López, “The bethe ansatz as a quantum circuit,” 2023
2023
Later among the works it cites.
G. Panova, “Computational complexity in algebraic combinatorics,” 2023
2023
Later among the works it cites.
G. Panova, “Complexity and asymptotics of structure constants,” 2023
2023
Later among the works it cites.
D. Bluvstein, S. J. Evered, A. A. Geim, S. H. Li, H. Zhou, T. Manovitz, S. Ebadi, M. Cain, M. Kalinowski, D. Hangleiter, J. P. Bonilla Ataides, N. Maskara, I. Cong, X. Gao, P. Sales Rodriguez, T. Karolyshyn, G. Semeghini, M. J. Gullans, M. Greiner, V. Vuletić, and M. D. Lukin, “Logical quantum processor based on reconfigurable atom arrays,” Nature
2024
Closest in time.
D. Raveh and R. I. Nepomechie, “Deterministic bethe state preparation,” 2024
2024
Closest in time.