Permutational quantum computing

zbMATH Open1237.81051arXiv0906.2508MaRDI QIDQ3171605FDOQ3171605

Authors: Stephen P. Jordan 

Publication date: 5 October 2011

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

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

Mathematics Subject Classification ID

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

Cited In (8)

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

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)