Imagen de Portada

Second order cone relaxations for quantum Max Cut

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Huber, Felix, Thompson, Kevin, Parekh, Ojas, Gharibian, Sevag
Formato:	Preprint
Publicado:	2024
Materias:	Quantum Physics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

No Quantum Advantage in Decoded Quantum Interferometry for MaxCut
por: Parekh, Ojas
Publicado: (2025)

The 7 faces of quantum NP
por: Gharibian, Sevag
Publicado: (2023)

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

An SU(2)-symmetric Semidefinite Programming Hierarchy for Quantum Max Cut
por: Takahashi, Jun, et al.
Publicado: (2023)

Constrained local Hamiltonians: quantum generalizations of Vertex Cover
por: Parekh, Ojas, et al.
Publicado: (2024)

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

BQP, meet NP: Search-to-decision reductions and approximate counting
por: Gharibian, Sevag, et al.
Publicado: (2024)

Hardness of approximation for ground state problems
por: Gharibian, Sevag, et al.
Publicado: (2024)

On the complexity of estimating ground state entanglement and free energy
por: Gharibian, Sevag, et al.
Publicado: (2025)

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

An unholy trinity: TFNP, polynomial systems, and the quantum satisfiability problem
por: Aldi, Marco, et al.
Publicado: (2024)

Dequantizing the Quantum Singular Value Transformation: Hardness and Applications to Quantum Chemistry and the Quantum PCP Conjecture
por: Gharibian, Sevag, et al.
Publicado: (2021)

Quantum 2-SAT on low dimensional systems is $\mathsf{QMA}_1$-complete: Direct embeddings and black-box simulation
por: Rudolph, Dorian, et al.
Publicado: (2024)

A Lovász theta lower bound on Quantum Max Cut
por: Huber, Felix
Publicado: (2025)

Quantum k-SAT Related Hypergraph Problems
por: Kremer, Simon-Luca, et al.
Publicado: (2025)

Fermionic Insights into Measurement-Based Quantum Computation: Circle Graph States Are Not Universal Resources
por: Harrison, Brent, et al.
Publicado: (2025)

The Complexity of Translationally Invariant Problems beyond Ground State Energies
por: Watson, James D., et al.
Publicado: (2020)

Quantum Polynomial Hierarchies: Karp-Lipton, error reduction, and lower bounds
por: Agarwal, Avantika, et al.
Publicado: (2024)

Complexity Classification of Product State Problems for Local Hamiltonians
por: Kallaugher, John, et al.
Publicado: (2024)

How hard is it to verify a classical shadow?
por: Karaiskos, Georgios, et al.
Publicado: (2025)

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

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

Beating the natural Grover bound for low-energy estimation and state preparation
por: Buhrman, Harry, et al.
Publicado: (2024)

Energy, Bosons and Computational Complexity
por: Chabaud, Ulysse, et al.
Publicado: (2025)

Improved Hardness Results for the Guided Local Hamiltonian Problem
por: Cade, Chris, et al.
Publicado: (2022)

Second-Order FALQON Parameter Transfer for the Max-Cut Problem on 3-Regular Graphs
por: Thomaz, Gabriel Fernandes, et al.
Publicado: (2026)

Approximate quantum 3-colorings of graphs and the quantum Max 3-Cut problem
por: Harris, Samuel J.
Publicado: (2024)

Approximation Algorithms for Quantum Max-$d$-Cut
por: Carlson, Charlie, et al.
Publicado: (2023)

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

Quantum Max Cut for complete tripartite graphs
por: Štrekelj, Tea
Publicado: (2025)

Performance of Parity QAOA for the Signed Max-Cut Problem
por: Weidinger, Anita, et al.
Publicado: (2024)

Refuting spectral compatibility of quantum marginals
por: Huber, Felix, et al.
Publicado: (2022)

Max-Cut graph-driven quantum circuit design for planar spin glasses
por: Ghasempouri, Seyed Ehsan, et al.
Publicado: (2025)

Quantum Max-Flow Min-Cut theorem
por: Yu, Nengkun
Publicado: (2021)

Quantum Max-Cut is NP hard to approximate
por: Piddock, Stephen
Publicado: (2025)

On the Effects of Small Graph Perturbations in the MaxCut Problem by QAOA
por: Lavagna, Leonardo, et al.
Publicado: (2024)

Parameter Transfer for Quantum Approximate Optimization of Weighted MaxCut
por: Shaydulin, Ruslan, et al.
Publicado: (2022)

Low-depth Clifford circuits approximately solve MaxCut
por: Muñoz-Arias, Manuel H., et al.
Publicado: (2023)

Beyond Quantum Annealing: Optimal control solutions to MaxCut problems
por: Pecci, Giovanni, et al.
Publicado: (2024)

Benchmarking a heuristic Floquet adiabatic algorithm for the Max-Cut problem
por: Granet, Etienne, et al.
Publicado: (2024)