Fetching the paper…
Reading the bibliography…
Holant problems are a framework for the analysis of counting complexity problems on graphs.
Physical Review Letters
Artur K. Ekert (1991): Quantum cryptography based on Bell’s theorem · 1991
Earlier work this paper cites.
Mariami Gachechiladze & Otfried Gühne (2016): Addendum to ”Generic quantum nonlocality” [Phys. Lett. A 166, 293 (1992)] · 1992
Earlier work this paper cites.
Physics Letters A
Sandu Popescu & Daniel Rohrlich (1992): Generic quantum nonlocality · 1992
Earlier work this paper cites.
Physical Review Letters
Charles H. Bennett, Gilles Brassard, Claude Crépeau, Richard Jozsa, Asher Peres & William K. Wootters (1993): Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels · 1993
Earlier work this paper cites.
arXiv:quant-ph/9807006
Daniel Gottesman (1998): The Heisenberg Representation of Quantum Computers · 1999
Earlier work this paper cites.
Physical Review A
Charles H. Bennett, Sandu Popescu, Daniel Rohrlich, John A. Smolin & Ashish V. Thapliyal (2000): Exact and asymptotic measures of multipartite pure-state entanglement · 2000
Earlier work this paper cites.
Physical Review A
W. Dür, G. Vidal & J. I. Cirac (2000): Three qubits can be entangled in two inequivalent ways · 2000
Earlier work this paper cites.
Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences
Richard Jozsa & Noah Linden (2003): On the role of entanglement in quantum-computational speed-up · 2002
Earlier work this paper cites.
Physical Review A
F. Verstraete, J. Dehaene, B. De Moor & H. Verschelde (2002): Four qubits can be entangled in nine different ways · 2002
Earlier work this paper cites.
Physical Review A
Jeroen Dehaene & Bart De Moor (2003): Clifford group, stabilizer states, and linear and quadratic operations over GF(2) · 2003
Cited alongside, same era.
In Jin-Yi Cai, S. Barry Cooper & Angsheng Li, editors: Theory and Applications of Models of Computation
Jin-Yi Cai & Vinay Choudhary (2006): Valiant’s Holant Theorem and Matchgate Tensors · 2006
Cited alongside, same era.
Physical Review A
L. Lamata, J. León, D. Salgado & E. Solano (2006): Inductive classification of multipartite entanglement under stochastic local operations and classical communication · 2006
Cited alongside, same era.
Physics Letters A
Dafa Li, Xiangrong Li, Hongtao Huang & Xinxin Li (2006): Simple criteria for the SLOCC classification · 2006
Cited alongside, same era.
Physical Review A
L. Lamata, J. León, D. Salgado & E. Solano (2007): Inductive entanglement classification of four qubits under stochastic local operations and classical communication · 2007
Cited alongside, same era.
SIAM Journal on Computing
L. Valiant (2008): Holographic Algorithms · 2008
In: Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms
J. Cai, P. Lu & M. Xia (2011): Dichotomy for Holant* Problems of Boolean Domain · 2011
Later among the works it cites.
Algorithmica
Jin-Yi Cai, Sangxia Huang & Pinyan Lu (2012): From Holant to #CSP and Back: Dichotomy for Holant c · 2012
Later among the works it cites.
In: Proceedings of the Forty-fifth Annual ACM Symposium on Theory of Computing
Jin-Yi Cai, Heng Guo & Tyson Williams (2013): A Complete Dichotomy Rises from the Capture of Vanishing Signatures: Extended Abstract · 2013
Later among the works it cites.
Journal of Computer and System Sciences
Jin-Yi Cai, Pinyan Lu & Mingji Xia (2014): The complexity of complex weighted Boolean #CSP · 2013
Later among the works it cites.
Reports on Progress in Physics
Simon J Devitt, William J Munro & Kae Nemoto (2013): Quantum error correction for beginners · 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…
Cited alongside, same era.
In: Proceedings of the Forty-first Annual ACM Symposium on Theory of Computing
Jin-Yi Cai, Pinyan Lu & Mingji Xia (2009): Holant Problems and Counting CSP · 2009
Cited alongside, same era.
In Samson Abramsky, Cyril Gavoille, Claude Kirchner, Friedhelm Meyer auf der Heide & Paul G. Spirakis, editors: Automata, Languages and Programming
Jin-Yi Cai, Xi Chen & Pinyan Lu (2010): Graph Homomorphisms with Complex Values: A Dichotomy Theorem · 2010
Cited alongside, same era.
Cambridge University Press, Cambridge
Michael A. Nielsen & Isaac L. Chuang (2010): Quantum Computation and Quantum Information · 2010
Cited alongside, same era.
Miriam Backens (2016): The inductive entanglement classification yields ten rather than eight classes of four-qubit entangled states · 2016
Later among the works it cites.
computational complexity
Sangxia Huang & Pinyan Lu (2016): A Dichotomy for Real Weighted Holant Problems · 2016
Later among the works it cites.
Jiabao Lin & Hanpin Wang (2016): The Complexity of Holant Problems over Boolean Domain with Non-negative Weights · 2016
Later among the works it cites.