Quantum Algorithms for Testing Hamiltonian Symmetry
read the original abstract
Symmetries in a Hamiltonian play an important role in quantum physics because they correspond directly with conserved quantities of the related system. In this paper, we propose quantum algorithms capable of testing whether a Hamiltonian exhibits symmetry with respect to a group. We demonstrate that familiar expressions of Hamiltonian symmetry in quantum mechanics correspond directly with the acceptance probabilities of our algorithms. We execute one of our symmetry-testing algorithms on existing quantum computers for simple examples of both symmetric and asymmetric cases.
This paper has not been read by Pith yet.
Forward citations
Cited by 1 Pith paper
-
Blind Symmetry Matching in Quantum States with Application to Shot-Count Reduction
A framework for blind discovery of finite-group symmetries in quantum states via scoring of candidate groups, with unbiased selection proven and a circuit that tests both weak commutation and strong charge-sector conf...
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.