Cover Image

Efficient Identification of Permutation Symmetries in Many-Body Hamiltonians via Graph Theory

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Shah, Saumya, Rebentrost, Patrick
Format:	Preprint
Published:	2025
Subjects:	Quantum Physics Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Low depth amplitude estimation without really trying
by: Vu, Dinh-Long, et al.
Published: (2024)

Many Hamiltonians Are Sparsifiable
by: Basu, Arpon, et al.
Published: (2026)

Conjectured Bounds for 2-Local Hamiltonians via Token Graphs
by: Apte, Anuj, et al.
Published: (2025)

Block Permutation Routing on Ramanujan Hypergraphs for Fault-Tolerant Quantum Computing
by: Courtney, Joshua M.
Published: (2026)

Block Encoding of Sparse Matrices via Coherent Permutation
by: Setty, Abhishek
Published: (2025)

Improved approximation algorithms for the EPR Hamiltonian
by: Ju, Nathan, et al.
Published: (2025)

Time-Dependent Hamiltonian Simulation in the Low-Energy Subspace
by: Zhou, Shuo, et al.
Published: (2026)

A convergent hierarchy of spectral gap certificates for qubit Hamiltonians
by: Rao, Sujit
Published: (2025)

Heisenberg-limited Hamiltonian learning without short-time control
by: Shin, Myeongjin, et al.
Published: (2026)

Efficient Classical Sampling from Gaussian Boson Sampling Distributions on Unweighted Graphs
by: Zhang, Yexin, et al.
Published: (2025)

Quantum (Inspired) $D^2$-sampling with Applications
by: Shah, Poojan, et al.
Published: (2024)

An Optimal Product-State Approximation for 2-Local Quantum Hamiltonians with Positive Terms
by: Parekh, Ojas, et al.
Published: (2022)

Permutation Routing on Ramanujan Hypergraphs with Applications to Neutral Atom Quantum Architectures
by: Courtney, Joshua M.
Published: (2026)

Simulating quantum collision models with Hamiltonian simulations using early fault-tolerant quantum computers
by: Garg, Kushagra, et al.
Published: (2025)

Efficient Approximation of Quantum Channel Fidelity Exploiting Symmetry
by: Chee, Yeow Meng, et al.
Published: (2023)

Efficient Learning of Structured Quantum Circuits via Pauli Dimensionality and Sparsity
by: Grewal, Sabee, et al.
Published: (2025)

Hamiltonian Locality Testing via Trotterized Postselection
by: Kallaugher, John, et al.
Published: (2025)

Learning $k$-body Hamiltonians via compressed sensing
by: Ma, Muzhou, et al.
Published: (2024)

Improved algorithms for learning quantum Hamiltonians, via flat polynomials
by: Narayanan, Shyam
Published: (2024)

Efficient Unitary T-designs from Random Sums
by: Chen, Chi-Fang, et al.
Published: (2024)

Quantum Graph-State Synthesis with SAT
by: Brand, Sebastiaan, et al.
Published: (2023)

Parameterized Quantum Query Algorithms for Graph Problems
by: Terao, Tatsuya, et al.
Published: (2024)

Exponential Quantum Advantage for Pathfinding in Regular Sunflower Graphs
by: Li, Jianqiang, et al.
Published: (2024)

Mixing time of quantum Gibbs sampling for random sparse Hamiltonians
by: Ramkumar, Akshar, et al.
Published: (2024)

Variational Quantum Algorithms for Semidefinite Programming
by: Patel, Dhrumil, et al.
Published: (2021)

Quantum Circuit for Quantum Fourier Transform for Arbitrary Qubit Connectivity Graphs
by: Khadiev, Kamil, et al.
Published: (2025)

Deterministic Search on Complete Bipartite Graphs by Continuous Time Quantum Walk
by: Lin, Honghong, et al.
Published: (2024)

Qubit-Efficient Randomized Quantum Algorithms for Linear Algebra
by: Wang, Samson, et al.
Published: (2023)

Ancilla-Efficient QSAMPLE Preparation for Reversible Markov Chains
by: Zhao, Nicholas
Published: (2026)

Sample-Efficient Estimation of Nonlinear Quantum State Functions
by: Yao, Hongshun, et al.
Published: (2024)

Space-Efficient Quantum Error Reduction without log Factors
by: Belovs, Aleksandrs, et al.
Published: (2025)

Circuits of Quantum Hashing and Quantum Fourier Transform for a Cactus as a Qubit Connectivity Graph
by: Khadiev, Kamil, et al.
Published: (2026)

Certifying and learning quantum Ising Hamiltonians
by: Bluhm, Andreas, et al.
Published: (2025)

Certifying and learning local quantum Hamiltonians
by: Bluhm, Andreas, et al.
Published: (2026)

Testing and learning structured quantum Hamiltonians
by: Arunachalam, Srinivasan, et al.
Published: (2024)

Dequantization Barriers for Guided Stoquastic Hamiltonians
by: Hamoudi, Yassine, et al.
Published: (2026)

Certified Lower Bounds and Efficient Estimation of Minimum Accuracy in Quantum Kernel Methods
by: Gonçalves, Demerson N., et al.
Published: (2025)

Accuracy and resource advantages of quantum eigenvalue estimation with non-Hermitian transcorrelated electronic Hamiltonians
by: Uvarov, Alexey, et al.
Published: (2025)

Prefix Sums via Kronecker Products
by: Sobczyk, Aleksandros, et al.
Published: (2025)

Quantum Metropolis Sampling via Weak Measurement
by: Jiang, Jiaqing, et al.
Published: (2024)