Classification and transformations of quantum circuit decompositions for permutation operations

DOI10.1007/S11128-024-04508-5MaRDI QIDQ6629254zbMATH OpenFDO

Authors Ankit Khandelwal, Handy Kurniawan, Shraddha Aangiras, Özlem Salehi, Adam Glos

Publication date 29 October 2024

Published in Quantum Information Processing (Search for Journal in Brave)

zbMATH Keywords

permutationsquantum circuittranspilation

Mathematics Subject Classification ID

Quantum computation (81P68)

Cites work

• scientific article; zbMATH DE number 5568624 (Why is no real title available?)
• scientific article; zbMATH DE number 1256737 (Why is no real title available?)
• scientific article; zbMATH DE number 1406111 (Why is no real title available?)
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Quantum Speedups for Dynamic Programming on n-Dimensional Lattice Graphs
• Quantum Walk Based Search Algorithms
• Quantum computation and quantum information. 10th anniversary edition
• Quantum speedups for exponential-time dynamic programming algorithms
• Realizable Universal Quantum Logic Gates

This page was built for publication: Classification and transformations of quantum circuit decompositions for permutation operations

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