3 papers
physics.comp-ph2025
An improved update rule for probabilistic computers
Andrew Rockovich, Gregory Lafyatis, Daniel J. Gauthier
Many hard combinatorial problems can be mapped onto Ising models, which replicate the behavior of classical spins. Recent advances in probabilistic computers are characterized by p…
quant-ph2025
Superconducting Qubit Readout Using Next-Generation Reservoir Computing
Robert Kent, Benjamin Lienhard, Gregory Lafyatis +1
Quantum processors require rapid and high-fidelity simultaneous measurements of many qubits. While superconducting qubits are among the leading modalities toward a useful quantum p…
quant-ph2025
Efficient measurement of neutral-atom qubits with matched filters
Robert M. Kent, Linipun Phuttitarn, Chaithanya Naik Mude +4
Quantum computers require high-fidelity measurement of many qubits to achieve a quantum advantage. Traditional approaches suffer from readout crosstalk for a neutral-atom quantum p…