Permutational quantum computing

MaRDI QIDQ3171605zbMATH OpenFDO

Authors Stephen P. Jordan

Publication date 5 October 2011

Full work available at URL https://arxiv.org/abs/0906.2508

Mathematics Subject Classification ID

Quantum algorithms and complexity in the theory of computing (68Q12) Quantum computation (81P68)

Recommendations

• The computational complexity of ball permutations
• scientific article; zbMATH DE number 5832281
• Spin networks and quantum computation
• TOWARDS A QUANTUM ALGORITHM FOR THE PERMANENT
• The magic of universal quantum computing with permutations

Cited in

(8)

• Recoupling coefficients and quantum entropies
• The magic of universal quantum computing with permutations
• Faster quantum computation with permutations and resonant couplings
• Quantum information in the Posner model of quantum cognition
• Quantum Circuits for the Unitary Permutation Problem
• The computational complexity of linear optics
• Quantum switching and quantum merge sorting
• The computational complexity of ball permutations

This page was built for publication: Permutational quantum computing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3171605)