A reduction framework from sample complexity yields matching time lower bounds for purity estimation, high-order functionals, productness testing, and related quantum protocols.
Gelfand-tsetlin basis for partially transposed permutations, with applications to quantum information
8 Pith papers cite this work. Polarity classification is still indexing.
8
Pith papers citing it
fields
quant-ph 8verdicts
UNVERDICTED 8representative 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.
Develops two protocols for probabilistic storage-and-retrieval of unitary superchannels, with staircase backstitch reaching unit success probability asymptotically as query number grows, plus a universal inversion protocol.
Optimal success probability for identifying one or two faulty unknown unitaries is independent of total device count, achieved via an ancillary-system protocol that allows independent testing.
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
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.
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.
-
Probabilistic Storage and Retrieval of Quantum Superchannels for "Retrospective'' Intervention
Develops two protocols for probabilistic storage-and-retrieval of unitary superchannels, with staircase backstitch reaching unit success probability asymptotically as query number grows, plus a universal inversion protocol.
-
Exact identification of unknown unitary processes
Optimal success probability for identifying one or two faulty unknown unitaries is independent of total device count, achieved via an ancillary-system protocol that allows independent testing.
-
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
-
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.