In a composite quantum hypothesis testing scenario with dephasing, the reverse sandwiched Renyi divergence for alpha in (0,1) exactly determines the single-copy Hoeffding exponent.
From Classical to Quantum Shannon Theory
12 Pith papers cite this work. Polarity classification is still indexing.
12
Pith papers citing it
representative citing papers
Quantum strategy stores isometry channels with n = Θ(1/√ε) queries for error ε, quadratic improvement over classical n = Θ(ε^{-1}).
Defines polyslot pslot[C] and srep[C] constructions on symmetric monoidal categories that reconstruct unitary supermaps and forbid time-loops in composition, with equivalence shown on path-contraction groupoids.
Derives the optimal constant c for the square-root law of covert communication over lossy thermal bosonic channels and shows it is achieved by QPSK coherent-state modulation.
Optimal affine filtering measurements for group-covariant pure-state codewords reduce to an LP, and SPC-based affine-filtering+GE decoding can outperform symbol-wise USD and PGM on i.i.d. pure-state channels.
Proposes the dual-rail cat code (DRCC) as a concatenated bosonic encoding enabling bias-preserving gates, deterministic photon-loss correction, and erasure-resilient fault tolerance.
k-local quantum Hamiltonians admit system-size-independent spectral gap for Gibbs samplers at high temperature, enabling FPT quantum approximation algorithms for partition functions.
Maximal success probability for multicopy teleportation without receiver correction is p(d,k)=k/[d(k-1+d)], attained by explicit protocol using group representation theory, with application to enhanced quantum program storage/retrieval.
The paper proves sample complexity bounds showing that any efficiently representable unitary can be learned incoherently with arbitrary measurements, but only low-entangling unitaries with shallow-depth measurements, and demonstrates this on a 16-qubit hardware device.
New combinatorial proofs and circuit designs for quantum error correction reduce physical qubit overhead by up to 10x and time overhead by 2-6x for codes including Steane, Golay, and surface codes.
For two orthogonal black-box n-qubit states, a poly(n, 1/ε)-size approximating unitary exists that maps basis states to them while resetting all auxiliaries on every input.
Reviews information-based approaches for measuring physical entropy in nonequilibrium steady and absorbing states, noting their distinction from general statistical entropy estimation and their application to diverse physical systems.
citing papers explorer
-
Operational interpretation of the reverse sandwiched Renyi divergences in composite quantum hypothesis testing
In a composite quantum hypothesis testing scenario with dephasing, the reverse sandwiched Renyi divergence for alpha in (0,1) exactly determines the single-copy Hoeffding exponent.
-
Quantum Advantage in Storage and Retrieval of Isometry Channels
Quantum strategy stores isometry channels with n = Θ(1/√ε) queries for error ε, quadratic improvement over classical n = Θ(ε^{-1}).
-
Polycategorical Constructions for Unitary Supermaps of Arbitrary Dimension
Defines polyslot pslot[C] and srep[C] constructions on symmetric monoidal categories that reconstruct unitary supermaps and forbid time-loops in composition, with equivalence shown on path-contraction groupoids.
-
Fundamental limits of quantum-secure covert communication over bosonic channels
Derives the optimal constant c for the square-root law of covert communication over lossy thermal bosonic channels and shows it is achieved by QPSK coherent-state modulation.
-
Affine Filtering Measurements and Their Applications to Quantum Decoding
Optimal affine filtering measurements for group-covariant pure-state codewords reduce to an LP, and SPC-based affine-filtering+GE decoding can outperform symbol-wise USD and PGM on i.i.d. pure-state channels.
-
Bias-Preserving Gates and Quantum Error Correction With Dual-Rail Cat Codes
Proposes the dual-rail cat code (DRCC) as a concatenated bosonic encoding enabling bias-preserving gates, deterministic photon-loss correction, and erasure-resilient fault tolerance.
-
Fast mixing of all-to-all quantum systems at high temperatures
k-local quantum Hamiltonians admit system-size-independent spectral gap for Gibbs samplers at high temperature, enabling FPT quantum approximation algorithms for partition functions.
-
Multicopy quantum state teleportation with application to storage and retrieval of quantum programs
Maximal success probability for multicopy teleportation without receiver correction is p(d,k)=k/[d(k-1+d)], attained by explicit protocol using group representation theory, with application to enhanced quantum program storage/retrieval.
-
The power and limitations of learning quantum dynamics incoherently
The paper proves sample complexity bounds showing that any efficiently representable unitary can be learned incoherently with arbitrary measurements, but only low-entangling unitaries with shallow-depth measurements, and demonstrates this on a 16-qubit hardware device.
-
Lower overhead fault-tolerant building blocks for noisy quantum computers
New combinatorial proofs and circuit designs for quantum error correction reduce physical qubit overhead by up to 10x and time overhead by 2-6x for codes including Steane, Golay, and surface codes.
-
Approximating Unitary Preparations of Orthogonal Black Box States
For two orthogonal black-box n-qubit states, a poly(n, 1/ε)-size approximating unitary exists that maps basis states to them while resetting all auxiliaries on every input.
-
Perspective: Measuring physical entropy out of equilibrium
Reviews information-based approaches for measuring physical entropy in nonequilibrium steady and absorbing states, noting their distinction from general statistical entropy estimation and their application to diverse physical systems.