Gröbner bases for finite-temperature quantum computing and their complexity

DOI10.1063/1.3660379MaRDI QIDQ2851766zbMATH OpenOpenAlexFDO

Authors P. R. Crompton

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

zbMATH Keywords

anyon conjecture for quantum computation

Mathematics Subject Classification ID

Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Linear operators on spaces with an indefinite metric (47B50) Quantum algorithms and complexity in the theory of computing (68Q12) Quantum computation (81P68) Axiomatic quantum field theory; operator algebras (81T05) Thermal quantum field theory (81T28)

Abstract: Following the recent approach of using order domains to construct Grobner bases from general projective varieties, we examine the parity and time-reversal arguments relating de Witt and Lyman's assertion that all path weights associated with homotopy in dimensions d <= 2 form a faithful representation of the fundamental group of a quantum system. We then show how the most general polynomial ring obtained for a fermionic quantum system does not, in fact, admit a faithful representation, and so give a general prescription for calcluating Grobner bases for finite temperature many-body quantum system and show that their complexity class is BQP.

Recommendations

• Strong reduced Gröbner bases of the quantum algebra A_n(q₁,,q_n,K)
• Involutive method for computing Gröbner bases over \(\mathbb F_2\)
• q-DEFORMED SPIN NETWORKS, KNOT POLYNOMIALS AND ANYONIC TOPOLOGICAL QUANTUM COMPUTATION
• Counting and Gröbner bases
• Publication:3470575

Cites work

• A polynomial invariant for knots via von Neumann algebras
• Approximate Counting and Quantum Computation
• Clifford groups of quantum gates, BN-pairs and smooth cubic surfaces
• Cryptanalysis of 2R− Schemes
• Efficient computation of zero-dimensional Gröbner bases by change of ordering
• Fermionic quantum computation
• Generic sequences of polynomials
• Mirror symmetry in two steps: A--I--B
• Mixed Hodge structures and renormalization in physics
• Non-Abelian braid statistics versus projective permutation statistics
• Nonperturbative quantum field theory and the structure of matter
• On an easy transition from operator dynamics to generating functionals by Clifford algebras
• On the Hopf algebraic origin of Wick normal ordering.
• Parameterized and exact computation. Second international workshop, IWPEC 2006, Zürich, Switzerland, September 13--15, 2006. Proceedings
• PCT, spin and statistics, and all that.
• PP-lowness and a simple definition of AWPP
• Quadratic mappings and Clifford algebras
• Simulation of topological field theories by quantum computers
• Sums of squares on real algebraic surfaces

This page was built for publication: Gröbner bases for finite-temperature quantum computing and their complexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2851766)