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 …

Quantum computing: an overview across the system stack

S Resch, UR Karpuzcu - arXiv preprint arXiv:1905.07240, 2019 - arxiv.org
Quantum computers, if fully realized, promise to be a revolutionary technology. As a result,
quantum computing has become one of the hottest areas of research in the last few years …

Experimental comparison of two quantum computing architectures

NM Linke, D Maslov, M Roetteler… - Proceedings of the …, 2017 - National Acad Sciences
We run a selection of algorithms on two state-of-the-art 5-qubit quantum computers that are
based on different technology platforms. One is a publicly accessible superconducting …

Synthesis of quantum circuits for linear nearest neighbor architectures

M Saeedi, R Wille, R Drechsler - Quantum Information Processing, 2011 - Springer
While a couple of impressive quantum technologies have been proposed, they have several
intrinsic limitations which must be considered by circuit designers to produce realizable …

Optimization of quantum circuits for interaction distance in linear nearest neighbor architectures

A Shafaei, M Saeedi, M Pedram - Proceedings of the 50th annual design …, 2013 - dl.acm.org
Optimization of the interaction distance between qubits to map a quantum circuit into one-
dimensional quantum architectures is addressed. The problem is formulated as the …

Implementation of quantum imaginary-time evolution method on NISQ devices by introducing nonlocal approximation

H Nishi, T Kosugi, Y Matsushita - npj Quantum Information, 2021 - nature.com
The imaginary-time evolution method is a well-known approach used for obtaining the
ground state in quantum many-body problems on a classical computer. A recently proposed …

Harmony-search algorithm for 2D nearest neighbor quantum circuits realization

MG Alfailakawi, I Ahmad, S Hamdan - Expert Systems with Applications, 2016 - Elsevier
Motivated by its promising applications, quantum computing is an emerging area of
research. This paper addresses the NP-complete problem of finding Nearest Neighbor (NN) …

Layout optimization for quantum circuits with linear nearest neighbor architectures

M Pedram, A Shafaei - IEEE Circuits and Systems Magazine, 2016 - ieeexplore.ieee.org
This paper is concerned with the physical design of quantum logic circuits. More precisely, it
addresses the problem of minimizing the number of required qubit reorderings (achieved by …

Using reinforcement learning to find efficient qubit routing policies for deployment in near-term quantum computers

S Herbert, A Sengupta - arXiv preprint arXiv:1812.11619, 2018 - arxiv.org
This paper addresses the problem of qubit routing in first-generation and other near-term
quantum computers. In particular, it is asserted that the qubit routing problem can be …

Ion transport and reordering in a 2d trap array

Y Wan, R Jördens, SD Erickson, JJ Wu… - Advanced Quantum …, 2020 - Wiley Online Library
Scaling quantum information processors is a challenging task, requiring manipulation of a
large number of qubits with high fidelity and a high degree of connectivity. For trapped ions …