1 citations · 1 across the 2 of their papers we have counts for
Showing quant-phShow all
2 papers · 1 filter
quant-ph2026
Disassembling qLDPC codes for depth-optimal parity-check circuits
Minh T. P. Nguyen, Maximilian Rimbach-Russ, Stefano Bosco
Quantum low-density parity-check (qLDPC) codes offer a promising route to scalable fault-tolerant quantum computing, but their practical implementation requires efficient circuits…
quant-ph2023★ 1 cited
Efficient learning of Sparse Pauli Lindblad models for fully connected qubit topology
Jose Este Jaloveckas, Minh Tham Pham Nguyen, Lilly Palackal +2
The challenge to achieve practical quantum computing considering current hardware size and gate fidelity is the sensitivity to errors and noise. Recent work has shown that by learn…