Synthesis and optimization of reversible circuits—a survey

M Saeedi, IL Markov - ACM Computing Surveys (CSUR), 2013 - dl.acm.org
Reversible logic circuits have been historically motivated by theoretical research in low-
power electronics as well as practical improvement of bit manipulation transforms in …

Covariant quantum kernels for data with group structure

JR Glick, TP Gujarati, AD Corcoles, Y Kim, A Kandala… - Nature Physics, 2024 - nature.com
The use of kernel functions is a common technique to extract important features from
datasets. A quantum computer can be used to estimate kernel entries as transition …

Polynomial-time T-depth optimization of Clifford+ T circuits via matroid partitioning

M Amy, D Maslov, M Mosca - IEEE Transactions on Computer …, 2014 - ieeexplore.ieee.org
Most work in quantum circuit optimization has been performed in isolation from the results of
quantum fault-tolerance. Here we present a polynomial-time algorithm for optimizing …

Quantum arithmetic with the quantum Fourier transform

L Ruiz-Perez, JC Garcia-Escartin - Quantum Information Processing, 2017 - Springer
The quantum Fourier transform offers an interesting way to perform arithmetic operations on
a quantum computer. We review existing quantum Fourier transform adders and multipliers …

Factoring with qutrits: Shor's algorithm on ternary and metaplectic quantum architectures

A Bocharov, M Roetteler, KM Svore - Physical Review A, 2017 - APS
We determine the cost of performing Shor's algorithm for integer factorization on a ternary
quantum computer, using two natural models of universal fault-tolerant computing:(i) a …

Quantum circuit design of a T-count optimized integer multiplier

E Muñoz-Coreas, H Thapliyal - IEEE Transactions on …, 2018 - ieeexplore.ieee.org
Quantum circuits of many qubits are extremely difficult to realize; thus, the number of qubits
is an important metric in a quantum circuit design. Further, scalable and reliable quantum …

[HTML][HTML] Large-scale simulation of Shor's quantum factoring algorithm

D Willsch, M Willsch, F Jin, H De Raedt, K Michielsen - Mathematics, 2023 - mdpi.com
Shor's factoring algorithm is one of the most anticipated applications of quantum computing.
However, the limited capabilities of today's quantum computers only permit a study of Shor's …

Time-sliced quantum circuit partitioning for modular architectures

JM Baker, C Duckering, A Hoover… - Proceedings of the 17th …, 2020 - dl.acm.org
Current quantum computer designs will not scale. To scale beyond small prototypes,
quantum architectures will likely adopt a modular approach with clusters of tightly connected …

T-count optimization and Reed–Muller codes

M Amy, M Mosca - IEEE Transactions on Information Theory, 2019 - ieeexplore.ieee.org
In this paper, we study the close relationship between Reed-Muller codes and single-qubit
phase gates from the perspective of T-count optimization. We prove that minimizing the …

Efficient implementation of lightweight hash functions on GPU and quantum computers for IoT applications

WK Lee, K Jang, G Song, H Kim, SO Hwang… - IEEE Access, 2022 - ieeexplore.ieee.org
Secure communication is important for Internet of Things (IoT) applications, to avoid cyber-
security attacks. One of the key security aspects is data integrity, which can be protected by …