References
- R. P. Feynman (1986). Quantum mechanical computers. Foundations of Physics, 16, pp. 507–531.
- D. Deutsch and R. Jozsa (1992). Rapid solution of problems by quantum computation, Proceedings of the Royal Society A: Mathematical. Physical and Engineering Sciences, 439 (1907), pp. 553–558.
- L. K. Grover (1996). A fast quantum mechanical algorithm for database search, Proceedings of the 28th Annual ACM Symposium on Theory of Computing (STOC ’96), pp. 212–219.
- D. R. Simon (1997). On the power of quantum computation, SIAM Journal on Computing, 26(5), pp. 1474–1483.
- P. W. Shor (1997). Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Journal on Computing, 26(5), pp. 1484–1509.
- C. Jones (2013). Low-overhead constructions for the fault-tolerant Toffoli gate. Phys. Rev. A, 87(2), 022328.
- S. Bravyi and A. Kitaev (2005). Universal quantum computation with ideal Clifford gates and noisy ancillas. Phys. Rev. A, 71(2), 022316.
- P. Selinger (2013). Quantum circuits of T-depth one. Phys. Rev. A, 87(4), 042302.
- M. Amy, D. Maslov, M. Mosca and M. Roetteler (2013). A meet-in-the-middle algorithm for fast synthesis of depth-optimal quantum circuits, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 32(6), pp. 818–830.
- C. Gidney and M. Ekera (2021). How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits. Quantum, 5, 433.
- C. Gidney (2025). How to factor 2048 bit RSA integers with less than a million noisy qubits, arXiv: 2505.15917.
- S. Dutta, S. Wang, A. Baksi, A. Chattopadhyay and S. Maitra (2025). Exact space-depth trade-offs in multicontrolled Toffoli decomposition, Phys. Rev. A, 111, 052611.
- S. Jaques, M. Naehrig, M. Roetteler and F. Virdia (2020). Implementing Grover oracles for quantum key search on AES and LowMC, Advances in Cryptology – EUROCRYPT 2020. LNCS, vol. 12106, pp. 280–310.
- Z. Huang and S. Sun (2022). Synthesizing quantum circuits of AES with lower T-depth and less qubits, Advances in Cryptology – ASIACRYPT 2022. LNCS, vol. 13793, pp. 614–644.
- Q. Liu, B. Preneel, Z. Zhao and M. Wang (2023). Improved quantum circuits for AES: reducing the depth and the number of qubits, Advances in Cryptology – ASIACRYPT 2023. LNCS, vol. 14440, pp. 67–98.
- M. Zhang, T. Shi, W. Wu and H. Sui (2024). Optimized quantum circuit of AES with interlacing-uncompute structure. IEEE Transactions on Computers, vol. 73, no. 11, pp. 2563–2575.
- H. Shi and X. Feng (2024). Quantum circuits of AES with a low-depth linear layer and a new structure, Advances in Cryptology – ASIACRYPT 2024. LNCS, vol. 15491, pp. 358–395.
- Z. Huang, F. Zhang and D. Lin (2025). Constructing quantum implementations with the minimal T-depth or minimal width and their applications, Advances in Cryptology – EUROCRYPT 2025. LNCS, vol. 15601, pp. 155–185.
- K. Jang, A. Baksi, H. Kim, G. Song, H. Seo and A. Chattopadhyay (2025). Quantum analysis of AES, IACR Communications in Cryptology, 2(1).
- C. Gidney (2018). Halving the cost of quantum addition. Quantum, 2, pp. 74–79.
- C. Gidney and A. G. Fowler (2019). Flexible layout of surface code computations using autoCCZ states, arXiv: 1905.08916.
- M. R. Albrecht, C. Rechberger, T. Schneider, T. Tiessen and M. Zohner (2015). Ciphers for MPC and FHE, Advances in Cryptology – EUROCRYPT 2015. LNCS, vol. 9056, pp. 430–454.
- A. Baksi, S. Bhasin, J. Breier, M. Khairallah, T. Peyrin, S. Sarkar and S. M. Sim (2021). DEFAULT: cipher level resistance against differential fault attack, Advances in Cryptology – ASIACRYPT 2021. LNCS, vol. 13091, pp. 124–156.
- S. Banik, S. K. Pandey, T. Peyrin, Y. Sasaki, S. M. Sim and Y. Todo (2017). GIFT: a small present, CHES 2017. LNCS, vol. 10529, pp. 321–345.
- A. Bogdanov, L. R. Knudsen, G. Leander, C. Paar, A. Poschmann, M. J. B. Robshaw, et al. (2007). PRESENT: an ultra-lightweight block cipher, CHES 2007. LNCS, vol. 4727, pp. 450–466.
- J. Borghoff, A. Canteaut, T. Güneysu, E. B. Kavun, M. Knezevic, L. R. Knudsen, et al. (2012). PRINCE – a low-latency block cipher for pervasive computing applications, Advances in Cryptology – ASIACRYPT 2012. LNCS, vol. 7658, pp. 208–225.
- C. Dobraunig, M. Eichlseder, F. Mendel and M. Schläffer (2021). Ascon v1.2: lightweight authenticated encryption and hashing. J Cryptol, 34, 33.
- J. Daemen and V. Rijmen (2002). The design of Rijndael, Springer, Information Security and Cryptography.
- Y. Yuan, W. Wu, T. Shi, L. Zhang and Y. Zhang (2024). A framework to improve the implementations of linear layers, IACR Transactions on Symmetric Cryptology, 2024(2), pp. 322–347.
- T. Häner and M. Soeken (2022). Lowering the T-depth of quantum circuits via logic network optimization. ACM Transactions on Quantum Computing, 3(2), art. no. 6, pp. 1–15.
- G. Leander and A. May (2017). Grover meets Simon – quantumly attacking the FX-construction, Advances in Cryptology – ASIACRYPT 2017. LNCS, vol. 10625, pp. 161–178.