Related papers: Orchestrated Trios: Compiling for Efficient Commun…
Quantum Approximation Optimization Algorithm (QAOA) is a highly advocated variational algorithm for solving the combinatorial optimization problem. One critical feature in the quantum circuit of QAOA algorithm is that it consists of…
We present an implementation of multi-controlled quantum gates which provides significant reductions of cost compared to state-of-the-art methods. The operator applied on the target qubit is a unitary, special unitary, or the Pauli X…
Quantum-circuit optimization is essential for any practical realization of quantum computation, in order to beat decoherence. We present a scheme for implementing the final stage in the compilation of quantum circuits, i.e., for finding the…
Topological quantum computation may provide a robust approach for encoding and manipulating information utilizing the topological properties of anyonic quasi-particle excitations. We develop an efficient means to map between dense and…
A large-scale quantum circuit can be partitioned into multiple subcircuits through circuit cutting, where each subcircuit is executed multiple times and the expectation value of the original circuit is reconstructed by classical…
Numerical optimization is used to design linear-optical devices that implement a desired quantum gate with perfect fidelity, while maximizing the success rate. For the 2-qubit CS (or CNOT) gate, we provide numerical evidence that the…
The success probability of a quantum algorithm constructed from noisy quantum gates cannot be accurately predicted from single parameter metrics that compare noisy and ideal gates. We illustrate this concept by examining a system with…
Just as classical computing relies on distributed systems, the quantum computing era requires new kinds of infrastructure and software tools. Quantum networks will become the backbone of hybrid, quantum-augmented data centers, in which…
Unitary decomposition is a widely used method to map quantum algorithms to an arbitrary set of quantum gates. Efficient implementation of this decomposition allows for translation of bigger unitary gates into elementary quantum operations,…
Compared with the idea of universal quantum computation, a direct synthesis of a multiqubit logic gate can greatly improve the efficiency of quantum information processing tasks. Here we propose an efficient scheme to implement a…
Despite major ongoing advancements in neutral atom hardware technology, there remains limited work in systems-level software tailored to overcoming the challenges of neutral atom quantum computers. In particular, most current neutral atom…
In this work we propose a high-quality decomposition approach for qubit routing by swap insertion. This optimization problem arises in the context of compiling quantum algorithms onto specific quantum hardware. Our approach decomposes the…
Optimal implementation of quantum gates is crucial for designing a quantum computer. We consider the matrix representation of an arbitrary multiqubit gate. By ordering the basis vectors using the Gray code, we construct the quantum circuit…
The von Neumann architecture for a classical computer comprises a central processing unit and a memory holding instructions and data. We demonstrate a quantum central processing unit that exchanges data with a quantum random-access memory…
This paper presents novel methods for optimizing multi-controlled quantum gates, which naturally arise in high-level quantum programming. Our primary approach involves rewriting $U(2)$ gates as $SU(2)$ gates, utilizing one auxiliary qubit…
Pairwise exchange couplings have long been the standard mechanism for entangling spin qubits in semiconductor systems. However, implementing quantum circuits based on pairwise exchange gates often requires a lengthy sequence of elementary…
We study the problem of finding the best approximate circuit that is the closest (in some pertinent metric) to a target circuit, and which satisfies a number of hardware constraints, like gate alphabet and connectivity. We look at the…
The quantum Toffoli gate allows universal reversible classical computation. It is also an important primitive in many quantum circuits and quantum error correction schemes. Here we demonstrate the realization of a Toffoli gate with three…
Any unitary operation in quantum information processing can be implemented via a sequence of simpler steps - quantum gates. However, actual implementation of a quantum gate is always imperfect and takes a finite time. Therefore, seeking for…
The family of $n$-bit Toffoli gates, with the two-bit Toffoli gate as the figurehead, are of great interest in quantum information as they can be used as universal gates and in quantum error correction, among other things. We present a…