Fetching the paper…
Reading the bibliography…
We consider the complexity of the local Hamiltonian problem in the context of fermionic Hamiltonians with $\mathcal N=2 $ supersymmetry and show that the problem remains $\mathsf{QMA}$-complete.
Supersymmetry and Spin Systems
H. Nicolai · 1976
Earlier work this paper cites.
Dynamical Breaking of Supersymmetry
Edward Witten · 1981
Earlier work this paper cites.
Eigenvalues and expanders
Noga Alon · 1986
Earlier work this paper cites.
Quantum Field Theory and the Jones Polynomial
Edward Witten · 1989
Earlier work this paper cites.
An Introduction to Homological Algebra
Charles A. Weibel · 1994
Earlier work this paper cites.
Lattice models and n= 2 supersymmetry
Hubert Saleur and Nicholas P Warner · 1995
Earlier work this paper cites.
Supersymmetric Methods in Quantum and Statistical Physics
Georg Junker · 1996
Earlier work this paper cites.
Universal quantum simulators
Seth Lloyd · 1996
Earlier work this paper cites.
Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
Peter W. Shor · 1997
Earlier work this paper cites.
𝖯 / 𝖭𝖯 \mathsf{P}/\mathsf{NP} , and the quantum field computer
M. Freedman · 1998
Earlier work this paper cites.
Lecture notes for Physics 219: Quantum computation
John Preskill · 1999
Earlier work this paper cites.
Chapter 28 - History of Homological Algebra
Charles A. Weibel · 1999
Earlier work this paper cites.
Quantum lower bounds by polynomials
Robert Beals, Harry Buhrman, Richard Cleve, Michele Mosca, and Ronald de Wolf · 2001
Earlier work this paper cites.
Demonstrating a continuous set of two-qubit gates for near-term quantum algorithms
B. Foxen, C. Neill, A. Dunsworth, P. Roushan, B. Chiaro, A. Megrant, J. Kelly, Zijun Chen, K. Satzinger, and R. Barends · 2001
Earlier work this paper cites.
Mirror symmetry , volume 1 of Clay mathematics monographs
K. Hori, S. Katz, A. Klemm, R. Pandharipande, R. Thomas, C. Vafa, R. Vakil, and E. Zaslow · 2001
Earlier work this paper cites.
Fermionic quantum computation
Sergey B Bravyi and Alexei Yu Kitaev · 2002
Earlier work this paper cites.
Some Algorithmic Problems in Polytope Theory
Volker Kaibel and Marc E. Pfetsch · 2002
Earlier work this paper cites.
Classical and Quantum Computation
A. Yu. Kitaev, A. H. Shen, and M. N. Vyalyi · 2002
Earlier work this paper cites.
Topological quantum computation
Michael Freedman, Alexei Kitaev, Michael Larsen, and Zhenghan Wang · 2003
Earlier work this paper cites.
3 3 -local hamitonian is 𝖰𝖬𝖠 {\mathsf{QMA}} -complete
Julia Kempe and Oded Regev · 2003
Earlier work this paper cites.
Fault-tolerant quantum computation by anyons
A.Yu. Kitaev · 2003
Earlier work this paper cites.
Computational homology
Tomasz Kaczynski, Konstantin Michael Mischaikow, Marian Mrozek, and Konstantin Mischaikow · 2004
Earlier work this paper cites.
Non-local spacetime supersymmetry on the lattice
Xiao Yang and Paul Fendley · 2004
Earlier work this paper cites.
Exact results for strongly correlated fermions in 2+ 1 dimensions
Paul Fendley and Kareljan Schoutens · 2005
Earlier work this paper cites.
Supersymmetric model of spin-1/2 fermions on a chain
Raoul Santachiara and Kareljan Schoutens · 2005
Earlier work this paper cites.
Extensive ground state entropy in supersymmetric lattice models
Hendrik van Eerten · 2005
Earlier work this paper cites.
Topology for Computing
Afra J. Zomorodian · 2005
Earlier work this paper cites.
On promise problems: A survey
Oded Goldreich · 2006
Earlier work this paper cites.
The complexity of the local Hamiltonian problem
Julia Kempe, Alexei Kitaev, and Oded Regev · 2006
Cited alongside, same era.
Hamiltonian simulation in the low energy subspace
Burak Sahinoglu and Rolando Somma · 2006
Cited alongside, same era.
Cooper pairs and exclusion statistics from coupled free-fermion chains
Paul Fendley and Kareljan Schoutens · 2007
Cited alongside, same era.
A simple 𝖯𝗋𝗈𝗆𝗂𝗌𝖾𝖡𝖰𝖯 \mathsf{PromiseBQP} -complete matrix problem
Dominik Janzing and Pawel Wocjan · 2007
Cited alongside, same era.
Quantum computational complexity of the n n -representability problem: 𝖰𝖬𝖠 {\mathsf{QMA}} complete
Yi-Kai Liu, Matthias Christandl, and F. Verstraete · 2007
Cited alongside, same era.
On the complexity of deciding connectedness and computing betti numbers of a complex algebraic variety
A variational eigenvalue solver on a photonic quantum processor
Alberto Peruzzo, Jarrod McClean, Peter Shadbolt, Man-Hong Yung, Xiao-Qi Zhou, Peter J Love, Alán Aspuru-Guzik, and Jeremy L O’brien · 2014
Later among the works it cites.
A cheeger-type inequality on simplicial complexes
John Steenbergen, Caroline Klivans, and Sayan Mukherjee · 2014
Later among the works it cites.
Hamiltonian simulation with nearly optimal dependence on all parameters
Dominic W Berry, Andrew M Childs, and Robin Kothari · 2015
Later among the works it cites.
James PF LeBlanc, Andrey E Antipov, Federico Becca, Ireneusz W Bulik, Garnet Kin-Lic Chan, Chia-Min Chung, Youjin Deng, Michel Ferrero, Thomas M Henderson, Carlos A Jiménez-Hoyos, et al · 2015
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Peter Scheiblechner · 2007
Cited alongside, same era.
Entanglement theory and the quantum simulation of many-body physics
Fernando GSL Brandão · 2008
Cited alongside, same era.
Barcodes: the persistent topology of data
Robert Ghrist · 2008
Cited alongside, same era.
On perfect completeness for 𝖰𝖬𝖠 {\mathsf{QMA}}
Scott Aaronson · 2009
Cited alongside, same era.
A polynomial quantum algorithm for approximating the jones polynomial
Dorit Aharonov, Vaughan Jones, and Zeph Landau · 2009
Cited alongside, same era.
Computational Topology: An Introduction , volume 47
Herbert Edelsbrunner and John L. Harer · 2009
Cited alongside, same era.
Quantum Computational Complexity , pages 7174–7201
John Watrous · 2009
Cited alongside, same era.
Emergent Supersymmetry from Strongly Interacting Majorana Zero Modes
Armin Rahmani, Xiaoyu Zhu, Marcel Franz, and Ian Affleck · 2015
Later among the works it cites.
Complexity of simplicial homology and independence complexes of chordal graphs
Michał Adamaszek and Juraj Stacho · 2016
Later among the works it cites.
Homological Algebra (PMS-19)
Henry Cartan and Samuel Eilenberg · 2016
Later among the works it cites.
Complexity classification of local Hamiltonian problems
Toby Cubitt and Ashley Montanaro · 2016
Later among the works it cites.
Integrable supersymmetric chain without particle conservation
Jan de Gier, Gyorgy Z. Feher, Bernard Nienhuis, and Magdalena Rusaczonek · 2016
Later among the works it cites.
Quantum algorithms for topological and geometric analysis of data
Seth Lloyd, Silvano Garnerone, and Paolo Zanardi · 2016
Later among the works it cites.
The theory of variational hybrid quantum-classical algorithms
Jarrod R McClean, Jonathan Romero, Ryan Babbush, and Alán Aspuru-Guzik · 2016
Later among the works it cites.
Isoperimetric inequalities in simplicial complexes
Ori Parzanchevski, Ron Rosenthal, and Ran J Tessler · 2016
Later among the works it cites.
Christian Reiher · 2016
Later among the works it cites.
Supersymmetric Sachdev-Ye-Kitaev models
Wenbo Fu, Davide Gaiotto, Juan Maldacena, and Subir Sachdev · 2017
Later among the works it cites.
A short introduction to topological quantum computation
Ville Lahtinen and Jiannis Pachos · 2017
Later among the works it cites.
The quantum complexity of computing Schatten p p -norms
Chris Cade and Ashley Montanaro · 2018
Later among the works it cites.
Larry Wasserman · 2018
Later among the works it cites.
Quantum chemistry in the age of quantum computing
Yudong Cao, Jonathan Romero, Jonathan P Olson, Matthias Degroote, Peter D Johnson, Mária Kieferová, Ian D Kivlichan, Tim Menke, Borja Peropadre, Nicolas PD Sawaya, et al · 2019
Later among the works it cites.
Andrew M Childs, Yuan Su, Minh C Tran, Nathan Wiebe, and Shuchen Zhu · 2019
Later among the works it cites.
Supersymmetry and Quantum Computation
P. Marcos Crichigno · 2020
Later among the works it cites.
Kink dynamics and quantum simulation of supersymmetric lattice Hamiltonians
Jiří Minář, Bart van Voorden, and Kareljan Schoutens · 2020
Later among the works it cites.
Spectral sparsification of simplicial complexes for clustering and label propagation
Sourabh Palande and Bei Wang · 2020
Later among the works it cites.
Provably efficient machine learning for quantum many-body problems
Hsin-Yuan Huang, Richard Kueng, Giacomo Torlai, Victor V. Albert, and John Preskill · 2021
Closest in time.
What the foundations of quantum computer science teach us about chemistry
Jarrod R McClean, Nicholas C Rubin, Joonho Lee, Matthew P Harrigan, Thomas E O’Brien, Ryan Babbush, William J Huggins, and Hsin-Yuan Huang · 2021
Closest in time.
Electronic structure in a fixed basis is qma-complete
Bryan O’Gorman, Sandy Irani, James Whitfield, and Bill Fefferman · 2021
Closest in time.
Partitioning well-clustered graphs: Spectral clustering works!
Richard Peng, He Sun, and Luca Zanetti · 2021
Closest in time.
Towards quantum advantage for topological data analysis
Casper Gyurik, Chris Cade, and Vedran Dunjko · 2022
Closest in time.