Related papers: 2D Qubit Placement of Quantum Circuits using LONGP…
Geometric phase is a promising element to induce high-fidelity and robust quantum operations due to its built-in noise-resilience feature. Unfortunately, its practical applications are usually circumscribed by requiring complex interactions…
Due to the limited connectivity of gate model quantum devices, logical quantum circuits must be compiled to target hardware before they can be executed. Often, this process involves the insertion of SWAP gates into the logical circuit,…
Quantum computing is currently strongly limited by the impact of noise, in particular introduced by the application of two-qubit gates. For this reason, reducing the number of two-qubit gates is of paramount importance on noisy…
In this paper, we demonstrate that optimal control algorithms can be used to speed up the implementation of modules of quantum algorithms or quantum simulations in networks of coupled qubits. The gain is most prominent in realistic cases,…
In quantum computation every unitary operation can be decomposed into quantum circuits-a series of single-qubit rotations and a single type entangling two-qubit gates, such as controlled-NOT (CNOT) gates. Two measures are important when…
Matching problems on 3D shapes and images are challenging as they are frequently formulated as combinatorial quadratic assignment problems (QAPs) with permutation matrix constraints, which are NP-hard. In this work, we address such problems…
We propose a scheme to implement quantum controlled SWAP gates by directing single-photon pulses to a two-sided cavity with a single trapped atom. The resultant gates can be used to realize quantum fingerprinting and universal photonic…
We demonstrate machine learning assisted design of a two-qubit gate in a Rydberg tweezer system. Two low-energy hyperfine states in each of the atoms represent the logical qubit and a Rydberg state acts as an auxiliary state to induce qubit…
We use quantum optimal control to identify fast collision-based two-qubit $\sqrt{\text{SWAP}}$ gates in ultracold atoms. We show that a significant speed up can be achieved by optimizing the full gate instead of separately optimizing the…
We show how to realize a general quantum circuit involving gates between arbitrary pairs of qubits by means of geometrically local quantum operations and efficient classical computation. We prove that circuit-level local stochastic noise…
Quantum computing has garnered attention for its potential to solve complex computational problems with considerable speedup. Despite notable advancements in the field, achieving meaningful scalability and noise control in quantum hardware…
Qubit Mapping is a critical task in Quantum Compilation, as modern Quantum Processing Units (QPUs) are constrained to nearest-neighbor interactions defined by a qubit coupling graph. This compiler pass repairs the connectivity of two-qubit…
In the circuit model, quantum computers rely on the availability of a universal quantum gate set. A particularly intriguing example is a set of two-qubit only gates: matchgates, along with SWAP (the exchange of two qubits). In this paper,…
From a geometric approach, we derive the minimum number of applications needed for an arbitrary Controlled-Unitary gate to construct a universal quantum circuit. A new analytic construction procedure is presented and shown to be either…
The development of a universal fault-tolerant quantum computer that can solve efficiently various difficult computational problems is an outstanding challenge for science and technology. In this work, we propose a technique for an efficient…
Two of the major obstacles to achieve quantum computing (QC) are (i) scalability to many qubits and (ii) controlled connectivity between any selected qubits. Using Josephson charge qubits, here we propose an experimentally realizable method…
In the noisy intermediate-scale quantum (NISQ) era, two-qubit gates in quantum circuits are more susceptible to noise than single-qubit gates. Therefore, reducing the number of two-qubit gates is crucial for improving circuit efficiency and…
Quantum computers have the potential to outperform classical computers, but are currently limited in their capabilities. One such limitation is the restricted connectivity between qubits, as captured by the hardware's coupling graph. This…
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…
Quantum circuit compilation and, in particular, efficient qubit layout synthesis is a critical challenge in modular, multi-core quantum architectures with constrained interconnects. In this work, we extend the SABRE heuristic algorithm to…