Quantum Algorithms for Testing Hamiltonian Symmetry.

Phys Rev Lett

Hearne Institute for Theoretical Physics, Department of Physics and Astronomy, and Center for Computation and Technology, Louisiana State University, Baton Rouge, Louisiana 70803, USA.

Published: October 2022

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.

Download full-text PDF

Source
http://dx.doi.org/10.1103/PhysRevLett.129.160503DOI Listing

Publication Analysis

Top Keywords

quantum algorithms
8
testing hamiltonian
8
hamiltonian symmetry
8
correspond directly
8
quantum
5
algorithms testing
4
hamiltonian
4
symmetry symmetries
4
symmetries hamiltonian
4
hamiltonian play
4

Similar Publications

We introduce a novel technique for enhancing the robustness of light-pulse atom interferometers against the pulse infidelities that typically limit their sensitivities. The technique uses quantum optimal control to favorably harness the multipath interference of the stray trajectories produced by imperfect atom-optics operations. We apply this method to a resonant atom interferometer and achieve thousandfold phase amplification, representing a 50-fold improvement over the performance observed without optimized control.

View Article and Find Full Text PDF

Quantum error correction is believed to be essential for scalable quantum computation, but its implementation is challenging due to its considerable space-time overhead. Motivated by recent experiments demonstrating efficient manipulation of logical qubits using transversal gates [Bluvstein et al., Nature (London) 626, 58 (2024)NATUAS0028-083610.

View Article and Find Full Text PDF

kMetaShot: a fast and reliable taxonomy classifier for metagenome-assembled genomes.

Brief Bioinform

November 2024

Department of Biosciences, Biotechnology and Environment, University of Bari Aldo Moro, Via E. Orabona 4, 70126, Bari, Italy.

The advent of high-throughput sequencing (HTS) technologies unlocked the complexity of the microbial world through the development of metagenomics, which now provides an unprecedented and comprehensive overview of its taxonomic and functional contribution in a huge variety of macro- and micro-ecosystems. In particular, shotgun metagenomics allows the reconstruction of microbial genomes, through the assembly of reads into MAGs (metagenome-assembled genomes). In fact, MAGs represent an information-rich proxy for inferring the taxonomic composition and the functional contribution of microbiomes, even if the relevant analytical approaches are not trivial and still improvable.

View Article and Find Full Text PDF

Image filtering involves the application of window operations that perform valuable functions, such as noise removal, image enhancement, high dynamic range (HDR) compression, and so on. Guided image filtering is a new type of explicit image filter with multiple advantages. It can effectively remove noise while preserving edge details, and can be used in a variety of scenarios.

View Article and Find Full Text PDF

Pathogenic bacteria are the source of many serious health problems, such as foodborne diseases and hospital infections. Timely and accurate detection of these pathogens is of vital significance for disease prevention, control of epidemic spread, and protection of public health security. Rapid identification of pathogenic bacteria has become a research focus in recent years.

View Article and Find Full Text PDF

Want AI Summaries of new PubMed Abstracts delivered to your In-box?

Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!