Partition Function Estimation: Quantum and Quantum-Inspired Algorithms
arXiv:2208.00930 · doi:10.1103/PhysRevA.107.012421
Abstract
We present two algorithms, one quantum and one classical, for estimating partition functions of quantum spin Hamiltonians. The former is a DQC1 (Deterministic quantum computation with one clean qubit) algorithm, and the first such for complex temperatures. The latter, for real temperatures, achieves performance comparable to a state-of-the-art DQC1 algorithm [Chowdhury et al. Phys. Rev. A 103, 032422 (2021)]. Both our algorithms take as input the Hamiltonian decomposed as a linear combination Pauli operators. We show this decomposition to be DQC1-hard for a given Hamiltonian, providing new insight into the hardness of estimating partition functions.
References in corpus (27)
- Improved Simulation of Stabilizer Circuits
- On the Power of One Bit of Quantum Information
- Hamiltonian Simulation by Qubitization
- Quantum algorithms for quantum chemistry and quantum materials science
- Instantaneous non-local computation of low T-depth quantum circuits
- The Heisenberg Representation of Quantum Computers
- A Theory of Trotter Error
- Solutions of the Two Dimensional Hubbard Model: Benchmarks and Results from a Wide Range of Numerical Algorithms
- Solving strongly correlated electron models on a quantum computer
- Towards the solution of the many-electron problem in real materials: equation of state of the hydrogen chain with state-of-the-art many-body methods
- Hardware-efficient variational quantum algorithms for time evolution
- Quantum principal component analysis only achieves an exponential speedup because of its state preparation assumptions
- Quantum-inspired algorithms in practice
- Quantum localization bounds Trotter errors in digital quantum simulation
- A Compact Fermion to Qubit Mapping
- Complex Langevin and other approaches to the sign problem in quantum many-body physics
- Hamiltonian Simulation Algorithms for Near-Term Quantum Hardware
- Impossibility of Classically Simulating One-Clean-Qubit Computation
- On applications of quantum computing to plasma simulations
- Quantum Discord and Quantum Computing - An Appraisal
- Quantum algorithms for classical lattice models
- On the Quantum Computational Complexity of the Ising Spin Glass Partition Function and of Knot Invariants
- Computing partition functions in the one clean qubit model
- Optimal Trotterization in universal quantum simulators under faulty control
- A quantum algorithm for additive approximation of Ising partition functions
- Determining QMC simulability with geometric phases
- Novel Trotter formulas for digital quantum simulation