Efficient Quantum Circuits for Schur and Clebsch-Gordan Transforms

DOI10.1103/PhysRevLett.97.170502zbMath1228.81119arXivquant-ph/0407082OpenAlexW2006596905WikidataQ51095718 ScholiaQ51095718MaRDI QIDQ3107838

Dave Morris Bacon, Aram W. Harrow, Isaac Chuang

Publication date: 26 December 2011

Published in: Physical Review Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/quant-ph/0407082

Mathematics Subject Classification ID

Quantum computation (81P68) Finite-dimensional groups and algebras motivated by physics and their representations (81R05)

Related Items (11)

Quantum stopwatch: how to store time in a quantum memory ⋮ Combinatorial approach to the representation of the Schur-Weyl duality in one-dimensional spin systems ⋮ Lower bound on entanglement in subspaces defined by Young diagrams ⋮ Beating noise with abstention in state estimation ⋮ Asymptotic error rates in quantum hypothesis testing ⋮ Quantum information processing and composite quantum fields ⋮ Quantum simulation of gauge theory via orbifold lattice ⋮ A simplified formalism of the algebra of partially transposed permutation operators with applications ⋮ Reference frames, superselection rules, and quantum information ⋮ Efficient simulation of random states and random unitaries ⋮ Optimality of the pretty good measurement for port-based teleportation

Cites Work

• A pattern calculus for tensor operators in the unitary groups
• Optimal sequence of quantum measurements in the sense of Stein s lemma in quantum hypothesis testing
• Theory of Quantum Error Correction for General Noise
• Unnamed Item
• Unnamed Item

This page was built for publication: Efficient Quantum Circuits for Schur and Clebsch-Gordan Transforms