Image de couverture de livre

A 0.8395-approximation algorithm for the EPR problem

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Apte, Anuj, Lee, Eunou, Marwaha, Kunal, Parekh, Ojas, Sinjorgo, Lennart, Sud, James
Format:	Preprint
Publié:	2025
Sujets:	Quantum Physics Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Conjectured Bounds for 2-Local Hamiltonians via Token Graphs
par: Apte, Anuj, et autres
Publié: (2025)

Improved Algorithms for Quantum MaxCut via Partially Entangled Matchings
par: Apte, Anuj, et autres
Publié: (2025)

No Quantum Advantage in Decoded Quantum Interferometry for MaxCut
par: Parekh, Ojas
Publié: (2025)

An Optimal Product-State Approximation for 2-Local Quantum Hamiltonians with Positive Terms
par: Parekh, Ojas, et autres
Publié: (2022)

Improved approximation algorithms for the EPR Hamiltonian
par: Ju, Nathan, et autres
Publié: (2025)

How to Design a Quantum Streaming Algorithm Without Knowing Anything About Quantum Computing
par: Kallaugher, John, et autres
Publié: (2024)

A quantum algorithm for solving 0-1 Knapsack problems
par: Wilkening, Sören, et autres
Publié: (2023)

An improved Quantum Max Cut approximation via matching
par: Lee, Eunou, et autres
Publié: (2024)

Lower bounds on the number of rounds of the quantum approximate optimization algorithm required for guaranteed approximation ratios
par: Benchasattabuse, Naphan, et autres
Publié: (2023)

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

A complexity phase transition at the EPR Hamiltonian
par: Marwaha, Kunal, et autres
Publié: (2026)

Revisiting Majumdar-Ghosh spin chain model and Max-cut problem using variational quantum algorithms
par: Britant, et autres
Publié: (2024)

Enumeration algorithms for combinatorial problems using Ising machines: When should we stop exploring energy landscapes?
par: Mizuno, Yuta, et autres
Publié: (2024)

Mechanisms for Quantum Advantage in Global Optimization of Nonconvex Functions
par: Herman, Dylan, et autres
Publié: (2025)

Randomized and quantum approximate matrix multiplication
par: Apers, Simon, et autres
Publié: (2025)

Tight Lieb-Robinson Bound for approximation ratio in Quantum Annealing
par: Braida, Arthur, et autres
Publié: (2023)

An Exact Algorithm for the Unanimous Vote Problem
par: Keles, Feyza Duman, et autres
Publié: (2025)

The state hidden subgroup problem and an efficient algorithm for locating unentanglement
par: Bouland, Adam, et autres
Publié: (2024)

Fast algorithms for classical specifications of stabiliser states and Clifford gates
par: de Silva, Nadish, et autres
Publié: (2023)

A simple analysis of a quantum-inspired algorithm for solving low-rank linear systems
par: Chen, Tyler, et autres
Publié: (2025)

Quantum algorithms and lower bounds for eccentricity, radius, and diameter in undirected graphs
par: Wesołowski, Adam, et autres
Publié: (2025)

An algebraic interpretation of Pauli flow, leading to faster flow-finding algorithms
par: Mitosek, Piotr, et autres
Publié: (2024)

Randomized adiabatic quantum linear solver algorithm with optimal complexity scaling and detailed running costs
par: Jennings, David, et autres
Publié: (2023)

No quantum advantage implies improved bounds and classical algorithms for the binary paint shop problem
par: Goh, Mark, et autres
Publié: (2026)

A sublinear query quantum algorithm for s-t minimum cut on dense simple graphs
par: Apers, Simon, et autres
Publié: (2021)

Quantum speedups in solving near-symmetric optimization problems by low-depth QAOA
par: Montanaro, Ashley, et autres
Publié: (2024)

Optimal learning of quantum channels in diamond distance
par: Mele, Antonio Anna, et autres
Publié: (2025)

Improved quantum algorithms for linear and nonlinear differential equations
par: Krovi, Hari
Publié: (2022)

A $(2+\varepsilon)$-approximation algorithm for the general scheduling problem in quasipolynomial time
par: Armbruster, Alexander, et autres
Publié: (2025)

Heisenberg-limited Hamiltonian learning without short-time control
par: Shin, Myeongjin, et autres
Publié: (2026)

A Feasibility-Preserved Quantum Approximate Solver for the Capacitated Vehicle Routing Problem
par: Xie, Ningyi, et autres
Publié: (2023)

A quantum central path algorithm for linear optimization
par: Augustino, Brandon, et autres
Publié: (2023)

On the quantum time complexity of divide and conquer
par: Allcock, Jonathan, et autres
Publié: (2023)

Clifford testing: algorithms and lower bounds
par: Hinsche, Marcel, et autres
Publié: (2025)

Fast quantum algorithm for differential equations
par: Bagherimehrab, Mohsen, et autres
Publié: (2023)

A quantum neural network framework for scalable quantum circuit approximation of unitary matrices
par: Sarkar, Rohit Sarma, et autres
Publié: (2024)

High-level quantum algorithm programming using Silq
par: Bezganovic, Viktorija, et autres
Publié: (2024)

Improved algorithms for learning quantum Hamiltonians, via flat polynomials
par: Narayanan, Shyam
Publié: (2024)

Analyzing and improving a classical Betti number estimation algorithm
par: Sorci, Julien
Publié: (2025)

Quantum algorithms for general nonlinear dynamics based on the Carleman embedding
par: Jennings, David, et autres
Publié: (2025)