Conjectured Bounds for 2-Local Hamiltonians via Token Graphs
Fuente:
arXiv
Guardado en:
| Autores principales: | Apte, Anuj, Parekh, Ojas, Sud, James |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
A 0.8395-approximation algorithm for the EPR problem
por: Apte, Anuj, et al.
Publicado: (2025)
por: Apte, Anuj, et al.
Publicado: (2025)
An Optimal Product-State Approximation for 2-Local Quantum Hamiltonians with Positive Terms
por: Parekh, Ojas, et al.
Publicado: (2022)
por: Parekh, Ojas, et al.
Publicado: (2022)
No Quantum Advantage in Decoded Quantum Interferometry for MaxCut
por: Parekh, Ojas
Publicado: (2025)
por: Parekh, Ojas
Publicado: (2025)
How to Design a Quantum Streaming Algorithm Without Knowing Anything About Quantum Computing
por: Kallaugher, John, et al.
Publicado: (2024)
por: Kallaugher, John, et al.
Publicado: (2024)
Efficient Identification of Permutation Symmetries in Many-Body Hamiltonians via Graph Theory
por: Shah, Saumya, et al.
Publicado: (2025)
por: Shah, Saumya, et al.
Publicado: (2025)
Hamiltonian Locality Testing via Trotterized Postselection
por: Kallaugher, John, et al.
Publicado: (2025)
por: Kallaugher, John, et al.
Publicado: (2025)
Many Hamiltonians Are Sparsifiable
por: Basu, Arpon, et al.
Publicado: (2026)
por: Basu, Arpon, et al.
Publicado: (2026)
Mechanisms for Quantum Advantage in Global Optimization of Nonconvex Functions
por: Herman, Dylan, et al.
Publicado: (2025)
por: Herman, Dylan, et al.
Publicado: (2025)
Improved approximation algorithms for the EPR Hamiltonian
por: Ju, Nathan, et al.
Publicado: (2025)
por: Ju, Nathan, et al.
Publicado: (2025)
Time-Dependent Hamiltonian Simulation in the Low-Energy Subspace
por: Zhou, Shuo, et al.
Publicado: (2026)
por: Zhou, Shuo, et al.
Publicado: (2026)
An Entropy-Governed Speedup for Quantum Algorithms on Local Hamiltonians
por: Mataraarachchi, Ranitha, et al.
Publicado: (2026)
por: Mataraarachchi, Ranitha, et al.
Publicado: (2026)
A convergent hierarchy of spectral gap certificates for qubit Hamiltonians
por: Rao, Sujit
Publicado: (2025)
por: Rao, Sujit
Publicado: (2025)
Heisenberg-limited Hamiltonian learning without short-time control
por: Shin, Myeongjin, et al.
Publicado: (2026)
por: Shin, Myeongjin, et al.
Publicado: (2026)
Sharp Bounds on the Eigenvalues of Kikuchi Graphs and Applications to Quantum Max Cut
por: Bakshi, Ainesh, et al.
Publicado: (2026)
por: Bakshi, Ainesh, et al.
Publicado: (2026)
Improved Algorithms for Quantum MaxCut via Partially Entangled Matchings
por: Apte, Anuj, et al.
Publicado: (2025)
por: Apte, Anuj, et al.
Publicado: (2025)
Lindbladian Simulation with Commutator Bounds
por: Wang, Xinzhao, et al.
Publicado: (2026)
por: Wang, Xinzhao, et al.
Publicado: (2026)
Locality Bounds for Sampling Hamming Slices
por: Kane, Daniel M., et al.
Publicado: (2024)
por: Kane, Daniel M., et al.
Publicado: (2024)
Classical Algorithms for Constant Approximation of the Ground State Energy of Local Hamiltonians
por: Gall, François Le
Publicado: (2024)
por: Gall, François Le
Publicado: (2024)
Simulating quantum collision models with Hamiltonian simulations using early fault-tolerant quantum computers
por: Garg, Kushagra, et al.
Publicado: (2025)
por: Garg, Kushagra, et al.
Publicado: (2025)
Scalable Experimental Bounds for Entangled Quantum State Fidelities
por: Aktar, Shamminuj, et al.
Publicado: (2022)
por: Aktar, Shamminuj, et al.
Publicado: (2022)
Tight Lieb-Robinson Bound for approximation ratio in Quantum Annealing
por: Braida, Arthur, et al.
Publicado: (2023)
por: Braida, Arthur, et al.
Publicado: (2023)
Quantum Property Testing for Bounded-Degree Directed Graphs
por: Peng, Pan, et al.
Publicado: (2026)
por: Peng, Pan, et al.
Publicado: (2026)
Certified Lower Bounds and Efficient Estimation of Minimum Accuracy in Quantum Kernel Methods
por: Gonçalves, Demerson N., et al.
Publicado: (2025)
por: Gonçalves, Demerson N., et al.
Publicado: (2025)
Learning $k$-body Hamiltonians via compressed sensing
por: Ma, Muzhou, et al.
Publicado: (2024)
por: Ma, Muzhou, et al.
Publicado: (2024)
Complexity of Digital Quantum Simulation in the Low-Energy Subspace: Applications and a Lower Bound
por: Gong, Weiyuan, et al.
Publicado: (2023)
por: Gong, Weiyuan, et al.
Publicado: (2023)
Improved algorithms for learning quantum Hamiltonians, via flat polynomials
por: Narayanan, Shyam
Publicado: (2024)
por: Narayanan, Shyam
Publicado: (2024)
Quantum Graph-State Synthesis with SAT
por: Brand, Sebastiaan, et al.
Publicado: (2023)
por: Brand, Sebastiaan, et al.
Publicado: (2023)
3-Local Hamiltonian Problem and Constant Relative Error Quantum Partition Function Approximation: $O(2^{\frac{n}{2}})$ Algorithm Is Nearly Optimal under QSETH
por: Chia, Nai-Hui, et al.
Publicado: (2025)
por: Chia, Nai-Hui, et al.
Publicado: (2025)
Parameterized Quantum Query Algorithms for Graph Problems
por: Terao, Tatsuya, et al.
Publicado: (2024)
por: Terao, Tatsuya, et al.
Publicado: (2024)
Exponential Quantum Advantage for Pathfinding in Regular Sunflower Graphs
por: Li, Jianqiang, et al.
Publicado: (2024)
por: Li, Jianqiang, et al.
Publicado: (2024)
Mixing time of quantum Gibbs sampling for random sparse Hamiltonians
por: Ramkumar, Akshar, et al.
Publicado: (2024)
por: Ramkumar, Akshar, et al.
Publicado: (2024)
Advancing Quantum State Preparation Using Decision Diagram with Local Invertible Maps
por: Hong, Xin, et al.
Publicado: (2025)
por: Hong, Xin, et al.
Publicado: (2025)
Quantum Circuit for Quantum Fourier Transform for Arbitrary Qubit Connectivity Graphs
por: Khadiev, Kamil, et al.
Publicado: (2025)
por: Khadiev, Kamil, et al.
Publicado: (2025)
Deterministic Search on Complete Bipartite Graphs by Continuous Time Quantum Walk
por: Lin, Honghong, et al.
Publicado: (2024)
por: Lin, Honghong, et al.
Publicado: (2024)
Efficient Classical Sampling from Gaussian Boson Sampling Distributions on Unweighted Graphs
por: Zhang, Yexin, et al.
Publicado: (2025)
por: Zhang, Yexin, et al.
Publicado: (2025)
Circuits of Quantum Hashing and Quantum Fourier Transform for a Cactus as a Qubit Connectivity Graph
por: Khadiev, Kamil, et al.
Publicado: (2026)
por: Khadiev, Kamil, et al.
Publicado: (2026)
Certifying and learning quantum Ising Hamiltonians
por: Bluhm, Andreas, et al.
Publicado: (2025)
por: Bluhm, Andreas, et al.
Publicado: (2025)
Certifying and learning local quantum Hamiltonians
por: Bluhm, Andreas, et al.
Publicado: (2026)
por: Bluhm, Andreas, et al.
Publicado: (2026)
Testing and learning structured quantum Hamiltonians
por: Arunachalam, Srinivasan, et al.
Publicado: (2024)
por: Arunachalam, Srinivasan, et al.
Publicado: (2024)
Dequantization Barriers for Guided Stoquastic Hamiltonians
por: Hamoudi, Yassine, et al.
Publicado: (2026)
por: Hamoudi, Yassine, et al.
Publicado: (2026)
Ejemplares similares
-
A 0.8395-approximation algorithm for the EPR problem
por: Apte, Anuj, et al.
Publicado: (2025) -
An Optimal Product-State Approximation for 2-Local Quantum Hamiltonians with Positive Terms
por: Parekh, Ojas, et al.
Publicado: (2022) -
No Quantum Advantage in Decoded Quantum Interferometry for MaxCut
por: Parekh, Ojas
Publicado: (2025) -
How to Design a Quantum Streaming Algorithm Without Knowing Anything About Quantum Computing
por: Kallaugher, John, et al.
Publicado: (2024) -
Efficient Identification of Permutation Symmetries in Many-Body Hamiltonians via Graph Theory
por: Shah, Saumya, et al.
Publicado: (2025)