For qudit channels, learning is exponentially hard with c < d parallel copies and becomes efficient at c = d with tight ε^(-2d) scaling; access to the complex-conjugate channel gives tight ε^(-4) bounds, and bosonic channels are hard for all c = O(1/ε).
Approximate quantum error correction can lead to better codes
5 Pith papers cite this work, alongside 222 external citations. Polarity classification is still indexing.
5
Pith papers citing it
222
external citations · Crossref
citation-role summary
background 1
citation-polarity summary
fields
quant-ph 5roles
background 1polarities
background 1representative citing papers
Under local amplitude damping, GHZ-type states lose magic, regain it after entanglement death, and the rebirth threshold exactly mirrors the entanglement-death threshold: γ₊ = 1 − γₑ for every n.
The thesis introduces Gaussian-controlled rotations (GCR), a composite pulse that cancels oscillator-fluctuation errors in qubit rotations, enabling deterministic preparation of squeezed, cat, and GKP states and a probabilistic error-correction analysis for photon loss.
A new [[(w+1)(w+K), K]] code family approximately corrects up to w amplitude-damping errors, and concatenation with the dual-rail code adds collective-coherent-error immunity.
A quantum anonymous secret sharing scheme is constructed using permutation-invariant codes, with leakage in ramp schemes quantified by quantum conditional min-entropy related to Knill-Laflamme conditions.
citing papers explorer
-
Quantum channel learning with limited parallel access
For qudit channels, learning is exponentially hard with c < d parallel copies and becomes efficient at c = d with tight ε^(-2d) scaling; access to the complex-conjugate channel gives tight ε^(-4) bounds, and bosonic channels are hard for all c = O(1/ε).
-
Sudden death of entanglement, rebirth of magic
Under local amplitude damping, GHZ-type states lose magic, regain it after entanglement death, and the rebirth threshold exactly mirrors the entanglement-death threshold: γ₊ = 1 − γₑ for every n.
-
Quantum Anonymous Secret Sharing with Permutation Invariant Codes
A quantum anonymous secret sharing scheme is constructed using permutation-invariant codes, with leakage in ramp schemes quantified by quantum conditional min-entropy related to Knill-Laflamme conditions.