#### Degree

Doctor of Philosophy (PhD)

#### Department

Physics and Astronomy

#### Document Type

Dissertation

#### Abstract

In Chapter 1, we establish the mathematical background used throughout this thesis. We review concepts from group and representation theory. We further establish fundamental concepts from quantum information. This will allow us to then define the different notions of symmetry necessary in the following chapters. In Chapter 2, we investigate Hamiltonian symmetries. We propose quantum algorithms capable of testing whether a Hamiltonian exhibits symmetry with respect to a group. Furthermore, we show that this algorithm is that this algorithm is DQC1-Complete. Finally, we execute one of our symmetry-testing algorithms on existing quantum computers for simple examples. In Chapter 3, we discuss tests of symmetry for quantum states. For the case of testing Bose symmetry of a state, there is a simple and efficient quantum algorithm, while the tests for other kinds of symmetry rely on the aid of a quantum prover. We prove that the acceptance probability of each algorithm is equal to the maximum symmetric fidelity of the state being tested Finally, we establish various generalizations of the resource theory of asymmetry, with the upshot being that the acceptance probabilities of the algorithms are resource monotones. In Chapter 4, we begin by showing that the analytical form of the acceptance probability of such a test is given by the cycle index polynomial of the symmetric group ���� . We derive a family of quantum separability tests, each of which is generated by a finite group; for all such algorithms, we show that the acceptance probability is determined by the cycle index polynomial of the group. Finally, we produce and analyze explicit circuit constructions for these tests, showing that the tests corresponding to the symmetric and cyclic groups can be executed with ��(��2) and ��(�� log(��)) controlled-SWAP gates, respectively, where �� is the number of copies of the state In Chapter 5, we include additional results not previously published; in particular, we give a test for symmetry of a quantum state using density matrix exponentiation, a further result of Hamiltonian symmetry measurements when using Abelian groups, and an alternate Hamiltonian symmetry test construction for a block-encoded Hamiltonian.

#### Date

4-6-2023

#### Recommended Citation

LaBorde, Margarite Lynn, "A Menagerie of Symmetry Testing Quantum Algorithms" (2023). *LSU Doctoral Dissertations*. 6134.

https://repository.lsu.edu/gradschool_dissertations/6134

#### Committee Chair

Wilde, Mark M.

#### DOI

10.31390/gradschool_dissertations.6134