Quick Navigation

Overview Topics Abstract Importance Paper Tools References Reactions Discussion Publication Related

Topics

Quantum Simulation

Computational Difficulty of Computing the Density of States

arXiv

Authors: Brielin Brown, Steven T. Flammia, Norbert Schuch

Year

2010

Paper ID

10849

Status

Preprint

Abstract Read

~2 min

Abstract Words

Citations

N/A

Abstract

We study the computational difficulty of computing the ground state degeneracy and the density of states for local Hamiltonians. We show that the difficulty of both problems is exactly captured by a class which we call #BQP, which is the counting version of the quantum complexity class QMA. We show that #BQP is not harder than its classical counting counterpart #P, which in turn implies that computing the ground state degeneracy or the density of states for classical Hamiltonians is just as hard as it is for quantum Hamiltonians.

Why This Paper Matters

This paper contributes to the Quantum Simulation research area in the Quantum Articles archive.
It adds a 2010 reference point for readers tracking recent quantum research.
We study the computational difficulty of computing the ground state degeneracy and the density of states for local Hamiltonians.

Paper Tools

Become a member to use research tools

Sign in to open papers, visit source links, share, cite, compare, copy DOI links, request category corrections, and build your reading list.

Become a member Sign in

Show Paper arXiv Publisher Share Cite This Paper Copy URL Compare Copy DOI Add to Reading List Category Correction Request

References & Citation Signals

[1] DOI https://doi.org/arXiv:1010.3060 [2] arXiv https://arxiv.org/abs/1010.3060 [3] Publisher https://arxiv.org/abs/1010.3060

Local Citation Graph (Related-Paper Links)

External citation index: OpenAlex citation signal

Community Reactions

Quick sentiment from readers on this paper.

Score: 0

Likes: 0 Dislikes: 0

Discussion & Reviews (Moderated)

Average Rating: 0.0 / 5 (0 ratings)

No written reviews yet.