REVIEW 12 cited by
Gelfand-Tsetlin basis for partially transposed permutations, with applications to quantum information
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
We study representation theory of the partially transposed permutation matrix algebra, a matrix representation of the diagrammatic walled Brauer algebra. This algebra plays a prominent role in mixed Schur-Weyl duality that appears in various contexts in quantum information. Our main technical result is an explicit formula for the action of the walled Brauer algebra generators in the Gelfand-Tsetlin basis. It generalizes the well-known Gelfand-Tsetlin basis for the symmetric group (also known as Young's orthogonal form or Young-Yamanouchi basis). We provide two applications of our result to quantum information. First, we show how to simplify semidefinite optimization problems over unitary-equivariant quantum channels by performing a symmetry reduction. Second, we derive an efficient quantum circuit for implementing the optimal port-based quantum teleportation protocol, exponentially improving the known trivial construction. As a consequence, this also exponentially improves the known lower bound for the amount of entanglement needed to implement unitaries non-locally. Both applications require a generalization of quantum Schur transform to tensors of mixed unitary symmetry. We develop an efficient quantum circuit for this mixed quantum Schur transform and provide a matrix product state representation of its basis vectors. For constant local dimension, this yields an efficient classical algorithm for computing any entry of the mixed quantum Schur transform unitary.
Forward citations
Cited by 12 Pith papers
-
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.
-
Optimal complex conjugation of unknown isometry channels
The optimal n-use fidelity for complex conjugating an unknown isometry C^d→C^D is derived in closed form, with parallel protocols proven optimal among all general quantum superchannels.
-
Fixed points in de Finetti hierarchies
Fixed-point constraints on de Finetti hierarchies yield O(√(log n)/n) double-sided rates, block-structured dimension dependence, and poly-time certifiable separable inner approximations for fixed local dimensions.
-
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 ten...
-
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 appli...
-
Sequential quantum processes with group symmetries
A canonical streaming circuit decomposition for (G×H)-invariant quantum combs is derived, and numerical optimization suggests a deterministic 7-query transposition protocol for qutrits that is reported as exact.
-
Quantum Simulation of Random Unitaries from Clebsch-Gordan Transforms
Clebsch-Gordan transforms give exact compressed oracles for Haar-random unitary group actions, with efficient circuits for U(d).
-
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 st...
-
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...
Discussion (0). Sign in to comment.