12 citations · 20 across the 6 of their papers we have counts for
7 papers
A Slice-Rank Drift Bound for Random Quantum \(k\)-SAT
Jean Bernoulli Ravelomanana
Random quantum satisfiability is a natural quantum analogue of random constraint satisfaction and a basic model for frustration-free local Hamiltonians. Despite extensive work on i…
The PRODSAT phase of random quantum satisfiability
Joon Lee, Nicolas Macris, Jean Bernoulli Ravelomanana +1
The -QSAT problem is a quantum analog of the famous -SAT constraint satisfaction problem. We must determine the zero energy ground states of a Hamiltonian of qubits consi…
Metastability of the Potts ferromagnet on random regular graphs
Amin Coja-Oghlan, Andreas Galanis, Leslie Ann Goldberg +3
We study the performance of Markov chains for the -state ferromagnetic Potts model on random regular graphs. It is conjectured that their performance is dictated by metastabilit…
Warning Propagation: stability and subcriticality
Oliver Cooley, Joon Lee, Jean B. Ravelomanana
Warning Propagation is a combinatorial message passing algorithm that unifies and generalises a wide variety of recursive combinatorial procedures. Special cases include the Unit C…
The sparse parity matrix
Amin Coja-Oghlan, Oliver Cooley, Mihyun Kang +2
Let be an -matrix over whose every entry equals with probability independently for a fixed . Draw a vector random…
Warning Propagation on random graphs
Amin Coja-Oghlan, Oliver Cooley, Mihyun Kang +2
Warning Propagation is a combinatorial message passing algorithm that unifies and generalises a wide variety of recursive combinatorial procedures. Special cases include the Unit C…