Copertina

A 0.8395-approximation algorithm for the EPR problem

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Apte, Anuj, Lee, Eunou, Marwaha, Kunal, Parekh, Ojas, Sinjorgo, Lennart, 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

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

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

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

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

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

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

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

An improved Quantum Max Cut approximation via matching
di: Lee, Eunou, et al.
Pubblicazione: (2024)

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

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

A complexity phase transition at the EPR Hamiltonian
di: Marwaha, Kunal, et al.
Pubblicazione: (2026)

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

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

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

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

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

An Exact Algorithm for the Unanimous Vote Problem
di: Keles, Feyza Duman, et al.
Pubblicazione: (2025)

The state hidden subgroup problem and an efficient algorithm for locating unentanglement
di: Bouland, Adam, et al.
Pubblicazione: (2024)

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

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

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

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

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

No quantum advantage implies improved bounds and classical algorithms for the binary paint shop problem
di: Goh, Mark, et al.
Pubblicazione: (2026)

A sublinear query quantum algorithm for s-t minimum cut on dense simple graphs
di: Apers, Simon, et al.
Pubblicazione: (2021)

Quantum speedups in solving near-symmetric optimization problems by low-depth QAOA
di: Montanaro, Ashley, et al.
Pubblicazione: (2024)

Optimal learning of quantum channels in diamond distance
di: Mele, Antonio Anna, et al.
Pubblicazione: (2025)

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

A $(2+\varepsilon)$-approximation algorithm for the general scheduling problem in quasipolynomial time
di: Armbruster, Alexander, et al.
Pubblicazione: (2025)

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

A Feasibility-Preserved Quantum Approximate Solver for the Capacitated Vehicle Routing Problem
di: Xie, Ningyi, et al.
Pubblicazione: (2023)

A quantum central path algorithm for linear optimization
di: Augustino, Brandon, et al.
Pubblicazione: (2023)

On the quantum time complexity of divide and conquer
di: Allcock, Jonathan, et al.
Pubblicazione: (2023)

Clifford testing: algorithms and lower bounds
di: Hinsche, Marcel, et al.
Pubblicazione: (2025)

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

A quantum neural network framework for scalable quantum circuit approximation of unitary matrices
di: Sarkar, Rohit Sarma, et al.
Pubblicazione: (2024)

High-level quantum algorithm programming using Silq
di: Bezganovic, Viktorija, et al.
Pubblicazione: (2024)

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

Analyzing and improving a classical Betti number estimation algorithm
di: Sorci, Julien
Pubblicazione: (2025)

Quantum algorithms for general nonlinear dynamics based on the Carleman embedding
di: Jennings, David, et al.
Pubblicazione: (2025)