Cover Image

Improved approximation algorithms for the EPR Hamiltonian

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Ju, Nathan, Nagda, Ansh
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

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

On approximability of the Permanent of PSD matrices
by: Ebrahimnejad, Farzam, et al.
Published: (2024)

Lower bounds on the number of rounds of the quantum approximate optimization algorithm required for guaranteed approximation ratios
by: Benchasattabuse, Naphan, et al.
Published: (2023)

On optimal distinguishers for Planted Clique
by: Nagda, Ansh, et al.
Published: (2025)

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

Quantum algorithm for approximating the expected value of a random-exist quantified oracle
by: Rotello, Caleb
Published: (2024)

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

Improved quantum algorithms for linear and nonlinear differential equations
by: Krovi, Hari
Published: (2022)

Randomized and quantum approximate matrix multiplication
by: Apers, Simon, et al.
Published: (2025)

Nearly optimal algorithms to learn sparse quantum Hamiltonians in physically motivated distances
by: Abbas, Amira, 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)

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

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

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

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

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

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

A quantum algorithm for solving 0-1 Knapsack problems
by: Wilkening, Sören, et al.
Published: (2023)

Fast algorithms for classical specifications of stabiliser states and Clifford gates
by: de Silva, Nadish, et al.
Published: (2023)

Fast quantum algorithm for differential equations
by: Bagherimehrab, Mohsen, et al.
Published: (2023)

Quantum algorithms and lower bounds for eccentricity, radius, and diameter in undirected graphs
by: Wesołowski, Adam, et al.
Published: (2025)

An algebraic interpretation of Pauli flow, leading to faster flow-finding algorithms
by: Mitosek, Piotr, et al.
Published: (2024)

A simple analysis of a quantum-inspired algorithm for solving low-rank linear systems
by: Chen, Tyler, et al.
Published: (2025)

Randomized adiabatic quantum linear solver algorithm with optimal complexity scaling and detailed running costs
by: Jennings, David, et al.
Published: (2023)

Revisiting Majumdar-Ghosh spin chain model and Max-cut problem using variational quantum algorithms
by: Britant, et al.
Published: (2024)

Enumeration algorithms for combinatorial problems using Ising machines: When should we stop exploring energy landscapes?
by: Mizuno, Yuta, et al.
Published: (2024)

Improved Quantum Query Complexity on Easier Inputs
by: Anderson, Noel T., et al.
Published: (2023)

An Improved Classical Singular Value Transformation for Quantum Machine Learning
by: Bakshi, Ainesh, et al.
Published: (2023)

Smarter k-Partitioning of ZX-Diagrams for Improved Quantum Circuit Simulation
by: Sutcliffe, Matthew
Published: (2024)

Improved Dual Attack and Trapdoor Sampling via Quantum Rejection Sampling
by: Ling, Cong, et al.
Published: (2026)

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

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)

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

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

Structure learning of Hamiltonians from real-time evolution
by: Bakshi, Ainesh, et al.
Published: (2024)

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