The “MaxCut” problem is a fundamental question about graphs with real-world applications, like efficient circuit design. Recently, work on MaxCut helped mathematicians solve a major problem in number theory.
www.quantamagazine.org/networks-hol...
www.quantamagazine.org/networks-hol...
January 29, 2026 at 4:46 PM
The “MaxCut” problem is a fundamental question about graphs with real-world applications, like efficient circuit design. Recently, work on MaxCut helped mathematicians solve a major problem in number theory.
www.quantamagazine.org/networks-hol...
www.quantamagazine.org/networks-hol...
To be fair, the DQI paper didn't claim an advantage for Maxcut but suggested one for a different problem
September 25, 2025 at 1:13 PM
To be fair, the DQI paper didn't claim an advantage for Maxcut but suggested one for a different problem
Yes, that's the beautiful proof I know-- I was teaching Derandomization this morning, and MaxCUT was the guiding example.
March 18, 2026 at 12:19 AM
Yes, that's the beautiful proof I know-- I was teaching Derandomization this morning, and MaxCUT was the guiding example.
I must have implemented simulated annealing 100 times. Here’s a vibe coded version w. MaxCut interface (the vibe was “mildly annoyed by comparisons to straw-man baselines”).
github.com/gcant/anneal...
github.com/gcant/anneal...
GitHub - gcant/annealMaxCut: Simulated annealing for MaxCut (and other Ising problems)
Simulated annealing for MaxCut (and other Ising problems) - gcant/annealMaxCut
github.com
August 26, 2026 at 5:19 PM
I must have implemented simulated annealing 100 times. Here’s a vibe coded version w. MaxCut interface (the vibe was “mildly annoyed by comparisons to straw-man baselines”).
github.com/gcant/anneal...
github.com/gcant/anneal...
MEU DEUS O MAXCUT OWIWIEIHEKEKSNEHIWKDBEJEJ
"Feliz 4º aniversário de 'Heaven & Hell'. O max cut está de volta, mas apenas por um segundo." — Novo vídeo postado por Ava Max em seu perfil no 'Instagram'.
September 18, 2024 at 7:22 PM
MEU DEUS O MAXCUT OWIWIEIHEKEKSNEHIWKDBEJEJ
Ainda te darei muito orgulho velha (maxcut)
September 14, 2024 at 8:05 PM
Ainda te darei muito orgulho velha (maxcut)
Today #quantum selection: QCD calculation on quantum computer, Clifford circuits augmented matrix product states, GroverGPT, quantum genetic algorithm for the MaxCut problem, variational algorithms in silicon photonics, and pseudorandom quantum authentication.
More details and links below
More details and links below
January 3, 2025 at 1:55 PM
Today #quantum selection: QCD calculation on quantum computer, Clifford circuits augmented matrix product states, GroverGPT, quantum genetic algorithm for the MaxCut problem, variational algorithms in silicon photonics, and pseudorandom quantum authentication.
More details and links below
More details and links below
YES!🚀 #Quantum optimization with fewer qubits!
We can now solve MaxCut for m=7000 using dramatically fewer qubits—matching or surpassing top classical solvers! 💡
Could this be a step toward near-term quantum advantage? 🔗 #QuantumComputing #Optimization #qiskit www.nature.com/articles/s41...
We can now solve MaxCut for m=7000 using dramatically fewer qubits—matching or surpassing top classical solvers! 💡
Could this be a step toward near-term quantum advantage? 🔗 #QuantumComputing #Optimization #qiskit www.nature.com/articles/s41...
February 1, 2025 at 11:59 PM
YES!🚀 #Quantum optimization with fewer qubits!
We can now solve MaxCut for m=7000 using dramatically fewer qubits—matching or surpassing top classical solvers! 💡
Could this be a step toward near-term quantum advantage? 🔗 #QuantumComputing #Optimization #qiskit www.nature.com/articles/s41...
We can now solve MaxCut for m=7000 using dramatically fewer qubits—matching or surpassing top classical solvers! 💡
Could this be a step toward near-term quantum advantage? 🔗 #QuantumComputing #Optimization #qiskit www.nature.com/articles/s41...
Ava Max sobre o maxcut (seu icônico corte de cabelo assimétrico) em recente entrevista concedida ao programa de rádio australiano 'Ricki-Lee, Tim & Joel':
"Está hibernando no momento. Ele voltará um dia."
"Está hibernando no momento. Ele voltará um dia."
November 19, 2024 at 12:09 PM
Ava Max sobre o maxcut (seu icônico corte de cabelo assimétrico) em recente entrevista concedida ao programa de rádio australiano 'Ricki-Lee, Tim & Joel':
"Está hibernando no momento. Ele voltará um dia."
"Está hibernando no momento. Ele voltará um dia."
CALMA AE O MAXCUT VOLTOU MESMO OU É PERUCA?????????
September 18, 2024 at 7:18 PM
CALMA AE O MAXCUT VOLTOU MESMO OU É PERUCA?????????
Ainda em choque com ela usando o maxcut de novo...
Não acredito a Ava Max fazendo marketing pra "Agatha All Along " muito diva mesmo
September 20, 2024 at 12:05 AM
Ainda em choque com ela usando o maxcut de novo...
A new paper by Sciorilli et al. presents a qubit-efficient MaxCut solver for large-scale problems, achieving ~0.941 approximation ratio on trapped-ion hardware—comparable to advanced classical methods. www.nature.com/articles/s41...
Towards large-scale quantum optimization solvers with few qubits - Nature Communications
Combinatorial optimization problems might be solvable more efficiently with quantum computing, but near-term quantum optimization solvers are limited in qubit size. Here, the authors propose and demon...
www.nature.com
January 8, 2025 at 3:10 PM
A new paper by Sciorilli et al. presents a qubit-efficient MaxCut solver for large-scale problems, achieving ~0.941 approximation ratio on trapped-ion hardware—comparable to advanced classical methods. www.nature.com/articles/s41...
Our work featuring high approximation ratios in MaxCut using a reduced number of qubits has been published in @naturecomms.bsky.social ! 🎉🎉
www.nature.com/articles/s41...
www.nature.com/articles/s41...
Towards large-scale quantum optimization solvers with few qubits - Nature Communications
Combinatorial optimization problems might be solvable more efficiently with quantum computing, but near-term quantum optimization solvers are limited in qubit size. Here, the authors propose and demon...
www.nature.com
January 8, 2025 at 4:39 PM
Our work featuring high approximation ratios in MaxCut using a reduced number of qubits has been published in @naturecomms.bsky.social ! 🎉🎉
www.nature.com/articles/s41...
www.nature.com/articles/s41...
1/7 🚀 Excited to share our latest research on quantum-classical computing! We're tackling MaxCUT and eigenproblems with a fresh perspective on approximation algorithms.
@RiceCompSci
@ricekenkennedy
@RiceEngineering
@RiceCompSci
@ricekenkennedy
@RiceEngineering
December 5, 2024 at 4:02 AM
1/7 🚀 Excited to share our latest research on quantum-classical computing! We're tackling MaxCUT and eigenproblems with a fresh perspective on approximation algorithms.
@RiceCompSci
@ricekenkennedy
@RiceEngineering
@RiceCompSci
@ricekenkennedy
@RiceEngineering
Quantum approximate multi-objective optimization
->Nature | More from Lil Dr Glen EcoChat at BigEarthData.ai
->Nature | More from Lil Dr Glen EcoChat at BigEarthData.ai
Quantum approximate multi-objective optimization
We demonstrate our proposal on instances of MO-MAXCUT. The goal of single-objective weighted MAXCUT is to partition the set of nodes \({\mathcal{V}}\) of a given weighted graph \({\mathcal{G}}=({\mathcal{V}},{\mathcal{E}},w)\), with edge weights w kl for edges \((k,l)\in {\mathcal{E}}\), into two sets,...
www.nature.com
October 25, 2025 at 10:15 PM
Benchmarking Quantum Heuristics: Non-Variational QWOA for Weighted Maxcut
https://arxiv.org/pdf/2505.24191
Tavis Bennett, Aidan Smith, Edric Matwiejew, Jingbo Wang.
https://arxiv.org/pdf/2505.24191
Tavis Bennett, Aidan Smith, Edric Matwiejew, Jingbo Wang.
https://arxiv.org/abs/2505.24191
arXiv abstract link
arxiv.org
June 2, 2025 at 4:31 AM
Benchmarking Quantum Heuristics: Non-Variational QWOA for Weighted Maxcut
https://arxiv.org/pdf/2505.24191
Tavis Bennett, Aidan Smith, Edric Matwiejew, Jingbo Wang.
https://arxiv.org/pdf/2505.24191
Tavis Bennett, Aidan Smith, Edric Matwiejew, Jingbo Wang.
Jingjuan Huang, Alvaro Velasquez, Jia Liu, Ismail Alkhouri: Parallelizable Gradient-Based Optimization For Multi-Objective MaxCut https://arxiv.org/abs/2608.25098 https://arxiv.org/pdf/2608.25098 https://arxiv.org/html/2608.25098
August 27, 2026 at 6:40 AM
Jingjuan Huang, Alvaro Velasquez, Jia Liu, Ismail Alkhouri: Parallelizable Gradient-Based Optimization For Multi-Objective MaxCut https://arxiv.org/abs/2608.25098 https://arxiv.org/pdf/2608.25098 https://arxiv.org/html/2608.25098
Improved Algorithms for Quantum MaxCut via Partially Entangled Matchings
https://arxiv.org/pdf/2504.15276
Anuj Apte, Eunou Lee, Kunal Marwaha, Ojas Parekh, James Sud.
https://arxiv.org/pdf/2504.15276
Anuj Apte, Eunou Lee, Kunal Marwaha, Ojas Parekh, James Sud.
https://arxiv.org/abs/2504.15276
arXiv abstract link
arxiv.org
April 22, 2025 at 4:33 AM
Improved Algorithms for Quantum MaxCut via Partially Entangled Matchings
https://arxiv.org/pdf/2504.15276
Anuj Apte, Eunou Lee, Kunal Marwaha, Ojas Parekh, James Sud.
https://arxiv.org/pdf/2504.15276
Anuj Apte, Eunou Lee, Kunal Marwaha, Ojas Parekh, James Sud.
Stefan Glock, Professor of #DiscreteMathematics, has honoured the Czech mathematician Svatopluk #Poljak by launching a new lecture series in his name. Read this report to find out more about who he was and why his legacy lives on: www.digital.uni-passau.de/en/beitraege...
#Maths #MaxCut 🧪
#Maths #MaxCut 🧪
Networker and pioneer in network research
Stefan Glock, professor of Discrete Mathematics, has honoured Czech mathematician Svatopluk Poljak with a new lecture series. Who he was and why his legacy lives on.
www.digital.uni-passau.de
May 27, 2025 at 8:37 AM
Stefan Glock, Professor of #DiscreteMathematics, has honoured the Czech mathematician Svatopluk #Poljak by launching a new lecture series in his name. Read this report to find out more about who he was and why his legacy lives on: www.digital.uni-passau.de/en/beitraege...
#Maths #MaxCut 🧪
#Maths #MaxCut 🧪
Extended quantum-guided cluster algorithm incorporating next-nearest-neighbor correlations achieves notable performance gains for Max-Cut optimization.
#QuantumOptimization #MaxCut #Research
#QuantumOptimization #MaxCut #Research
Enhanced Quantum-Guided Cluster Algorithm for Max-Cut Optimization
arxiv.org
June 2, 2026 at 3:40 AM
Extended quantum-guided cluster algorithm incorporating next-nearest-neighbor correlations achieves notable performance gains for Max-Cut optimization.
#QuantumOptimization #MaxCut #Research
#QuantumOptimization #MaxCut #Research
We embedded learned Transformer optimizers directly into QAOA's hybrid quantum-classical loop, enabling amortized parameter optimization that transfers across MaxCut instances. Results show improved efficiency and solution quality compared to conventional optimization methods.
Transformer-Based Intrinsic Optimizers for Quantum Approximate Optimization Algorithm
arxiv.org
September 18, 2026 at 10:36 AM
We embedded learned Transformer optimizers directly into QAOA's hybrid quantum-classical loop, enabling amortized parameter optimization that transfers across MaxCut instances. Results show improved efficiency and solution quality compared to conventional optimization methods.