Copertina

Conjectured Bounds for 2-Local Hamiltonians via Token Graphs

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Apte, Anuj, Parekh, Ojas, Sud, James
Natura:	Preprint
Pubblicazione:	2025
Soggetti:	Quantum Physics Data Structures and Algorithms
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

A 0.8395-approximation algorithm for the EPR problem
di: Apte, Anuj, et al.
Pubblicazione: (2025)

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

No Quantum Advantage in Decoded Quantum Interferometry for MaxCut
di: Parekh, Ojas
Pubblicazione: (2025)

How to Design a Quantum Streaming Algorithm Without Knowing Anything About Quantum Computing
di: Kallaugher, John, et al.
Pubblicazione: (2024)

Efficient Identification of Permutation Symmetries in Many-Body Hamiltonians via Graph Theory
di: Shah, Saumya, et al.
Pubblicazione: (2025)

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

Many Hamiltonians Are Sparsifiable
di: Basu, Arpon, et al.
Pubblicazione: (2026)

Mechanisms for Quantum Advantage in Global Optimization of Nonconvex Functions
di: Herman, Dylan, et al.
Pubblicazione: (2025)

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

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

An Entropy-Governed Speedup for Quantum Algorithms on Local Hamiltonians
di: Mataraarachchi, Ranitha, et al.
Pubblicazione: (2026)

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

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

Sharp Bounds on the Eigenvalues of Kikuchi Graphs and Applications to Quantum Max Cut
di: Bakshi, Ainesh, et al.
Pubblicazione: (2026)

Lindbladian Simulation with Commutator Bounds
di: Wang, Xinzhao, et al.
Pubblicazione: (2026)

Improved Algorithms for Quantum MaxCut via Partially Entangled Matchings
di: Apte, Anuj, et al.
Pubblicazione: (2025)

Locality Bounds for Sampling Hamming Slices
di: Kane, Daniel M., et al.
Pubblicazione: (2024)

Classical Algorithms for Constant Approximation of the Ground State Energy of Local Hamiltonians
di: Gall, François Le
Pubblicazione: (2024)

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

Scalable Experimental Bounds for Entangled Quantum State Fidelities
di: Aktar, Shamminuj, et al.
Pubblicazione: (2022)

Tight Lieb-Robinson Bound for approximation ratio in Quantum Annealing
di: Braida, Arthur, et al.
Pubblicazione: (2023)

Quantum Property Testing for Bounded-Degree Directed Graphs
di: Peng, Pan, et al.
Pubblicazione: (2026)

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

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

Complexity of Digital Quantum Simulation in the Low-Energy Subspace: Applications and a Lower Bound
di: Gong, Weiyuan, et al.
Pubblicazione: (2023)

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

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

3-Local Hamiltonian Problem and Constant Relative Error Quantum Partition Function Approximation: $O(2^{\frac{n}{2}})$ Algorithm Is Nearly Optimal under QSETH
di: Chia, Nai-Hui, et al.
Pubblicazione: (2025)

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

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

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

Advancing Quantum State Preparation Using Decision Diagram with Local Invertible Maps
di: Hong, Xin, et al.
Pubblicazione: (2025)

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

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

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

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

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

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

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

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