Symmetry is a unifying concept in physics. In quantum information and beyond, it is known that quantum states possessing symmetry are not useful for certain information-processing tasks. For example, states that commute with a Hamiltonian realizing a time evolution are not useful for timekeeping during that evolution, and bipartite states that are highly extendible are not strongly entangled and thus not useful for basic tasks like teleportation. Motivated by this perspective, this paper details several quantum algorithms that test the symmetry of quantum states and channels. For the case of testing Bose symmetry of a state, we show that 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, thus giving a firm operational meaning to these latter resource quantifiers. Special cases of the algorithms test for incoherence or separability of quantum states. We evaluate the performance of these algorithms on choice examples by using the variational approach to quantum algorithms, replacing the quantum prover with a parameterized circuit. We demonstrate this approach for numerous examples using the IBM quantum noiseless and noisy simulators, and we observe that the algorithms perform well in the noiseless case and exhibit noise resilience in the noisy case. We also show that the maximum symmetric fidelities can be calculated by semi-definite programs, which is useful for benchmarking the performance of these algorithms for sufficiently small examples. 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 and thus well motivated from the resource-theoretic perspective.
Symmetry is a unifying concept in physics. In quantum information and beyond, it is known that quantum states possessing symmetry are not useful for certain information-processing tasks. For example, states that commute with a Hamiltonian realizing a time evolution are not useful for timekeeping during that evolution, and bipartite states that are highly extendible are not strongly entangled and thus not useful for basic tasks like teleportation. Motivated by this perspective, this paper details several quantum algorithms that test the symmetry of quantum states and channels. For the case of testing Bose symmetry of a state, we show that 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, thus giving a firm operational meaning to these latter resource quantifiers. Special cases of the algorithms test for incoherence or separability of quantum states. We evaluate the performance of these algorithms on choice examples by using the variational approach to quantum algorithms, replacing the quantum prover with a parameterized circuit. We demonstrate this approach for numerous examples using the IBM quantum noiseless and noisy simulators, and we observe that the algorithms perform well in the noiseless case and exhibit noise resilience in the noisy case. We also show that the maximum symmetric fidelities can be calculated by semi-definite programs, which is useful for benchmarking the performance of these algorithms for sufficiently small examples. 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 and thus well motivated from the resource-theoretic perspective.
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.
In quantum computing, knowing the symmetries a given system or state obeys or disobeys is often useful. For example, Hamiltonian symmetries may limit allowed state transitions or simplify learning parameters in machine learning applications, and certain asymmetric quantum states are known to be resourceful in various applications. Symmetry testing algorithms provide a means to identify and quantify these properties with respect to a representation of a group. In this paper, we present a collection of quantum algorithms that realize projections onto the symmetric subspace, as well as the asymmetric subspace, of quantum systems. We describe how this can be modified to realize an antisymmetric projection as well, and we show how projectors can be combined in a systematic way to effectively measure various projections in a single quantum circuit. Using these constructions, we demonstrate applications such as testing for Werner-state symmetry and estimating Schmidt ranks of bipartite states, supported by experimental data from IBM Quantum systems. This work underscores the pivotal role of symmetry in simplifying quantum calculations and advancing quantum information tasks.
Testing quantum software is challenging because quantum states cannot be directly inspected. Variational quantum algorithms (VQAs) are a particularly important target as they are among the most promising approaches for near-term noisy quantum hardware. Many testing methods rely on classically computed results, which conflicts with the regime where quantum advantage is expected. Although prior studies mitigate this oracle problem, the core difficulty remains that existing approaches do not verify whether the execution deviates from the intended problem or whether the obtained solution is physically plausible. We propose a symmetry-oriented testing framework for VQAs that addresses this gap by using operators commuting with the target Hamiltonian as test specifications. The framework provides two complementary diagnostics: a commutator-based health check that monitors whether each execution step during optimization remains consistent with the symmetry of the target Hamiltonian, and a variance-based acceptance check that assesses the converged solution by examining whether the state is an eigenstate of the symmetry operators. Both diagnostics derive from the problem structure and do not require the exact solution. We evaluate the framework on representative user- and system-side faults, across multiple target systems, and under injected noise. Results show that the two diagnostics detect faulty behavior, provide informative signals of solution quality, and remain useful under noisy execution.
Symmetries in a Hamiltonian play an important role in quantum physics because they correspond directly with conserved quantities of the related system. In this Letter, 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.
Testing the symmetries of quantum states and channels provides a way to assess their usefulness for different physical, computational, and communication tasks. Here, we establish several complexity-theoretic results that classify the difficulty of symmetry-testing problems involving a unitary representation of a group and a state or a channel that is being tested. In particular, we prove that various such symmetry-testing problems are complete for bounded-error quantum polynomial time, quantum Merlin–Arthur (QMA), quantum statistical zero-knowledge, two-message quantum interactive proofs (QIPs), two-message QIPs restricted to entanglement-breaking provers, and QIPs, thus spanning the prominent classes of the QIP hierarchy and forging a nontrivial connection between symmetry and quantum computational complexity. Finally, we prove the inclusion of two Hamiltonian symmetry-testing problems in QMA and quantum Arthur–Merlin, while leaving it as an intriguing open question to determine whether these problems are complete for these classes.
It is impossible to overstate the importance of symmetry in physics and mathematics. Symmetry arguments play a central role in a broad range of problems from simplifying a system of linear equations to a deep role in organizing the fundamental principles of physics. They are used, for instance, in Noether’s theorem to find the consequences of symmetry of a dynamics. For many systems of interest, the dynamics are sufficiently complicated that one cannot hope to characterize their evolution completely, whereas by appealing to the symmetries of the dynamical laws one can easily infer many useful results. \n \nIn part I of this thesis we study the problem of finding the consequences of symmetry of a (possibly open) dynamics from an information-theoretic perspective. The study of this problem naturally leads us to the notion of asymmetry of quantum states. The asymmetry of a state relative to some symmetry group specifies how and to what extent the given symmetry is broken by the state. Characterizing these is found to be surprisingly useful to constrain which final states of the system can be reached from a given initial state. Another motivation for the study of asymmetry comes from the field of quantum metrology and relatedly the field of quantum reference frames. It turns out that the degree of success one can achieve in many metrological tasks depends only on the asymmetry properties of the state used for metrology. We show that some ideas and tools developed in the field of quantum information theory are extremely useful to study the notion of asymmetry of states and therefore to find the consequences of symmetry of an open or closed system dynamics. \n \nIn part II of this thesis we present a novel application of symmetry arguments in the field of quantum estimation theory. We consider a family of multi-copy estimation problems wherein one is given n copies of an unknown quantum state according to some prior distribution and the goal is to estimate certain parameters of the given state. In particular, we are interested to know whether collective measurements are useful and if so to find an upper bound on the amount of entanglement which is required to achieve the optimal estimation. We introduce a new approach to this problem by considering the symmetries of the prior and the symmetries of the parameters to be estimated. We show that based on these symmetries one can find strong constraints on the amount of entanglement required to implement the optimal measurement. In order to infer properties of the optimal estimation procedure from the symmetries of the parameters and the prior we come up with a generalization of Schur-Weyl duality. Just as Schur-Weyl duality has many applications to quantum information theory and quantum algorithms so too does this generalization. In this thesis we explore some of these applications.