Fetching the paper…
Reading the bibliography…
We present a quantum algorithm that additively approximates the value of a tensor network to a certain scale.
Some simplified NP-complete problems,
M. R. Garey, D. S. Johnson and L. Stockmeyer, · 1974
Earlier work this paper cites.
Thermodynamics and an Introduction to Thermostatistics
H. B. Callen, · 1985
Earlier work this paper cites.
SIAM J. Algebraic Discrete Methods 8
S. Arnborg, D. G. Corneil and A. Proskurowski, Complexity of finding embeddings in a k-tree · 1987
Earlier work this paper cites.
Math. Proc. Camb. Phil. Soc 108
F. Jaeger, D. Vertigan and D. Welsh, On the computational complexity of the Jones and Tutte polynomials · 1990
Earlier work this paper cites.
Complexity: knots, colourings and counting
D. J. A. Welsh, · 1993
Earlier work this paper cites.
Computational complexity
C. M. Papadimitriou, · 1994
Earlier work this paper cites.
SIAM J. Comput. 26
P. W. Shor, Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer · 1997
Earlier work this paper cites.
Phys. Rev. Lett. 81
E. Knill and R. Laflamme, Power of One Bit of Quantum Information · 1998
Earlier work this paper cites.
pages 60–67 (2001)
J. Watrous, Quantum algorithms for solvable groups · 2001
Earlier work this paper cites.
Bull. Amer. Math. Soc. 40
M. Freedman, A. Kitaev, M. Larsen and Z. Wang, Topological quantum computation · 2002
Earlier work this paper cites.
Communications in Mathematical Physics 227
M. Freedman, A. Kitaev and Z. Wang, Simulation of Topological Field Theories by Quantum Computers · 2002
Earlier work this paper cites.
Communications in Mathematical Physics 227
M. Freedman, M. Larsen and Z. Wang, A Modular Functor Which is Universal for Quantum Computation · 2002
Earlier work this paper cites.
Classical and Quantum Computation
A. Y. Kitaev, A. H. Shen and M. N. Vyalyi, · 2002
Earlier work this paper cites.
pages 59–68 (2003)
A. M. Childs, R. Cleve, E. Deotto, E. Farhi, S. Gutmann and D. A. Spielman, Exponential algorithmic speedup by a quantum walk · 2003
Earlier work this paper cites.
pages 489–498 (2003)
W. van Dam, S. Hallgren and L. Ip, Quantum algorithms for some hidden shift problems · 2003
Earlier work this paper cites.
Phys. Rev. Lett. 91
G. Vidal, Efficient Classical Simulation of Slightly Entangled Quantum Computations · 2003
Cited alongside, same era.
Algorithmica 38
M. Dyer, L. Goldberg, C. Greenhill and M. Jerrum, The relative complexity of approximate counting problems · 2004
Cited alongside, same era.
ArXiv Condensed Matter e-prints (July 2004), cond-mat/0407066
F. Verstraete and J. I. Cirac, Renormalization algorithms for Quantum-Many Body Systems in two and higher dimensions · 2004
Cited alongside, same era.
Phys. Rev. Lett. 93
G. Vidal, Efficient Simulation of One-Dimensional Quantum Many-Body Systems · 2004
Cited alongside, same era.
Comb. Probab. Comput. 14
M. Bordewich, M. Freedman, L. Lovász and D. Welsh, Approximate Counting and Quantum Computation · 2005
Cited alongside, same era.
Arxiv preprint quant-ph/0505030 (2005)
C. Dawson and M. Nielsen, The Solovay-Kitaev algorithm · 2005
Cited alongside, same era.
Inapproximability of the Tutte polynomial,
L. A. Goldberg and M. Jerrum, · 2007
Later among the works it cites.
J. ACM 54
S. Hallgren, Polynomial-time quantum algorithms for Pell’s equation and the principal ideal problem · 2007
Later among the works it cites.
private communication, 2007
M. Van den Nest, · 2007
Later among the works it cites.
eprint arXiv: 0708.2275 (2007)
M. Van den Nest, W. Dür and H. J. Briegel, Completeness of the classical 2D Ising model and universal quantum computation · 2007
Later among the works it cites.
Phys Rev Lett 98
M. Van den Nest, W. Dur and H. Briegel, Classical spin models and the quantum-stabilizer formalism · 2007
Later among the works it cites.
Physical review. A 75
M. Van den Nest, W. Dür, G. Vidal and H. J. Briegel, Classical simulation versus universality in measurement-based quantum computation · 2007
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
arXiv preprint (2005), quant-ph/0511069
I. Markov and Y. Shi, Simulating quantum computation by contracting tensor networks · 2005
Cited alongside, same era.
Surveys in Combinatorics 2005 , 173–226 (2005)
A. D. Sokal, The multivariate Tutte polynomial (alias Potts model) for graphs and matroids · 2005
Cited alongside, same era.
Arxiv preprint quant-ph/0605181 (2006)
D. Aharonov and I. Arad, The BQP-hardness of approximating the Jones Polynomial · 2006
Cited alongside, same era.
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing , 427–436 (2006)
D. Aharonov, V. Jones and Z. Landau, A polynomial quantum algorithm for approximating the Jones polynomial · 2006
Cited alongside, same era.
arXiv preprint (2006), quant-ph/0611156
D. Aharonov, Z. Landau and J. Makowsky, The quantum FFT can be classically simulated · 2006
Cited alongside, same era.
Phys. Rev. A 74
Y. Shi, L. Duan and G. Vidal, Classical simulation of quantum many-body systems with a tree tensor network · 2006
Cited alongside, same era.
G. Vidal, Entanglement Renormalization · 2007
Later among the works it cites.
Exactly Solved Models in Statistical Mechanics
R. J. Baxter, · 2008
Closest in time.
arXiv preprint (2008), 0801.4833
J. Geraci, A BQP-complete problem related to the Ising model partition function via a new connection between quantum circuits and graphs · 2008
Closest in time.
Communications in Mathematical Physics 279
J. Geraci and D. Lidar, On the Exact Evaluation of Certain Instances of the Potts Partition Function by Quantum Computers · 2008
Closest in time.
ArXiv Condensed Matter e-prints (February 2008), 0802.1211
R. Hübener, C. Kruszynska, L. Hartmann, W. Dür, F. Verstraete, J. Eisert and M. Plenio, Renormalization algorithm with graph enhancement · 2008
Closest in time.
arXiv preprint (2008), 0805.1214
M. Van den Nest, W. Dür and H. J. Raussendorf, R. Briegel, Quantum algorithms for spin models and simulable gate sets for quantum computation · 2008
Closest in time.
arXiv preprint (2009), arXiv:0911.1624
M. Van den Nest, Classical simulation of quantum algorithms and the role of classical postprocessing · 2009
Closest in time.
private communication, 2009
M. Van den Nest, · 2009
Closest in time.