A reduction framework from sample complexity yields matching time lower bounds for purity estimation, high-order functionals, productness testing, and related quantum protocols.
The mixed Schur transform: efficient quantum circuit and applications
6 Pith papers cite this work. Polarity classification is still indexing.
6
Pith papers citing it
verdicts
UNVERDICTED 6representative citing papers
A sample-optimal quantum state tomography algorithm that is memory-efficient by using unitary Schur sampling with streaming access to samples.
A general-purpose path-recording oracle is defined that perfectly simulates random elements of any closed subgroup of U(N) by storing t input-output pairs whose updates are governed by the commutant of the group's tensor-power representation.
Dimension corrections in non-semisimple walled Brauer algebras are counted via restricted Bratteli diagrams whose generating functions match the partition function of an infinite tower of simple harmonic oscillators.
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.
Introduces resource theories for asynchronous port-based teleportation with free classical and quantum pre-processing, computes tight fidelity bounds for isotropic, graph, and symmetrized EPR states, and proves the strongest model equals any one-way protocol in surpassing the classical teleportation
citing papers explorer
-
Quantum Time Lower Bounds by Permutation Invariance
A reduction framework from sample complexity yields matching time lower bounds for purity estimation, high-order functionals, productness testing, and related quantum protocols.
-
Sample Optimal and Memory Efficient Quantum State Tomography
A sample-optimal quantum state tomography algorithm that is memory-efficient by using unitary Schur sampling with streaming access to samples.
-
Quantum Lazy Sampling and Path Recording for Any Group
A general-purpose path-recording oracle is defined that perfectly simulates random elements of any closed subgroup of U(N) by storing t input-output pairs whose updates are governed by the commutant of the group's tensor-power representation.
-
Oscillators from non-semisimple walled Brauer algebras
Dimension corrections in non-semisimple walled Brauer algebras are counted via restricted Bratteli diagrams whose generating functions match the partition function of an infinite tower of simple harmonic oscillators.
-
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.
-
A resource theory of asynchronous quantum information processing
Introduces resource theories for asynchronous port-based teleportation with free classical and quantum pre-processing, computes tight fidelity bounds for isotropic, graph, and symmetrized EPR states, and proves the strongest model equals any one-way protocol in surpassing the classical teleportation