Fetching the paper…
Reading the bibliography…
We tackle the long-standing question of the computational complexity of determining homology groups of simplicial complexes, a fundamental task in computational topology, posed by Kaibel and Pfetsch 20 years ago.
E. Witten, “Supersymmetry and Morse theory,” J. Diff. Geom
1982
Earlier work this paper cites.
L. M. Adleman, J. DeMarrais, and M.-D. A. Huang, “Quantum computability,” SIAM Journal on Computing
1997
Earlier work this paper cites.
Springer Berlin Heidelberg, Berlin, Heidelberg, 1999
P. O. de Mendez, “Geometric realization of simplicial complexes,” in Graph Drawing · 1999
Earlier work this paper cites.
https://arxiv.org/abs/cs/0009002
J. Watrous, “Succinct quantum proofs for properties of finite groups,” 2000 · 2000
Earlier work this paper cites.
V. Kaibel and M. E. Pfetsch, “Some Algorithmic Problems in Polytope Theory,” arXiv Mathematics e-prints
2002
Earlier work this paper cites.
Algebraic Topology. Cambridge University Press, 2002
A. Hatcher, C. U. Press, and C. U. D. of Mathematics, Algebraic Topology · 2002
Earlier work this paper cites.
Springer New York, New York, NY, 2002
A. Y. Kitaev, A. Shen, and M. N. Vyalyi, “Classical and quantum computing,” in Quantum Information · 2002
Earlier work this paper cites.
Y. Shi, “Both toffoli and controlled-not need little help to do universal quantum computing,” Quantum Information & Computation
2003
Earlier work this paper cites.
P. Fendley, K. Schoutens, and J. de Boer, “Lattice models with 𝒩 = 2 \mathcal{N}=2 supersymmetry,” Physical Review Letters
2003
Earlier work this paper cites.
P. Fendley, B. Nienhuis, and K. Schoutens, “Lattice fermion models with supersymmetry,” Journal of Physics A: Mathematical and General
2003
Earlier work this paper cites.
P. Fendley, K. Schoutens, and H. van Eerten, “Hard squares with negative activity,” Journal of Physics A: Mathematical and General
2004
Earlier work this paper cites.
https://arxiv.org/abs/2005.02607
C. Gyurik, C. Cade, and V. Dunjko, “Towards quantum advantage via topological data analysis,” 2020 · 2005
Earlier work this paper cites.
M. Beccaria and G. F. De Angelis, “Exact ground state and finite-size scaling in a supersymmetric lattice model,” Physical review letters
2005
Earlier work this paper cites.
P. Fendley and K. Schoutens, “Exact results for strongly correlated fermions in 2+ 1 dimensions,” Physical review letters
2005
Earlier work this paper cites.
J. Jonsson, “Hard squares on grids with diagonal boundary conditions,” preprint
2006
Earlier work this paper cites.
2007
Cited alongside, same era.
https://arxiv.org/abs/0804.3401
J. Watrous, “Quantum computational complexity,” 2008 · 2008
Cited alongside, same era.
L. Huijse and K. Schoutens, “Superfrustration of charge degrees of freedom,” The European Physical Journal B
2008
Cited alongside, same era.
L. Huijse and K. Schoutens, “Superfrustration of charge degrees of freedom,” The European Physical Journal B
2008
Cited alongside, same era.
L. Huijse, J. Halverson, P. Fendley, and K. Schoutens, “Charge frustration and quantum criticality for strongly correlated fermions,” Physical review letters
2008
Cited alongside, same era.
P. M. Crichigno, “Supersymmetry and Quantum Computation,” arXiv:2011.01239 [quant-ph]
2011
Later among the works it cites.
S. Bravyi, “Efficient algorithm for a quantum analogue of 2-SAT,” Contemporary Mathematics
2011
Later among the works it cites.
R. Baxter, “Hard squares for z=–1,” Annals of Combinatorics
2011
Later among the works it cites.
2013
Later among the works it cites.
D. Horak and J. Jost, “Spectra of combinatorial laplace operators on simplicial complexes,” Advances in Mathematics
2013
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
M. Bousquet-Mélou, S. Linusson, and E. Nevo, “On the independence complex of square grids,” Journal of Algebraic combinatorics
2008
Cited alongside, same era.
G. Carlsson, “Topology and data,” Bulletin of the American Mathematical Society
2009
Cited alongside, same era.
D. Aharonov, V. Jones, and Z. Landau, “A polynomial quantum algorithm for approximating the jones polynomial,” Algorithmica
2009
Cited alongside, same era.
J. Jonsson, “Hard squares with negative activity on cylinders with odd circumference,” the electronic journal of combinatorics
2009
Cited alongside, same era.
A. Engström, “Upper bounds on the witten index for supersymmetric lattice models by discrete morse theory,” European Journal of Combinatorics
2009
Cited alongside, same era.
P. Csorba, “Subdivision yields alexander duality on independence complexes,” the electronic journal of combinatorics
2009
Cited alongside, same era.
Applied Mathematics. American Mathematical Society, 2010
H. Edelsbrunner and J. Harer, Computational Topology: An Introduction · 2010
Cited alongside, same era.
M. Adamaszek, “Special cycles in independence complexes and superfrustration in some lattices,” Topology and its Applications
2013
Later among the works it cites.
G. Petri, P. Expert, F. Turkheimer, R. Carhart-Harris, D. Nutt, P. J. Hellyer, and F. Vaccarino, “Homological scaffolds of brain functional networks,” Journal of The Royal Society Interface
2014
Later among the works it cites.
M. Adamaszek and J. Stacho, “Complexity of simplicial homology and independence complexes of chordal graphs,” Computational Geometry
2016
Later among the works it cites.
L. Wasserman, “Topological data analysis,” arXiv preprint arXiv:1609.08227
2016
Later among the works it cites.
C. Giusti, R. Ghrist, and D. S. Bassett, “Two’s company, three (or more) is a simplex,” Journal of computational neuroscience
2016
Later among the works it cites.
S. Lloyd, S. Garnerone, and P. Zanardi, “Quantum algorithms for topological and geometric analysis of data,” Nature communications
2016
Later among the works it cites.
M. Reimann, M. Nolte, M. Scolamiero, K. Turner, R. Perin, G. Chindemi, P. Dlotko, R. Levi, K. Hess, and H. Markram, “Cliques of Neurons Bound into Cavities Provide a Missing Link between Structure and Function,” Frontiers in Computational Neuroscience
2017
Later among the works it cites.
G. Carlsson, “Topological methods for data modelling,” Nature Reviews Physics
2020
Later among the works it cites.
https://arxiv.org/abs/2102.02991
L. Zhou and D. Aharonov, “Strongly universal hamiltonian simulators,” 2021 · 2021
Later among the works it cites.
I. Y. Akhalwaya, Y.-H. He, L. Horesh, V. Jejjala, W. Kirby, K. Naidoo, and S. Ubaru, “Representation of the fermionic boundary operator,” Physical Review A
2022
Closest in time.