Related papers: Optimal Mapping for Near-Term Quantum Architecture…
This work focuses on optimizing the gates of a quantum circuit with a given topology to approximate the unitary time evolution governed by a Hamiltonian. Recognizing that unitary matrices form a mathematical manifold, we employ Riemannian…
The fragile nature of quantum information limits our ability to construct large quantities of quantum bits suitable for quantum computing. An important goal, therefore, is to minimize the amount of resources required to implement quantum…
Optimal control can be used to significantly improve multi-qubit gates in quantum information processing hardware architectures based on superconducting circuit quantum electrodynamics. We apply this approach not only to dispersive gates of…
Quantum algorithm design usually assumes access to a perfect quantum computer with ideal properties like full connectivity, noise-freedom and arbitrarily long coherence time. In Noisy Intermediate-Scale Quantum (NISQ) devices, however, the…
Quantum arithmetic circuits have practical applications in various quantum algorithms. In this paper, we address quantum addition on 2-dimensional nearest-neighbor architectures based on the work presented by Choi and Van Meter (JETC 2012).…
In this work, we explore and propose several quantum circuit mapping strategies to optimize qubit shuttling in scalable quantum computing architectures based on silicon spin qubits. Our goal is to minimize phase errors introduced during…
Quantum computations are typically compiled into a circuit of basic quantum gates. Just like for classical circuits, a quantum compiler should optimize the quantum circuit, e.g. by minimizing the number of required gates. Optimizing quantum…
The practical use of many types of near-term quantum computers requires accounting for their limited connectivity. One way of overcoming limited connectivity is to insert swaps in the circuit so that logical operations can be performed on…
Trapped-ion (TI) quantum computer is one of the forerunner quantum technologies. However, TI systems can have a limited number of qubits in a single trap. Execution of meaningful quantum algorithms requires a multiple trap system. In such…
Variational quantum algorithms, inspired by neural networks, have become a novel approach in quantum computing. However, designing efficient parameterized quantum circuits remains a challenge. Quantum architecture search tackles this by…
Rydberg quantum gate serving as an indispensable computing unit for neutral-atom quantum computation, has attracted intense research efforts for the last decade. However the state-of-the-art experiments have not reached the high gate…
A zoned neutral atom architecture achieves exceptional fidelity by segregating the execution spaces of 1- and 2-qubit gates, being a promising candidate for high-accuracy quantum systems. Unfortunately, naively applying programs designed…
Topological Data Analysis methods can be useful for classification and clustering tasks in many different fields as they can provide two dimensional persistence diagrams that summarize important information about the shape of potentially…
Qubit Mapping is a critical aspect of implementing quantum circuits on real hardware devices. Currently, the existing algorithms for qubit mapping encounter difficulties when dealing with larger circuit sizes involving hundreds of qubits.…
Unitary and non-unitary diagonal operators are fundamental building blocks in quantum algorithms with applications in the resolution of partial differential equations, Hamiltonian simulations, the loading of classical data on quantum…
Existing quantum routing implicitly mimics classical routing principles, with finding the ``best'' path (aka pathfinding), according to a selected routing metric, as a core mechanism for establishing end-to-end entanglement. However,…
Despite the striking progress in the field of quantum gases, one of their much anticipated application -- the simulation of quantum Hall states -- remains elusive: all experimental approaches so far failed in reaching a sufficiently small…
We theoretically investigate the use of fast pulsed two-qubit gates for trapped ion quantum computing in a two-dimensional microtrap architecture. In one dimension, such fast gates are optimal when employed between nearest neighbours, and…
Quantum holonomic gates hold built-in resilience to local noises and provide a promising approach for implementing fault-tolerant quantum computation. We propose to realize high-fidelity holonomic $(N+1)$-qubit controlled gates using…
A significant hurdle towards realization of practical and scalable quantum computing is to protect the quantum states from inherent noises during the computation. In physical implementation of quantum circuits, a long-distance interaction…