Showing quant-phShow all
3 papers · 1 filter
quant-ph2025
Dynamical quantum codes and logic gates on a lattice with sparse connectivity
Dominic J. Williamson, Bence Hetényi
We introduce several dynamical schemes that take advantage of mid-circuit measurement and nearest-neighbor gates on a lattice with maximum vertex degree three to implement topologi…
quant-ph2025
Readout sweet spots for spin qubits with strong spin-orbit interaction
Domonkos Svastits, Bence Hetényi, Gábor Széchenyi +4
Qubit readout schemes often deviate from ideal projective measurements, introducing critical issues that limit quantum computing performance. In this work, we model charge-sensing-…
quant-ph2025
Decision-tree decoders for general quantum LDPC codes
Kai R. Ott, Bence Hetényi, Michael E. Beverland
We introduce Decision Tree Decoders (DTDs), which rely only on the sparsity of the binary check matrix, making them broadly applicable for decoding any quantum low-density parity-c…