Cover Image

Lower bounding the MaxCut of high girth 3-regular graphs using the QAOA

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Farhi, Edward, Gutmann, Sam, Ranard, Daniel, Villalonga, Benjamin
Format:	Preprint
Published:	2025
Subjects:	Quantum Physics Discrete Mathematics Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Factorization norms and an inverse theorem for MaxCut
by: Balla, Igor, et al.
Published: (2025)

Improved lower bounds on the maximum size of graphs with girth 5
by: Goedgebeur, Jan, et al.
Published: (2025)

New small regular graphs of given girth: the cage problem and beyond
by: Exoo, Geoffrey, et al.
Published: (2025)

Krenn-Gu conjecture for sparse graphs
by: Chandran, L. Sunil, et al.
Published: (2024)

Solving General QUBOs with Warm-Start QAOA via a Reduction to Max-Cut
by: Bhattacharyya, Bikrant, et al.
Published: (2025)

Preparing graph states forbidding a vertex-minor
by: Davies, James, et al.
Published: (2025)

2-distance 4-coloring of planar subcubic graphs with girth at least 21
by: La, Hoang, et al.
Published: (2021)

Playing Sudoku on random 3-regular graphs
by: Dippel, Jack, et al.
Published: (2025)

Lower Bounds for Maximum Weighted Cut
by: Gutin, Gregory, et al.
Published: (2021)

Perfect state transfer using Markovian quantum walk
by: Dutta, Supriyo
Published: (2022)

On the order-diameter ratio of girth-diameter cages
by: Cambie, Stijn, et al.
Published: (2025)

3-colorable planar graphs have an intersection segment representation using 3 slopes
by: Gonçalves, Daniel
Published: (2025)

$ε$-Uniform Mixing in Discrete Quantum Walks
by: Zhan, Hanmeng
Published: (2023)

Discrete Quantum Walks with Marked Vertices and Their Average Vertex Mixing Matrices
by: Mohan, Amulya, et al.
Published: (2024)

Simple Quantum Coins Enable Pretty Good State Transfer on Every Hypercube
by: Zhan, Hanmeng
Published: (2024)

Sunflowers and Ramsey problems for restricted intersections
by: Janzer, Barnabás, et al.
Published: (2025)

Random sampling of permutations through quantum circuits
by: Adhikari, Bibhas
Published: (2024)

Planar #CSP Equality Corresponds to Quantum Isomorphism -- A Holant Viewpoint
by: Cai, Jin-Yi, et al.
Published: (2022)

An optimal chromatic bound for ($P_2+P_3$, gem)-free graphs
by: Char, Arnab, et al.
Published: (2024)

On rigid regular graphs and a problem of Babai and Pultr
by: Knauer, Kolja, et al.
Published: (2025)

On the existence of factors intersecting sets of cycles in regular graphs
by: Goedgebeur, Jan, et al.
Published: (2024)

Elimination distance to bounded degree on planar graphs
by: Lindermayr, Alexander, et al.
Published: (2020)

Indirect Job-Shop coding using rank: application to QAOA (IQAOA)
by: Bourreau, Eric, et al.
Published: (2024)

Edge coloring lattice graphs
by: Kattemölle, Joris
Published: (2024)

Strong odd colorings in graph classes of bounded expansion
by: Pilipczuk, Michał
Published: (2025)

Cops and robber in graphs with bounded vertex cover number
by: Bose, Prosenjit, et al.
Published: (2026)

Bounded twin-width graphs are polynomially $χ$-bounded
by: Bourneuf, Romain, et al.
Published: (2023)

A Brooks-type theorem for the k-choosability of graphs with maximum local edge-connectivity k
by: Bastida, Sam, et al.
Published: (2026)

On expectations and variances in the hard-core model on bounded degree graphs
by: Davies, Ewan, et al.
Published: (2025)

A Caro-Wei bound for induced linear forests in graphs
by: Joret, Gwenaël, et al.
Published: (2024)

Canonical labelling of random regular graphs
by: Isaev, Mikhail, et al.
Published: (2026)

Lower Bounds and properties for the average number of colors in the non-equivalent colorings of a graph
by: Hertz, Alain, et al.
Published: (2021)

On $(n,m)$-chromatic numbers of graphs having bounded sparsity parameters
by: Das, Sandip, et al.
Published: (2023)

A quasi-optimal upper bound for induced paths in sparse graphs
by: Couëtoux, Basile, et al.
Published: (2025)

A polynomial bound on the number of minimal separators and potential maximal cliques in $P_6$-free graphs of bounded clique number
by: Pilipczuk, Marcin, et al.
Published: (2023)

Upper bounds on the average number of colors in the non-equivalent colorings of a graph
by: Hertz, Alain, et al.
Published: (2021)

Immersions of large cliques in graphs with independence number 2 and bounded maximum degree
by: Botler, Fábio, et al.
Published: (2025)

A polynomial bound on the pathwidth of graphs edge-coverable by $k$ shortest paths
by: Baste, Julien, et al.
Published: (2025)

Hamiltonian path and Hamiltonian cycle are solvable in polynomial time in graphs of bounded independence number
by: Jedličková, Nikola, et al.
Published: (2023)

On the expansion of Hanoi graphs
by: Eppstein, David, et al.
Published: (2025)