1011 problems

Open problems

Each problem states how progress is verified and what counts as a contribution. Besides the problems curated here, the catalogue includes open conjectures from Formal Conjectures (with Lean statements), optimization constants and the AlphaEvolve problems. Know one that belongs here? Propose a problem.

All fields Mathematics 97 Computer science 8 Physics & astronomy 1

Quantum information 1

Source Any Curated here 6 Optimization constants 1

Verification Any A · Machine-checkable B · Reproducible C · Reviewed Tier Any Standard Hard Grand challenges

1 shown

B Quantum information · Optimization constants

Approximation ratio for quantum Max Cut

Quantum Max Cut is the quantum analog of Max Cut. Given a graph G = (E,V), it asks for the maximum eigenvalue of H_G = Σ_(ij) ∈ E (I - X_iX_j - Y_iY_j - Z_i Z_j), where X_i, Y_i, Z_i are the Pauli matrices acting on the i'th tensor factor and trivially on all other coordinates.

0claims

0verified

Approximation ratio for quantum Max Cut

Browse by field