Commuting quantum circuits and complexity of Ising partition functions

DOI10.1088/1367-2630/aa5fdbzbMath1514.81091arXiv1311.2128OpenAlexW3099752579MaRDI QIDQ6100591

Publication date: 12 May 2023

Published in: New Journal of Physics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1311.2128

Mathematics Subject Classification ID

Quantum computation (81P68) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (1)

Universal blind quantum computation for hybrid system

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Low depth quantum circuits for Ising models
The complexity of computing the permanent
Random measurement bases, quantum state distinction and applications to the hidden subgroup problem
Quantum computing and quadratically signed weight enumerators
Fault-tolerant quantum computation by anyons
PP is closed under intersection
BQP and the polynomial hierarchy
A linear-optical proof that the permanent is # P -hard
The statistics of dimers on a lattice
Universal linear optics
Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy
Polynomial-Time Approximation Algorithms for the Ising Model
Quantum Circuits That Can Be Simulated Classically in Polynomial Time
Statistical mechanics, three-dimensionality and NP-completeness
PP is as Hard as the Polynomial-Time Hierarchy
The Complexity of Ferromagnetic Ising with Local Fields
Matchgates and classical simulation of quantum circuits
Temporally unstructured quantum computation
Threshold Computation and Cryptographic Security
Matchgate and space-bounded quantum computations are equivalent
Classical Ising model test for quantum circuits
Quantum algorithms for classical lattice models
Generating a statet-design by diagonal quantum circuits
Universal Blind Quantum Computation
Quantum complexity theory
Computational Complexity
DIAGONAL-UNITARY 2-DESIGN AND THEIR IMPLEMENTATIONS BY QUANTUM CIRCUITS
Quantum Information and Statistical Mechanics: An Introduction to Frontier
The computational complexity of linear optics
Quantum computing, postselection, and probabilistic polynomial-time
On Unapproximable Versions of $NP$-Complete Problems
A polynomial quantum algorithm for approximating the Jones polynomial

This page was built for publication: Commuting quantum circuits and complexity of Ising partition functions