!
You're viewing papers too quickly. Please wait a moment.<br>This helps keep the archive available for everyone.
Quick Navigation
Topics
Trapped Ion Quantum Computing
Efficient quantum algorithms for testing symmetries of open quantum systems
arXiv
Authors: Rahul Bandyopadhyay, Alex H. Rubin, Marina Radulaski, Mark M. Wilde
Year
2023
Paper ID
55147
Status
Preprint
Abstract Read
~2 min
Abstract Words
164
Citations
N/A
Abstract
Symmetry is an important and unifying notion in many areas of physics. In quantum mechanics, it is possible to eliminate degrees of freedom from a system by leveraging symmetry to identify the possible physical transitions. This allows us to simplify calculations and characterize potentially complicated dynamics of the system with relative ease. Previous works have focused on devising quantum algorithms to ascertain symmetries by means of fidelity-based symmetry measures. In our present work, we develop alternative symmetry testing quantum algorithms that are efficiently implementable on quantum computers. Our approach estimates asymmetry measures based on the Hilbert--Schmidt distance, which is significantly easier, in a computational sense, than using fidelity as a metric. The method is derived to measure symmetries of states, channels, Lindbladians, and measurements. We apply this method to a number of scenarios involving open quantum systems, including the amplitude damping channel and a spin chain, and we test for symmetries within and outside the finite symmetry group of the Hamiltonian and Lindblad operators.
Why This Paper Matters
- This paper contributes to the Trapped-Ion Quantum Computing research area in the Quantum Articles archive.
- It adds a 2023 reference point for readers tracking recent quantum research.
- Symmetry is an important and unifying notion in many areas of physics.
Paper Tools
Become a member to use research tools
Sign in to open papers, visit source links, share, cite, compare, copy DOI links, request category corrections, and build your reading list.
Show Paper arXiv Publisher Share
Cite This Paper
Copy URL
Compare
Copy DOI Add to Reading List
Category Correction Request
Category Correction Request
Help us improve classification quality by proposing a better category. Every request is reviewed by an admin.
Sign in to submit a category correction request for this paper.
Log In to SubmitReferences & Citation Signals
Community Reactions
Quick sentiment from readers on this paper.
Score:
0
Likes: 0
Dislikes: 0
Sign in to react to this paper.
Discussion & Reviews (Moderated)
Average Rating: 0.0 / 5 (0 ratings)
No written reviews yet.