Derives parameter-free analytical expression for collision resolution in peeling decoding of BB codes, validated with R^2=0.86 and enabling low-latency two-shot decoding.
Title resolution pending
8 Pith papers cite this work. Polarity classification is still indexing.
8
Pith papers citing it
citation-role summary
background 2
citation-polarity summary
fields
quant-ph 8verdicts
UNVERDICTED 8roles
background 1polarities
support 1representative citing papers
A single modulo check on syndrome defect count predicts whether belief propagation will converge when decoding bivariate bicycle quantum error correction codes.
Cyclic control via parameter-space expansion restores controllability in fast CZ gates despite short-timescale distortions, cutting average coherent error from 0.27% to 0.12% in superconducting qubit experiments without extending gate duration.
A tunable coupler design enables sub-100 ns two-qubit gates with errors below 10^{-4} between fluxonium qubits over 1 cm distances for modular architectures.
The checkerboard fracton code achieves a code-capacity threshold of p_th ≈ 0.107(3) under stochastic Pauli noise, the highest among known 3D codes and near the theoretical limit.
A dynamical decoupling protocol enables fast high-fidelity gates on a central qubit coupled to targets, demonstrated via IBMQ simulation and adapted for 15NV centers in diamond.
Ensemble quantum token protocol benchmarked on IBM processors achieves bank acceptance of forged tokens below 10^{-22} while accepting legitimate tokens above 0.999.
The paper identifies four key hurdles in the transition from NISQ to FASQ quantum computers and argues that targeting them will accelerate progress toward useful quantum advantage.
citing papers explorer
-
Analytical Theory of Greedy Peeling for Bivariate Bicycle Codes and Two-Shot Streaming Decoding
Derives parameter-free analytical expression for collision resolution in peeling decoding of BB codes, validated with R^2=0.86 and enabling low-latency two-shot decoding.
-
Belief Propagation Convergence Prediction for Bivariate Bicycle Quantum Error Correction Codes
A single modulo check on syndrome defect count predicts whether belief propagation will converge when decoding bivariate bicycle quantum error correction codes.
-
Overcoming the Speed-Fidelity Trade-off in Fast CZ Gates via Cyclic Control
Cyclic control via parameter-space expansion restores controllability in fast CZ gates despite short-timescale distortions, cutting average coherent error from 0.27% to 0.12% in superconducting qubit experiments without extending gate duration.
-
Long-range tunable coupler for modular fluxonium quantum processors
A tunable coupler design enables sub-100 ns two-qubit gates with errors below 10^{-4} between fluxonium qubits over 1 cm distances for modular architectures.
-
Error Resilience of Fracton Codes and Near Saturation of Code-Capacity Threshold in Three Dimensions
The checkerboard fracton code achieves a code-capacity threshold of p_th ≈ 0.107(3) under stochastic Pauli noise, the highest among known 3D codes and near the theoretical limit.
-
Quantum Gates via Dynamical Decoupling of Central Qubit on IBMQ and 15NV Center in Diamond
A dynamical decoupling protocol enables fast high-fidelity gates on a central qubit coupled to targets, demonstrated via IBMQ simulation and adapted for 15NV centers in diamond.
-
Ensemble-Based Quantum Token Protocol Benchmarked on IBM Quantum Processors
Ensemble quantum token protocol benchmarked on IBM processors achieves bank acceptance of forged tokens below 10^{-22} while accepting legitimate tokens above 0.999.
-
Mind the gaps: The fraught road to quantum advantage
The paper identifies four key hurdles in the transition from NISQ to FASQ quantum computers and argues that targeting them will accelerate progress toward useful quantum advantage.