Fetching the paper…
Reading the bibliography…
Multipartite entanglement is one of the hallmarks of quantum mechanics and is central to quantum information processing.
1910
Earlier work this paper cites.
Frank L Hitchcock, “The expression of a tensor or a polyadic as a sum of products,” Studies in Applied Mathematics 6
1927
Earlier work this paper cites.
A. Einstein, B. Podolsky, and N. Rosen, “Can Quantum-Mechanical Description of Physical Reality Be Considered Complete?” Physical Review 47
1935
Earlier work this paper cites.
Richard A. Harshman, “Foundations of the parafac procedure: Models and conditions for an "explanatory" multi-model factor analysis,” (1970)
1970
Earlier work this paper cites.
Reinhard F. Werner, “Quantum states with Einstein-Podolsky-Rosen correlations admitting a hidden-variable model,” Physical Review A 40
1989
Earlier work this paper cites.
S. Roman, Coding and Information Theory , Graduate Texts in Mathematics (Springer New York, 1992)
1992
Earlier work this paper cites.
Steven. Roman, Coding and information theory , 1st ed. (Springer-Verlag, New York, 1992)
1992
Earlier work this paper cites.
A. M. Steane, “Error correcting codes in quantum theory,” Phys. Rev. Lett. 77
1996
Earlier work this paper cites.
Daniel Gottesman, Stabilizer Codes and Quantum Error Correction , Ph.D. thesis, California Institute of Technology (1997)
1997
Earlier work this paper cites.
Peter Shor and Raymond Laflamme, “Quantum Analog of the MacWilliams Identities for Classical Coding Theory,” Physical Review Letters 78
1997
Earlier work this paper cites.
Artur Ekert and Richard Jozsa, “Quantum algorithms: entanglementenhanced information processing,” Philosophical Transactions of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences 356
1998
Earlier work this paper cites.
William K. Wootters, “Quantum entanglement as a quantifiable resource,” Philosophical Transactions of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences 356
1998
Earlier work this paper cites.
Chungheon Baek, Tomohiro Ostuka, Seigo Tarucha, al, Simon J Devitt, William J Munro, Kae Nemoto -, Joschka Roffe, and David Headley, “Quantum computing,” Reports on Progress in Physics 61
1998
Earlier work this paper cites.
E.M. Rains, “Shadow bounds for self-dual codes,” IEEE Transactions on Information Theory 44
1998
Earlier work this paper cites.
A.R. Calderbank, E.M. Rains, P.M. Shor, and N.J.A. Sloane, “Quantum error correction via codes over gf(4),” IEEE Transactions on Information Theory 44
1998
Earlier work this paper cites.
W. Dur, G. Vidal, and J. I. Cirac, “Three qubits can be entangled in two inequivalent ways,” Physical Review A - Atomic, Molecular, and Optical Physics 62
2000
Earlier work this paper cites.
Valerie Coffman, Joydip Kundu, and William K. Wootters, “Distributed entanglement,” Physical Review A 61
2000
Earlier work this paper cites.
Robert Raussendorf and Hans J. Briegel, “A One-Way Quantum Computer,” Physical Review Letters 86
2001
Earlier work this paper cites.
H Barnum and N Linden, “Monotones and invariants for multi-particle quantum states,” J. Phys. A: Math. Gen 34
2001
Earlier work this paper cites.
Alexander Wong and Nelson Christensen, “Potential multiparticle entanglement measure,” Physical Review A 63
2001
Earlier work this paper cites.
Jens Eisert and Hans J. Briegel, “Schmidt measure as a tool for quantifying multiparticle entanglement,” Physical Review A 64
2001
Earlier work this paper cites.
Harry Buhrman, Richard Cleve, John Watrous, and Ronald de Wolf, “Quantum Fingerprinting,” Physical Review Letters 87
2001
Earlier work this paper cites.
See Supplemental Material which contains additional details and proofs as well as Refs. Werner 1989 ; Eggeling and Werner 2001 ; Spiegel et al. 2018 ; Hein et al. 2006 ; Varbanov 2007 ; Gulliver and Kim 2004 ; Bachoc and Gaborit 2001
2001
Cited alongside, same era.
T. Eggeling and R. F. Werner, “Separability properties of tripartite states with u ⨂ u ⨂ u u\bigotimes u\bigotimes u symmetry,” Phys. Rev. A 63
2001
Cited alongside, same era.
Christine Bachoc and Philippe Gaborit, “On extremal additive f4 codes of length 10 to 18,” Electronic Notes in Discrete Mathematics 6
2001
Cited alongside, same era.
David A. Meyer and Nolan R. Wallach, “Global entanglement in multiparticle systems,” Journal of Mathematical Physics 43
2002
Cited alongside, same era.
Jean Luc Brylinski, “Algebraic measures of entanglement,” Mathematics of Quantum Computation , 3–24 (2002) , arXiv:0008031 [quant-ph]
2010
Later among the works it cites.
Michael A. Nielsen and Isaac L. Chuang, Quantum Computation and Quantum Information: 10th Anniversary Edition (Cambridge University Press, 2010)
2010
Later among the works it cites.
Lin Chen, Eric Chitambar, Runyao Duan, Zhengfeng Ji, and Andreas Winter, “Tensor Rank and Stochastic Entanglement Catalysis for Multipartite Pure States,” Physical Review Letters 105
2010
Later among the works it cites.
Ludovic Arnaud and Nicolas J. Cerf, “Exploring pure quantum states with maximally mixed reductions,” Physical Review A - Atomic, Molecular, and Optical Physics 87
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…
2002
Cited alongside, same era.
Robert Lockhart, “Low-rank separable states are a set of measure zero within the set of low-rank states,” Physical Review A 65
2002
Cited alongside, same era.
Richard Jozsa and Noah Linden, “On the role of entanglement in quantum-computational speed-up,” Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences 459
2003
Cited alongside, same era.
Akimasa Miyake, “Classification of multipartite entangled states by multidimensional determinants,” Physical Review A 67
2003
Cited alongside, same era.
Gavin K. Brennen, “An observable measure of entanglement for pure states of multi-qubit systems,” Quantum Info. Comput. 3
2003
Cited alongside, same era.
Tzu-Chieh Wei and Paul M. Goldbart, “Geometric measure of entanglement and applications to bipartite and multipartite quantum states,” Physical Review A 68
2003
Cited alongside, same era.
A. J. Scott, “Multipartite entanglement, quantum-error-correcting codes, and entangling power of quantum evolutions,” Physical Review A - Atomic, Molecular, and Optical Physics 69
2004
Cited alongside, same era.
André R.R. Carvalho, Florian Mintert, and Andreas Buchleitner, “Decoherence and multipartite entanglement,” Physical Review Letters 93
2004
Cited alongside, same era.
2014
Later among the works it cites.
Szilárd Szalay, “Multipartite entanglement measures,” Physical Review A 92
2015
Later among the works it cites.
2015
Later among the works it cites.
Michael Walter, David Gross, and Jens Eisert, “Multipartite Entanglement,” Quantum Information , 293–330 (2016)
2016
Later among the works it cites.
Xianfei Qi, Ting Gao, and Fengli Yan, “Lower bounds of concurrence for N-qubit systems and the detection of k-nonseparability of multipartite quantum systems,” Quantum Information Processing 2016 16:1 16
2016
Later among the works it cites.
C. L. Degen, F. Reinhard, and P. Cappellaro, “Quantum sensing,” Rev. Mod. Phys. 89
2017
Later among the works it cites.
2017
Later among the works it cites.
John Preskill, “Quantum Computing in the NISQ era and beyond,” Quantum 2
2018
Later among the works it cites.
Felix Huber, Christopher Eltschka, Jens Siewert, and Otfried Gühne, “Bounds on absolutely maximally entangled states from shadow inequalities, and the quantum MacWilliams identity,” Journal of Physics A: Mathematical and Theoretical 51
2018
Later among the works it cites.
Zahra Raissi, Christian Gogolin, Arnau Riera, and Antonio Acín, “Optimal quantum error correcting codes from absolutely maximally entangled states,” Journal of Physics A: Mathematical and Theoretical 51
2018
Later among the works it cites.
Murray R. Spiegel, Seymour Lipschutz, and John Liu, Mathematical Handbook of Formulas and tables (McGraw-Hill Education, 2018)
2018
Later among the works it cites.
Laszlo Gyongyosi and Sandor Imre, “A Survey on quantum computing technology,” Computer Science Review 31
2019
Later among the works it cites.
2021
Later among the works it cites.
2021
Later among the works it cites.
2022
Closest in time.
2022
Closest in time.