Related papers: Optimal synthesis into fixed XX interactions
High-fidelity two-qubit gates at scale are a key requirement to realize the full promise of quantum computation and simulation. The advent and use of coupler elements to tunably control two-qubit interactions has improved operational…
We present an efficient approach to optimising pulse sequences for implementing fast entangling two-qubit gates on trapped ion quantum information processors. We employ a two-phase procedure for optimising gate fidelity, which we…
Working with trapped atoms at close distance to each other, we show that one can implement entangling gates based on non-independent qubits using a single pulse per qubit, or a single structured pulse. The optimal parameters depend on…
The decomposition of matrices associated to two-qubit and three-qubit orthogonal gates is studied, and based on the decomposition the synthesis of these gates is investigated. The optimal synthesis of general two-qubit orthogonal gate is…
We address the issue of improving the quality of the joint remote preparation of an arbitrary two-qubit in case four qubits of the quantum channel which consists of a GHZ state and a GHZ-like one are subjected to noises. Two controlling…
The quantum circuit synthesis problem bridges quantum algorithm design and quantum hardware implementation in the Noisy Intermediate-Scale Quantum (NISQ) era. In quantum circuit synthesis problems, diagonal unitary synthesis plays a crucial…
Coherent gate errors are a concern in many proposed quantum computing architectures. These errors can be effectively handled through composite pulse sequences for single-qubit gates, however, such techniques are less feasible for entangling…
We theoretically analyze the errors in one- and two-qubit gates in SiMOS and Si/SiGe spin qubit experiments, and present a pulse sequence which can suppress the errors in exchange coupling due to charge noise using ideal local rotations. In…
Approximate computing is an attractive paradigm for reducing the design complexity of error-resilient systems, therefore improving performance and saving power consumption. In this work, we propose a new two-level approximate logic…
Gate model quantum computers with too many qubits to be simulated by available classical computers are about to arrive. We present a strategy for programming these devices without error correction or compilation. This means that the number…
Arrays of optically trapped neutral atoms are a promising architecture for the realization of quantum computers. In order to run increasingly complex algorithms, it is advantageous to demonstrate high-fidelity and flexible gates between…
We propose to increase the fidelity of two-qubit resonator-induced phase gates in circuit QED by the use of narrowband single-mode squeezed drive. We show that there exists an optimal squeezing angle and strength that erases qubit…
Single-qubit operations on singlet-triplet qubits in GaAs double quantum dots have not yet reached the fidelities required for fault-tolerant quantum information processing. Considering experimentally important constraints and using…
Efficient implementation of quantum algorithms requires single- or multi-qubit gates with high fidelity. In this report, we report that the fidelity of single-qubit gate operations on open quantum systems has a maximum value corresponding…
We provide a simple framework for the synthesis of quantum circuits based on a numerical optimization algorithm. This algorithm is used in the context of the trapped-ions technology. We derive theoretical lower bounds for the number of…
We present a depth-aware optimization framework for quantum circuit compilation that unifies provable optimality with scalable heuristics. For exact synthesis of a target unitary, we formulate a mixed-integer linear program (MILP) that…
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…
Many quantum algorithms can be written as a composition of unitaries, some of which can be exactly synthesized by a universal fault-tolerant gate set, while others can be approximately synthesized. A quantum compiler synthesizes each…
In recent advancements of quantum computing utilizing spin qubits, it has been demonstrated that this platform possesses the potential for implementing two-qubit gates with fidelities exceeding 99.5%. However, as with other qubit platforms,…
We analyze in detail the so-called "pushing gate" for trapped ions, introducing a time dependent harmonic approximation for the external motion. We show how to extract the average fidelity for the gate from the resulting semi-classical…