Related papers: Minimal Non-orthogonal Gate Decomposition for Qubi…
Error mitigation schemes and error-correcting codes have been the center of much effort in quantum information processing research over the last few decades. While most of the successful proposed schemes for error mitigation are…
We employ quantum optimal control theory to realize quantum gates for two protected superconducting circuits: the heavy-fluxonium qubit and the 0-$\pi$ qubit. Utilizing automatic differentiation facilitates the simultaneous inclusion of…
The stabilizing properties of one-error correcting jump codes are explored under realistic non-ideal conditions. For this purpose the quantum algorithm of the tent-map is decomposed into a universal set of Hamiltonian quantum gates which…
Cat qubits have emerged as a promising candidate for quantum computation due to their higher error-correction thresholds and low resource overheads. In existing literature, the detuning of the two-photon drive is assumed to be zero for…
Optimal control theory is a versatile tool that presents a route to significantly improving figures of merit for quantum information tasks. We combine it here with the geometric theory for local equivalence classes of two-qubit operations…
We present a simple algorithm that implements an arbitrary $n$-qubit unitary operator using a Clifford+T circuit with T-count $O(2^{4n/3} n^{2/3})$. This improves upon the previous best known upper bound of $O(2^{3n/2} n)$, while the best…
We present some compact quantum circuits for a deterministic quantum computing on electron-spin qubits assisted by quantum dots inside single-side optical microcavities, including the CNOT, Toffoli, and Fredkin gates. They are constructed…
A method, termed controlled-injection, is proposed for compiling three-qubit controlled gates within the non-abelian Fibonacci anyon model. Building on single-qubit compilation techniques with three Fibonacci anyons, the approach showcases…
We conduct a systematic study of quantum circuits composed of multiple-control $Z$-rotation (MCZR) gates as primitives, since they are widely-used components in quantum algorithms and also have attracted much experimental interest in recent…
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 gates executed on physical hardware are inevitably degraded by environmental noise. While state purification effectively distills static quantum resources, the dynamic execution of quantum algorithms requires a higher-order approach…
Gate-based universal quantum computation is formulated in terms of two types of operations: local single-qubit gates, which are typically easily implementable, and two-qubit entangling gates, whose faithful implementation remains one of the…
We introduce a method for finding the required control parameters for a quantum computer that yields the desired quantum algorithm without invoking elementary gates. We concentrate on the Josephson charge-qubit model, but the scenario is…
The central challenge of quantum computing is implementing high-fidelity quantum gates at scale. However, many existing approaches to qubit control suffer from a scale-performance trade-off, impeding progress towards the creation of useful…
We study the optimal quantum control of heteronuclear two-qubit systems described by a Hamiltonian containing both nonlocal internal drift and local control terms. We derive an explicit formula to compute the minimum time required to steer…
We consider a unitary transformation which maps any given state of an $n$-qubit quantum register into another one. This transformation has applications in the initialization of a quantum computer, and also in some quantum algorithms.…
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 analyze the use of the Solovay Kitaev (SK) algorithm to generate an ensemble of one qubit rotations over which to perform randomized compilation. We perform simulations to compare the trace distance between the quantum state resulting…
We propose a universal gate set for quantum computing with all-to-all connectivity and intrinsic robustness to bit-flip errors based on parity encoding. We show that logical controlled phase gate and $R_z$ rotations can be implemented in…
The implementation of fault-tolerant quantum gates on encoded logic qubits is considered. It is shown that transversal implementation of logic gates based on simple geometric control ideas is problematic for realistic physical systems…