Gröbner bases for finite-temperature quantum computing and their complexity
From MaRDI portal
Publication:2851766
DOI10.1063/1.3660379zbMath1272.81039arXiv1008.4055OpenAlexW3101828125MaRDI QIDQ2851766
Publication date: 2 October 2013
Published in: Journal of Mathematical Physics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1008.4055
Quantum computation (81P68) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Axiomatic quantum field theory; operator algebras (81T05) Linear operators on spaces with an indefinite metric (47B50) Thermal quantum field theory (81T28) Quantum algorithms and complexity in the theory of computing (68Q12)
Cites Work
- Unnamed Item
- Unnamed Item
- Fermionic quantum computation
- Mirror symmetry in two steps: A--I--B
- Generic sequences of polynomials
- Mixed Hodge structures and renormalization in physics
- Efficient computation of zero-dimensional Gröbner bases by change of ordering
- PP-lowness and a simple definition of AWPP
- Simulation of topological field theories by quantum computers
- Parameterized and exact computation. Second international workshop, IWPEC 2006, Zürich, Switzerland, September 13--15, 2006. Proceedings
- Sums of squares on real algebraic surfaces
- On the Hopf algebraic origin of Wick normal ordering
- Clifford groups of quantum gates, BN-pairs and smooth cubic surfaces
- A polynomial invariant for knots via von Neumann algebras
- On an easy transition from operator dynamics to generating functionals by Clifford algebras
- Non-Abelian braid statistics versus projective permutation statistics
- Approximate Counting and Quantum Computation
- Cryptanalysis of 2R− Schemes
- Nonperturbative quantum field theory and the structure of matter
