Testing symmetry on quantum computers

Abstract

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.

v3: 51 pages, 41 figures, 31 tables, final version accepted for publication in Quantum Journal

References in corpus (28)

• Variational Quantum Algorithms
• Noisy intermediate-scale quantum (NISQ) algorithms
• Reference frames, superselection rules, and quantum information
• Coding Theorem and Strong Converse for Quantum Channels
• The resource theory of quantum reference frames: manipulations and monotones
• A complete family of separability criteria
• Training variational quantum algorithms is NP-hard
• Evenly distributed unitaries: on the structure of unitary designs
• Is Entanglement Monogamous?
• One-and-a-half quantum de Finetti theorems
• Detecting multipartite entanglement
• Optimizing quantum process tomography with unitary 2-designs
• Unitary designs and codes
• Principles of Quantum Communication Theory: A Modern Approach
• Computable and operationally meaningful multipartite entanglement measures
• The controlled SWAP test for determining quantum entanglement
• Remarks on the classical capacity of quantum channel
• Quantum Proofs
• Realization schemes for quantum instruments in finite dimensions
• Extendibility limits the performance of quantum processors
• Estimating distinguishability measures on quantum computers
• A quasipolynomial-time algorithm for the quantum separability problem
• Quantum Mixed State Compiling
• Quantum-machine-learning channel discrimination
• Variational Quantum Algorithms for Trace Distance and Fidelity Estimation
• Quantum Algorithms for Testing Hamiltonian Symmetry
• A hierarchy of efficient bounds on quantum capacities exploiting symmetry
• Cycle Index Polynomials and Generalized Quantum Separability Tests

Cited by in corpus (11)

• Logarithmic-Depth Quantum Circuits for Hamming Weight Projections
• Schrödinger as a Quantum Programmer: Estimating Entanglement via Steering
• Efficient quantum algorithms for testing symmetries of open quantum systems
• Learning Equivariant Maps with Variational Quantum Circuits
• Unification of Finite Symmetries in Simulation of Many-body Systems on Quantum Computers
• Quantum Computational Complexity and Symmetry
• Introduction to Quantum Error Correction with Stabilizer Codes
• Learning quantum symmetries with interactive quantum-classical variational algorithms
• Dubious Identities: A Visit to the Borwein Zoo
• The abelian state hidden subgroup problem: Learning stabilizer groups and beyond
• A fixed-point algorithm for matrix projections with applications in quantum information