Presents a poly-complexity quantum circuit implementing the random dilation superchannel for parallel channel queries, with approximate sequential extension, a no-go theorem for exact sequential dilation, and an application to exponentially improved channel storage-retrieval.
Title resolution pending
4 Pith papers cite this work. Polarity classification is still indexing.
4
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
roles
background 1polarities
background 1representative citing papers
Quantum strategy stores isometry channels with n = Θ(1/√ε) queries for error ε, quadratic improvement over classical n = Θ(ε^{-1}).
The paper organizes important open questions in quantum gravity and quantum information into four themes without presenting new results or derivations.
citing papers explorer
-
Random dilation superchannel
Presents a poly-complexity quantum circuit implementing the random dilation superchannel for parallel channel queries, with approximate sequential extension, a no-go theorem for exact sequential dilation, and an application to exponentially improved channel storage-retrieval.
-
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}).
-
Rethinking quantum information in gravity and fields
The paper organizes important open questions in quantum gravity and quantum information into four themes without presenting new results or derivations.
- Unbiased Hamiltonian Simulation by Reversing Trotter Error Dynamics