Related references
Note: Only part of the references are listed.A Polynomial Quantum Algorithm for Approximating the Jones Polynomial
Dorit Aharonov et al.
ALGORITHMICA (2009)
Quantum algorithms for spin models and simulable gate sets for quantum computation
M. Van den Nest et al.
PHYSICAL REVIEW A (2009)
Renormalization algorithm with graph enhancement
R. Huebener et al.
PHYSICAL REVIEW A (2009)
On the exact evaluation of certain instances of the Potts partition function by quantum computers
Joseph Geraci et al.
COMMUNICATIONS IN MATHEMATICAL PHYSICS (2008)
Inapproximability of the Tutte polynomial
Leslie Ann Goldberg et al.
INFORMATION AND COMPUTATION (2008)
Completeness of the classical 2D ising model and universal quantum computation
M. Van den Nest et al.
PHYSICAL REVIEW LETTERS (2008)
Simulating quantum computation by contracting tensor networks
Igor L. Markov et al.
SIAM JOURNAL ON COMPUTING (2008)
Entanglement renormalization
G. Vidal
PHYSICAL REVIEW LETTERS (2007)
Polynomial-time quantum algorithms for Pell's equation and the principal ideal problem
Sean Hallgren
JOURNAL OF THE ACM (2007)
Classical simulation versus universality in measurement-based quantum computation
M. Van den Nest et al.
PHYSICAL REVIEW A (2007)
Classical simulation of quantum many-body systems with a tree tensor network
Y. -Y. Shi et al.
PHYSICAL REVIEW A (2006)
Approximate counting and quantum computation
M Bordewich et al.
COMBINATORICS PROBABILITY & COMPUTING (2005)
A subexponential-time quantum algorithm for the dihedral hidden subgroup problem
G Kuperberg
SIAM JOURNAL ON COMPUTING (2005)
The relative complexity of approximate counting problems
M Dyer et al.
ALGORITHMICA (2004)
Efficient simulation of one-dimensional quantum many-body systems
G Vidal
PHYSICAL REVIEW LETTERS (2004)
Efficient classical simulation of slightly entangled quantum computations
G Vidal
PHYSICAL REVIEW LETTERS (2003)
Simulation of topological field theories by quantum computers
MH Freedman et al.
COMMUNICATIONS IN MATHEMATICAL PHYSICS (2002)
A modular functor which is universal for quantum computation
MH Freedman et al.
COMMUNICATIONS IN MATHEMATICAL PHYSICS (2002)
Share Paper
