activity
20242026
most citedPolynomial Time Quantum Gibbs Sampling for Fermi-Hubbard Model at any Temperature

6 citations · 7 across the 5 of their papers we have counts for

collaborators
Showing 2026Show all

5 papers · 1 filter

quant-ph2026

Loss-tolerant distributed lattice surgery using fusion networks

Felix Burt, Richard Meister, Sheng-Ku Lin +5

Networking matter-based quantum processing units (QPUs) offers a promising route to scaling fault-tolerant quantum computers. This requires distributed logical operations to be per…

quant-ph2026

Graph Neural Post-selection for Quantum Error Correction

Conor Carty, Tamas Noszko, Joschka Roffe +1

Post-selection improves the logical reliability of quantum computation by rejecting shots which are likely to result in logical failure. We introduce graph neural networks that pre…

quant-ph2026

Local Relaxation Hierarchies for Quantum Ground State Energies: Convergence Guarantees and Message Passing Algorithms

Sheng-Ku Lin, Ricardo Rivera Cardoso, Roberto Bondesan

Convex relaxation hierarchies provide lower bounds to the ground state energy of quantum many-body systems that can be computed in polynomial time on a classical computer, at any f…

quant-ph2026

Constant-time equilibration of observables under rapid Lindbladian dynamics

Štěpán Šmíd, Richard Meister, Mario Berta +1

Markovian open-system dynamics have widespread applications throughout quantum information science, including algorithmic state preparation. Their convergence is commonly quantifie…

quant-ph2026

Bayesian Optimization for Quantum Error-Correcting Code Discovery

Yihua Chengyu, Richard Meister, Conor Carty +2

Quantum error-correcting codes protect fragile quantum information by encoding it redundantly, but identifying codes that perform well in practice with minimal overhead remains dif…