Efficient Quantum Circuits for Schur and Clebsch-Gordan Transforms

DOI10.1103/PhysRevLett.97.170502zbMath1228.81119arXivquant-ph/0407082WikidataQ51095718 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

81P68: Quantum computation

81R05: Finite-dimensional groups and algebras motivated by physics and their representations

Related Items

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, A simplified formalism of the algebra of partially transposed permutation operators with applications, Beating noise with abstention in state estimation, Quantum information processing and composite quantum fields, Asymptotic error rates in quantum hypothesis testing, Efficient simulation of random states and random unitaries, Quantum simulation of gauge theory via orbifold lattice, Reference frames, superselection rules, and quantum information

Cites Work

• Unnamed Item
• Unnamed Item
• 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